TreeStructures-0.0.2: A collection of heaps and search trees

Safe Haskell	Safe-Inferred
Language	Haskell98

Data.Tree.AVL

Synopsis

data AVLTree k v
head :: Ord k => AVLTree k v -> v
tail :: Ord k => AVLTree k v -> AVLTree k v
singleton :: Ord k => k -> v -> AVLTree k v
empty :: Ord k => AVLTree k v
null :: AVLTree k v -> Bool
fromList :: Ord k => [(k, v)] -> AVLTree k v
fromAscList :: Ord k => [(k, v)] -> AVLTree k v
toList :: Ord k => AVLTree k v -> [(k, v)]
toAscList :: Ord k => AVLTree k v -> [(k, v)]
insert :: Ord k => k -> v -> AVLTree k v -> AVLTree k v
delete :: Ord k => k -> AVLTree k v -> AVLTree k v
lookup :: Ord k => k -> AVLTree k v -> Maybe v
(!!) :: Ord k => AVLTree k v -> Int -> (k, v)
size :: AVLTree k v -> Int

Documentation

data AVLTree k v Source #

Instances

Instances details

(Show k, Show v) => Show (AVLTree k v) Source #
Instance details Defined in Data.Tree.AVL Methods showsPrec :: Int -> AVLTree k v -> ShowS # show :: AVLTree k v -> String # showList :: [AVLTree k v] -> ShowS #
(Eq k, Eq v) => Eq (AVLTree k v) Source #
Instance details Defined in Data.Tree.AVL Methods (==) :: AVLTree k v -> AVLTree k v -> Bool # (/=) :: AVLTree k v -> AVLTree k v -> Bool #
(Ord k, Ord v) => Ord (AVLTree k v) Source #
Instance details Defined in Data.Tree.AVL Methods compare :: AVLTree k v -> AVLTree k v -> Ordering # (<) :: AVLTree k v -> AVLTree k v -> Bool # (<=) :: AVLTree k v -> AVLTree k v -> Bool # (>) :: AVLTree k v -> AVLTree k v -> Bool # (>=) :: AVLTree k v -> AVLTree k v -> Bool # max :: AVLTree k v -> AVLTree k v -> AVLTree k v # min :: AVLTree k v -> AVLTree k v -> AVLTree k v #

head :: Ord k => AVLTree k v -> v Source #

O(1). head returns the head of a tree.

tail :: Ord k => AVLTree k v -> AVLTree k v Source #

O(lg n). tail discards the head of the tree and returns a tree.

singleton :: Ord k => k -> v -> AVLTree k v Source #

O(1). singleton constructs a singleton AVL tree

empty :: Ord k => AVLTree k v Source #

O(1). empty produces an empty tree

null :: AVLTree k v -> Bool Source #

O(1). null returns True if a tree is empty, otherwise False.

fromList :: Ord k => [(k, v)] -> AVLTree k v Source #

O(n lg n).

fromAscList :: Ord k => [(k, v)] -> AVLTree k v Source #

O(n lg n).

toList :: Ord k => AVLTree k v -> [(k, v)] Source #

O(n lg n).

toAscList :: Ord k => AVLTree k v -> [(k, v)] Source #

O(n lg n).

insert :: Ord k => k -> v -> AVLTree k v -> AVLTree k v Source #

O(lg n).

delete :: Ord k => k -> AVLTree k v -> AVLTree k v Source #

O(lg n).

lookup :: Ord k => k -> AVLTree k v -> Maybe v Source #

O(lg n).

(!!) :: Ord k => AVLTree k v -> Int -> (k, v) Source #

size :: AVLTree k v -> Int Source #

O(1). size reports the number of children in a tree