2573
Comment:

← Revision 7 as of 20121201 05:30:22 ⇥
2619

Deletions are marked like this.  Additions are marked like this. 
Line 25:  Line 25: 
* The maximum distance between any two distinct configurations is the greater of their sizes: ∀a,b ∈ 𝔹: 𝓁(a, b) ≤ max(''S'',,a,,, ''S'',,b,,), * from wich it follows that: ∀c ∈ 𝔹: 𝓁(𝑒, c) = ''S'',,c,,. 
* The maximum distance between any two distinct configurations is the greater of their sizes: ∀a,b ∈ 𝔹: 𝓁(a, b) ≤ max(''S'',,a,,, ''S'',,b,,); * from wich it follows that: ∀c ∈ 𝔹: 𝓁(𝑒, c) = ''S'',,c,,. * All distances are nonnegative integers. 
Configuration Spaces and Histories
Before we dive into versioned filesystem design and implementation details, let's first take a look at the concepts we're talking about. We'll begin by discussing what a configuration management system actually operates on.
N.B.: Although the following text uses mathematical concepts and notation, it's not intended to be a rigorous dissertation on configuration theory. We'll often make statements and draw conclusions without providing proof. Therefore, dear reader, you can either trust we're right, or do your own homework to prove (or disprove) our assertions. We will, however, try to conscientiously flag⚑ all leaps of faith in the text.
Definition: A data configuration is a unique pattern of data that can be represented as exactly one distinct sequence of binary digits.
The representation of the empty configuration 𝑒 is the zerolength sequence.
The size , S_{c}, of a configuration c is the length of its representative sequence of binary digits.
Definition: A data configuration space is a metric space (𝔹, 𝒹) where:
 𝔹 is the set of all data configurations;
 𝒹: 𝔹 × 𝔹 ⟶ ℝ is a metric on 𝔹.
Definition: A configuration history is a sequence of elements of 𝔹; in other words, it is a curve in (𝔹, 𝒹).
Defining the Metric
We'll now show that we can indeed define a metric for 𝔹. One example is the Levenshtein distance,
𝓁: 𝔹 × 𝔹 ⟶ ℕ^{0}
applied to the binarydigit sequence representation of data configurations. It is easy to show⚑ that 𝓁 has all the required properties of a metric. In addition, it has the following properties:
 The minimum distance between any two distinct configurations is 1.
The maximum distance between any two distinct configurations is the greater of their sizes: ∀a,b ∈ 𝔹: 𝓁(a, b) ≤ max(S_{a}, S_{b});
from wich it follows that: ∀c ∈ 𝔹: 𝓁(𝑒, c) = S_{c}.
 All distances are nonnegative integers.
In the rest of this text, we'll specifically talk about (𝔹, 𝓁) — that is, the data configuration space with a Levenshtein distance metric; also referred to as edit distance. Even though the term "edit distance" is less precise in general, it fits the concept of edits (or edit transformations), which we'll discuss later on.