BDE 4.14.0 Production release
Loading...
Searching...
No Matches
bdlcc::SkipList< KEY, DATA > Member List

This is the complete list of members for bdlcc::SkipList< KEY, DATA >, including all inherited members.

add(const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
add(PairHandle *result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addAtLevelRaw(Pair **result, int level, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addAtLevelRawR(Pair **result, int level, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addAtLevelUniqueRaw(Pair **result, int level, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >
addAtLevelUniqueRawR(Pair **result, int level, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >
addPairReferenceRaw(const Pair *reference) constbdlcc::SkipList< KEY, DATA >inline
addR(const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addR(PairHandle *result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addRaw(Pair **result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addRawR(Pair **result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addUnique(const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addUnique(PairHandle *result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addUniqueR(const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addUniqueR(PairHandle *result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >
addUniqueRaw(Pair **result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
addUniqueRawR(Pair **result, const KEY &key, const DATA &data, bool *newFrontFlag=0)bdlcc::SkipList< KEY, DATA >inline
allocator() constbdlcc::SkipList< KEY, DATA >inline
back(PairHandle *back) constbdlcc::SkipList< KEY, DATA >inline
backRaw(Pair **back) constbdlcc::SkipList< KEY, DATA >inline
BCEC_DUPLICATE enum valuebdlcc::SkipList< KEY, DATA >
BCEC_INVALID enum valuebdlcc::SkipList< KEY, DATA >
BCEC_NOT_FOUND enum valuebdlcc::SkipList< KEY, DATA >
BCEC_SUCCESS enum valuebdlcc::SkipList< KEY, DATA >
BSLMF_NESTED_TRAIT_DECLARATION(SkipList, bslma::UsesBslmaAllocator)bdlcc::SkipList< KEY, DATA >
e_DUPLICATE enum valuebdlcc::SkipList< KEY, DATA >
e_INVALID enum valuebdlcc::SkipList< KEY, DATA >
e_NOT_FOUND enum valuebdlcc::SkipList< KEY, DATA >
e_SUCCESS enum valuebdlcc::SkipList< KEY, DATA >
exists(const KEY &key) constbdlcc::SkipList< KEY, DATA >
find(PairHandle *item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findLowerBound(PairHandle *item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findLowerBoundR(PairHandle *item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findLowerBoundRaw(Pair **item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findLowerBoundRRaw(Pair **item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findR(PairHandle *item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findRaw(Pair **item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findRRaw(Pair **item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findUpperBound(PairHandle *item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findUpperBoundR(PairHandle *item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findUpperBoundRaw(Pair **item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
findUpperBoundRRaw(Pair **item, const KEY &key) constbdlcc::SkipList< KEY, DATA >inline
front(PairHandle *front) constbdlcc::SkipList< KEY, DATA >inline
frontRaw(Pair **front) constbdlcc::SkipList< KEY, DATA >inline
isEmpty() constbdlcc::SkipList< KEY, DATA >inline
length() constbdlcc::SkipList< KEY, DATA >inline
level(const Pair *reference)bdlcc::SkipList< KEY, DATA >inlinestatic
next(PairHandle *next, const Pair *reference) constbdlcc::SkipList< KEY, DATA >inline
nextRaw(Pair **next, const Pair *reference) constbdlcc::SkipList< KEY, DATA >inline
operator!=bdlcc::SkipList< KEY, DATA >friend
operator=(const SkipList &rhs)bdlcc::SkipList< KEY, DATA >
operator==bdlcc::SkipList< KEY, DATA >friend
Pair typedefbdlcc::SkipList< KEY, DATA >
PairHandle typedefbdlcc::SkipList< KEY, DATA >
popFront(PairHandle *item=0)bdlcc::SkipList< KEY, DATA >inline
popFrontRaw(Pair **item)bdlcc::SkipList< KEY, DATA >inline
previous(PairHandle *prevPair, const Pair *reference) constbdlcc::SkipList< KEY, DATA >inline
previousRaw(Pair **prevPair, const Pair *reference) constbdlcc::SkipList< KEY, DATA >inline
print(bsl::ostream &stream, int level=0, int spacesPerLevel=4) constbdlcc::SkipList< KEY, DATA >
releaseReferenceRaw(const Pair *reference)bdlcc::SkipList< KEY, DATA >inline
remove(const Pair *reference)bdlcc::SkipList< KEY, DATA >inline
removeAll()bdlcc::SkipList< KEY, DATA >inline
removeAll(bsl::vector< PairHandle > *removed)bdlcc::SkipList< KEY, DATA >inline
removeAll(std::vector< PairHandle > *removed)bdlcc::SkipList< KEY, DATA >inline
removeAllRaw(bsl::vector< Pair * > *removed)bdlcc::SkipList< KEY, DATA >inline
removeAllRaw(std::vector< Pair * > *removed)bdlcc::SkipList< KEY, DATA >inline
RET_DUPLICATE enum valuebdlcc::SkipList< KEY, DATA >
RET_INVALID enum valuebdlcc::SkipList< KEY, DATA >
RET_NOT_FOUND enum valuebdlcc::SkipList< KEY, DATA >
RET_SUCCESS enum valuebdlcc::SkipList< KEY, DATA >
skipBackward(PairHandle *item) constbdlcc::SkipList< KEY, DATA >inline
skipBackwardRaw(Pair **item) constbdlcc::SkipList< KEY, DATA >inline
skipForward(PairHandle *item) constbdlcc::SkipList< KEY, DATA >inline
skipForwardRaw(Pair **item) constbdlcc::SkipList< KEY, DATA >inline
SkipList(bslma::Allocator *basicAllocator=0)bdlcc::SkipList< KEY, DATA >explicit
SkipList(const SkipList &original, bslma::Allocator *basicAllocator=0)bdlcc::SkipList< KEY, DATA >
SkipListPair< KEY, DATA >bdlcc::SkipList< KEY, DATA >friend
SkipListPairHandle< KEY, DATA >bdlcc::SkipList< KEY, DATA >friend
update(const Pair *reference, const KEY &newKey, bool *newFrontFlag=0, bool allowDuplicates=true)bdlcc::SkipList< KEY, DATA >inline
updateR(const Pair *reference, const KEY &newKey, bool *newFrontFlag=0, bool allowDuplicates=true)bdlcc::SkipList< KEY, DATA >inline
~SkipList()bdlcc::SkipList< KEY, DATA >