Examples of nextLong()

Examples of com.fasterxml.storemate.store.util.BytesToStuff.nextLong()

74
75
76
77
78
79
80
81
82
83
84
        /*
for (int i = 0, end = Math.min(length, 24); i < end; ++i) {
    System.out.println("#"+i+" -> 0x"+Integer.toHexString(raw[offset+i] & 0xFF));
}
*/
        final long lastmod = reader.nextLong();

        // Ok: ensure version number is valid
        _verifyVersion(reader.nextByte());
       
        int statusFlags = reader.nextByte();
View Full Code Here

Examples of freenet.crypt.DummyRandomSource.nextLong()

227
228
229
230
231
232
233
234
235
236
237
          String[] options = { "probeBandwidth", "probeBuild", "probeIdentifier", "probeLinkLengths", "probeLinkLengths", "probeUptime" };
          for (String option : options) {
            System.err.print(option + ": ");
            nodeConfig.set(option, Boolean.valueOf(r.readLine()));
          }
        } else nodes[index].startProbe(htl, random.nextLong(), types[selection], print);
      } catch (Exception e) {
        //If a non-number is entered or one outside the bounds.
        System.out.print(e.toString());
        e.printStackTrace();
        //Return isn't enough to exit: the nodes are still in the background.
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongBidirectionalIterator.nextLong()

148
149
150
151
152
153
154
155
156
157
158
        long[] data = {0, 42, 5, 2, 6, 1, 7};
        LongSortedSet set = new LongSortedArraySet(data);
        LongBidirectionalIterator iter = set.iterator(2);
        assertTrue(iter.hasNext());
        assertTrue(iter.hasPrevious());
        assertEquals(5, iter.nextLong());
        iter = set.iterator(2);
        assertEquals(2, iter.previousLong());
        iter = set.iterator(-5);
        assertFalse(iter.hasPrevious());
        iter = set.iterator(100);
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongIterator.nextLong()

149
150
151
152
153
154
155
156
157
158
159
      LongIterator iter = delDocs.iterator();
      IntRBTreeSet delDocIdSet = _delDocIdSet;

      while(iter.hasNext())
      {
        long uid = iter.nextLong();
        if (ZoieIndexReader.DELETED_UID != uid)
        {
          int docid = idMapper.getDocID(uid);
          if(docid != DocIDMapper.NOT_FOUND)
          {
View Full Code Here

Examples of it.unimi.dsi.fastutil.longs.LongListIterator.nextLong()

134
135
136
137
138
139
140
141
142
143
144
      @Override
      public boolean nextIndexEntry() {
        if (timestampIter.hasNext() && positionIter.hasNext()) {
          timestamp = timestampIter.nextLong();
          position = positionIter.nextLong();
          return true;
        }
        return false;
      }
View Full Code Here

Examples of java.security.SecureRandom.nextLong()

333
334
335
336
337
338
339
340
341
342
343
     * @return the random long value
     */
    public static long secureRandomLong() {
        SecureRandom sr = getSecureRandom();
        synchronized (sr) {
            return sr.nextLong();
        }
    }

    /**
     * Get a number of pseudo random bytes.
View Full Code Here

Examples of java.util.Random.nextLong()

110
111
112
113
114
115
116
117
118
119
120
    public synchronized static boolean acquireLock(FileSystemManager fsManager, FileObject fo) {
       
        // generate a random lock value to ensure that there are no two parties
        // processing the same file
        Random random = new Random();
        byte[] lockValue = String.valueOf(random.nextLong()).getBytes();
       
        try {
            // check whether there is an existing lock for this item, if so it is assumed
            // to be processed by an another listener (downloading) or a sender (uploading)
            // lock file is derived by attaching the ".lock" second extension to the file name
View Full Code Here

Examples of java.util.Random.nextLong()

137
138
139
140
141
142
143
144
145
146
147
        ConcurrentPluggableCache<Long, Long> cache = new ConcurrentPluggableCache<Long, Long>(capacity);
        cache.setReplacementPolicy(ReplacementPolicySelector.<Long, Long> provide(capacity, algo));
        Random rand = new Random(76675734342L);
        StopWatch watchdog = new StopWatch("capacity: " + capacity + ", round: " + round);
        for(int i = 0; i < round; i++) {
            long key = Math.abs(rand.nextLong()) % round;
            ICacheEntry<Long, Long> entry = cache.allocateEntry(key);
            entry.setValue(key);
            entry.unpin();
        }
        System.err.println(watchdog.toString());
View Full Code Here

Examples of java.util.Random.nextLong()

63
64
65
66
67
68
69
70
71
72
73
        List<byte[]> list = new ArrayList<byte[]>(REPEAT);
        Random random = new Random(54552542345L);
        StopWatch sw1 = new StopWatch("[BplusTreeUniq] Index Construction of " + REPEAT);
        for(int i = 0; i < REPEAT; i++) {
            long v = random.nextLong();
            byte[] b = Primitives.toBytes(v);
            Value k = new Value(b);
            Assert.assertTrue(btree.addValue(k, v) == -1);
            list.add(b);
        }
View Full Code Here

Examples of java.util.Random.nextLong()

96
97
98
99
100
101
102
103
104
105
106
        List<byte[]> list = new ArrayList<byte[]>(REPEAT);
        Random random = new Random(54552542345L);
        StopWatch sw1 = new StopWatch("[SortedStaticHash_with_" + buckets
                + "_buckets] Index Construction of " + REPEAT);
        for(int i = 0; i < REPEAT; i++) {
            String d = Double.toString(random.nextLong());
            byte[] b = StringUtils.getBytes(d);
            Key k = new Key(b);
            Value v = new Value(b);
            Assert.assertNull(hash.addValue(k, v));
            list.add(b);
View Full Code Here
TOP
Copyright © 2018 www.massapi.com. All rights reserved.
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.