NOTUNIQUE_HASH: a record whose key changes away and back in one transaction stays under that key after a later delete or update; SELECT ... WHERE k = 1 returns a record with k = 2 #10269

// Small fixed scenarios on an index of the given type on T.k: committed records first, then ONE transaction, then the index
// (get per key) and SQL (count per key) held against the records after commit.   java HashMin.java <dir> <NOTUNIQUE_HASH|NOTUNIQUE|UNIQUE_HASH>
import com.arcadedb.database.*;
import com.arcadedb.index.*;
import java.util.*;
import java.util.function.*;

public class HashMin {
  static Database db; static String TYPE;
  public static void main(String[] a) throws Exception {
    TYPE = a[1]; DatabaseFactory f = new DatabaseFactory(a[0]); if (f.exists()) f.open().drop(); db = f.create();
    run("S1 X(k=1); delete X", new int[] { 1 }, r -> r.get(0).asDocument().delete());
    run("S2 X(k=1); update X 1 -> 2", new int[] { 1 }, r -> set(r.get(0), 2));
    run("S3 X(k=1), Y(k=1); delete X", new int[] { 1, 1 }, r -> r.get(0).asDocument().delete());
    run("S4 X(k=1); delete X, insert Z(k=1)", new int[] { 1 }, r -> { r.get(0).asDocument().delete(); ins(1); });
    run("S5 X(k=0); insert A(k=4), insert B(k=4), update X 0 -> 4", new int[] { 0 }, r -> { ins(4); ins(4); set(r.get(0), 4); });
    run("S6 X(k=0); update X 0 -> 4", new int[] { 0 }, r -> set(r.get(0), 4));
    run("S7 X(k=0), Y(k=4); update X 0 -> 4", new int[] { 0, 4 }, r -> set(r.get(0), 4));
    run("S8 X(k=1), W(k=1); delete X, insert A(k=6), update W 1 -> 3, insert B(k=1), delete A", new int[] { 1, 1 },
        r -> { r.get(0).asDocument().delete(); RID x = ins(6); set(r.get(1), 3); ins(1); x.asDocument().delete(); });
    run("S9 X(k=1), W(k=1); delete X, update W 1 -> 3, insert B(k=1)", new int[] { 1, 1 }, r -> { r.get(0).asDocument().delete(); set(r.get(1), 3); ins(1); });
    run("S10 X(k=1), W(k=1); delete X, update W 1 -> 3", new int[] { 1, 1 }, r -> { r.get(0).asDocument().delete(); set(r.get(1), 3); });
    run2("S11 X(k=1); tx1: update X 1 -> 4, update X 4 -> 1", new int[] { 1 }, r -> { set(r.get(0), 4); set(r.get(0), 1); }, null);
    run2("S12 X(k=1); tx1: update X 1 -> 4, update X 4 -> 1; tx2: delete X", new int[] { 1 }, r -> { set(r.get(0), 4); set(r.get(0), 1); }, r -> r.get(0).asDocument().delete());
    run2("S13 X(k=1); tx1: update X 1 -> 4, update X 4 -> 1; tx2: update X 1 -> 2", new int[] { 1 }, r -> { set(r.get(0), 4); set(r.get(0), 1); }, r -> set(r.get(0), 2));
    db.close();
  }
  static void run2(String label, int[] committed, Consumer<List<RID>> tx1, Consumer<List<RID>> tx2) {
    run(label, committed, r -> { tx1.accept(r); if (tx2 != null) { db.commit(); db.begin(); tx2.accept(r); } });
  }
  static RID ins(int k) { MutableDocument d = db.newDocument("T"); d.set("k", k); d.save(); return d.getIdentity(); }
  static void set(RID r, int k) { r.asDocument().modify().set("k", k).save(); }
  static void run(String label, int[] committed, Consumer<List<RID>> tx) {
    if (db.getSchema().existsType("T")) db.getSchema().dropType("T");
    db.command("sql", "CREATE DOCUMENT TYPE T").close(); db.command("sql", "CREATE PROPERTY T.k INTEGER").close(); db.command("sql", "CREATE INDEX ON T (k) " + TYPE).close();
    List<RID> rs = new ArrayList<>();
    try { db.transaction(() -> { for (int k : committed) rs.add(ins(k)); }); }
    catch (Exception e) { System.out.println("RESULT " + TYPE + " " + label + " | setup refused " + e.getClass().getSimpleName() + " (the committed records break this index type) | -"); return; }
    String res; try { db.begin(); tx.accept(rs); db.commit(); res = "committed"; } catch (Exception e) { if (db.isTransactionActive()) db.rollback(); res = "refused " + e.getClass().getSimpleName(); }
    Map<Integer, Set<RID>> want = new TreeMap<>();
    for (var it = db.iterateType("T", true); it.hasNext(); ) { Document d = it.next().asDocument(); want.computeIfAbsent(((Number) d.get("k")).intValue(), x -> new TreeSet<>()).add(d.getIdentity()); }
    List<String> wrong = new ArrayList<>(); Index idx = db.getSchema().getIndexByName("T[k]");
    for (int k = 0; k <= 6; k++) {
      Set<RID> w = want.getOrDefault(k, Set.of()), got = new TreeSet<>(); int n = 0; IndexCursor c = idx.get(new Object[] { k }); while (c.hasNext()) { got.add(c.next().getIdentity()); n++; }
      long q; try (var r = db.query("sql", "SELECT count(*) AS c FROM T WHERE k = ?", k)) { q = ((Number) r.next().getProperty("c")).longValue(); }
      if (!got.equals(w) || n != w.size() || q != w.size()) {
        List<Object> vals = new ArrayList<>(); try (var r = db.query("sql", "SELECT k FROM T WHERE k = ?", k)) { while (r.hasNext()) vals.add(r.next().getProperty("k")); }
        wrong.add("k=" + k + ": records " + w + ", index get " + got + " (" + n + " entries), SQL count " + q + ", SELECT k FROM T WHERE k = " + k + " -> " + vals);
      }
    }
    System.out.println("RESULT " + TYPE + " " + label + " | " + res + " | " + (wrong.isEmpty() ? "ok" : "WRONG " + String.join("; ", wrong)));
  }
}