List of nextLong() Examples

Examples of nextLong()

com.fasterxml.storemate.store.util.BytesToStuff.nextLong()
freenet.crypt.DummyRandomSource.nextLong()
it.unimi.dsi.fastutil.longs.LongBidirectionalIterator.nextLong()
it.unimi.dsi.fastutil.longs.LongIterator.nextLong()
it.unimi.dsi.fastutil.longs.LongListIterator.nextLong()
java.security.SecureRandom.nextLong()
java.util.Random.nextLong()
Returns the next pseudorandom, uniformly distributed {@code long}value from this random number generator's sequence. The general contract of {@code nextLong} is that one {@code long} value ispseudorandomly generated and returned.
The method {@code nextLong} is implemented by class {@code Random}as if by:
```
  {@code}public long nextLong()  return ((long)next(32) << 32) + next(32); }}
```
Because class {@code Random} uses a seed with only 48 bits,this algorithm will not return all possible {@code long} values. @return the next pseudorandom, uniformly distributed {@code long}value from this random number generator's sequence
java.util.Scanner.nextLong()
Scans the next token of the input as a long.
An invocation of this method of the form nextLong() behaves in exactly the same way as the invocation nextLong(radix), where radix is the default radix of this scanner. @return the long scanned from the input @throws InputMismatchException if the next token does not match the Integer regular expression, or is out of range @throws NoSuchElementException if input is exhausted @throws IllegalStateException if this scanner is closed
jmt.engine.random.engine.MersenneTwister.nextLong()
Returns a 32 bit uniformly distributed random number in the closed interval [0,4294967295] (including 0 and 4294967295)
org.apache.commons.math.random.RandomData.nextLong()
Generates a uniformly distributed random long integer between lower and upper (endpoints included).
The generated long integer values will be random, but not cryptographically secure. To generate cryptographically secure sequences of longs, use nextSecureLong

Preconditions:
- lower < upper (otherwise an IllegalArgumentException is thrown.)
@param lower lower bound for generated integer @param upper upper bound for generated integer @return a random integer greater than or equal to lowerand less than or equal to upper.
org.apache.commons.math.random.RandomDataImpl.nextLong()
Generate a random long value uniformly distributed between lower and upper, inclusive. @param lower the lower bound. @param upper the upper bound. @return the random integer. @throws NumberIsTooLargeException if {@code lower >= upper}.
org.apache.commons.math3.random.MersenneTwister.nextLong()
Returns the next pseudorandom, uniformly distributed long value from this random number generator's sequence. All 2⁶⁴ possible {@code long} valuesshould be produced with (approximately) equal probability. @return the next pseudorandom, uniformly distributed longvalue from this random number generator's sequence
org.apache.commons.math3.random.RandomGenerator.nextLong()
Returns the next pseudorandom, uniformly distributed long value from this random number generator's sequence. All 2⁶⁴ possible {@code long} valuesshould be produced with (approximately) equal probability. @return the next pseudorandom, uniformly distributed longvalue from this random number generator's sequence
org.apache.commons.math3.random.Well1024a.nextLong()
Returns the next pseudorandom, uniformly distributed long value from this random number generator's sequence. All 2⁶⁴ possible {@code long} valuesshould be produced with (approximately) equal probability. @return the next pseudorandom, uniformly distributed longvalue from this random number generator's sequence
org.apache.mahout.cf.taste.impl.common.LongPrimitiveArrayIterator.nextLong()
org.apache.mahout.cf.taste.impl.common.LongPrimitiveIterator.nextLong()
@return next long in iteration @throws java.util.NoSuchElementException if no more elements exist in the iteration
org.apache.mahout.cf.taste.impl.common.SamplingLongPrimitiveIterator.nextLong()
org.cliffc.high_scale_lib.NonBlockingHashMapLong.IteratorLong.nextLong()
org.hsqldb.lib.Iterator.nextLong()
org.hsqldb_voltpatches.lib.Iterator.nextLong()
org.jamesii.core.math.random.generators.IRandom.nextLong()
Returns a uniformly distributed 64-bit {@code long} value from the randomnumber generator. @return A (pseudo-)random 64-bit integer.
prefuse.util.collections.LiteralIterator.nextLong()
xbird.util.distribution.ZipfGenerator.nextLong()

