sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Val
provides base functions for node values.
type t = value
The type for node values.
type metadata = Metadata.t
The type for node metadata.
type hash = key
The type for keys.
type step = Path.step
The type for steps between nodes.
The type for either (node) keys or (contents) keys combined with their metadata.
list t
is the contents of t
. offset
and length
are used to paginate results.
caching
cache
regulates the caching behaviour regarding the node's internal data which may be lazily loaded from the backend, depending on the node implementation.
cache
defaults to true
which may greatly reduce the IOs and the runtime but may also increase the memory consumption.
cache = false
doesn't replace a call to clear
, it only prevents the storing of new data, it doesn't discard the existing one.
of_seq s
is the node n
such that seq n = s
.
seq t
is the contents of t
. offset
and length
are used to paginate results.
See caching for an explanation of the cache
parameter
val empty : t
empty
is the empty node.
val length : t -> int
length t
is the number of entries in t
.
val clear : t -> unit
Cleanup internal caches.
find t s
is the value associated with s
in t
.
A node can point to user-defined contents. The edge between the node and the contents is labeled by a step.
See caching for an explanation of the cache
parameter
add t s v
is the node where find t v
is Some s
but is similar to t
otherwise.
remove t s
is the node where find t s
is None
but is similar to t
otherwise.
val t : t Irmin.Type.t
t
is the value type for t
.
val default : metadata
default
is the default metadata value.
val metadata_t : metadata Irmin.Type.t
metadata_t
is the value type for metadata
.
val hash_t : hash Irmin.Type.t
hash_t
is the value type for hash
.
val step_t : step Irmin.Type.t
step_t
is the value type for step
.
val value_t : value Irmin.Type.t
value_t
is the value type for value
.