Memory.Makeinclude Storage.S with type 'a io := 'a IO.tmodule Group : sig ... endmodule Array : sig ... endval hierarchy : t -> (Node.Array.t list * Node.Group.t list) IO.thierarchy t returns p where p is a pair of lists representing all nodes in store t. The first element of the pair is a list of all array nodes, and the second element is a list of all group nodes. This operation returns a pair of empty lists if store t is empty.
val create : unit -> tcreate () returns a new In-memory Zarr store type.