0001 template <typename K, typename V> V* Skiplist<K, V>::get ( K k ) { //跳转表词条查找算法 0002 if ( empty() ) return NULL; 0003 ListNode<Quadlist<Entry<K, V>>*>* qlist = first(); //从顶层Quadlist的 0004 QuadlistNode<Entry<K, V>>* p = qlist->data->first(); //首节点开始 0005 return skipSearch ( qlist, p, k ) ? & ( p->entry.value ) : NULL; //查找并报告 0006 } //有多个命中时靠后者优先