Private.Node_pathSourceRepresents the shortest unambiguous path through the Computation.t data structure, including the path through any contained Value.ts. Several of the constructors in Computation.t only contain a single inner computation or value; thus, keeping track of these segments in all the paths is often unnecessary. Thus, we can more properly model this path as with two parts:
Whenever a choice point gets added, we reset the number of nodes descended back to 0, since that number is no longer helpful for keeping the paths unique.
include Core.Bin_prot.Binable.S with type t := tinclude Bin_prot.Binable.S_only_functions with type t := tThis function only needs implementation if t exposed to be a polymorphic variant. Despite what the type reads, this does *not* produce a function after reading; instead it takes the constructor tag (int) before reading and reads the rest of the variant t afterwards.
include Core.Comparable.S_binable with type t := tinclude Base.Comparable.S with type t := tinclude Base.Comparisons.S with type t := tcompare t1 t2 returns 0 if t1 is equal to t2, a negative integer if t1 is less than t2, and a positive integer if t1 is greater than t2.
ascending is identical to compare. descending x y = ascending y x. These are intended to be mnemonic when used like List.sort ~compare:ascending and List.sort ~cmp:descending, since they cause the list to be sorted in ascending or descending order, respectively.
clamp_exn t ~min ~max returns t', the closest value to t such that between t' ~low:min ~high:max is true.
Raises if not (min <= max).
include Base.Comparator.S with type t := tinclude Core.Comparator.S
with type t := t
with type comparator_witness := comparator_witnessmodule Map :
Core.Map.S_binable
with type Key.t = t
with type Key.comparator_witness = comparator_witnessmodule Set :
Core.Set.S_binable
with type Elt.t = t
with type Elt.comparator_witness = comparator_witnessThe of_string and to_string functions operate on short, yet semi-human-readable strings.
For example:
{ choices = [ 1; 2; 3]; descend = 4 }is serialized to "1-2-3_4"
Adds a choice point to that input path. The provided number says which of the choices at that point was taken. When traversing a computation or value, if any case has multiple recursive calls, you should add a choice point to the path built up in each of those calls, with each call using a different number.
Adds an extra segment to the input path. All such segments get forgotten when the next choice point is added.