RetroSearch Browse

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

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

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

50 template

typename

Key>

86 template

typename

Value,

typename

Compare>

96

SValue* Next(

void

)

const 107 typedef typename

TSet::iterator iterator;

108 typedef typename

TSet::const_iterator const_iterator;

109 typedef

SValue* TForwardIterator;

111

CLinkedSetBase(

void

)

116

: m_Set(comp), m_Start(0)

120 bool empty

(

void

)

const 125

TForwardIterator ForwardBegin(

void

)

const 129

TForwardIterator ForwardEnd(

void

)

const 134

iterator begin(

void

)

136 return

m_Set.begin();

144 return

m_Set.find(

value

);

148 return

m_Set.lower_bound(

value

);

151

const_iterator begin(

void

)

const 153 return

m_Set.begin();

155

const_iterator end(

void

)

const 159

const_iterator find(

const Value

value

)

const 161 return

m_Set.find(

value

);

163

const_iterator lower_bound(

const Value

value

)

const 165 return

m_Set.lower_bound(

value

);

174 void

insertAfter(

const

SValue& prevValue,

const

SValue& newValue)

177

newValue.m_Next = prevValue.m_Next;

178

prevValue.m_Next = &newValue;

180 void

insertToStart(

const

SValue& newValue)

183

newValue.m_Next = m_Start;

187 void

removeAfter(

const

SValue& prevValue,

const

SValue&

value

)

189

prevValue.m_Next =

value

.m_Next;

192 void

removeFromStart(

const

SValue&

value

)

194

m_Start =

value

.m_Next;

202 template

typename

Mapped>

203 class

CLinkedSet :

public

CLinkedSetBase<typename Mapped::key_type>

205 typedef

CLinkedSetBase<typename Mapped::key_type> TParent;

208 typedef typename

TContainer::size_type size_type;

210 typedef typename

TContainer::iterator iterator;

211 typedef typename

TContainer::const_iterator const_iterator;

213

size_type

size

(

void

)

const 215 return

m_Container.size();

224

const_iterator begin(

void

)

const 226 return

m_Container.begin();

228

const_iterator end(

void

)

const 230 return

m_Container.end();

234 return

m_Container.find(

value

);

238 return

m_Container.lower_bound(

value

);

242 return

m_Container.upper_bound(

value

);

245

iterator begin(

void

)

247 return

m_Container.begin();

251 return

m_Container.end();

255 return

m_Container.find(

value

);

259 return

m_Container.lower_bound(

value

);

263 return

m_Container.upper_bound(

value

);

268

pair<iterator, bool> ins = m_Container.insert(

value

);

270 if

( ins.first == begin() )

271

this->insertToStart(*ins.first);

273

iterator

= ins.first;

274

this->insertAfter(*--

, *ins.first);

280 void

erase(iterator iter)

282 if

( iter == begin() )

283

this->removeFromStart(*iter);

285

iterator

= iter;

286

this->removeAfter(*--

, *iter);

288

m_Container.erase(iter);

292

TContainer m_Container;

296 template

typename

Key>

331

prevValue.

m_Next

= &newValue;

357 template

typename

Mapped>

424 if

( iter ==

begin

() )

435 if

( iter ==

begin

() )

449 #if defined(_RWSTD_VER) && !defined(_RWSTD_STRICT_ANSI)

const_iterator begin() const

const_iterator upper_bound(const key_type &key) const

iterator insert(const value_type &val)

const_iterator end() const

parent_type::size_type size_type

parent_type::value_type value_type

parent_type::iterator iterator

const_iterator find(const key_type &key) 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.

static DLIST_TYPE *DLIST_NAME() prev(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

static DLIST_TYPE *DLIST_NAME() next(DLIST_LIST_TYPE *list, DLIST_TYPE *item)

const_iterator end(void) const

SLinkedSetValue(const key_type &key, value_type *next=0)

size_type size(void) const

TContainer::size_type size_type

TContainer::iterator iterator

const_iterator find(const value_type &value) const

const key_type & GetKey(void) const

value_type * GetNext(void)

iterator insert(const value_type &value)

const value_type * GetStart(void) const

bool operator<(const value_type &value) const

const value_type * GetNext(void) const

CLinkedMultisetBase(void)

void removeAfter(value_type &prevValue, value_type &value)

const_iterator upper_bound(const value_type &value) const

TContainer::value_type value_type

const_iterator begin(void) const

iterator find(const value_type &value)

value_type * GetStart(void)

TContainer::const_iterator const_iterator

void erase(iterator iter)

const_iterator lower_bound(const value_type &value) const

SLinkedSetValue< key_type > value_type

multiset< Mapped > TContainer

void removeFromStart(value_type &value)

void insertAfter(value_type &prevValue, value_type &newValue)

SLinkedSetValue< Key > value_type

void insertToStart(value_type &newValue)

iterator upper_bound(const value_type &value)

CLinkedMultisetBase< typename Mapped::key_type > TParent

static value_type & get(iterator iter)

iterator lower_bound(const value_type &value)

sequence::ECompare Compare(const CSeq_loc &loc1, const CSeq_loc &loc2, CScope *scope)

Returns the sequence::ECompare containment relationship between CSeq_locs.

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

constexpr bool empty(list< Ts... >) noexcept

double value_type

The numeric datatype used by the parser.

const struct ncbi::grid::netcache::search::fields::SIZE size

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