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

NCBI C++ ToolKit: Interval Search Tree

  CIntervalTreeTraits::STreeMapValue::STreeMapValue (coordinate_type key, coordinate_type y, const mapped_type &value)   interval_type  CIntervalTreeTraits::STreeMapValue::GetInterval (void) const     CIntervalTreeTraits::SNodeMapValue::SNodeMapValue (coordinate_type key, TTreeMapI value)   static coordinate_type  CIntervalTreeTraits::GetMax (void)   static coordinate_type  CIntervalTreeTraits::GetMaxCoordinate (void)   static bool  CIntervalTreeTraits::IsNormal (const interval_type &interval)   bool  SIntervalTreeNodeIntervals< Traits >::Empty (void) const   void  SIntervalTreeNodeIntervals< Traits >::Insert (const interval_type &interval, TTreeMapI value)   bool  SIntervalTreeNodeIntervals< Traits >::Delete (const interval_type &interval, TTreeMapI value)   static void  SIntervalTreeNodeIntervals< Traits >::Delete (TNodeMap &m, const TNodeMapValue &v)     CIntervalTreeIterator< Traits >::CIntervalTreeIterator (coordinate_type search_x=0, coordinate_type searchLimit=0, TMapValueP currentMapValue=0, TTreeNodeP nextNode=0)     CIntervalTreeIterator< Traits >::CIntervalTreeIterator (const TNCIterator &iter)   bool  CIntervalTreeIterator< Traits >::Valid (void) const     CIntervalTreeIterator< Traits >::DECLARE_OPERATOR_BOOL_PTR (m_CurrentMapValue)   void  CIntervalTreeIterator< Traits >::Next (void)   TThisCIntervalTreeIterator< Traits >::operator++ (void)   interval_type  CIntervalTreeIterator< Traits >::GetInterval (void) const   reference  CIntervalTreeIterator< Traits >::GetValue (void) const   bool  CIntervalTreeIterator< Traits >::InAuxMap (void) const   TTreeMapValueP  CIntervalTreeIterator< Traits >::GetTreeMapValue (void) const   void  CIntervalTreeIterator< Traits >::NextLevel (void)     CIntervalTree::CIntervalTree (void)     CIntervalTree::~CIntervalTree (void)   bool  CIntervalTree::Empty (void) const   size_type  CIntervalTree::Size (void) const   pair< double, size_typeCIntervalTree::Stat (void) const   void  CIntervalTree::Clear (void)   iterator  CIntervalTree::Insert (const interval_type &interval, const mapped_type &value)   bool  CIntervalTree::Set (const interval_type &interval, const mapped_type &value)   bool  CIntervalTree::Reset (const interval_type &interval)   void  CIntervalTree::Add (const interval_type &interval, const mapped_type &value)   void  CIntervalTree::Replace (const interval_type &interval, const mapped_type &value)   void  CIntervalTree::Delete (const interval_type &interval)   bool  CIntervalTree::Add (const interval_type &interval, const mapped_type &value, const nothrow_t &)   bool  CIntervalTree::Replace (const interval_type &interval, const mapped_type &value, const nothrow_t &)   bool  CIntervalTree::Delete (const interval_type &interval, const nothrow_t &)   const_iterator  CIntervalTree::End (void) const   iterator  CIntervalTree::End (void)   const_iterator  CIntervalTree::Find (void) const   iterator  CIntervalTree::Find (void)   const_iterator  CIntervalTree::AllIntervals (void) const   iterator  CIntervalTree::AllIntervals (void)   const_iterator  CIntervalTree::IntervalsContaining (coordinate_type point) const   iterator  CIntervalTree::IntervalsContaining (coordinate_type point)   const_iterator  CIntervalTree::IntervalsOverlapping (const interval_type &interval) const   iterator  CIntervalTree::IntervalsOverlapping (const interval_type &interval)   static void  CIntervalTree::Assign (const_iterator &dst, const iterator &src)   static void  CIntervalTree::Assign (iterator &dst, const iterator &src)   void  CIntervalTree::Init (void)   void  CIntervalTree::Destroy (void)   void  CIntervalTree::Stat (const TTreeNode *node, SStat &stat) const   void  CIntervalTree::DoInsert (const interval_type &interval, TTreeMapI value)   bool  CIntervalTree::DoDelete (TTreeNode *node, const interval_type &interval, TTreeMapI value)   coordinate_type  CIntervalTree::GetMaxRootCoordinate (void) const   coordinate_type  CIntervalTree::GetNextRootKey (void) const   TTreeNodeCIntervalTree::AllocNode (void)   void  CIntervalTree::DeallocNode (TTreeNode *node)   TTreeNodeCIntervalTree::InitNode (TTreeNode *node, coordinate_type key) const   void  CIntervalTree::ClearNode (TTreeNode *node)   void  CIntervalTree::DeleteNode (TTreeNode *node)   TTreeNodeIntsCIntervalTree::AllocNodeIntervals (void)   void  CIntervalTree::DeallocNodeIntervals (TTreeNodeInts *nodeIntervals)   TTreeNodeIntsCIntervalTree::CreateNodeIntervals (void)   void  CIntervalTree::DeleteNodeIntervals (TTreeNodeInts *nodeIntervals)   ◆ const_iterator ◆ coordinate_type [1/5] ◆ coordinate_type [2/5]

