+
+sl_iter_t *sl_iter_begin (skiplist_t *sl, map_key_t key) {
+ node_t *iter = node_alloc(0, 0, 0);
+ find_preds(NULL, &iter->next[0], 0, sl, key, FALSE);
+ return iter;
+}
+
+map_val_t sl_iter_next (sl_iter_t *iter, map_key_t *key_ptr) {
+ assert(iter);
+ node_t *item = iter->next[0];
+ while (item != NULL && IS_TAGGED(item->next[0], TAG1)) {
+ item = (node_t *)STRIP_TAG(item->next[0], TAG1);
+ }
+ if (item == NULL) {
+ iter->next[0] = NULL;
+ return DOES_NOT_EXIST;
+ }
+ iter->next[0] = item->next[0];
+ if (key_ptr != NULL) {
+ *key_ptr = item->key;
+ }
+ return item->val;
+}
+
+void sl_iter_free (sl_iter_t *iter) {
+ nbd_free(iter);
+}