Method findSuperstr

src/back/util/map.ts:264–289

(key: K)

  }

  findSuperstr(key: K): Iterator<V> | undefined {
    const iter = this._iter.reset(key);
    let node = this._root;
    while (node) {
      const val = iter.cmp(node.segment);
      if (val > 0) {
        // left
        node = node.left;
      } else if (val < 0) {
        // right
        node = node.right;
      } else if (iter.hasNext()) {
        // mid
        iter.next();
        node = node.mid;
      } else {
        // collect
        if (!node.mid) {
          return undefined;
        } else {
          return this._nodeIterator(node.mid);
        }
      }
    }
    return undefined;
  }

  private _nodeIterator(node: TernarySearchTreeNode<K, V>): Iterator<V> {
    let res: { done: false; value: V; };