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.LinkedList;
30 import java.util.List;
31
32 /**
33 * This class does no arrangement for methods. That means that the order of the
34 * input is given back as the order of the output as well.
35 *
36 * @author Sebastian Graf, University of Konstanz
37 */
38 public final class NoMethodArrangement extends AbstractMethodArrangement {
39
40 /**
41 * Constructor for no arrangement. That means that the order which is given
42 * as an input is also given back as the output. The order is normally the
43 * order of occurrence of methods in the class.
44 *
45 * @param elements
46 * with benchmarkable elements.
47 */
48 protected NoMethodArrangement(final List<BenchmarkElement> elements) {
49 super(elements);
50 }
51
52 /**
53 * Not arranging the list in this case. That means normally that all
54 * elements are occuring in the same order than defined in the class-file.
55 *
56 * @param elements
57 * to be arranged, or not in this case.
58 * @return the input.
59 */
60 @Override
61 protected List<BenchmarkElement> arrangeList(final List<BenchmarkElement> elements) {
62 final List<BenchmarkElement> elementList = new LinkedList<BenchmarkElement>();
63 elementList.addAll(elements);
64 return elementList;
65 }
66 }