Mercurial > hg > Members > kono > jpf-core
view src/main/gov/nasa/jpf/vm/choice/RandomOrderIntCG.java @ 0:61d41facf527
initial v8 import (history reset)
author | Peter Mehlitz <Peter.C.Mehlitz@nasa.gov> |
---|---|
date | Fri, 23 Jan 2015 10:14:01 -0800 |
parents | |
children | fdc263e5806b |
line wrap: on
line source
/* * Copyright (C) 2014, United States Government, as represented by the * Administrator of the National Aeronautics and Space Administration. * All rights reserved. * * The Java Pathfinder core (jpf-core) platform is 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 gov.nasa.jpf.vm.choice; import gov.nasa.jpf.vm.ChoiceGeneratorBase; import gov.nasa.jpf.vm.IntChoiceGenerator; /** * a generic IntChoiceGenerator randomizer. Not very efficient for large int intervals */ public class RandomOrderIntCG extends ChoiceGeneratorBase<Integer> implements IntChoiceGenerator { protected int[] choices; protected int nextIdx; public RandomOrderIntCG(IntChoiceGenerator sub) { super(sub.getId()); setPreviousChoiceGenerator(sub.getPreviousChoiceGenerator()); choices = new int[sub.getTotalNumberOfChoices()]; for (int i = 0; i < choices.length; i++) { sub.advance(); choices[i] = sub.getNextChoice(); } for (int i = choices.length - 1; i > 0; i--) { // all but first int j = random.nextInt(i + 1); int tmp = choices[i]; choices[i] = choices[j]; choices[j] = tmp; } nextIdx = -1; } @Override public Integer getNextChoice() { return new Integer(choices[nextIdx]); } @Override public void advance() { if (nextIdx + 1 < choices.length) nextIdx++; } @Override public int getProcessedNumberOfChoices() { return nextIdx+1; } @Override public int getTotalNumberOfChoices() { return choices.length; } @Override public boolean hasMoreChoices() { return !isDone && (nextIdx + 1 < choices.length); } @Override public void reset() { nextIdx = -1; isDone = false; } @Override public Class<Integer> getChoiceType() { return Integer.class; } }