5 #include <libutl/TSkipListIt.h> 42 return super::add(const_cast<T&>(
object));
48 return super::add(const_cast<T*>(
object));
54 super::add(collection);
61 res.
copy(SkipList::begin());
69 res.
copy(SkipList::begin());
77 res.
copy(SkipList::end());
85 res.
copy(SkipList::end());
93 return utl::cast<T>(SkipList::find(key));
97 findIt(
const Object& key)
const 100 res.
copy(SkipList::findIt(key));
108 res.
copy(SkipList::findIt(key));
113 findFirstIt(
const Object& key,
BidIt& it,
bool insert =
false)
const 115 super::findFirstIt(key, it);
121 super::findFirstIt(key, it, insert);
125 findFirstIt(
const Object& key,
bool insert =
false)
const 128 res.
copy(SkipList::findFirstIt(key, insert));
133 findFirstIt(
const Object& key,
bool insert =
false)
136 res.
copy(SkipList::findFirstIt(key, insert));
143 super::findLastIt(key, it);
149 super::findLastIt(key, it);
153 findLastIt(
const Object& key)
const 156 res.
copy(SkipList::findLastIt(key));
161 findLastIt(
const Object& key)
164 res.
copy(SkipList::findLastIt(key));
184 :
SkipList(owner, multiSet, ordering)
#define UTL_CLASS_IMPL_TPL(className, T)
Implementation of standard UTL++ functionality for a template class.
#define UTL_CLASS_DEFID
Default init() and deInit() (which are merely place-holders).
virtual void copy(const Object &rhs)
Copy another SkipListIt.
Object comparison abstraction.
virtual void findFirstIt(const Object &key, BidIt &it, bool insert=false)
Find the first object matching the given key.
void remove(FwdIt &begin, const FwdIt &end, bool cmp=false, const Predicate *pred=nullptr, bool predVal=false)
Remove objects from a sequence.
Template version of SkipList.
Templated proxy for BidIt.
virtual void findLastIt(const Object &key, BidIt &it)
Find the last object matching the given key.
T * findT(const Object &key) const
See find().
Bi-directional iterator abstraction.
#define UTL_CLASS_DECL_TPL(DC, T, BC)
Declaration of standard UTL++ functionality for a template class with one parameter.
Template version of SkipListIt.
Root of UTL++ class hierarchy.