X-Git-Url: https://gerrit.simantics.org/r/gitweb?a=blobdiff_plain;f=tests%2Forg.simantics.db.tests%2Fsrc%2Forg%2Fsimantics%2Fdb%2Ftests%2Fregression%2Fbugs%2FIssue3420Test2.java;fp=tests%2Forg.simantics.db.tests%2Fsrc%2Forg%2Fsimantics%2Fdb%2Ftests%2Fregression%2Fbugs%2FIssue3420Test2.java;h=350fbde2a092990d58deb8e9fd075961533d892e;hb=67fd62f9c742337ec80eef658192db198a0efaac;hp=0000000000000000000000000000000000000000;hpb=cde82ba81327d5515fdca362f7f4c70f5103ae80;p=simantics%2Fplatform.git

diff --git a/tests/org.simantics.db.tests/src/org/simantics/db/tests/regression/bugs/Issue3420Test2.java b/tests/org.simantics.db.tests/src/org/simantics/db/tests/regression/bugs/Issue3420Test2.java
new file mode 100644
index 000000000..350fbde2a
--- /dev/null
+++ b/tests/org.simantics.db.tests/src/org/simantics/db/tests/regression/bugs/Issue3420Test2.java
@@ -0,0 +1,157 @@
+/*******************************************************************************
+ * Copyright (c) 2007, 2010 Association for Decentralized Information Management
+ * in Industry THTH ry.
+ * All rights reserved. This program and the accompanying materials
+ * are made available under the terms of the Eclipse Public License v1.0
+ * which accompanies this distribution, and is available at
+ * http://www.eclipse.org/legal/epl-v10.html
+ *
+ * Contributors:
+ *     VTT Technical Research Centre of Finland - initial API and implementation
+ *******************************************************************************/
+package org.simantics.db.tests.regression.bugs;
+
+import java.util.HashMap;
+import java.util.Map;
+import java.util.Set;
+import java.util.TreeSet;
+import java.util.Vector;
+
+import org.junit.Test;
+import org.simantics.db.ReadGraph;
+import org.simantics.db.Resource;
+import org.simantics.db.Session;
+import org.simantics.db.WriteGraph;
+import org.simantics.db.WriteOnlyGraph;
+import org.simantics.db.common.request.ReadRequest;
+import org.simantics.db.common.request.WriteOnlyRequest;
+import org.simantics.db.common.request.WriteRequest;
+import org.simantics.db.exception.ClusterSetExistException;
+import org.simantics.db.exception.DatabaseException;
+import org.simantics.db.impl.ClusterTraitsBase;
+import org.simantics.db.service.ClusteringSupport;
+import org.simantics.db.testing.base.ExistingDatabaseTest;
+import org.simantics.layer0.Layer0;
+
+/**
+ * Tests that cluster set can be used to explicitly control clustering.
+ * Must be called more than once from runner to test that cluster set is persistent.
+ */
+public class Issue3420Test2 extends ExistingDatabaseTest {
+//    final boolean DEBUG = true;
+    final boolean VERBOSE = false;
+    final int CLUSTER_FILL_SIZE = ClusterTraitsBase.getMaxNumberOfResources();
+    final Vector<Resource> clusterSets = new Vector<Resource>();
+    final Vector<Resource> resources = new Vector<Resource>();
+    @Test
+    public void test() throws DatabaseException {
+        Session session = getSession();
+        session.syncRequest(new InitClusterSet());
+        session.syncRequest(new Init());
+        session.syncRequest(new Modi());
+        session.syncRequest(new Check());
+        session.syncRequest(new ModiWO());
+        session.syncRequest(new Check());
+    }
+    class InitClusterSet extends WriteRequest {
+        @Override
+        public void perform(WriteGraph g) throws DatabaseException {
+            Layer0 l0 = Layer0.getInstance(g);
+            String base = "http://Projects/Development%20Project";
+            String tail = "Issue3420Test2";
+            Resource pl = g.getResource(base);
+            if (DEBUG)
+                System.out.println("projects=" + pl);
+            Resource il = g.getPossibleResource(base + "/" + tail);
+            try {
+                g.newClusterSet(pl);
+                // New cluster set.
+                assertTrue("Old cluster set data lost.", null == il);
+                il = g.newResource();
+                g.claim(il, l0.InstanceOf, null, l0.Library);
+                g.claim(il, l0.PartOf, pl);
+                g.claimLiteral(il, l0.HasName, tail);
+            } catch (ClusterSetExistException e) {
+                // Old cluster set.
+                assertTrue("Missing library resource.", null != il);
+            }
+            clusterSets.setSize(2);
+            clusterSets.set(0, pl);
+            clusterSets.set(1, il);
+        }
+    }
+    class Init extends ReadRequest {
+        @Override
+        public void run(ReadGraph g) throws DatabaseException {
+            resources.clear();
+            Layer0 l0 = Layer0.getInstance(g);
+            for (Resource r : g.getObjects(clusterSets.get(1), l0.ConsistsOf)) {
+                if (DEBUG)
+                    if (VERBOSE)
+                        System.out.println("Resource " + r);
+                resources.add(r);
+            }
+            if (DEBUG)
+                System.out.println("Resource count=" + resources.size());
+        }
+    }
+    class Modi extends WriteRequest {
+        @Override
+        public void perform(WriteGraph g) throws DatabaseException {
+            for (int i=0; i<CLUSTER_FILL_SIZE * 2 + 33; ++i) {
+                Resource r = g.newResource(clusterSets.get(0));
+                g.claim(r, L0.InstanceOf, null, L0.Entity);
+                g.claim(r, L0.PartOf, clusterSets.get(1));
+                resources.add(r);
+            }
+        }
+    }
+    class ModiWO extends WriteOnlyRequest {
+        @Override
+        public void perform(WriteOnlyGraph g) throws DatabaseException {
+            for (int i=0; i<CLUSTER_FILL_SIZE * 2 + 33; ++i) {
+                Resource r = g.newResource(clusterSets.get(0));
+                g.claim(r, L0.InstanceOf, null, L0.Entity);
+                g.claim(r, L0.PartOf, L0.ConsistsOf, clusterSets.get(1));
+                resources.add(r);
+            }
+        }
+    }
+    class Check extends ReadRequest {
+        @Override
+        public void run(ReadGraph g) throws DatabaseException {
+            ClusteringSupport cs = g.getService(ClusteringSupport.class);
+            Map<Long, Integer> clusters = new HashMap<Long, Integer>();
+            for (int i=0; i<resources.size(); ++i){
+                long cluster = cs.getCluster(resources.get(i));
+                Integer count = clusters.get(cluster);
+                if (null == count)
+                    count = 0;
+                clusters.put(cluster, ++count);
+            }
+            Set<Long> sortedKeys = new TreeSet<Long>();
+            for (Map.Entry<Long, Integer> i : clusters.entrySet())
+                sortedKeys.add(i.getKey());
+            long sum = 0;
+            for (long key : sortedKeys) {
+                int count = clusters.get(key);
+                if (DEBUG)
+                    System.out.println("cluster=" + key + " count=" + count);
+                sum += count;
+            }
+            if (resources.size() != sum) {
+                String msg = "Resource count mismatch. expected=" + resources.size() + " realized=" + sum;
+                if (DEBUG)
+                    System.out.println(msg);
+                fail(msg);
+            }
+            int n = resources.size() / CLUSTER_FILL_SIZE + 1;
+            if (n < clusters.size()) {
+                String msg = "Cluster count mismatch. expected=" + n + " realized=" + clusters.size();
+                if (DEBUG)
+                    System.out.println(msg);
+                fail(msg);
+            }
+        }
+    }
+}