Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 7 of 7 for ranks (0.02 seconds)

  1. guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

        }
    
        /** Equivalent to {@code newReentrantReadWriteLock(rank, false)}. */
        public ReentrantReadWriteLock newReentrantReadWriteLock(E rank) {
          return newReentrantReadWriteLock(rank, false);
        }
    
        /**
         * Creates a {@link ReentrantReadWriteLock} with the given fairness policy and rank. The values
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Sep 11 17:06:34 GMT 2025
    - 35.9K bytes
    - Click Count (0)
  2. android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java

        }
    
        /** Equivalent to {@code newReentrantReadWriteLock(rank, false)}. */
        public ReentrantReadWriteLock newReentrantReadWriteLock(E rank) {
          return newReentrantReadWriteLock(rank, false);
        }
    
        /**
         * Creates a {@link ReentrantReadWriteLock} with the given fairness policy and rank. The values
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Thu Sep 11 17:06:34 GMT 2025
    - 35.9K bytes
    - Click Count (0)
  3. tensorflow/c/c_api_experimental.cc

      const auto& shape = reader->GetVariableToShapeMap().at(name);
      int rank = shape.dims();
      if (num_dims != rank) {
        status->status = InvalidArgument("Expected rank is ", num_dims,
                                         " but actual rank is ", rank);
        return;
      }
      for (int i = 0; i < num_dims; i++) {
        dims[i] = shape.dim_size(i);
      }
    }
    
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Sat Oct 04 05:55:32 GMT 2025
    - 29.4K bytes
    - Click Count (0)
  4. android/guava-tests/test/com/google/common/collect/OrderingTest.java

        final T value;
        final int rank;
    
        Composite(T value, int rank) {
          this.value = value;
          this.rank = rank;
        }
    
        // natural order is by rank only; the test will compound() this with the
        // order of 't'.
        @Override
        public int compareTo(Composite<T> that) {
          return Integer.compare(rank, that.rank);
        }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Oct 10 23:13:45 GMT 2025
    - 42.8K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/collect/OrderingTest.java

        final T value;
        final int rank;
    
        Composite(T value, int rank) {
          this.value = value;
          this.rank = rank;
        }
    
        // natural order is by rank only; the test will compound() this with the
        // order of 't'.
        @Override
        public int compareTo(Composite<T> that) {
          return Integer.compare(rank, that.rank);
        }
    
    Created: Fri Dec 26 12:43:10 GMT 2025
    - Last Modified: Fri Oct 10 23:13:45 GMT 2025
    - 42.8K bytes
    - Click Count (0)
  6. tensorflow/c/c_api_experimental.h

        TFE_Context* ctx, const char* task, int64_t timeout_in_ms,
        TF_Status* status);
    
    // Information about the shape of a Tensor and its type.
    struct TF_ShapeAndType {
      // Number of dimensions. -1 indicates unknown rank.
      int num_dims;
      // Array of dimensions. -1 indicates unknown dim.
      int64_t* dims;
      // The data type. May be 0 to denote unknown type.
      TF_DataType dtype;
    };
    
    Created: Tue Dec 30 12:39:10 GMT 2025
    - Last Modified: Thu Apr 27 21:07:00 GMT 2023
    - 15.1K bytes
    - Click Count (0)
  7. docs/en/docs/async.md

    But still, the final experience is not the best. 😞
    
    ---
    
    This would be the parallel equivalent story for burgers. πŸ”
    
    For a more "real life" example of this, imagine a bank.
    
    Up to recently, most of the banks had multiple cashiers πŸ‘¨β€πŸ’ΌπŸ‘¨β€πŸ’ΌπŸ‘¨β€πŸ’ΌπŸ‘¨β€πŸ’Ό and a big line πŸ•™πŸ•™πŸ•™πŸ•™πŸ•™πŸ•™πŸ•™πŸ•™.
    
    All of the cashiers doing all the work with one client after the other πŸ‘¨β€πŸ’Όβ―.
    
    Created: Sun Dec 28 07:19:09 GMT 2025
    - Last Modified: Sun Aug 31 09:56:21 GMT 2025
    - 24K bytes
    - Click Count (0)
Back to Top