Examples of aima.core.util.math.MixedRadixNumber.increment()

Class aima.core.util.math.MixedRadixNumber

Examples of aima.core.util.math.MixedRadixNumber.increment()

aima.core.util.math.MixedRadixNumber.increment()
Increments the value of the mixed radix number, if the value is less than the maximum value which can be represented by the current array of radices. @return true if the increment was successful.

            .getDomainValueAt(mrn.getCurrentNumeralValue(rvInfo
                .getRadixIdx())));
      }
      pti.iterate(possibleWorld, values[mrn.intValue()]);


    } while (mrn.increment());
  }


  /**
   * Iterate over all possible values assignments for the Random Variables
   * comprising this ProbabilityTable that are not in the fixed set of values.

View Full Code Here

              .getRadixIdx()] = freeRVI.getIdxForDomain(fval);
        }
        pti.iterate(possibleWorld, values[(int) tableMRN
            .getCurrentValueFor(tableRadixValues)]);


      } while (freeMRN.increment());
    }
  }


  public ProbabilityTable divideBy(ProbabilityTable divisor) {
    if (!randomVarInfo.keySet().containsAll(divisor.randomVarInfo.keySet())) {

View Full Code Here

            .getDomainValueAt(mrn.getCurrentNumeralValue(rvInfo
                .getRadixIdx())));
      }
      pti.iterate(possibleWorld, values[mrn.intValue()]);


    } while (mrn.increment());
  }


  /**
   * Iterate over all possible values assignments for the Random Variables
   * comprising this ProbabilityTable that are not in the fixed set of values.

View Full Code Here

              .getRadixIdx()] = freeRVI.getIdxForDomain(fval);
        }
        pti.iterate(possibleWorld, values[(int) tableMRN
            .getCurrentValueFor(tableRadixValues)]);


      } while (freeMRN.increment());
    }
  }


  public ProbabilityTable divideBy(ProbabilityTable divisor) {
    if (!randomVarInfo.keySet().containsAll(divisor.randomVarInfo.keySet())) {

View Full Code Here


  @Test
  public void testIncrement() {
    MixedRadixNumber mrn = new MixedRadixNumber(0, new int[] { 3, 2 });
    int i = 0;
    while (mrn.increment()) {
      i++;
    }
    Assert.assertEquals(i, mrn.getMaxAllowedValue());
  }

View Full Code Here

    while (mrn.decrement()) {
      i++;
    }
    Assert.assertEquals(i, mrn.getMaxAllowedValue());
    i = 0;
    while (mrn.increment()) {
      i++;
    }
    while (mrn.decrement()) {
      i--;
    }

View Full Code Here


      // If there is more than 1 mapping
      // keep track of where I am in the
      // possible number of mapping permutations.
      if (null != permutation) {
        permutation.increment();
      }
    }


    return subsumes;
  }

View Full Code Here

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.