X-Git-Url: https://gerrit.simantics.org/r/gitweb?p=simantics%2Fplatform.git;a=blobdiff_plain;f=bundles%2Forg.simantics.utils.datastructures%2Fsrc%2Forg%2Fsimantics%2Futils%2Fdatastructures%2Fslice%2FSliceUtil.java;h=986656a9cf38afe78b95a9be762d8cf732211ffd;hp=5a209f5ddc40a0124f8f4ee19e8033f8dea4e6d7;hb=refs%2Fchanges%2F38%2F238%2F2;hpb=24e2b34260f219f0d1644ca7a138894980e25b14

diff --git a/bundles/org.simantics.utils.datastructures/src/org/simantics/utils/datastructures/slice/SliceUtil.java b/bundles/org.simantics.utils.datastructures/src/org/simantics/utils/datastructures/slice/SliceUtil.java
index 5a209f5dd..986656a9c 100644
--- a/bundles/org.simantics.utils.datastructures/src/org/simantics/utils/datastructures/slice/SliceUtil.java
+++ b/bundles/org.simantics.utils.datastructures/src/org/simantics/utils/datastructures/slice/SliceUtil.java
@@ -1,97 +1,97 @@
-package org.simantics.utils.datastructures.slice;
-
-import java.util.ArrayList;
-import java.util.Collection;
-import java.util.Collections;
-
-/**
- * @author Tuukka Lehtonen
- */
-public final class SliceUtil {
-
-    public static final int MAX_NODES_PER_LEVEL_EXP = 2;
-
-    /**
-     * @param <T>
-     * @param prop
-     * @return
-     */
-    public static <T extends Sliceable<T>> Collection<T> subnodify(Sliceable<T> prop) {
-        return subnodify(prop, prop.getRange());
-    }
-
-    /**
-     * @param <T>
-     * @param prop
-     * @param range
-     * @return
-     */
-    public static <T extends Sliceable<T>> Collection<T> subnodify(Sliceable<T> prop, ValueRange range) {
-        return subnodify(prop, range.start(), range.size(), MAX_NODES_PER_LEVEL_EXP);
-    }
-
-    /**
-     * @param <T>
-     * @param prop
-     * @param rangeStart
-     * @param rangeSize
-     * @return
-     */
-    public static <T extends Sliceable<T>> Collection<T> subnodify(Sliceable<T> prop, int rangeStart, int rangeSize) {
-        return subnodify(prop, rangeStart, rangeSize, MAX_NODES_PER_LEVEL_EXP);
-    }
-
-    /**
-     * @param <T>
-     * @param p
-     * @param rangeStart
-     * @param rangeSize
-     * @param pow10OfItemsPerLevel
-     * @return
-     */
-    public static <T> Collection<T> subnodify(Object p, int rangeStart, int rangeSize, int pow10OfItemsPerLevel) {
-        if (rangeSize < 2)
-            return Collections.emptyList();
-        if (!(p instanceof Sliceable<?>))
-            return Collections.emptyList();
-
-        @SuppressWarnings("unchecked")
-        Sliceable<T> prop = (Sliceable<T>) p;
-
-        // Defaults for <= 100 nodes
-        int nodes = rangeSize;
-        int intervalSize = 1;
-
-        int maxNodesPerLevel = (int) Math.pow(10, pow10OfItemsPerLevel);
-
-        if (rangeSize > maxNodesPerLevel) {
-            double intervalSizeExp = Math.floor(Math.log10(rangeSize));
-            double intervalMaxSize = Math.pow(10, intervalSizeExp);
-            //System.out.println("EXP: " + intervalSizeExp + " => " + intervalMaxSize);
-            if ((int) intervalMaxSize == rangeSize) {
-                // Need to make the amount of shown children smaller.
-                // As a minimum, always leave at least MAX_NODES_PER_LEVEL
-                // elements into the leaf nodes.
-                intervalMaxSize = Math.pow(10, Math.max(intervalSizeExp - pow10OfItemsPerLevel, pow10OfItemsPerLevel));
-                //System.out.println("EXP2: " + intervalMaxSize);
-            }
-            nodes = (int) (Math.ceil(rangeSize / intervalMaxSize));
-            intervalSize = (int) intervalMaxSize;
-        }
-
-        int start = rangeStart;
-        int sizeLeft = rangeSize;
-
-        //System.out.println("SUBNODIFY: " + rangeStart + ", " + rangeSize + " => " + intervalSize + ", " + nodes);
-
-        ArrayList<T> result = new ArrayList<T>(nodes);
-        for (int i = 0; i < nodes; ++i) {
-            result.add(prop.slice(ValueRange.make(start, Math.min(intervalSize, sizeLeft))));
-            //System.out.println(result.get(result.size()-1));
-            start += intervalSize;
-            sizeLeft -= intervalSize;
-        }
-        return result;
-    }
-
-}
+package org.simantics.utils.datastructures.slice;
+
+import java.util.ArrayList;
+import java.util.Collection;
+import java.util.Collections;
+
+/**
+ * @author Tuukka Lehtonen
+ */
+public final class SliceUtil {
+
+    public static final int MAX_NODES_PER_LEVEL_EXP = 2;
+
+    /**
+     * @param <T>
+     * @param prop
+     * @return
+     */
+    public static <T extends Sliceable<T>> Collection<T> subnodify(Sliceable<T> prop) {
+        return subnodify(prop, prop.getRange());
+    }
+
+    /**
+     * @param <T>
+     * @param prop
+     * @param range
+     * @return
+     */
+    public static <T extends Sliceable<T>> Collection<T> subnodify(Sliceable<T> prop, ValueRange range) {
+        return subnodify(prop, range.start(), range.size(), MAX_NODES_PER_LEVEL_EXP);
+    }
+
+    /**
+     * @param <T>
+     * @param prop
+     * @param rangeStart
+     * @param rangeSize
+     * @return
+     */
+    public static <T extends Sliceable<T>> Collection<T> subnodify(Sliceable<T> prop, int rangeStart, int rangeSize) {
+        return subnodify(prop, rangeStart, rangeSize, MAX_NODES_PER_LEVEL_EXP);
+    }
+
+    /**
+     * @param <T>
+     * @param p
+     * @param rangeStart
+     * @param rangeSize
+     * @param pow10OfItemsPerLevel
+     * @return
+     */
+    public static <T> Collection<T> subnodify(Object p, int rangeStart, int rangeSize, int pow10OfItemsPerLevel) {
+        if (rangeSize < 2)
+            return Collections.emptyList();
+        if (!(p instanceof Sliceable<?>))
+            return Collections.emptyList();
+
+        @SuppressWarnings("unchecked")
+        Sliceable<T> prop = (Sliceable<T>) p;
+
+        // Defaults for <= 100 nodes
+        int nodes = rangeSize;
+        int intervalSize = 1;
+
+        int maxNodesPerLevel = (int) Math.pow(10, pow10OfItemsPerLevel);
+
+        if (rangeSize > maxNodesPerLevel) {
+            double intervalSizeExp = Math.floor(Math.log10(rangeSize));
+            double intervalMaxSize = Math.pow(10, intervalSizeExp);
+            //System.out.println("EXP: " + intervalSizeExp + " => " + intervalMaxSize);
+            if ((int) intervalMaxSize == rangeSize) {
+                // Need to make the amount of shown children smaller.
+                // As a minimum, always leave at least MAX_NODES_PER_LEVEL
+                // elements into the leaf nodes.
+                intervalMaxSize = Math.pow(10, Math.max(intervalSizeExp - pow10OfItemsPerLevel, pow10OfItemsPerLevel));
+                //System.out.println("EXP2: " + intervalMaxSize);
+            }
+            nodes = (int) (Math.ceil(rangeSize / intervalMaxSize));
+            intervalSize = (int) intervalMaxSize;
+        }
+
+        int start = rangeStart;
+        int sizeLeft = rangeSize;
+
+        //System.out.println("SUBNODIFY: " + rangeStart + ", " + rangeSize + " => " + intervalSize + ", " + nodes);
+
+        ArrayList<T> result = new ArrayList<T>(nodes);
+        for (int i = 0; i < nodes; ++i) {
+            result.add(prop.slice(ValueRange.make(start, Math.min(intervalSize, sizeLeft))));
+            //System.out.println(result.get(result.size()-1));
+            start += intervalSize;
+            sizeLeft -= intervalSize;
+        }
+        return result;
+    }
+
+}