/***************************************************************************** * su4sml --- a SML repository for managing (Secure)UML/OCL models * http://projects.brucker.ch/su4sml/ * * IntArrayStore.java --- * This file is part of su4sml. * * Copyright (c) 2005-2007, ETH Zurich, Switzerland * * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are * met: * * * Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * * * Redistributions in binary form must reproduce the above * copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided * with the distribution. * * * Neither the name of the copyright holders nor the names of its * contributors may be used to endorse or promote products derived * from this software without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. ******************************************************************************/ /* $Id$ */ package ch.ethz.infsec.jtestdataaccessor.examples; public class IntArrayStore { private int[] array; public IntArrayStore(int[] array) { this.array = array; } /** * Use bubblesort to sort an int[]. Taken from * http://de.wikipedia.org/wiki/Bubblesort. * * @param array * to sort * @return the sorted array. */ public int[] getSorted() { boolean sorted = true; do { sorted = true; for (int i = 1; i < array.length; i++) { if (array[i - 1] > array[i]) { swap(i - 1, i); sorted = false; } } } while (!sorted); return array; } /** * Use bubblesort to "wrongly" sort an int[]. * * @param array * to sort * @return the sorted array. * @throws Exception */ public int[] getInvalidSorted() throws Exception { boolean sorted = true; do { sorted = true; for (int i = 1; i < array.length; i++) { if (array[i - 1] < array[i]) { swap(i - 1, i); sorted = false; } } } while (!sorted); return array; } /** * Swap two elements of the array. * * @param i * the first element. * @param j * the second element. */ private void swap(int i, int j) { final int tmp = array[i]; array[i] = array[j]; array[j] = tmp; } }