template<typename Traits >

Definition at line 162 of file itree.hpp.

◆ coordinate_type [3/5]

template<typename Traits >

Definition at line 181 of file itree.hpp.

◆ coordinate_type [4/5] ◆ coordinate_type [5/5] ◆ interval_type [1/5] ◆ interval_type [2/5]

template<typename Traits >

Definition at line 163 of file itree.hpp.

◆ interval_type [3/5]

template<typename Traits >

Definition at line 182 of file itree.hpp.

◆ interval_type [4/5] ◆ interval_type [5/5] ◆ iterator ◆ mapped_type [1/4] ◆ mapped_type [2/4]

template<typename Traits >

Definition at line 164 of file itree.hpp.

◆ mapped_type [3/4]

template<typename Traits >

Definition at line 183 of file itree.hpp.

◆ mapped_type [4/4] ◆ reference [1/3] ◆ reference [2/3] ◆ reference [3/3] ◆ size_type ◆ TConstIteratorTraits [1/2] ◆ TConstIteratorTraits [2/2] ◆ TIteratorTraits [1/2] ◆ TIteratorTraits [2/2] ◆ TMap [1/2] ◆ TMap [2/2] ◆ TMapValue ◆ TMapValueP [1/3] ◆ TMapValueP [2/3] ◆ TMapValueP [3/3] ◆ TNCIterator [1/2] ◆ TNCIterator [2/2] ◆ TNodeAllocator ◆ TNodeIntervalsAllocator ◆ TNodeMap [1/2] ◆ TNodeMap [2/2]

template<typename Traits >

Definition at line 188 of file itree.hpp.

◆ TNodeMapCI ◆ TNodeMapI [1/2] ◆ TNodeMapI [2/2]

template<typename Traits >

Definition at line 190 of file itree.hpp.

◆ TNodeMapValue [1/2] ◆ TNodeMapValue [2/2]

template<typename Traits >

Definition at line 189 of file itree.hpp.

◆ TNodeMapValueP [1/3] ◆ TNodeMapValueP [2/3] ◆ TNodeMapValueP [3/3] ◆ TParent [1/2] ◆ TParent [2/2] ◆ TThis ◆ TTraits [1/5] ◆ TTraits [2/5]

template<typename Traits >

Definition at line 161 of file itree.hpp.

◆ TTraits [3/5]

template<typename Traits >

Definition at line 180 of file itree.hpp.

◆ TTraits [4/5] ◆ TTraits [5/5] ◆ TTreeMap [1/2] ◆ TTreeMap [2/2] ◆ TTreeMapCI [1/2] ◆ TTreeMapCI [2/2] ◆ TTreeMapI [1/3] ◆ TTreeMapI [2/3]

template<typename Traits >

Definition at line 191 of file itree.hpp.

◆ TTreeMapI [3/3] ◆ TTreeMapValue [1/2] ◆ TTreeMapValue [2/2] ◆ TTreeMapValueP [1/3] ◆ TTreeMapValueP [2/3] ◆ TTreeMapValueP [3/3] ◆ TTreeNode [1/4] ◆ TTreeNode [2/4]

template<typename Traits >

Definition at line 166 of file itree.hpp.

◆ TTreeNode [3/4]

template<typename Traits >

Definition at line 185 of file itree.hpp.

◆ TTreeNode [4/4] ◆ TTreeNodeInts [1/4] ◆ TTreeNodeInts [2/4]

template<typename Traits >

Definition at line 167 of file itree.hpp.

◆ TTreeNodeInts [3/4]

template<typename Traits >

Definition at line 186 of file itree.hpp.

◆ TTreeNodeInts [4/4] ◆ TTreeNodeIntsP [1/3] ◆ TTreeNodeIntsP [2/3] ◆ TTreeNodeIntsP [3/3] ◆ TTreeNodeP [1/3] ◆ TTreeNodeP [2/3] ◆ TTreeNodeP [3/3] ◆ TTreeTraits [1/2] ◆ TTreeTraits [2/2] ◆ Add() [1/2] ◆ Add() [2/2] ◆ AllIntervals() [1/2] iterator CIntervalTree::AllIntervals ( void  ) ◆ AllIntervals() [2/2] ◆ AllocNode() ◆ AllocNodeIntervals() ◆ Assign() [1/2] ◆ Assign() [2/2] ◆ CIntervalTree() CIntervalTree::CIntervalTree ( void  ) ◆ CIntervalTreeIterator() [1/2] ◆ CIntervalTreeIterator() [2/2] ◆ Clear() ◆ ClearNode() void CIntervalTree::ClearNode ( TTreeNodenode ) private ◆ CreateNodeIntervals() ◆ DeallocNode() void CIntervalTree::DeallocNode ( TTreeNodenode ) private ◆ DeallocNodeIntervals() void CIntervalTree::DeallocNodeIntervals ( TTreeNodeIntsnodeIntervals ) private ◆ DECLARE_OPERATOR_BOOL_PTR() ◆ Delete() [1/4] ◆ Delete() [2/4] ◆ Delete() [3/4] ◆ Delete() [4/4]

