public void insert(long x) {
    if (x == blank) {
      findNewBlank();
    }
    long temp;
    if (lookup(x)) {
      return;
    }

    // Try to insert up to n times. Rehash if that fails.
    for(int i = 0; i != n; i++) {
      if (t1[h1(x)] == blank) {
        t1[h1(x)] = x;
        return;
      }

      // swap x and t1[h1(x)]
      temp = t1[h1(x)];
      t1[h1(x)] = x;
      x = temp;

      if (t2[h2(x)] == blank) {
        t2[h2(x)] = x;
        return;
      }

      // swap x and t2[h2(x)]
      temp = t2[h2(x)];
      t2[h2(x)] = x;
      x = temp;
    }
    rehash();
    insert(x);
  }
Return true if and only if the value x is present in the set.
ql/src/java/org/apache/hadoop/hive/ql/exec/vector/expressions/CuckooSetLong.java