| ||||||||

| ||||||||

Description | ||||||||

Functions for pushing elements into trees of known height. | ||||||||

Synopsis | ||||||||

| ||||||||

Documentation | ||||||||

pushHL :: e -> AVL e -> Int# -> (#AVL e, Int##) | ||||||||

A version of pushL for an AVL tree of known height. Returns an AVL tree of known height. It's OK if height is relative, with fixed offset. In this case the height of the result will have the same fixed offset. | ||||||||

pushHR :: AVL e -> Int# -> e -> (#AVL e, Int##) | ||||||||

A version of pushR for an AVL tree of known height. Returns an AVL tree of known height. It's OK if height is relative, with fixed offset. In this case the height of the result will have the same fixed offset. | ||||||||

pushHL_ :: AVL e -> AVL e -> Int# -> (#AVL e, Int##) | ||||||||

Push a singleton tree (first arg) in the leftmost position of an AVL tree of known height, returning an AVL tree of known height. It's OK if height is relative, with fixed offset. In this case the height of the result will have the same fixed offset. Complexity: O(log n) | ||||||||

pushHR_ :: AVL e -> Int# -> AVL e -> (#AVL e, Int##) | ||||||||

Push a singleton tree (third arg) in the rightmost position of an AVL tree of known height, returning an AVL tree of known height. It's OK if height is relative, with fixed offset. In this case the height of the result will have the same fixed offset. Complexity: O(log n) | ||||||||

Produced by Haddock version 0.7 |