type-safe-avl-1.0.0.1: 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.BST.Intern

Description

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

Synopsis

Documentation

emptyBST :: BST 'EmptyTree Source #

Empty BST tree with the internalist implementation.

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

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 Source #

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

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

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