Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 33 for Prev (0.02 seconds)

The search processing time has exceeded the limit. The displayed results may be partial.

  1. guava-tests/test/com/google/common/util/concurrent/AtomicDoubleTest.java

      public void testCompareAndSet() {
        double prev = Math.E;
        double unused = Math.E + Math.PI;
        AtomicDouble at = new AtomicDouble(prev);
        for (double x : VALUES) {
          assertBitEquals(prev, at.get());
          assertFalse(at.compareAndSet(unused, x));
          assertBitEquals(prev, at.get());
          assertTrue(at.compareAndSet(prev, x));
          assertBitEquals(x, at.get());
          prev = x;
        }
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Mar 13 13:01:07 GMT 2026
    - 10.6K bytes
    - Click Count (0)
  2. guava-tests/test/com/google/common/util/concurrent/AtomicDoubleArrayTest.java

        for (int i : new int[] {0, SIZE - 1}) {
          double prev = 0.0;
          double unused = Math.E + Math.PI;
          for (double x : VALUES) {
            assertBitEquals(prev, aa.get(i));
            assertFalse(aa.compareAndSet(i, unused, x));
            assertBitEquals(prev, aa.get(i));
            assertTrue(aa.compareAndSet(i, prev, x));
            assertBitEquals(x, aa.get(i));
            prev = x;
          }
        }
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Thu Mar 12 17:47:10 GMT 2026
    - 14.8K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/Comparators.java

        checkNotNull(comparator);
        Iterator<? extends T> it = iterable.iterator();
        if (it.hasNext()) {
          T prev = it.next();
          while (it.hasNext()) {
            T next = it.next();
            if (comparator.compare(prev, next) > 0) {
              return false;
            }
            prev = next;
          }
        }
        return true;
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Feb 23 19:19:10 GMT 2026
    - 10.9K bytes
    - Click Count (0)
  4. guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java

        SettableFuture<String> orig = SettableFuture.create();
        SettableFuture<String> prev = orig;
        for (int i = 0; i < 100000; i++) {
          SettableFuture<String> curr = SettableFuture.create();
          prev.setFuture(curr);
          prev = curr;
        }
        // prev represents the 'innermost' future
        prev.set("done");
        assertTrue(orig.isDone());
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 22:45:21 GMT 2026
    - 45.2K bytes
    - Click Count (0)
  5. android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java

        SettableFuture<String> orig = SettableFuture.create();
        SettableFuture<String> prev = orig;
        for (int i = 0; i < 100000; i++) {
          SettableFuture<String> curr = SettableFuture.create();
          prev.setFuture(curr);
          prev = curr;
        }
        // prev represents the 'innermost' future
        prev.set("done");
        assertTrue(orig.isDone());
      }
    
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 22:45:21 GMT 2026
    - 45.2K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/HashBiMap.java

       * prev}. {@code ENDPOINT} represents either the first or last entry in the entire map (as
       * appropriate).
       */
      private void setSucceeds(int prev, int next) {
        if (prev == ENDPOINT) {
          firstInInsertionOrder = next;
        } else {
          nextInInsertionOrder[prev] = next;
        }
        if (next == ENDPOINT) {
          lastInInsertionOrder = prev;
        } else {
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Sun Mar 08 16:16:42 GMT 2026
    - 37K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/LinkedHashMultimap.java

          int smearedHash = smearedHash(o);
          int bucket = smearedHash & mask();
          ValueEntry<K, V> prev = null;
          for (ValueEntry<K, V> entry = hashTable[bucket];
              entry != null;
              prev = entry, entry = entry.nextInValueBucket) {
            if (entry.matchesValue(o, smearedHash)) {
              if (prev == null) {
                // first entry in the bucket
                hashTable[bucket] = entry.nextInValueBucket;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 19.2K bytes
    - Click Count (0)
  8. src/main/java/org/codelibs/fess/suggest/index/operations/ContentIndexingOperations.java

            final StringBuilder buf = new StringBuilder(searchWord.length());
            char prev = 0;
            for (final char c : searchWord.toCharArray()) {
                if (!Character.isWhitespace(c)) {
                    buf.append(c);
                } else if (!Character.isWhitespace(prev)) {
                    buf.append(' ');
                }
                prev = c;
            }
            final String[] words = buf.toString().trim().split(" ");
    Created: Fri Apr 17 09:08:13 GMT 2026
    - Last Modified: Sat Mar 14 02:35:38 GMT 2026
    - 21.7K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/LinkedHashMultimap.java

          int smearedHash = smearedHash(o);
          int bucket = smearedHash & mask();
          ValueEntry<K, V> prev = null;
          for (ValueEntry<K, V> entry = hashTable[bucket];
              entry != null;
              prev = entry, entry = entry.nextInValueBucket) {
            if (entry.matchesValue(o, smearedHash)) {
              if (prev == null) {
                // first entry in the bucket
                hashTable[bucket] = entry.nextInValueBucket;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Dec 26 20:08:09 GMT 2025
    - 20K bytes
    - Click Count (0)
  10. android/guava/src/com/google/common/util/concurrent/InterruptibleTask.java

            // not all.  See the test cases for examples on how this can happen.
            try {
              ((Thread) currentRunner).interrupt();
            } finally {
              Runnable prev = getAndSet(DONE);
              if (prev == PARKED) {
                LockSupport.unpark((Thread) currentRunner);
              }
            }
          }
        }
      }
    
      /**
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Jan 28 22:39:02 GMT 2026
    - 10K bytes
    - Click Count (0)
Back to Top