# HG changeset patch
# User shade
# Date 1493231723 -7200
# Node ID f321fbdd1093ce2cbdd6d23ff04d65fb1b19f207
# Parent  95129eeb5f7a3336f406d64009c9cf7ade07227d
Sequence.

diff -r 95129eeb5f7a -r f321fbdd1093 src/main/java/org/openjdk/gcbench/tests/Sequence.java
--- a/src/main/java/org/openjdk/gcbench/tests/Sequence.java	Wed Mar 15 22:00:03 2017 +0100
+++ b/src/main/java/org/openjdk/gcbench/tests/Sequence.java	Wed Apr 26 20:35:23 2017 +0200
@@ -24,6 +24,30 @@
         return new Sequence("[" + min + ", " + max + "], power-of-ten steps, last step divided in 5 parts", vs);
     }
 
+    public static Sequence powersOfTen_Sub10(int min, int max) {
+        List<Object> vs = new ArrayList<>();
+        for (int v = min; v <= max; v *= 10) {
+            for (int t = 1; t < 10; t++) {
+                int n = v * t;
+                if (n <= max) {
+                    vs.add(n);
+                }
+            }
+        }
+        return new Sequence("[" + min + ", " + max + "], power-of-ten steps, last step divided in 10 parts", vs);
+    }
+
+    public static Sequence equidistantLog(int min, int max, int steps) {
+        List<Object> vs = new ArrayList<>();
+        double minLog = Math.log(min);
+        double maxLog = Math.log(max);
+        for (int c = 0; c <= steps; c++) {
+            double v = minLog + (maxLog - minLog) * c / steps;
+            vs.add((int)Math.exp(v));
+        }
+        return new Sequence("[" + min + ", " + max + "], equidistant, " + steps + " steps", vs);
+    }
+
     public static Sequence powersOfTen(int min, int max) {
         List<Object> vs = new ArrayList<>();
         for (int v = min; v <= max; v *= 10) {