1 /**
2 * Copyright (c) 2012, University of Konstanz, Distributed Systems Group
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are met:
7 * * Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * * Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 * * Neither the name of the University of Konstanz nor the
13 * names of its contributors may be used to endorse or promote products
14 * derived from this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
17 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
18 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
19 * DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
20 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
21 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
22 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
23 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
24 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
25 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
26 */
27 package org.perfidix.element;
28
29 import java.util.Collections;
30 import java.util.LinkedList;
31 import java.util.List;
32 import java.util.Random;
33
34 /**
35 * This class represents a shuffle random arrangement of elements. All elements
36 * are shuffled and executed in a complete random order.
37 *
38 * @author Sebastian Graf, University of Konstanz
39 */
40 public final class ShuffleMethodArrangement extends AbstractMethodArrangement {
41
42 /** Seed for the random arrangement of the elements. */
43 private static final long SEED = 1L;
44
45 /**
46 * Constructor for shuffle arrangement. That means that the order which is
47 * given as an input is shuffled in a random way and given back as the
48 * output. The order is complete randomlike and depends on a seed.
49 *
50 * @param elements
51 * with benchmarkable elements.
52 */
53 protected ShuffleMethodArrangement(final List<BenchmarkElement> elements) {
54 super(elements);
55 }
56
57 /** {@inheritDoc} */
58 @Override
59 protected List<BenchmarkElement> arrangeList(final List<BenchmarkElement> methods) {
60 final Random ran = new Random(SEED);
61 final List<BenchmarkElement> inputList = new LinkedList<BenchmarkElement>();
62 inputList.addAll(methods);
63 Collections.shuffle(inputList, ran);
64 return inputList;
65 }
66 }