Lines Matching refs:Key
43 template<typename Key, class Comparator>
60 void Insert(const Key& key);
63 bool Contains(const Key& key) const;
66 uint64_t EstimateCount(const Key& key) const;
85 const Key& key() const;
96 void Seek(const Key& target);
99 void SeekForPrev(const Key& target);
141 Node* NewNode(const Key& key, int height);
143 bool Equal(const Key& a, const Key& b) const { return (compare_(a, b) == 0); } in Equal()
144 bool LessThan(const Key& a, const Key& b) const { in LessThan()
149 bool KeyIsAfterNode(const Key& key, Node* n) const;
153 Node* FindGreaterOrEqual(const Key& key) const;
159 Node* FindLessThan(const Key& key, Node** prev = nullptr) const;
167 template<typename Key, class Comparator>
168 struct SkipList<Key, Comparator>::Node {
169 explicit Node(const Key& k) : key(k) { }
171 Key const key;
203 template<typename Key, class Comparator>
204 typename SkipList<Key, Comparator>::Node*
205 SkipList<Key, Comparator>::NewNode(const Key& key, int height) {
211 template<typename Key, class Comparator>
212 inline SkipList<Key, Comparator>::Iterator::Iterator(const SkipList* list) {
216 template<typename Key, class Comparator>
217 inline void SkipList<Key, Comparator>::Iterator::SetList(const SkipList* list) {
222 template<typename Key, class Comparator>
223 inline bool SkipList<Key, Comparator>::Iterator::Valid() const {
227 template<typename Key, class Comparator>
228 inline const Key& SkipList<Key, Comparator>::Iterator::key() const {
233 template<typename Key, class Comparator>
234 inline void SkipList<Key, Comparator>::Iterator::Next() {
239 template<typename Key, class Comparator>
240 inline void SkipList<Key, Comparator>::Iterator::Prev() {
250 template<typename Key, class Comparator>
251 inline void SkipList<Key, Comparator>::Iterator::Seek(const Key& target) {
255 template <typename Key, class Comparator>
256 inline void SkipList<Key, Comparator>::Iterator::SeekForPrev(
257 const Key& target) {
267 template <typename Key, class Comparator>
268 inline void SkipList<Key, Comparator>::Iterator::SeekToFirst() {
272 template<typename Key, class Comparator>
273 inline void SkipList<Key, Comparator>::Iterator::SeekToLast() {
280 template<typename Key, class Comparator>
281 int SkipList<Key, Comparator>::RandomHeight() {
294 template<typename Key, class Comparator>
295 bool SkipList<Key, Comparator>::KeyIsAfterNode(const Key& key, Node* n) const {
300 template<typename Key, class Comparator>
301 typename SkipList<Key, Comparator>::Node* SkipList<Key, Comparator>::
302 FindGreaterOrEqual(const Key& key) const {
333 template<typename Key, class Comparator>
334 typename SkipList<Key, Comparator>::Node*
335 SkipList<Key, Comparator>::FindLessThan(const Key& key, Node** prev) const {
363 template<typename Key, class Comparator>
364 typename SkipList<Key, Comparator>::Node* SkipList<Key, Comparator>::FindLast()
383 template <typename Key, class Comparator>
384 uint64_t SkipList<Key, Comparator>::EstimateCount(const Key& key) const {
407 template <typename Key, class Comparator>
408 SkipList<Key, Comparator>::SkipList(const Comparator cmp, Allocator* allocator,
434 template<typename Key, class Comparator>
435 void SkipList<Key, Comparator>::Insert(const Key& key) {
486 template<typename Key, class Comparator>
487 bool SkipList<Key, Comparator>::Contains(const Key& key) const {