Data.Tree.BST.Intern

Interface for the main functions over type safe BST trees implemented with the internalist approach.

Documentation

emptyBST :: BST 'EmptyTree

Empty BST tree with the internalist implementation.

insertBST :: Insertable x a t => Proxy x -> a -> BST t -> BST (Insert x a t)

Interface for the insertion algorithm in the internalist implementation. It calls insert over an internalist BST tree.

lookupBST :: (t ~ 'ForkTree l (Node n a1) r, Member x t t ~ 'True, Lookupable x a t) => Proxy x -> BST t -> a

Interface for the lookup algorithm in the internalist implementation for BST.

deleteBST :: Deletable x t => Proxy x -> BST t -> BST (Delete x t)

Interface for the deletion algorithm in the internalist implementation. It calls delete over an internalist BST tree.