Search Options

Results per page
Sort
Preferred Languages
Advance

Results 101 - 110 of 1,272 for oder (0.02 sec)

  1. android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java

     * is not guaranteed to traverse the elements of the MonitorBasedPriorityBlockingQueue in
     * any particular order. If you need ordered traversal, consider using {@code
     * Arrays.sort(pq.toArray())}. Also, method {@code drainTo} can be used to remove some or
     * all elements in priority order and place them in another collection.
     *
     * <p>Operations on this class make no guarantees about the ordering of elements with equal
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 18.9K bytes
    - Viewed (0)
  2. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java

       * traversal order of the collection's iterator.
       *
       * @param capacity the capacity of this queue
       * @param fair if {@code true} then queue accesses for threads blocked on insertion or removal,
       *     are processed in FIFO order; if {@code false} the access order is unspecified.
       * @param c the collection of elements to initially contain
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue May 13 18:46:00 UTC 2025
    - 22.4K bytes
    - Viewed (0)
  3. android/guava/src/com/google/common/collect/Sets.java

      /**
       * Returns an unmodifiable <b>view</b> of the union of two sets. The returned set contains all
       * elements that are contained in either backing set. Iterating over the returned set iterates
       * first over all the elements of {@code set1}, then over each element of {@code set2}, in order,
       * that is not contained in {@code set1}.
       *
       * <p>Results are undefined if {@code set1} and {@code set2} are sets based on different
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Thu Aug 07 16:05:33 UTC 2025
    - 81.6K bytes
    - Viewed (0)
  4. cmd/storage-datatypes.go

    //     only after as a 2-phase call, allowing the older dataDir to
    //     hang-around in-case we need some form of recovery.
    type RenameDataResp struct {
    	Sign       []byte `msg:"s"`
    	OldDataDir string `msg:"od"` // contains '<uuid>', it is designed to be passed as value to Delete(bucket, pathJoin(object, dataDir))
    }
    
    const (
    	checkPartUnknown int = iota
    
    	// Changing the order can cause a data loss
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Fri Apr 25 05:41:04 UTC 2025
    - 17.4K bytes
    - Viewed (0)
  5. docs/en/docs/tutorial/path-params-numeric-validations.md

    A path parameter is always required as it has to be part of the path. Even if you declared it with `None` or set a default value, it would not affect anything, it would still be always required.
    
    ///
    
    ## Order the parameters as you need { #order-the-parameters-as-you-need }
    
    /// tip
    
    This is probably not as important or necessary if you use `Annotated`.
    
    ///
    
    Let's say that you want to declare the query parameter `q` as a required `str`.
    Registered: Sun Sep 07 07:19:17 UTC 2025
    - Last Modified: Sun Aug 31 09:15:41 UTC 2025
    - 6.2K bytes
    - Viewed (0)
  6. guava/src/com/google/common/collect/Comparators.java

       * until a nonzero result is found; imposes "dictionary order." If the end of one iterable is
       * reached, but not the other, the shorter iterable is considered to be less than the longer one.
       * For example, a lexicographical natural ordering over integers considers {@code [] < [1] < [1,
       * 1] < [1, 2] < [2]}.
       *
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Mon Mar 17 20:26:29 UTC 2025
    - 10.9K bytes
    - Viewed (0)
  7. futures/listenablefuture1/pom.xml

        version number is enough for some build systems (notably, Gradle) to select
        that empty artifact over the "real" listenablefuture-1.0 -- avoiding a
        conflict with the copy of ListenableFuture in guava itself. If users are
        using an older version of Guava or a build system other than Gradle, they
        may see class conflicts. If so, they can solve them by manually excluding
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Sep 12 21:42:09 UTC 2018
    - 2.2K bytes
    - Viewed (0)
  8. android/guava/src/com/google/common/collect/CompactLinkedHashSet.java

      /**
       * Pointer to the predecessor of an entry in insertion order. ENDPOINT indicates a node is the
       * first node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
       */
      private transient int @Nullable [] predecessor;
    
      /**
       * Pointer to the successor of an entry in insertion order. ENDPOINT indicates a node is the last
       * node in insertion order; all values at indices ≥ {@link #size()} are UNSET.
       */
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Wed Aug 06 14:59:07 UTC 2025
    - 9.4K bytes
    - Viewed (0)
  9. android/guava/src/com/google/common/collect/CompactHashSet.java

     * average, in the marking phase, not {@code 5.0} as in {@code java.util.HashSet}.
     *
     * <p>If there are no removals, then {@link #iterator iteration} order is the same as insertion
     * order. Any removal invalidates any ordering guarantees.
     *
     * <p>This class should not be assumed to be universally superior to {@code java.util.HashSet}.
    Registered: Fri Sep 05 12:43:10 UTC 2025
    - Last Modified: Tue Jul 08 18:32:10 UTC 2025
    - 23.9K bytes
    - Viewed (0)
  10. cmd/metacache-entries.go

    	}
    
    	// Check if each version matches...
    	for i, eVer := range eVers.versions {
    		oVer := oVers.versions[i]
    		if eVer.header != oVer.header {
    			if eVer.header.hasEC() != oVer.header.hasEC() {
    				// One version has EC and the other doesn't - may have been written later.
    				// Compare without considering EC.
    				a, b := eVer.header, oVer.header
    				a.EcN, a.EcM = 0, 0
    				b.EcN, b.EcM = 0, 0
    				if a == b {
    					continue
    Registered: Sun Sep 07 19:28:11 UTC 2025
    - Last Modified: Thu Aug 08 15:29:58 UTC 2024
    - 24.1K bytes
    - Viewed (0)
Back to top