A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/limited__size__map_8hpp_source.html below:

NCBI C++ ToolKit: include/util/limited_size_map.hpp Source File

1 #ifndef UTIL__LIMITED_SIZE_MAP__HPP 2 #define UTIL__LIMITED_SIZE_MAP__HPP 51 template

<

class

Key,

class

Value,

class

Less = less<Key> >

130  return

!(*

this

==

a

);

165  return

!(*

this

==

a

);

205  return

iterator(iter);

212  return

iterator(iter);

217

const_iterator

begin

(

void

)

const

{

220

const_iterator

end

(

void

)

const

{

221  return

const_iterator(

m_Map

.

end

());

241  return

pair<iterator, bool>(iterator(ins.first), ins.second);

263  return const_cast<

SNode&

>

(*iter);

280

iter->m_RemoveListIter);

iterator_bool insert(const value_type &val)

const_iterator begin() const

parent_type::iterator iterator

const_iterator upper_bound(const key_type &key) const

const_iterator find(const key_type &key) const

const_iterator end() const

const_iterator lower_bound(const key_type &key) const

parent_type::const_iterator const_iterator

Include a standard set of the NCBI C++ Toolkit most basic headers.

const_iterator find(const key_type &key) const

bool operator!=(const_iterator a) const

SNode(const key_type &key, const mapped_type &value)

TRemoveList::iterator TRemoveListIterator

const_iterator end(void) const

const value_type * operator->() const

const_iterator & operator--()

const_iterator lower_bound(const key_type &key) const

list< TMapIterator > TRemoveList

bool operator==(const_iterator a) const

iterator find(const key_type &key)

const_iterator operator++(int)

SLess(const TLess &key_comp)

iterator upper_bound(const key_type &key)

size_t get_size_limit(void) const

value_type & operator*() const

bool operator==(iterator a) const

pair< iterator, bool > insert(const value_type &value)

const_iterator & operator++()

value_type * operator->() const

void set_size_limit(size_t size_limit)

iterator(TMapIterator iter)

const_iterator operator--(int)

bool operator()(const SNode &a, const SNode &b) const

pair< const key_type, mapped_type > value_type

SNode & x_GetNode(TMapIterator iter)

iterator lower_bound(const key_type &key)

void erase(iterator iter)

TRemoveListIterator m_RemoveListIter

void x_MarkUsed(TMapIterator iter)

const_iterator upper_bound(const key_type &key) const

mapped_type & operator[](const key_type &key)

const value_type & operator*() const

const_iterator(iterator iter)

const_iterator begin(void) const

limited_size_map(size_t size_limit=0)

bool operator!=(iterator a) const

SNode(const key_type &key)

void x_MarkAdded(TMapIterator iter)

SNode(const value_type &value)

TMap::const_iterator TMapConstIterator

const_iterator(TMapConstIterator iter)

TMap::iterator TMapIterator

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

const struct ncbi::grid::netcache::search::fields::KEY key

const GenericPointer< typename T::ValueType > T2 value

GenericValue< UTF8<> > Value

GenericValue with UTF8 encoding.

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4