template<typename Traits >

◆ DeleteNode() ◆ DeleteNodeIntervals() void CIntervalTree::DeleteNodeIntervals ( TTreeNodeIntsnodeIntervals ) private ◆ Destroy() void CIntervalTree::Destroy ( void  ) private ◆ DoDelete()

Definition at line 120 of file itree.cpp.

References _ASSERT, SIntervalTreeNodeIntervals< Traits >::Delete(), CIntervalTree::DeleteNodeIntervals(), CRange_Base::GetFrom(), CRange_Base::GetTo(), ncbi::grid::netcache::search::fields::key, SIntervalTreeNode< Traits >::m_Key, SIntervalTreeNode< Traits >::m_Left, SIntervalTreeNode< Traits >::m_NodeIntervals, SIntervalTreeNode< Traits >::m_Right, and rapidjson::value.

◆ DoInsert()

Definition at line 57 of file itree.cpp.

References _ASSERT, CIntervalTree::AllocNode(), CIntervalTree::CreateNodeIntervals(), CRange_Base::GetFrom(), CIntervalTree::GetMaxRootCoordinate(), CIntervalTree::GetNextRootKey(), CRange_Base::GetTo(), CIntervalTree::InitNode(), SIntervalTreeNodeIntervals< Traits >::Insert(), CIntervalTreeTraits::IsNormal(), ncbi::grid::netcache::search::fields::key, SIntervalTreeNode< Traits >::m_Key, SIntervalTreeNode< Traits >::m_Left, SIntervalTreeNode< Traits >::m_NodeIntervals, SIntervalTreeNode< Traits >::m_Right, CIntervalTree::m_Root, next(), and rapidjson::value.

Referenced by CIntervalTree::Insert().

◆ Empty() [1/2]

template<typename Traits >

◆ Empty() [2/2] bool CIntervalTree::Empty ( void  ) const ◆ End() [1/2] ◆ End() [2/2] ◆ Find() [1/2] ◆ Find() [2/2] ◆ GetInterval() [1/2] interval_type CIntervalTreeTraits::STreeMapValue::GetInterval ( void  ) const inline ◆ GetInterval() [2/2] ◆ GetMax() ◆ GetMaxCoordinate() ◆ GetMaxRootCoordinate() ◆ GetNextRootKey() ◆ GetTreeMapValue() ◆ GetValue() ◆ InAuxMap() ◆ Init() void CIntervalTree::Init ( void  ) private ◆ InitNode() ◆ Insert() [1/2] ◆ Insert() [2/2] ◆ IntervalsContaining() [1/2] ◆ IntervalsContaining() [2/2] ◆ IntervalsOverlapping() [1/2]

Definition at line 190 of file itree.cpp.

References CLinkedMultiset< Mapped >::end(), CLinkedMultiset< Mapped >::get(), CRange_Base::GetFrom(), CIntervalTreeTraits::GetMaxCoordinate(), CRange_Base::GetTo(), CLinkedMultiset< Mapped >::lower_bound(), CIntervalTree::m_ByX, CIntervalTreeIterator< Traits >::m_CurrentMapValue, CIntervalTree::m_Root, CIntervalTreeIterator< Traits >::m_SearchLimit, and CIntervalTreeIterator< Traits >::NextLevel().

◆ IntervalsOverlapping() [2/2] ◆ IsNormal() ◆ Next() ◆ NextLevel() ◆ operator++() ◆ Replace() [1/2] ◆ Replace() [2/2] ◆ Reset() ◆ Set() ◆ Size() ◆ SNodeMapValue() ◆ Stat() [1/2] ◆ Stat() [2/2] ◆ STreeMapValue() ◆ Valid() ◆ ~CIntervalTree() CIntervalTree::~CIntervalTree ( void  ) ◆ count ◆ m_ByX [1/2]

template<typename Traits >

◆ m_ByX [2/2] ◆ m_ByY

template<typename Traits >

◆ m_CurrentMapValue ◆ m_Key

template<typename Traits >

◆ m_Left

template<typename Traits >

◆ m_NextNode ◆ m_NodeAllocator ◆ m_NodeIntervals

template<typename Traits >

◆ m_NodeIntervalsAllocator ◆ m_Right

template<typename Traits >

◆ m_Root ◆ m_SearchLimit ◆ m_SearchX ◆ m_Value [1/2] ◆ m_Value [2/2] ◆ m_Y ◆ max ◆ total ◆ CIntervalTree

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