123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114(*****************************************************************************)(* *)(* Open Source License *)(* Copyright (c) 2019,2020 DaiLambda, Inc. <contact@dailambda.jp> *)(* *)(* Permission is hereby granted, free of charge, to any person obtaining a *)(* copy of this software and associated documentation files (the "Software"),*)(* to deal in the Software without restriction, including without limitation *)(* the rights to use, copy, modify, merge, publish, distribute, sublicense, *)(* and/or sell copies of the Software, and to permit persons to whom the *)(* Software is furnished to do so, subject to the following conditions: *)(* *)(* The above copyright notice and this permission notice shall be included *)(* in all copies or substantial portions of the Software. *)(* *)(* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR*)(* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, *)(* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL *)(* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER*)(* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING *)(* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER *)(* DEALINGS IN THE SOFTWARE. *)(* *)(*****************************************************************************)(** { 1 Plebeia }
Implementation of space-efficient binary Patricia trees in OCaml.
The implementation is geared for used in Tezos, though it is rather
generic. A stop-and-copy GC is provided. This implementation aims
to maximize correctness and cares second about efficiency. *)(** { 2 Internal implementation }
For testing, debugging, and advance uses.
*)moduleInternal=struct(** { 3 Base } *)moduleLimit=LimitmoduleError=ErrormoduleUtils=UtilsmoduleOption=OptionmoduleResult=ResultmoduleMonad=MonadmoduleLog=Log(** { 3 Core } *)moduleValue=ValuemoduleIndex=IndexmoduleSegment=SegmentmoduleSegment_int_array=Segment_int_arraymodulePath=PathmoduleContext=ContextmoduleNode=NodemoduleNode_type=Node_typemoduleNode_tools=Node_toolsmoduleInfo=InfomoduleCursor=Cursor(** { 3 High level } *)moduleDeep=DeepmoduleTraverse=Traverse(** { 3 Version control } *)moduleCommit=CommitmoduleCommit_tree=Commit_treemoduleCommit_db=Commit_dbmoduleVc=Vc(** { 3 File system } *)moduleFs_intf=Fs_intfmoduleFs_impl=Fs_implmoduleFs=FsmoduleFs_tree=Fs_tree(** { 3 Hash } *)moduleCommit_hash=Commit_hashmoduleHashfunc=HashfuncmoduleHash=HashmoduleNode_hash=Node_hash(** { 3 Storage } *)moduleLock=LockmoduleStorage=StoragemoduleNode_storage=Node_storagemoduleHashcons=HashconsmoduleNode_cache=Node_cachemoduleXcstruct=XcstructmoduleMmap=Mmap(** { 3 GC } *)moduleCopy=Copy(** { 3 Helper } *)moduleStat=StatmoduleDebug=Debug(** { 3 Tools } *)moduleDiff=DiffmoduleMerkle_proof=Merkle_proofmoduleCursor_tools=Cursor_toolsmoduleSnapshot=SnapshotmoduleData_encoding_tools=Data_encoding_toolsmoduleKey=KeymoduleResult_lwt=Result_lwt(** { 3 Test } *)moduleGen=GenendincludeInternal(** { 2 Standard APIs, module interfaces are currently equivalent with Internal } *)