| Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
| Config |
|
| 1.0;1 |
| 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.example; | |
| 28 | ||
| 29 | import java.util.HashSet; | |
| 30 | import java.util.Set; | |
| 31 | ||
| 32 | import org.perfidix.AbstractConfig; | |
| 33 | import org.perfidix.annotation.BenchmarkConfig; | |
| 34 | import org.perfidix.element.KindOfArrangement; | |
| 35 | import org.perfidix.meter.AbstractMeter; | |
| 36 | import org.perfidix.meter.MemMeter; | |
| 37 | import org.perfidix.meter.Memory; | |
| 38 | import org.perfidix.meter.Time; | |
| 39 | import org.perfidix.meter.TimeMeter; | |
| 40 | import org.perfidix.ouput.AbstractOutput; | |
| 41 | ||
| 42 | /** | |
| 43 | * Public class to represent the settings for this benchmark. | |
| 44 | * | |
| 45 | * @author Sebastian Graf, University of Konstanz | |
| 46 | */ | |
| 47 | @BenchmarkConfig | |
| 48 | public class Config extends AbstractConfig { | |
| 49 | ||
| 50 | private final static int RUNS = 100; | |
| 51 | 5 | private final static Set<AbstractMeter> METERS = new HashSet<AbstractMeter>(); |
| 52 | 5 | private final static Set<AbstractOutput> OUTPUT = new HashSet<AbstractOutput>(); |
| 53 | ||
| 54 | 5 | private final static KindOfArrangement ARRAN = KindOfArrangement.SequentialMethodArrangement; |
| 55 | private final static double GCPROB = 1.0d; | |
| 56 | ||
| 57 | static { | |
| 58 | 5 | METERS.add(new TimeMeter(Time.MilliSeconds)); |
| 59 | 5 | METERS.add(new MemMeter(Memory.Byte)); |
| 60 | ||
| 61 | // OUTPUT.add(new TabularSummaryOutput()); | |
| 62 | 5 | } |
| 63 | ||
| 64 | /** | |
| 65 | * Public constructor. | |
| 66 | */ | |
| 67 | public Config() { | |
| 68 | 15 | super(RUNS, METERS, OUTPUT, ARRAN, GCPROB); |
| 69 | ||
| 70 | 15 | } |
| 71 | ||
| 72 | } |