CausalGraph

The names of the product elements.

The name of the type.

Two versions have one of 4 different relationship configurations:

• They're equal (a == b)
• They're concurrent (a || b)
• Or one dominates the other (a < b or b > a)

This method depends on the caller to check if the passed versions are equal (a == b). Otherwise it returns 0 if the operations are concurrent, -1 if a < b or 1 if b > a

This method takes in two versions (expressed as frontiers) and returns the set of operations only appearing in the history of one version or the other.

Find the dominators amongst the input versions.

Each item in the input will be output to the callback function exactly once.

If a version is repeated, it will only ever be counted as a dominator once.

The versions will be yielded from largest to smallest.

Yields the intersection (most recent common version) and remainder (if any)

Scan the VersionSummary and report (via visitor function) which versions overlap.

If you consider the venn diagram of versions, there are 3 categories:

• a (only known locally)
• a+b (common versions)
• b (only known remotely)

Currently this method:

• Ignores a only. Only a+b or b are yielded via the visitor
• For a+b, we yield the local version
• For b only, we yield a LV of -1.

The entries returned from this function are in the order of versions specified in ranges.

Does frontier contain target?