View Source partisan_plumtree_util (partisan v5.0.0-rc.2)

Link to this section Summary

Functions

Convert a list of elements into an N-ary tree. This conversion works by treating the list as an array-based tree where, for example in a binary 2-ary tree, a node at index i has children 2i and 2i+1. The conversion also supports a "cycles" mode where the array is logically wrapped around to ensure leaf nodes also have children by giving them backedges to other elements.

Link to this section Functions

Link to this function

build_tree(N, Nodes, Opts)

View Source
-spec build_tree(N :: integer(), Nodes :: [term()], Opts :: [term()]) -> orddict:orddict().
Convert a list of elements into an N-ary tree. This conversion works by treating the list as an array-based tree where, for example in a binary 2-ary tree, a node at index i has children 2i and 2i+1. The conversion also supports a "cycles" mode where the array is logically wrapped around to ensure leaf nodes also have children by giving them backedges to other elements.
Link to this function

log(Level, String, Args)

View Source
-spec log(debug | info | error, String :: string(), Args :: [term()]) -> ok.