Expand description

Provided node implementations.

Structs

Implementation of range max for generic type T, it implements Node and LazyNode.

Implementation of the solution to the maximum subarray problem. It just implements Node.

Implementation of range min for generic type T, it implements Node and LazyNode.

A simple wrapper for nodes to easily implement PersistentNode. If the wrapped node implements LazyNode the wrapper also implements it.

Implementation of range sum for generic type T, it implements Node and LazyNode, as such it can be used as a node in every segment tree type.