Merlin_index_format.Granular_marshalSourceA pointer to an 'a value, either residing in memory or on disk.
reuse lnk marks the link as being used more than once, to ensure proper serialization of DAGs.
cache (module Hash) returns a function to de-duplicate links which share the same value, resulting in a compressed file.
fetch lnk returns the value pointed by the link lnk.
We of course have fetch (link v) = v and link (fetch lnk) = lnk.
For Merlin we can't depend on a PPX or external dependencies, so we require a user-defined schema to describe where the links can be found. This is just an iter traversal over the values, recursively yielding on any reachable link. Since links can point to values themselves containing links, recursion is delayed by asking for the schema of each child.
For example, the following type has the following schema:
type t = { first : string link ; second : int link list link }
let type_first : string link Type.Id.t = Type.Id.make ()
let type_second : int link list link Type.Id.t = Type.Id.make ()
let type_v : int link Type.Id.t = Type.Id.make ()
let schema : t schema = fun iter t ->
iter.yield t.first type_first schema_no_sublinks ;
iter.yield t.second type_second @@ fun iter lst ->
List.iter (fun v -> iter.yield v type_v schema_no_sublinks) lstwhere schema_no_sublinks indicates that the yielded value contains no reachable links.
A function to iter on every link reachable in the value 'a.
A callback to signal the reachable links and the schema of their pointed sub-value. Since a value can contain multiple links each pointing to different types of values, the callback is polymorphic.
A schema usable when the 'a value does not contain any links.