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/itree_8cpp_source.html below:

NCBI C++ ToolKit: src/util/itree.cpp Source File

89

nodeSize = (nodeSize + 1) / 2;

96

nextKeyOffset = nodeSize;

98 else if

( interval.

GetTo

() <

key

) {

100

nextKeyOffset = -nodeSize;

105 if

( !nodeIntervals )

130 else if

( interval.

GetTo

() <

key

) {

179 if

( iter !=

m_ByX

end

() && iter->GetKey() <= y ) {

199 if

( iter !=

m_ByX

end

() && iter->GetKey() <= y ) {

232 #if defined(_RWSTD_VER) && !defined(_RWSTD_STRICT_ANSI) 233

ints->

m_ByX

.allocation_size(16);

234

ints->

m_ByY

.allocation_size(16);

242

ptr->~TTreeNodeInts();

261 return

make_pair(

double

(stat.

total

) / (

double

)stat.

count

, stat.

max

);

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

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

iterator Insert(const interval_type &interval, const mapped_type &value)

void DeallocNode(TTreeNode *node)

void DeleteNode(TTreeNode *node)

TTraits::mapped_type mapped_type

TTraits::TTreeNodeInts TTreeNodeInts

TTreeNode * AllocNode(void)

coordinate_type m_SearchLimit

TTreeNode * InitNode(TTreeNode *node, coordinate_type key) const

pair< double, size_type > Stat(void) const

static bool IsNormal(const interval_type &interval)

void DeleteNodeIntervals(TTreeNodeInts *nodeIntervals)

coordinate_type GetMaxRootCoordinate(void) const

void Insert(const interval_type &interval, TTreeMapI value)

static coordinate_type GetMaxCoordinate(void)

void ClearNode(TTreeNode *node)

TTraits::TTreeMapCI TTreeMapCI

bool Delete(const interval_type &interval, TTreeMapI value)

TTraits::TTreeMapI TTreeMapI

TMapValueP m_CurrentMapValue

TTreeNodeInts * AllocNodeIntervals(void)

TTraits::coordinate_type coordinate_type

TNodeIntervalsAllocator m_NodeIntervalsAllocator

bool DoDelete(TTreeNode *node, const interval_type &interval, TTreeMapI value)

TTraits::TTreeMapValue TTreeMapValue

void DoInsert(const interval_type &interval, TTreeMapI value)

const_iterator IntervalsOverlapping(const interval_type &interval) const

TTreeNodeInts * m_NodeIntervals

coordinate_type GetNextRootKey(void) const

TTreeNodeInts * CreateNodeIntervals(void)

CIntervalTreeIterator< TIteratorTraits > iterator

TNodeAllocator m_NodeAllocator

void DeallocNodeIntervals(TTreeNodeInts *nodeIntervals)

const_iterator end(void) const

iterator insert(const value_type &value)

const_iterator lower_bound(const value_type &value) const

static value_type & get(iterator iter)

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

TTo GetTo(void) const

Get the To member data.

TFrom GetFrom(void) const

Get the From member data.

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

const GenericPointer< typename T::ValueType > T2 value

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