base_map< K, T, Pr, M > Class Template Reference

implements binary tree More...

#include <map.h>

Inheritance diagram for base_map< K, T, Pr, M >:

List of all members.

Public Types
typedef bool	redblack
	red/black flag
typedef bool	nodetype
	head/leaf
typedef pair< iterator, iterator >	pairii_t
	range of iterators
typedef pair< const_iterator, const_iterator >	paircc_t
	const range of iterators
typedef pair< iterator, bool >	pairib_t
	iterator and boolean flag
Public Member Functions
const Pr &	comp () const
	returns predicate
TYPENAME base_map< K, T, Pr, M > ::iterator	begin ()
	begins iterator
TYPENAME base_map< K, T, Pr, M > ::const_iterator	begin () const
	const begin iterator
TYPENAME base_map< K, T, Pr, M > ::iterator	end ()
	ends iterator
TYPENAME base_map< K, T, Pr, M > ::const_iterator	end () const
	const end iterator
size_t	size () const
	returns size of map
bool	empty () const
	checks if map is empty
TYPENAME base_map< K, T, Pr, M > ::iterator	find (const K &k)
	finds iterator by key
TYPENAME base_map< K, T, Pr, M > ::const_iterator	find (const K &k) const
	finds const iterator by key
TYPENAME base_map< K, T, Pr, M > ::iterator	lower_bound (const K &k)
	finds lower bound by key
TYPENAME base_map< K, T, Pr, M > ::const_iterator	lower_bound (const K &k) const
	finds const lower bound by key
TYPENAME base_map< K, T, Pr, M > ::iterator	upper_bound (const K &k)
	finds upper bound by key
TYPENAME base_map< K, T, Pr, M > ::const_iterator	upper_bound (const K &k) const
	finds const upper bound by key
pairii_t	equal_range (const K &k)
	finds equal range by key
paircc_t	equal_range (const K &k) const
	finds const equal range by key
void	clear ()
	clears map
Protected Member Functions
	base_map (const Pr &pr=Pr())
	constructor
	base_map (const base_map< K, T, Pr, M > &x)
	copy constructor
	~base_map ()
	destructor
TYPENAME base_map< K, T, Pr, M > ::iterator	_insert (bool left, TYPENAME base_map< K, T, Pr, M >::_node *w, TYPENAME base_map< K, T, Pr, M >::_node *n, const K &k, const T &v)
	inserts new node
TYPENAME base_map< K, T, Pr, M > ::iterator	_erase (iterator w, TYPENAME base_map< K, T, Pr, M >::_node *&e)
	erases node
TYPENAME base_map< K, T, Pr, M > ::_node *	_lbound (const K &k) const
	finds lower bound node by key
TYPENAME base_map< K, T, Pr, M > ::_node *	_ubound (const K &k) const
	finds upper bound node by key
TYPENAME base_map< K, T, Pr, M > ::_node *&	lmost ()
	gets the left most node
TYPENAME base_map< K, T, Pr, M > ::_node *&	lmost () const
	gets the left most node (const)
TYPENAME base_map< K, T, Pr, M > ::_node *&	rmost ()
	gets the right most node
