X-Git-Url: https://gerrit.simantics.org/r/gitweb?p=simantics%2Fplatform.git;a=blobdiff_plain;f=bundles%2Forg.simantics.scl.runtime%2Ftests%2Forg%2Fsimantics%2Fscl%2Fruntime%2Ftests%2FTestCHRHashIndex.java;fp=bundles%2Forg.simantics.scl.runtime%2Ftests%2Forg%2Fsimantics%2Fscl%2Fruntime%2Ftests%2FTestCHRHashIndex.java;h=87c71945c61d31ab39f51e5a803b8d4481a0d3d8;hp=0000000000000000000000000000000000000000;hb=a8758de5bc19e5adb3f618d3038743a164f09912;hpb=12d9af17384d960b75d58c3935d2b7b46d93e87b

diff --git a/bundles/org.simantics.scl.runtime/tests/org/simantics/scl/runtime/tests/TestCHRHashIndex.java b/bundles/org.simantics.scl.runtime/tests/org/simantics/scl/runtime/tests/TestCHRHashIndex.java
new file mode 100644
index 000000000..87c71945c
--- /dev/null
+++ b/bundles/org.simantics.scl.runtime/tests/org/simantics/scl/runtime/tests/TestCHRHashIndex.java
@@ -0,0 +1,163 @@
+package org.simantics.scl.runtime.tests;
+
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.LinkedHashSet;
+import java.util.List;
+import java.util.Random;
+
+import org.junit.Assert;
+import org.junit.Before;
+import org.junit.Test;
+import org.simantics.scl.runtime.chr.CHRHashIndex;
+
+import gnu.trove.map.hash.TIntObjectHashMap;
+import gnu.trove.set.hash.THashSet;
+import gnu.trove.set.hash.TIntHashSet;
+
+public class TestCHRHashIndex {
+    
+    Random random;
+    Store store;
+    Store2 store2;
+    THashSet<Fact> aliveFacts = new THashSet<Fact>(); 
+    
+    public static class Store {
+        CHRHashIndex bfIndex = new CHRHashIndex() {
+            @Override
+            protected boolean keyEquals(Object a, Object b) {
+                return ((Fact)a).a == ((Fact)b).a;
+            }
+            @Override
+            protected int keyHashCode(Object key) {
+                return ((Fact)key).a;
+            }
+        };
+    }
+    
+    public static class Store2 {
+        TIntObjectHashMap<LinkedHashSet<Fact>> bfIndex = new TIntObjectHashMap<LinkedHashSet<Fact>>(); 
+    }
+    
+    public static class Fact {
+        public int a; // key
+        public int b;
+        public Fact bfPrev;
+        public Fact bfNext;
+        
+        public Fact(int a, int b) {
+            this.a = a;
+            this.b = b;
+        }
+        
+        public void add(Store store) {
+            bfNext = (Fact)store.bfIndex.addFreshAndReturnOld(this);
+            if(bfNext != null)
+                bfNext.bfPrev = this;
+        }
+        
+        public void remove(Store store) {
+            if(bfPrev == null) {
+                if(bfNext == null)
+                    store.bfIndex.removeKnownToExistKey(this);
+                else {
+                    bfNext.bfPrev = null;
+                    store.bfIndex.replaceKnownToExistKey(this, bfNext);
+                }
+            }
+            else {
+                bfPrev.bfNext = bfNext;
+                if(bfNext != null)
+                    bfNext.bfPrev = bfPrev;
+            }
+        }
+        
+        public List<Fact> get(Store store) {
+            Object r = store.bfIndex.getEqual(this);
+            if(r == null)
+                return Collections.emptyList();
+            else {
+                ArrayList<Fact> result = new ArrayList<Fact>(); 
+                for(Fact cur=(Fact)r;cur!=null;cur=cur.bfNext)
+                    result.add(cur);
+                Collections.reverse(result);
+                return result;
+            }
+        }
+        
+        public void add(Store2 store) {
+            LinkedHashSet<Fact> set = store.bfIndex.get(a);
+            if(set == null) {
+                set = new LinkedHashSet<>();
+                store.bfIndex.put(a, set);
+            }
+            set.add(this);
+        }
+        
+        public void remove(Store2 store) {
+            store.bfIndex.get(a).remove(this);
+        }
+        
+        public List<Fact> get(Store2 store) {
+            LinkedHashSet<Fact> set = store.bfIndex.get(a);
+            if(set == null)
+                return Collections.emptyList();
+            else
+                return new ArrayList<Fact>(set);
+        }
+    }
+    
+    @Before
+    public void init() {
+        random = new Random(123L);
+        store = new Store();
+        store2 = new Store2();
+    }
+    
+    public Fact createFact(int maxA, int maxB) {
+        return new Fact(random.nextInt(maxA), random.nextInt(maxB));
+    }
+    
+    public void add(Fact fact) {
+        fact.add(store);
+        fact.add(store2);
+        aliveFacts.add(fact);
+    }
+    
+    public void remove(Fact fact) {
+        fact.remove(store);
+        fact.remove(store2);
+        aliveFacts.remove(fact);
+    }
+    
+    public void checkConsistency() {
+        TIntHashSet keys = new TIntHashSet();
+        for(Fact fact : aliveFacts)
+            keys.add(fact.a);
+        Fact temp = new Fact(0, 0);
+        for(int a : keys.toArray()) {
+            temp.a = a;
+            Assert.assertEquals(temp.get(store2), temp.get(store));
+        }
+        TIntHashSet keys2 = new TIntHashSet();
+        for(Fact fact : store.bfIndex.toArray(new Fact[keys.size()]))
+            keys2.add(fact.a);
+        Assert.assertEquals(keys, keys2);
+    }
+    
+    @Test
+    public void testStore() {
+        for(int i=0;;++i) {
+            System.out.println("Run " + i);
+            for(int j=0;j<1000000;++j)
+                add(createFact(10000, 1000000));
+            checkConsistency();
+            ArrayList<Fact> factArray = new ArrayList<Fact>(aliveFacts);
+            Collections.shuffle(factArray, random);
+            for(Fact fact : factArray.subList(100000, factArray.size()))
+                remove(fact);
+            checkConsistency();
+        }
+    }
+    
+}