balanced-binary-search-tree-1.0.0.0: Type safe BST and AVL trees
Copyright(c) Nicolás Rodríguez 2021
LicenseGPL-3
MaintainerNicolás Rodríguez
Stabilityexperimental
PortabilityPOSIX
Safe HaskellSafe
LanguageHaskell2010

Data.Tree.AVL.Intern

Description

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

Synopsis

Documentation

emptyAVL :: AVL 'EmptyTree Source #

Empty AVL tree with the internalist implementation.

insertAVL :: Insertable x a t => Proxy x -> a -> AVL t -> AVL (Insert x a t) Source #

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

lookupAVL :: (t ~ 'ForkTree l (Node n a1) r, Member x t t ~ 'True, Lookupable x a t) => Proxy x -> AVL t -> a Source #

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

deleteAVL :: Deletable x t => Proxy x -> AVL t -> AVL (Delete x t) Source #

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