TYPENAME base_map< K, T, Pr, M > ::_node *&	rmost () const
	gets the right most node (const_
TYPENAME base_map< K, T, Pr, M > ::_node *&	root ()
	gets the root node
TYPENAME base_map< K, T, Pr, M > ::_node *&	root () const
	gets the root node (const)
TYPENAME base_map< K, T, Pr, M > ::_node *	head ()
TYPENAME base_map< K, T, Pr, M > ::_node *	head () const
	gets the head node (const)
void	_lrotate (TYPENAME base_map< K, T, Pr, M >::_node *x)
	left rotate node
void	_rrotate (TYPENAME base_map< K, T, Pr, M >::_node *x)
	right rotate node
void	_consval (T *p, const T &v)
	constructs value on pre-allocated memory
void	_conskey (K *p, const K &k)
	constructs key on pre-allocated memory
void	_destval (T *p)
	destroys value on pre-allocated memory
void	_destkey (K *p)
	destroys key on pre-allocated memory
Protected Attributes
Pr	key_compare
	predicate
TYPENAME base_map< K, T, Pr, M > ::_node_	_head
	head
size_t	_size
	size
Friends
class	const_iterator
	friends
class	iterator
Classes
class	_node
	node with template key and value More...
class	_node_
	base node More...
class	const_iterator
	const iterator More...
class	iterator
	non const iterator More...

---

Detailed Description

template<class K, class T, class Pr = less< K >, bool M = false>
class base_map< K, T, Pr, M >

implements binary tree

Definition at line 78 of file map.h.

---

Member Typedef Documentation

template<class K, class T, class Pr = less< K >, bool M = false>

base_map< K, T, Pr, M >::redblack

red/black flag

Definition at line 91 of file map.h.

template<class K, class T, class Pr = less< K >, bool M = false>

base_map< K, T, Pr, M >::nodetype

head/leaf

Definition at line 100 of file map.h.

template<class K, class T, class Pr = less< K >, bool M = false>

base_map< K, T, Pr, M >::pairii_t

range of iterators

Definition at line 478 of file map.h.

template<class K, class T, class Pr = less< K >, bool M = false>

base_map< K, T, Pr, M >::paircc_t

const range of iterators

Definition at line 481 of file map.h.

template<class K, class T, class Pr = less< K >, bool M = false>

base_map< K, T, Pr, M >::pairib_t

iterator and boolean flag

Definition at line 523 of file map.h.

---

Constructor & Destructor Documentation

template<class K, class T, class Pr, bool M>

base_map< K, T, Pr, M >::base_map

(

const Pr &

pr = Pr()

)

[inline, explicit, protected]

constructor

Parameters:

pr

predicate

Definition at line 91 of file map.hpp.

References base_map< K, T, Pr, M >::clear().

template<class K, class T, class Pr, bool M>

base_map< K, T, Pr, M >::base_map

(

const base_map< K, T, Pr, M > &

x

)

[inline, protected]

copy constructor

Definition at line 103 of file map.hpp.

References base_map< K, T, Pr, M >::clear().

template<class K, class T, class Pr, bool M>

base_map< K, T, Pr, M >::~base_map

(

)

[inline, protected]

destructor

Definition at line 98 of file map.hpp.

---

Member Function Documentation

template<class K, class T, class Pr, bool M>

const Pr & base_map< K, T, Pr, M >::comp

(

)

const [inline]

returns predicate

Definition at line 112 of file map.hpp.

References base_map< K, T, Pr, M >::key_compare.

Referenced by memlookup::construct(), and memlookup::memlookup().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::begin

(

)

[inline]

begins iterator

Definition at line 120 of file map.hpp.

References base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_left, and base_map< K, T, Pr, M >::iterator.

Referenced by threadpool::_clean_up_clients(), msg_communicator::_destroy_connections(), msg_communicator::_turn_off_connections(), msg_communicator::_turn_on_connections(), xml_document::add_def_attributes(), _map< K, T, A, Pr, M >::assign(), fuzzy_matcher_impl::candidate_sorter::candidate_sorter(), varmap< T, C >::clear(), map< K, T, Pr, M >::clear(), tokenizer::clear_regex(), var_container::combine(), memlookup::construct(), xml_grammar::copy(), cluster_processor< T, N >::cut(), cluster_engine_impl::do_clustering(), map< K, T, Pr, M >::erase(), _map< K, T, A, Pr, M >::erase(), varmap< T, C >::fetch_all(), varmap< T, C >::find_less_resource(), map< K, T, Pr, M >::insert(), _map< K, T, A, Pr, M >::insert(), var_container::intersect(), varmap< T, C >::intersect_less_resource(), msg_communicator::notify(), aiosock::off(), aiogate::off(), aiofile::off(), map< K, T, Pr, M >::operator=(), dtd_processor::parseAttDef(), xml_processor::parseAttributes(), msg_user_connection::peek_async_timeouted(), xml_persistor::persistDocType(), xml_persistor::persistElementDecl(), msg_user_connection::pop_async_timeouted(), aiosock::process_accept_blocks(), aiosock::process_timeouted_blocks(), aiofile::process_timeouted_blocks(), varmap< T, C >::remove_all_resource(), xml_grammar::resolve_references(), varmap< pk_column, var_container >::retrive_stats(), aiosock::v_has_job(), aiofile::v_has_job(), xml_document::validate_attributes(), msg_communicator::validate_connection(), and msg_user_connection::~msg_user_connection().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::const_iterator base_map< K, T, Pr, M >::begin

(

)

const [inline]

const begin iterator

Definition at line 128 of file map.hpp.

References base_map< K, T, Pr, M >::const_iterator, and base_map< K, T, Pr, M >::head().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::end

(

)

[inline]

ends iterator

Definition at line 136 of file map.hpp.

References base_map< K, T, Pr, M >::head(), and base_map< K, T, Pr, M >::iterator.

Referenced by aiosock::_activate_block(), aiofile::_activate_block(), aiofile::_assign_file(), aiosock::_assign_socket(), threadpool::_clean_up_clients(), msg_communicator::_close_connection(), msg_communicator::_destroy_connections(), map< K, T, Pr, M >::_insert(), _map< K, T, A, Pr, M >::_insert(), fuzzy_matcher_impl::_match(), aiosock::_process_block(), aiofile::_process_block(), msg_communicator::_register_this(), msg_communicator::_turn_off_connections(), msg_communicator::_turn_on_connections(), threadpool::_validate_client(), fuzzy_matcher_impl::add(), tokenizer::add_abbreviation(), xml_grammar::add_attribute_decl(), msg_communicator::add_connection(), xml_document::add_def_attributes(), xml_grammar::add_element_decl(), xml_grammar::add_entity_decl(), xml_document::add_model(), xml_grammar::add_notation_decl(), xml_grammar::add_pi_decl(), xml_grammar::add_reference_decl(), tokenizer::add_regex(), varmap< T, C >::add_resource(), _map< K, T, A, Pr, M >::assign(), aiogate::bind(), content_children::build_dfa(), fuzzy_matcher_impl::candidate_sorter::candidate_sorter(), msg_communicator::change_connection_address(), varmap< T, C >::clear(), map< K, T, Pr, M >::clear(), tokenizer::clear_regex(), aiosock::close(), aiogate::close(), aiofile::close(), var_container::combine(), aiosock::complete_block(), aiofile::complete_block(), aiogate::connect(), memlookup::construct(), xml_grammar::copy(), cluster_processor< T, N >::cut(), aiogate::deaf(), var_object_repository::delete_object(), tokenizer::do_abbr(), cluster_engine_impl::do_clustering(), tokenizer::do_regex(), varmap< T, C >::end(), map< K, T, Pr, M >::erase(), _map< K, T, A, Pr, M >::erase(), varmap< T, C >::fetch_all(), base_map< K, T, Pr, M >::find(), msg_communicator::find_connection(), varmap< T, C >::find_exact_resource(), varmap< T, C >::find_fuzzy_resource(), varmap< T, C >::find_greater_resource(), xml_document::find_model(), varmap< T, C >::find_partial_resource(), aiosock::find_socket_handle(), aiogate::initiate_close(), var_container::intersect(), varmap< T, C >::intersect_exact_resource(), varmap< T, C >::intersect_fuzzy_resource(), varmap< T, C >::intersect_greater_resource(), varmap< T, C >::intersect_partial_resource(), aiosock::listen(), aiogate::listen(), msg_communicator::loan_communicator(), tokenizer::match(), fuzzy_matcher_impl::match(), msg_communicator::notify(), memlookup::notify(), memindex::notify(), aiosock::off(), aiogate::off(), aiofile::off(), map< K, T, Pr, M >::operator=(), dtd_processor::parseAttDef(), xml_processor::parseAttributes(), fuzzy_matcher_impl::partial_intersect(), msg_user_connection::peek_async_timeouted(), xml_persistor::persistDocType(), xml_persistor::persistElementDecl(), msg_user_connection::pop_async_timeouted(), aiosock::process_accept_blocks(), var_object_repository::process_condition(), var_object_repository::process_query(), aiosock::process_timeouted_blocks(), aiofile::process_timeouted_blocks(), vardatabase::process_xml_request(), msg_user_connection::push_msg(), fuzzy_matcher_impl::reconstruct_string(), aiogate::recv(), fuzzy_matcher_impl::remove(), varmap< T, C >::remove_all_resource(), varmap< T, C >::remove_resource(), xml_grammar::resolve_references(), byte_manager::resolveEntity(), varmap< pk_column, var_container >::retrive_stats(), msg_communicator::return_communicator(), var_object_repository::select_object(), aiogate::send_bulk(), aiogate::set_recv_timeout(), aiogate::set_send_timeout(), aiogate::unlock_pin(), var_object_repository::update_object(), msg_communicator::v_do_job(), aiosock::v_do_job(), aiofile::v_do_job(), aiosock::v_has_job(), aiofile::v_has_job(), aiogate::v_on_accept(), aiogate::v_on_connect(), aiogate::v_on_error(), aiogate::v_on_receive(), aiogate::v_on_send(), xml_document::validate_attributes(), msg_communicator::validate_connection(), and msg_user_connection::~msg_user_connection().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::const_iterator base_map< K, T, Pr, M >::end

(

)

const [inline]

const end iterator

Definition at line 144 of file map.hpp.

References base_map< K, T, Pr, M >::const_iterator, and base_map< K, T, Pr, M >::head().

template<class K, class T, class Pr, bool M>

size_t base_map< K, T, Pr, M >::size

(

)

const [inline]

returns size of map

Definition at line 152 of file map.hpp.

References base_map< K, T, Pr, M >::_size.

Referenced by fuzzy_matcher_impl::candidate_sorter::candidate_sorter(), var_object_repository::count(), cluster_processor< T, N >::cut(), threadpool::doxray(), msg_communicator::doxray(), aiosock::doxray(), aiogate::doxray(), aiofile::doxray(), cluster_engine_impl::get_cluster_object(), cluster_engine_impl::get_cluster_size(), cluster_engine_impl::get_clusters_count(), and xml_processor::parseAttributes().

template<class K, class T, class Pr, bool M>

bool base_map< K, T, Pr, M >::empty

(

)

const [inline]

checks if map is empty

Definition at line 160 of file map.hpp.

References base_map< K, T, Pr, M >::_size.

Referenced by threadpool::_clean_up_clients(), fuzzy_matcher_impl::_match(), tokenizer::do_regex(), xml_grammar::find_attribute_decl(), xml_grammar::find_element_decl(), xml_grammar::find_entity_decl(), xml_grammar::find_notation_decl(), varmap< T, C >::find_partial_resource(), xml_grammar::find_pi_decl(), xml_grammar::find_reference_decl(), varmap< T, C >::intersect_partial_resource(), fuzzy_matcher_impl::partial_intersect(), and xml_persistor::persistElementDecl().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::find

(

const K &

k

)

[inline]

finds iterator by key

Parameters:

k

key

Definition at line 168 of file map.hpp.

References base_map< K, T, Pr, M >::end(), base_map< K, T, Pr, M >::key_compare, base_map< K, T, Pr, M >::lower_bound(), and TYPENAME.

Referenced by aiosock::_activate_block(), aiofile::_activate_block(), threadpool::_clean_up_clients(), msg_communicator::_close_connection(), fuzzy_matcher_impl::_match(), aiosock::_process_block(), aiofile::_process_block(), msg_communicator::_register_this(), threadpool::_validate_client(), fuzzy_matcher_impl::add(), msg_communicator::add_connection(), xml_document::add_model(), varmap< T, C >::add_resource(), content_children::build_dfa(), msg_communicator::change_connection_address(), aiosock::close(), aiogate::close(), aiofile::close(), aiosock::complete_block(), aiofile::complete_block(), cluster_processor< T, N >::cut(), aiogate::deaf(), var_object_repository::delete_object(), msg_communicator::find_connection(), varmap< T, C >::find_exact_resource(), varmap< T, C >::find_greater_resource(), xml_document::find_model(), aiosock::find_socket_handle(), cluster_engine_impl::get_cluster_object(), cluster_engine_impl::get_cluster_size(), aiogate::initiate_close(), varmap< T, C >::intersect_exact_resource(), varmap< T, C >::intersect_greater_resource(), varmap< T, C >::intersect_partial_resource(), aiosock::listen(), msg_communicator::loan_communicator(), fuzzy_matcher_impl::match(), xml_processor::parseAttributes(), fuzzy_matcher_impl::partial_intersect(), var_object_repository::process_condition(), var_object_repository::process_query(), aiosock::process_timeouted_blocks(), aiofile::process_timeouted_blocks(), vardatabase::process_xml_request(), msg_user_connection::push_msg(), fuzzy_matcher_impl::reconstruct_string(), aiogate::recv(), fuzzy_matcher_impl::remove(), byte_manager::resolveEntity(), msg_communicator::return_communicator(), var_object_repository::select_object(), aiogate::send_bulk(), aiogate::set_recv_timeout(), aiogate::set_send_timeout(), aiogate::unlock_pin(), var_object_repository::update_object(), msg_communicator::v_do_job(), aiosock::v_do_job(), aiofile::v_do_job(), aiogate::v_on_accept(), aiogate::v_on_connect(), aiogate::v_on_error(), aiogate::v_on_receive(), and aiogate::v_on_send().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::const_iterator base_map< K, T, Pr, M >::find

(

const K &

k

)

const [inline]

finds const iterator by key

Parameters:

k

key

Definition at line 177 of file map.hpp.

References base_map< K, T, Pr, M >::end(), base_map< K, T, Pr, M >::key_compare, base_map< K, T, Pr, M >::lower_bound(), and TYPENAME.

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::lower_bound

(

const K &

k

)

[inline]

finds lower bound by key

Parameters:

k

key

Definition at line 186 of file map.hpp.

References base_map< K, T, Pr, M >::_lbound(), and base_map< K, T, Pr, M >::iterator.

Referenced by fuzzy_matcher_impl::_match(), cluster_processor< T, N >::cut(), tokenizer::do_abbr(), base_map< K, T, Pr, M >::equal_range(), base_map< K, T, Pr, M >::find(), varmap< T, C >::find_fuzzy_resource(), varmap< T, C >::find_less_resource(), varmap< T, C >::find_partial_resource(), varmap< T, C >::intersect_fuzzy_resource(), varmap< T, C >::intersect_less_resource(), varmap< T, C >::intersect_partial_resource(), tokenizer::match(), fuzzy_matcher_impl::partial_intersect(), fuzzy_matcher_impl::remove(), and varmap< T, C >::remove_resource().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::const_iterator base_map< K, T, Pr, M >::lower_bound

(

const K &

k

)

const [inline]

finds const lower bound by key

Parameters:

k

key

Definition at line 194 of file map.hpp.

References base_map< K, T, Pr, M >::_lbound(), and base_map< K, T, Pr, M >::const_iterator.

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::upper_bound

(

const K &

k

)

[inline]

finds upper bound by key

Parameters:

k

key

Definition at line 202 of file map.hpp.

References base_map< K, T, Pr, M >::_ubound(), and base_map< K, T, Pr, M >::iterator.

Referenced by tokenizer::do_regex(), base_map< K, T, Pr, M >::equal_range(), varmap< T, C >::find_greater_resource(), varmap< T, C >::find_less_resource(), varmap< T, C >::intersect_greater_resource(), varmap< T, C >::intersect_less_resource(), fuzzy_matcher_impl::remove(), and varmap< T, C >::remove_resource().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::const_iterator base_map< K, T, Pr, M >::upper_bound

(

const K &

k

)

const [inline]

finds const upper bound by key

Parameters:

k

key

Definition at line 210 of file map.hpp.

References base_map< K, T, Pr, M >::_ubound(), and base_map< K, T, Pr, M >::iterator.

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::pairii_t base_map< K, T, Pr, M >::equal_range

(

const K &

k

)

[inline]

finds equal range by key

Parameters:

k

key

Definition at line 218 of file map.hpp.

References base_map< K, T, Pr, M >::lower_bound(), TYPENAME, and base_map< K, T, Pr, M >::upper_bound().

Referenced by xml_grammar::add_attribute_decl(), xml_grammar::add_element_decl(), xml_grammar::add_entity_decl(), xml_grammar::add_notation_decl(), xml_grammar::add_pi_decl(), xml_grammar::add_reference_decl(), memlookup::construct(), map< K, T, Pr, M >::erase(), _map< K, T, A, Pr, M >::erase(), xml_grammar::find_attribute_decl(), xml_grammar::find_element_decl(), xml_grammar::find_entity_decl(), xml_grammar::find_notation_decl(), xml_grammar::find_pi_decl(), xml_grammar::find_reference_decl(), memlookup::notify(), and memindex::notify().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::paircc_t base_map< K, T, Pr, M >::equal_range

(

const K &

k

)

const [inline]

finds const equal range by key

Parameters:

k

key

Definition at line 226 of file map.hpp.

References base_map< K, T, Pr, M >::lower_bound(), TYPENAME, and base_map< K, T, Pr, M >::upper_bound().

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::clear

(

)

[inline]

clears map

Reimplemented in map< K, T, Pr, M >, map< HANDLE, map< size_t, aiofile_file >::iterator >, map< main_map_key, mainmap_object_t, main_map_key_compare >, map< _terimber_guid_, msg_wait_async_reply >, map< SOCKET, map< size_t, aiosock_socket >::iterator >, map< size_t, size_t >, map< terimber_thread_employer *, _map >, map< _terimber_guid_, msg_wait_reply >, map< size_t, ngram_entry_t::iterator >, map< size_t, word_entry_t::iterator >, map< word_key, word_entry >, map< size_t, aiosock::listener_info >, map< size_t, aiosock::aiosock_socket >, map< memdb_rowset_t::const_iterator, memdb_rowset_t::const_iterator, memdb_rowset_less, true >, map< size_t, base_string, less< size_t >, true >, map< offset_map_key, bool, less< offset_map_key >, true >, map< base_string, vardatabase::vartable >, map< size_t, word_entry_t::iterator, less< size_t >, true >, map< pcre_key, pcre_entry, less< pcre_key >, true >, map< _terimber_guid_, msg_connection * >, map< ngram_key, ngram_entry >, map< metaphone_key, metaphone_entry >, map< size_t, ngram_entry_t::iterator, less< size_t >, true >, map< size_t, aiogate::pin_info >, map< size_t, aiogate::listener_info >, map< fuzzy_matcher_impl::ngram_key_offset, bool, less< fuzzy_matcher_impl::ngram_key_offset >, true >, map< reflection_key, reflection_entry >, and map< size_t, aiofile::aiofile_file >.

Definition at line 234 of file map.hpp.

References base_map< K, T, Pr, M >::_node_::_color, base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_left, base_map< K, T, Pr, M >::_node_::_parent, base_map< K, T, Pr, M >::_node_::_right, base_map< K, T, Pr, M >::_size, base_map< K, T, Pr, M >::_node_::_type, c_black, base_map< K, T, Pr, M >::head(), and t_head.

Referenced by _map< K, T, A, Pr, M >::_map(), _map< K, T, A, Pr, M >::assign(), base_map< K, T, Pr, M >::base_map(), xml_grammar::clear(), xml_document::clear(), map< K, T, Pr, M >::clear(), xml_grammar::copy(), cluster_engine_impl::do_clustering(), map< K, T, Pr, M >::erase(), _map< K, T, A, Pr, M >::erase(), xml_processor::parse(), and var_object_repository::reset().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::_insert	(	bool	left,
		TYPENAME base_map< K, T, Pr, M >::_node *	w,
		TYPENAME base_map< K, T, Pr, M >::_node *	n,
		const K &	k,
		const T &	v
	)			[inline, protected]

inserts new node

Parameters:

left	left flag
w	target node
n	new node
k	key
v	value

Definition at line 245 of file map.hpp.

References base_map< K, T, Pr, M >::_node_::_color, base_map< K, T, Pr, M >::_conskey(), base_map< K, T, Pr, M >::_consval(), base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_left, base_map< K, T, Pr, M >::_lrotate(), base_map< K, T, Pr, M >::_node_::_parent, base_map< K, T, Pr, M >::_node_::_right, base_map< K, T, Pr, M >::_rrotate(), base_map< K, T, Pr, M >::_size, c_black, c_red, base_map< K, T, Pr, M >::head(), base_map< K, T, Pr, M >::iterator, and TYPENAME.

Referenced by map< K, T, Pr, M >::_insert(), and _map< K, T, A, Pr, M >::_insert().

template<class K, class T, class Pr = less< K >, bool M = false>

TYPENAME base_map< K, T, Pr, M >::iterator base_map< K, T, Pr, M >::_erase	(	iterator	w,
		TYPENAME base_map< K, T, Pr, M >::_node *&	e
	)			[inline, protected]

erases node

Parameters:

w	iterator for erase
e	[out] deleted node

Referenced by map< K, T, Pr, M >::erase(), and _map< K, T, A, Pr, M >::erase().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node * base_map< K, T, Pr, M >::_lbound

(

const K &

k

)

const [inline, protected]

finds lower bound node by key

Parameters:

k

key

Definition at line 460 of file map.hpp.

References base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_parent, base_map< K, T, Pr, M >::head(), base_map< K, T, Pr, M >::key_compare, t_head, and TYPENAME.

Referenced by base_map< K, T, Pr, M >::lower_bound().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node * base_map< K, T, Pr, M >::_ubound

(

const K &

k

)

const [inline, protected]

finds upper bound node by key

Parameters:

k

key

Definition at line 475 of file map.hpp.

References base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_parent, base_map< K, T, Pr, M >::head(), base_map< K, T, Pr, M >::key_compare, t_head, and TYPENAME.

Referenced by base_map< K, T, Pr, M >::upper_bound().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node *& base_map< K, T, Pr, M >::lmost

(

)

[inline, protected]

gets the left most node

Definition at line 490 of file map.hpp.

References base_map< K, T, Pr, M >::_head, and base_map< K, T, Pr, M >::_node_::_left.

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node *& base_map< K, T, Pr, M >::lmost

(

)

const [inline, protected]

gets the left most node (const)

Definition at line 498 of file map.hpp.

References base_map< K, T, Pr, M >::_node_::_left, and base_map< K, T, Pr, M >::head().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node *& base_map< K, T, Pr, M >::rmost

(

)

[inline, protected]

gets the right most node

Definition at line 506 of file map.hpp.

References base_map< K, T, Pr, M >::_head, and base_map< K, T, Pr, M >::_node_::_right.

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node *& base_map< K, T, Pr, M >::rmost

(

)

const [inline, protected]

gets the right most node (const_

Definition at line 514 of file map.hpp.

References base_map< K, T, Pr, M >::_node_::_right, and base_map< K, T, Pr, M >::head().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node *& base_map< K, T, Pr, M >::root

(

)

[inline, protected]

gets the root node

Definition at line 522 of file map.hpp.

References base_map< K, T, Pr, M >::_head, and base_map< K, T, Pr, M >::_node_::_parent.

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node *& base_map< K, T, Pr, M >::root

(

)

const [inline, protected]

gets the root node (const)

Definition at line 530 of file map.hpp.

References base_map< K, T, Pr, M >::_node_::_parent, and base_map< K, T, Pr, M >::head().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node * base_map< K, T, Pr, M >::head

(

)

[inline, protected]

Definition at line 538 of file map.hpp.

References base_map< K, T, Pr, M >::_head, and TYPENAME.

Referenced by map< K, T, Pr, M >::_buynode(), _map< K, T, A, Pr, M >::_buynode(), base_map< K, T, Pr, M >::_insert(), base_map< K, T, Pr, M >::_lbound(), base_map< K, T, Pr, M >::_ubound(), base_map< K, T, Pr, M >::begin(), base_map< K, T, Pr, M >::clear(), base_map< K, T, Pr, M >::end(), map< K, T, Pr, M >::insert(), _map< K, T, A, Pr, M >::insert(), base_map< K, T, Pr, M >::lmost(), base_map< K, T, Pr, M >::rmost(), and base_map< K, T, Pr, M >::root().

template<class K, class T, class Pr, bool M>

TYPENAME base_map< K, T, Pr, M >::_node * base_map< K, T, Pr, M >::head

(

)

const [inline, protected]

gets the head node (const)

Definition at line 546 of file map.hpp.

References base_map< K, T, Pr, M >::_head, and TYPENAME.

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::_lrotate

(

TYPENAME base_map< K, T, Pr, M >::_node *

x

)

[inline, protected]

left rotate node

Parameters:

x	pointer to node

Definition at line 554 of file map.hpp.

References base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_left, base_map< K, T, Pr, M >::_node_::_parent, base_map< K, T, Pr, M >::_node_::_right, t_head, and TYPENAME.

Referenced by base_map< K, T, Pr, M >::_insert().

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::_rrotate

(

TYPENAME base_map< K, T, Pr, M >::_node *

x

)

[inline, protected]

right rotate node

Parameters:

x	pointer to node

Definition at line 574 of file map.hpp.

References base_map< K, T, Pr, M >::_head, base_map< K, T, Pr, M >::_node_::_left, base_map< K, T, Pr, M >::_node_::_parent, base_map< K, T, Pr, M >::_node_::_right, t_head, and TYPENAME.

Referenced by base_map< K, T, Pr, M >::_insert().

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::_consval	(	T *	p,
		const T &	v
	)			[inline, protected]

constructs value on pre-allocated memory

Parameters:

p	pointer to pre-allocated memory
v	value

Definition at line 594 of file map.hpp.

Referenced by base_map< K, T, Pr, M >::_insert().

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::_conskey	(	K *	p,
		const K &	k
	)			[inline, protected]

constructs key on pre-allocated memory

Parameters:

p	pointer to pre-allocated memory
k	key

Definition at line 602 of file map.hpp.

Referenced by base_map< K, T, Pr, M >::_insert().

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::_destval

(

T *

p

)

[inline, protected]

destroys value on pre-allocated memory

Parameters:

p	pointer to pre-allocated memory

Definition at line 610 of file map.hpp.

Referenced by map< K, T, Pr, M >::_erase(), map< K, T, Pr, M >::erase(), and _map< K, T, A, Pr, M >::erase().

template<class K, class T, class Pr, bool M>

void base_map< K, T, Pr, M >::_destkey

(

K *

p

)

[inline, protected]

destroys key on pre-allocated memory

Parameters:

p	pointer to pre-allocated memory

Definition at line 618 of file map.hpp.

Referenced by map< K, T, Pr, M >::_erase(), map< K, T, Pr, M >::erase(), and _map< K, T, A, Pr, M >::erase().

---

Friends And Related Function Documentation

template<class K, class T, class Pr = less< K >, bool M = false>

friend class const_iterator [friend]

friends

Definition at line 83 of file map.h.

Referenced by base_map< K, T, Pr, M >::begin(), base_map< K, T, Pr, M >::end(), and base_map< K, T, Pr, M >::lower_bound().

template<class K, class T, class Pr = less< K >, bool M = false>

friend class iterator [friend]

Definition at line 87 of file map.h.

Referenced by base_map< K, T, Pr, M >::_insert(), base_map< K, T, Pr, M >::begin(), base_map< K, T, Pr, M >::end(), map< K, T, Pr, M >::insert(), _map< K, T, A, Pr, M >::insert(), base_map< K, T, Pr, M >::lower_bound(), and base_map< K, T, Pr, M >::upper_bound().

---

Member Data Documentation

template<class K, class T, class Pr = less< K >, bool M = false>

Pr base_map< K, T, Pr, M >::key_compare [protected]

predicate

Definition at line 626 of file map.h.

Referenced by base_map< K, T, Pr, M >::_lbound(), base_map< K, T, Pr, M >::_ubound(), base_map< K, T, Pr, M >::comp(), base_map< K, T, Pr, M >::find(), map< K, T, Pr, M >::insert(), _map< K, T, A, Pr, M >::insert(), and map< K, T, Pr, M >::operator=().

template<class K, class T, class Pr = less< K >, bool M = false>

TYPENAME base_map< K, T, Pr, M >::_node_ base_map< K, T, Pr, M >::_head [protected]

head

Definition at line 627 of file map.h.

Referenced by base_map< K, T, Pr, M >::_insert(), base_map< K, T, Pr, M >::_lbound(), base_map< K, T, Pr, M >::_lrotate(), base_map< K, T, Pr, M >::_rrotate(), base_map< K, T, Pr, M >::_ubound(), base_map< K, T, Pr, M >::begin(), base_map< K, T, Pr, M >::clear(), map< K, T, Pr, M >::erase(), _map< K, T, A, Pr, M >::erase(), base_map< K, T, Pr, M >::head(), map< K, T, Pr, M >::insert(), _map< K, T, A, Pr, M >::insert(), base_map< K, T, Pr, M >::lmost(), base_map< K, T, Pr, M >::rmost(), and base_map< K, T, Pr, M >::root().

template<class K, class T, class Pr = less< K >, bool M = false>

size_t base_map< K, T, Pr, M >::_size [protected]

size

Definition at line 628 of file map.h.

Referenced by base_map< K, T, Pr, M >::_insert(), map< K, T, Pr, M >::clear(), base_map< K, T, Pr, M >::clear(), base_map< K, T, Pr, M >::empty(), map< K, T, Pr, M >::erase(), _map< K, T, A, Pr, M >::erase(), and base_map< K, T, Pr, M >::size().

---

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

• map.h
• map.hpp