test/com/google/caliper/examples/SortBenchmarkSuite.java

/*
 * Copyright (C) 2009 Google Inc.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.google.caliper.examples;

import com.google.caliper.Benchmark;
import com.google.caliper.DefaultBenchmarkSuite;
import com.google.caliper.Param;
import com.google.caliper.Runner;

import java.util.Arrays;
import java.util.EnumSet;
import java.util.Random;
import java.util.Collection;

/**
 * Measures sorting on different distributions of integers.
 */
public class SortBenchmarkSuite extends DefaultBenchmarkSuite {

  @Param int length;

  static Collection<Integer> lengthValues = Arrays.asList(10, 100, 1000, 10000);

  @Param Distribution distribution;

  static Collection<Distribution> distributionValues = EnumSet.allOf(Distribution.class);

  int[] values;
  int[] copy;

  @Override protected void setUp() throws Exception {
    values = distribution.create(length);
    copy = new int[length];
  }

  class ArraysSortBenchmark extends Benchmark {
    public Object run(int trials) throws Exception {
      int result = 0;
      for (int i = 0; i < trials; i++) {
        System.arraycopy(values, 0, copy, 0, values.length);
        Arrays.sort(copy);
        result ^= copy[0];
      }
      return result;
    }
  }

  enum Distribution {
    SAWTOOTH {
      @Override
      int[] create(int length) {
        int[] result = new int[length];
        for (int i = 0; i < length; i += 5) {
          result[i] = 0;
          result[i + 1] = 1;
          result[i + 2] = 2;
          result[i + 3] = 3;
          result[i + 4] = 4;
        }
        return result;
      }
    },
    INCREASING {
      @Override
      int[] create(int length) {
        int[] result = new int[length];
        for (int i = 0; i < length; i++) {
          result[i] = i;
        }
        return result;
      }
    },
    DECREASING {
      @Override
      int[] create(int length) {
        int[] result = new int[length];
        for (int i = 0; i < length; i++) {
          result[i] = length - i;
        }
        return result;
      }
    },
    RANDOM {
      @Override
      int[] create(int length) {
        Random random = new Random();
        int[] result = new int[length];
        for (int i = 0; i < length; i++) {
          result[i] = random.nextInt();
        }
        return result;
      }
    };

    abstract int[] create(int length);
  }

  public static void main(String[] args) {
    Runner.main(SortBenchmarkSuite.class, args);
  }
}