<
classTraits>
141 template<
classTraits>
148 typedef const typenameTParent::mapped_type&
reference;
158 template<
typenameTraits>
177 template<
typenameTraits>
204 template<
classTraits>
222 typedef typenameTTraits::TMap
TMap;
317pair<double, size_type> Stat(
void)
const;
373 voidDestroy(
void);
409 #if defined(_RWSTD_VER) && !defined(_RWSTD_ALLOCATOR)Include a standard set of the NCBI C++ Toolkit most basic headers.
bool Set(const interval_type &interval, const mapped_type &value)
CIntervalTreeIterator< TConstIteratorTraits > const_iterator
TTraits::TNCIterator TNCIterator
allocator< TTreeNode > TNodeAllocator
interval_type GetInterval(void) const
const_iterator Find(void) const
TTraits::TConstIteratorTraits TConstIteratorTraits
TTraits::interval_type interval_type
static void Assign(const_iterator &dst, const iterator &src)
void DeleteNode(TTreeNode *node)
TParent::TMapValue * TMapValueP
CRange< coordinate_type > interval_type
TTraits::mapped_type mapped_type
CIntervalTreeConstIteratorTraits< TTraits > TConstIteratorTraits
DECLARE_OPERATOR_BOOL_PTR(m_CurrentMapValue)
size_type Size(void) const
const TParent::TTreeMapValue * TTreeMapValueP
TParent::TTreeNode * TTreeNodeP
TTraits::TTreeNodeIntsP TTreeNodeIntsP
TTraits::reference reference
TTreeMap::const_iterator TTreeMapCI
TTraits::TTreeNodeP TTreeNodeP
TTraits::interval_type interval_type
CIntervalTreeIterator(coordinate_type search_x=0, coordinate_type searchLimit=0, TMapValueP currentMapValue=0, TTreeNodeP nextNode=0)
TTraits::TTreeNodeInts TTreeNodeInts
TTreeMapValueP GetTreeMapValue(void) const
TTraits::TTreeMapValueP TTreeMapValueP
TTraits::TMapValueP TMapValueP
CLinkedMultiset< TNodeMapValue > TNodeMap
TTraits::coordinate_type coordinate_type
TTraits::interval_type interval_type
STreeMapValue(coordinate_type key, coordinate_type y, const mapped_type &value)
coordinate_type m_SearchLimit
SIntervalTreeNode< TTraits > TTreeNode
CIntervalTreeTraits TTraits
iterator IntervalsContaining(coordinate_type point)
TTraits::TNodeMapI TNodeMapI
static coordinate_type GetMax(void)
CIntervalTreeIteratorTraits< TTraits > TIteratorTraits
TTreeNode * InitNode(TTreeNode *node, coordinate_type key) const
static bool IsNormal(const interval_type &interval)
TParent::TTreeNodeInts * TTreeNodeIntsP
TTraits::TTreeMap TTreeMap
const_iterator End(void) const
TTraits::TNodeMapValue TNodeMapValue
bool Delete(const interval_type &interval, const nothrow_t &)
TTraits::TNodeMap TNodeMap
void Add(const interval_type &interval, const mapped_type &value)
SNodeMapValue(coordinate_type key, TTreeMapI value)
TTraits::TTreeNodeInts TTreeNodeInts
static void Delete(TNodeMap &m, const TNodeMapValue &v)
void Insert(const interval_type &interval, TTreeMapI value)
static void Assign(iterator &dst, const iterator &src)
static coordinate_type GetMaxCoordinate(void)
iterator AllIntervals(void)
bool Reset(const interval_type &interval)
CIntervalTreeIterator(const TNCIterator &iter)
TParent::mapped_type & reference
TTraits::TTreeMapCI TTreeMapCI
bool Delete(const interval_type &interval, TTreeMapI value)
SLinkedSetValue< coordinate_type > TMapValue
SNodeMapValue TNodeMapValue
TTraits::coordinate_type coordinate_type
TTraits::mapped_type mapped_type
TTraits::TTreeNode TTreeNode
CIntervalTreeTraits TTraits
TTraits::TTreeMapI TTreeMapI
const TParent::mapped_type & reference
bool InAuxMap(void) const
TMapValueP m_CurrentMapValue
CLinkedMultiset< TTreeMapValue > TTreeMap
TNodeMap::const_iterator TNodeMapCI
const TParent::TNodeMapValue * TNodeMapValueP
TTraits::coordinate_type coordinate_type
TTraits::TTreeNode TTreeNode
const_iterator AllIntervals(void) const
TParent::TNodeMapValue * TNodeMapValueP
TTraits::TTreeNode TTreeNode
TTraits::interval_type interval_type
const TParent::TTreeNode * TTreeNodeP
const_iterator IntervalsContaining(coordinate_type point) const
TTreeMap::iterator TTreeMapI
bool Replace(const interval_type &interval, const mapped_type &value, const nothrow_t &)
bool Add(const interval_type &interval, const mapped_type &value, const nothrow_t &)
TNodeIntervalsAllocator m_NodeIntervalsAllocator
interval_type GetInterval(void) const
SIntervalTreeNodeIntervals< TTraits > TTreeNodeInts
const TParent::TTreeNodeInts * TTreeNodeIntsP
void Replace(const interval_type &interval, const mapped_type &value)
void Delete(const interval_type &interval)
const TParent::TMapValue * TMapValueP
TTraits::TTreeMapValue TTreeMapValue
CIntervalTreeIterator< TTraits > TThis
TTraits::TNodeMapValueP TNodeMapValueP
CConstRef< CObject > mapped_type
TTraits::TTreeMapI TTreeMapI
STreeMapValue TTreeMapValue
TTraits::coordinate_type coordinate_type
CIntervalTreeIterator< TIteratorTraits > TNCIterator
TTreeNodeInts * m_NodeIntervals
coordinate_type m_SearchX
TTraits::TTreeNodeInts TTreeNodeInts
TParent::TTreeMapValue * TTreeMapValueP
TTraits::TIteratorTraits TIteratorTraits
CIntervalTreeIterator< TIteratorTraits > iterator
TNodeAllocator m_NodeAllocator
allocator< TTreeNodeInts > TNodeIntervalsAllocator
reference GetValue(void) const
TTraits::mapped_type mapped_type
TNodeMap::iterator TNodeMapI
TContainer::iterator iterator
TContainer::const_iterator const_iterator
#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
Portable reference counted smart and weak pointers using CWeakRef, CRef, CObject and CObjectEx.
Useful/utility classes and methods.
NCBI_XUTIL_EXPORT
Parameter to control printing diagnostic message about conversion of static array data from a differe...
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