DeepHash

Data structure made up of nested hashes
https://github.com/ianxm/DeepHash

To install, run:

haxelib install DeepHash 0.4.0 

See using Haxelib in Haxelib documentation for more information.

README.md

DeepHash

DeepHash is a tree data structure made up of nested hashes. Items within the tree are located using a path, which is a list of keys.
DeepHash can compute values for non-leaf nodes based on their children. See tests for examples of use.

Interface

new()

   create a new deep hash

set(path :List, newVal :V)

    set a value at the specified path. create nodes as needed
    path variable is modified!

get(path :List)

    get the value at the specified path. return null if not found
    path variable is modified!

has(path :List)

    tell if the tree has a node at the given path

getPathIterator()

    pre-order traversal of paths, not lazy

getValuesIterator()

    pre-order traversal of values, not lazy

accum :V->V->V

    set a node's value by accumulating the values of its children

cmp : K->K->Int

    comparator function to sort keys during traversal
Contributors
ianxm
Version
0.4.0
Published
4 years ago
License
BSD

All libraries are free

Every month, more than thousand developers use haxelib to find, share, and reuse code — and assemble it in powerful new ways. Enjoy Haxe; It is great!

Explore Haxe

Haxe Manual

Haxe Code Cookbook

Haxe API documentation

You can try Haxe in the browser! try.haxe.org

Join us on Github!

Haxe is being developed on GitHub. Feel free to contribute or report issues to our projects.

Haxe on Github