Examples of org.apache.mahout.cf.taste.impl.common.LongPrimitiveArrayIterator.nextLong()

      preferredItemIDsIterator = 
          new SamplingLongPrimitiveIterator(preferredItemIDsIterator, samplingRate);
    }
    FastIDSet possibleItemsIDs = new FastIDSet();
    while (preferredItemIDsIterator.hasNext()) {
      long itemID = preferredItemIDsIterator.nextLong();
      PreferenceArray prefs = dataModel.getPreferencesForItem(itemID);
      int prefsLength = prefs.length();
      if (prefsLength > maxUsersPerItem) {
        Iterator<Preference> sampledPrefs =
            new FixedSizeSamplingIterator<Preference>(maxUsersPerItem, prefs.iterator());

View Full Code Here

Examples of org.apache.mahout.cf.taste.impl.common.LongPrimitiveIterator.nextLong()

    FastByIDMap<PreferenceArray> testUserPrefs = new FastByIDMap<PreferenceArray>(
        1 + (int) (evaluationPercentage * numUsers));
    
    LongPrimitiveIterator it = dataModel.getUserIDs();
    while (it.hasNext()) {
      long userID = it.nextLong();
      if (random.nextDouble() < evaluationPercentage) {
        processOneUser(trainingPercentage, trainingUsers, testUserPrefs, userID, dataModel);
      }
    }

View Full Code Here

Examples of org.apache.mahout.cf.taste.impl.common.SamplingLongPrimitiveIterator.nextLong()

  private void addSomeOf(FastIDSet possibleItemIDs, FastIDSet itemIDs) {
    if (itemIDs.size() > maxItemsPerUser) {
      LongPrimitiveIterator it =
          new SamplingLongPrimitiveIterator(itemIDs.iterator(), (double) maxItemsPerUser / itemIDs.size());
      while (it.hasNext()) {
        possibleItemIDs.add(it.nextLong());
      }
    } else {
      possibleItemIDs.addAll(itemIDs);
    }
  }

View Full Code Here

Examples of org.cliffc.high_scale_lib.NonBlockingHashMapLong.IteratorLong.nextLong()

        int size = actors.size();
        IteratorLong it = (IteratorLong) actors.keys();
        long[] ids = new long[size];
        int i = 0;
        while (it.hasNext() && i < size) {
            ids[i] = it.nextLong();
            i++;
        }
        if (i < size)
            return Arrays.copyOf(ids, i);
        else

View Full Code Here

Examples of org.hsqldb.lib.Iterator.nextLong()

        }


        i = scsMap.keySet().iterator();


        while (i.hasNext()) {
            csid = i.nextLong();


            int usecount = useMap.get(csid, 1) - 1;


            if (usecount == 0) {
                Statement cs = (Statement) csidMap.remove(csid);

View Full Code Here

Examples of org.hsqldb_voltpatches.lib.Iterator.nextLong()


            if (!lobUsageCount.isEmpty()) {
                Iterator it = lobUsageCount.keySet().iterator();


                while (it.hasNext()) {
                    long lobID = it.nextLong();
                    int  delta = lobUsageCount.get(lobID);


                    database.lobManager.adjustUsageCount(lobID, delta - 1);
                }

View Full Code Here

Examples of org.jamesii.core.math.random.generators.IRandom.nextLong()

    IRandom seedGen = instance.groups.get(ofGroup);
    if (seedGen == null) {
      throw new IllegalArgumentException(NO_GROUP_FOUND_FOR + ofGroup);
    }


    long seed = seedGen.nextLong();
    return seed;
  }


  public static synchronized void deleteGroup(long group) {
    instance.groups.remove(group);

View Full Code Here

Examples of prefuse.util.collections.LiteralIterator.nextLong()

     * Test method for 'edu.berkeley.guir.prefuse.data.util.IntIntTreeMap.keyIterator()'
     */
    public void testKeyIterator() {
        LiteralIterator iter = map.keyIterator();
        for ( int i=0; iter.hasNext(); ++i ) {
            long key = iter.nextLong();
            assertEquals(sort[i], key);
        }
    }


    /*

View Full Code Here

Examples of xbird.util.distribution.ZipfGenerator.nextLong()

    private static void runAllBenchmarksWithZipfDistribution(int capacity, int round) {
        // skew 1.0
        ZipfGenerator zipf1 = new ZipfGenerator(2.0d);
        long[] data = new long[round];
        for(int i = 0; i < round; i++) {
            data[i] = Math.abs(zipf1.nextLong()) % round;
        }
        runBenchmarkWithZipfDistribution(capacity, round, 1.0, data, ReplacementAlgorithm.GClockK);
        runBenchmarkWithZipfDistribution(capacity, round, 1.0, data, ReplacementAlgorithm.GClock);
        runBenchmarkWithZipfDistribution(capacity, round, 1.0, data, ReplacementAlgorithm.LRU);
        // skew 0.8

View Full Code Here

Examples of xbird.util.distribution.ZipfGenerator.nextLong()

        runBenchmarkWithZipfDistribution(capacity, round, 1.0, data, ReplacementAlgorithm.GClock);
        runBenchmarkWithZipfDistribution(capacity, round, 1.0, data, ReplacementAlgorithm.LRU);
        // skew 0.8
        ZipfGenerator zipf2 = new ZipfGenerator(1.8d);
        for(int i = 0; i < round; i++) {
            data[i] = Math.abs(zipf2.nextLong()) % round;
        }
        runBenchmarkWithZipfDistribution(capacity, round, 0.8, data, ReplacementAlgorithm.GClockK);
        runBenchmarkWithZipfDistribution(capacity, round, 0.8, data, ReplacementAlgorithm.GClock);
        runBenchmarkWithZipfDistribution(capacity, round, 0.8, data, ReplacementAlgorithm.LRU);
        // skew 0.5

View Full Code Here

0 1 2 3 4 5 6 7

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.