package irmin-pack
Install
Dune Dependency
Authors
Maintainers
Sources
sha256=964512f77697947a73dd1875c634d6804e98f14167c5aadd3c4f85b5f30ffb53
sha512=d56d3285daa2dd36f1eaff867af5c8f44c61bba4de1a5c7bb5347652dbc460c343483ab61de1a9302f664af357eacc964dc5c8b4477f6d01372dc028b162e98b
doc/irmin-pack.unix/Irmin_pack_unix/Mapping_file/Make/index.html
Module Mapping_file.Make
Source
Parameters
Signature
A mapping file is a collection of chunks which contain 3 integers. A length, the global offset (off
) of the chunk and the offset of the chunk in the prefix file (poff
).
The chunks have consecutive poff
with respect to their lengths.
There is no need to close a t
because its underlying file-descriptor is always closed.
val create :
root:string ->
generation:int ->
register_entries:
(register_entry:(off:Optint.Int63.t -> len:int -> unit) -> unit) ->
(t, Errs.t) result
create
creates inside the directory root
a mapping file. It never raises exceptions.
register_entries
is a user callback that is responsible for calling register_entry
for each live entry. Duplicates allowed, no specfic order expected.
Returns an error if the platform is not 64bits.
Creates temporary files in root
that are unlinked before the function returns.
open_map ~root ~generation
opens a mapping file.
iter mapping f
calls f
on each (off,len)
pair in mapping
.
It is guaranteed for the offsets to be iterated in monotonic order.
It is guaranteed that entries don't overlap.
The exceptions raised by f
are caught and returned (as long as they are known by Errs
).
Similar to iter mapping f
but raises exceptions.
find_nearest_leq t off
returns the entry in t
whose offset is the nearest <=
the given off