F2wCycleBasedPolyLCG.java

/*
 * Class:        F2wCycleBasedPolyLCG
 * Description:  point set based upon a linear congruential sequence in a
                 finite field
 * Environment:  Java
 * Software:     SSJ 
 * Copyright (C) 2001  Pierre L'Ecuyer and Universite de Montreal
 * Organization: DIRO, Universite de Montreal
 * @author       
 * @since
 *
 *
 * 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 umontreal.ssj.hups;
 
import umontreal.ssj.util.PrintfFormat;
import umontreal.ssj.rng.*;
import cern.colt.list.*;

public class F2wCycleBasedPolyLCG extends CycleBasedPointSetBase2 {
 
   private F2wStructure param;

   public F2wCycleBasedPolyLCG(int w, int r, int modQ, int step, int nbcoeff, int coeff[], int nocoeff[])
   {
      param = new F2wStructure(w, r, modQ, step, nbcoeff, coeff, nocoeff);
      numBits = param.numBits;
      normFactor = param.normFactor;
      EpsilonHalf = param.EpsilonHalf;
      fillCyclesPolyLCG();
   }

   public F2wCycleBasedPolyLCG(String filename, int no) {
      param = new F2wStructure(filename, no);
      numBits = param.numBits;
      normFactor = param.normFactor;
      fillCyclesPolyLCG();
   }
 
   public String toString() {
      String s = "F2wCycleBasedPolyLCG:" + PrintfFormat.NEWLINE;
      return s + param.toString();
   }
 
   private void fillCyclesPolyLCG() {
      int n = 1 << param.getLog2N();
      int i;
      int mask1 = (1 << (31 - param.r * param.w)) - 1;
      int mask2 = ~mask1;
      RandomStream random = new MRG32k3a();
      IntArrayList c; // Array used to store the current cycle.
      int currentState; // The state currently visited.
 
      boolean stateVisited[] = new boolean[n];
      // Indicates which states have been visited so far.
      for (i = 0; i < n; i++)
         stateVisited[i] = false;
      int startState = 0; // First state of the cycle currently considered.
      numPoints = 0;
      while (startState < n) {
         stateVisited[startState] = true;
         c = new IntArrayList();
         param.state = startState << param.S;
         c.add(param.state);
         // c.add ((state & mask2) | (mask1 &
         // (random.nextInt(0,2147483647))));
         param.output = param.F2wPolyLCG();
         // Warning: watch for overflow !!!
         while (param.state != (startState << param.S)) {
            stateVisited[param.state >> param.S] = true;
            // c.add ((param.state&mask2) | (mask1 &
            // (random.nextInt(0,2147483647))));
            c.add(param.state);
            param.output = param.F2wPolyLCG();
         }
         addCycle(c);
         for (i = startState + 1; i < n; i++)
            if (stateVisited[i] == false)
               break;
         startState = i;
      }
   }
}