/*
  Copyright (C) 2007 Andre Seidelt, All Rights Reserved.

  This software is provided 'as-is', without any express or implied warranty.
  In no event will the authors be held liable for any damages arising from the
  use of this software.

  Permission is granted to anyone to use this software for any purpose,
  including commercial applications, and to alter it and redistribute it
  freely, subject to the following restrictions:

  1. The origin of this software must not be misrepresented; you must not
     claim that you wrote the original software. If you use this software in
     a product, an acknowledgment in the product documentation would be
     appreciated but is not required.

  2. Altered source versions must be plainly marked as such, and must not be
     misrepresented as being the original software.

  3. This notice may not be removed or altered from any source distribution.
*/
/*
* a single genetic sequence, one possibility out of a choice.
*/
class SetSequence {
  // possible choices
  private int[] mPossibleValues;  
  // the current value
  private int mValue;

  // .ctor()
  public SetSequence(int[] pPossibleValues) {
    mPossibleValues = pPossibleValues;

    mValue = mPossibleValues[int(random(0, mPossibleValues.length))];
  }

  // reproduce sequence, mutates with given posibility
  public SetSequence reproduce(MutationCount pCnt, int pMutationRate) {
    if(int(random(0, 100) % (100-pMutationRate)) == 0) {
      sStat.mMutations++;
      pCnt.count++;
      return new SetSequence(mPossibleValues);
    } 
    else {
      return this;
    }
  }
}

/*
* a single genetic sequence, one possibility out of a range.
*/
class RangeSequence {
  // minimal value
  private int mMinValue;
  // maximal value
  private int mMaxValue;
  // the current value
  private int mValue;

  // .ctor()
  public RangeSequence(int pMin, int pMax) {
    mMinValue = pMin;
    mMaxValue = pMax;

    mValue = int(random(mMinValue, mMaxValue));
  }

  // reproduce sequence, mutates with given posibility
  public RangeSequence reproduce(MutationCount pCnt, int pMutationRate) {
    if(int(random(0, 100) % (100-pMutationRate)) == 0) {
      sStat.mMutations++;
      pCnt.count++;
      return new RangeSequence(mMinValue, mMaxValue);
    } 
    else {
      return this;
    }
  }
}