Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 21 - 30 of 191 for Ordered (0.1 seconds)

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

  1. guava/src/com/google/common/collect/TreeBasedTable.java

    import java.util.Set;
    import java.util.SortedMap;
    import java.util.SortedSet;
    import java.util.TreeMap;
    import org.jspecify.annotations.Nullable;
    
    /**
     * Implementation of {@code Table} whose row keys and column keys are ordered by their natural
     * ordering or by supplied comparators. When constructing a {@code TreeBasedTable}, you may provide
     * comparators for the row keys and the column keys, or you may use natural ordering for both.
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jul 18 15:05:43 GMT 2025
    - 11.6K bytes
    - Click Count (0)
  2. guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java

       * collection. If the specified collection is a {@link SortedSet} or a {@link PriorityQueue}, this
       * priority queue will be ordered according to the same ordering. Otherwise, this priority queue
       * will be ordered according to the {@linkplain Comparable natural ordering} of its elements.
       *
       * @param c the collection whose elements are to be placed into this priority queue
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Mar 23 21:06:42 GMT 2026
    - 19K bytes
    - Click Count (0)
  3. guava/src/com/google/common/collect/ImmutableSortedSet.java

      /**
       * Returns a builder that creates immutable sorted sets whose elements are ordered by the reverse
       * of their natural ordering.
       */
      public static <E extends Comparable<?>> Builder<E> reverseOrder() {
        return new Builder<>(Collections.reverseOrder());
      }
    
      /**
       * Returns a builder that creates immutable sorted sets whose elements are ordered by their
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Sep 23 17:50:58 GMT 2025
    - 39.1K bytes
    - Click Count (0)
  4. build-logic/binary-compatibility/src/test/kotlin/gradlebuild/binarycompatibility/AlphabeticalAcceptedApiChangesTaskIntegrationTest.kt

                )
            )
        }
    
        @Test
        fun `verify AlphabeticalAcceptedApiChangesTask accepts properly ordered changes`() {
            //language=JSON
            firstAcceptedApiChangesFile.writeText(
                """
                    {
                        "acceptedApiChanges": [
                            {
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Fri Mar 14 02:17:00 GMT 2025
    - 8.4K bytes
    - Click Count (0)
  5. guava-tests/test/com/google/common/graph/ValueGraphTest.java

        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(1, 2))).isFalse();
        assertThat(graph.hasEdgeConnecting(EndpointPair.ordered(2, 1))).isFalse();
      }
    
      @Test
      public void edgeValue_directed_correct() {
        graph = ValueGraphBuilder.directed().build();
        graph.putEdgeValue(1, 2, "A");
        assertThat(graph.edgeValue(EndpointPair.ordered(1, 2))).hasValue("A");
      }
    
      @Test
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Tue Mar 17 19:26:39 GMT 2026
    - 20.5K bytes
    - Click Count (0)
  6. android/guava/src/com/google/common/collect/TreeBasedTable.java

    import java.util.Set;
    import java.util.SortedMap;
    import java.util.SortedSet;
    import java.util.TreeMap;
    import org.jspecify.annotations.Nullable;
    
    /**
     * Implementation of {@code Table} whose row keys and column keys are ordered by their natural
     * ordering or by supplied comparators. When constructing a {@code TreeBasedTable}, you may provide
     * comparators for the row keys and the column keys, or you may use natural ordering for both.
     *
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Fri Jul 18 15:05:43 GMT 2025
    - 11.6K bytes
    - Click Count (0)
  7. android/guava/src/com/google/common/collect/MultimapBuilder.java

            }
          };
        }
    
        /** Uses an insertion-ordered hash-based {@code Set} to store value collections. */
        public SetMultimapBuilder<K0, @Nullable Object> linkedHashSetValues() {
          return linkedHashSetValues(DEFAULT_EXPECTED_VALUES_PER_KEY);
        }
    
        /**
         * Uses an insertion-ordered hash-based {@code Set} to store value collections, initialized to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 18K bytes
    - Click Count (0)
  8. guava/src/com/google/common/collect/MultimapBuilder.java

            }
          };
        }
    
        /** Uses an insertion-ordered hash-based {@code Set} to store value collections. */
        public SetMultimapBuilder<K0, @Nullable Object> linkedHashSetValues() {
          return linkedHashSetValues(DEFAULT_EXPECTED_VALUES_PER_KEY);
        }
    
        /**
         * Uses an insertion-ordered hash-based {@code Set} to store value collections, initialized to
    Created: Fri Apr 03 12:43:13 GMT 2026
    - Last Modified: Mon Sep 22 18:35:44 GMT 2025
    - 18K bytes
    - Click Count (0)
  9. guava/src/com/google/common/collect/LinkedHashMultimap.java

        return Spliterators.spliterator(
            entries(), Spliterator.DISTINCT | Spliterator.ORDERED | Spliterator.NONNULL);
      }
    
      @Override
      Iterator<V> valueIterator() {
        return Maps.valueIterator(entryIterator());
      }
    
      @Override
      Spliterator<V> valueSpliterator() {
        return CollectSpliterators.map(entrySpliterator(), Spliterator.ORDERED, Entry::getValue);
      }
    
      /**
    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. .teamcity/src/main/kotlin/model/BucketExtensions.kt

     * if some elements are too small, they will be aggregated by smallElementAggregateFunction.
     *
     * @param list the list to split, must be ordered by size desc
     * @param toIntFunction the function used to map the element to its "size"
     * @param largeElementSplitFunction the function used to further split the large element into smaller pieces
    Created: Wed Apr 01 11:36:16 GMT 2026
    - Last Modified: Wed Feb 12 09:12:03 GMT 2025
    - 5.7K bytes
    - Click Count (0)
Back to Top