Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 4 of 4 for optimistically (0.08 seconds)

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

  2. github.com/google/guava

    android/guava/src/com/google/common/hash/Striped64.java 

          long v;
      if ((as = cells) != null && (n = as.length) > 0) {
        if ((a = as[(n - 1) & h]) == null) {
          if (busy == 0) { // Try to attach new Cell
            Cell r = new Cell(x); // Optimistically create
            if (busy == 0 && casBusy()) {
              boolean created = false;
              try { // Recheck under lock
                Cell[] rs;
                int m, j;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Jan 15 22:17:15 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  3. github.com/google/guava

    android/guava/src/com/google/common/cache/Striped64.java 

          long v;
      if ((as = cells) != null && (n = as.length) > 0) {
        if ((a = as[(n - 1) & h]) == null) {
          if (busy == 0) { // Try to attach new Cell
            Cell r = new Cell(x); // Optimistically create
            if (busy == 0 && casBusy()) {
              boolean created = false;
              try { // Recheck under lock
                Cell[] rs;
                int m, j;
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Wed Jan 15 22:17:15 GMT 2025
    - 11.4K bytes
    - Click Count (0)
  4. github.com/google/guava

    guava/src/com/google/common/collect/MinMaxPriorityQueue.java 

        // We consider elementData(index) a "hole", and we want to fill it
    // with the last element of the heap, toTrickle.
    // Since the last element of the heap is from the bottom level, we
    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of
    // comparisons with toTrickle, but in some cases we will need to bubble it
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
  5. github.com/google/guava

    android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java 

        // We consider elementData(index) a "hole", and we want to fill it
    // with the last element of the heap, toTrickle.
    // Since the last element of the heap is from the bottom level, we
    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of
    // comparisons with toTrickle, but in some cases we will need to bubble it
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 16 13:11:08 GMT 2026
    - 34K bytes
    - Click Count (0)
Back to Top