liph::skip_list< Key, Compare, Allocator > Class Template Reference

#include <skip_list.h>

Inheritance diagram for liph::skip_list< Key, Compare, Allocator >:

Public Member Functions
	skip_list (const Compare &cmp=Compare(), const Allocator &alloc=Allocator())
void	insert (const Key &key)
bool	contains (const Key &key) const
bool	empty () const
int32_t	size () const
int32_t	max_size () const
void	clear ()
iterator	find (const Key &key)
const iterator	find (const Key &key) const
void	erase (iterator pos)
void	erase (const Key &key)
iterator	begin ()
const iterator	begin () const
iterator	end ()
const iterator	end () const

Constructor & Destructor Documentation

skip_list()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

liph::skip_list< Key, Compare, Allocator >::skip_list ( const Compare &  cmp = Compare(), const Allocator &  alloc = Allocator()  )

inline

Member Function Documentation

begin() [1/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator liph::skip_list< Key, Compare, Allocator >::begin

(

)

begin() [2/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const iterator liph::skip_list< Key, Compare, Allocator >::begin

(

)

const

clear()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void liph::skip_list< Key, Compare, Allocator >::clear

(

)

contains()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool liph::skip_list< K, C, A >::contains

(

const Key &

key

)

const

empty()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

bool liph::skip_list< Key, Compare, Allocator >::empty ( ) const

inline

end() [1/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator liph::skip_list< Key, Compare, Allocator >::end

(

)

end() [2/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const iterator liph::skip_list< Key, Compare, Allocator >::end

(

)

const

erase() [1/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void liph::skip_list< Key, Compare, Allocator >::erase

(

const Key &

key

)

erase() [2/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void liph::skip_list< Key, Compare, Allocator >::erase

(

iterator

pos

)

find() [1/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

iterator liph::skip_list< Key, Compare, Allocator >::find

(

const Key &

key

)

find() [2/2]

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

const iterator liph::skip_list< Key, Compare, Allocator >::find

(

const Key &

key

)

const

insert()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

void liph::skip_list< K, C, A >::insert

(

const Key &

key

)

max_size()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

int32_t liph::skip_list< Key, Compare, Allocator >::max_size ( ) const

inline

size()

template<class Key , class Compare = std::less<Key>, class Allocator = std::allocator<Key>>

int32_t liph::skip_list< Key, Compare, Allocator >::size ( ) const

inline

---

The documentation for this class was generated from the following file:

• liph/container/skip_list.h