- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 12 for tips (0.18 sec)
-
guava/src/com/google/common/collect/Comparators.java
return true; } /** * Returns a {@code Collector} that returns the {@code k} smallest (relative to the specified * {@code Comparator}) input elements, in ascending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code * Stream.of("foo", "quux", "banana", "elephant") * .collect(least(2, comparingInt(String::length)))
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 10.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* * <p>Operations on this class make no guarantees about the ordering of elements with equal * priority. If you need to enforce an ordering, you can define custom classes or comparators that * use a secondary key to break ties in primary priority values. For example, here is a class that * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a * {@code new FIFOEntry(anEntry)} instead of a plain entry object. *
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
android/guava/src/com/google/thirdparty/publicsuffix/PublicSuffixPatterns.java
mihsim?ra&biah?honikam??tawi?wa&g&ekak?ukik??kijuf??yimonijuf??i&a&ra?sok??hcamirom?juf?kaz&eamo?ustam??ma&nnak?ta??nukonuzi?orukuf??nohenawak?o&nosus?ti??u&stamamah?z&a&mun?wak??i!ay?i&hs&agih?in??manim??mihs????????m&a&tias!.&a&d&ihsoy?ot?usah??k&a&dih?sa??o&arihs?s???m&a&tias?y&as?o&rom?tah??ustamihsagih???i&hsagurust?jawak??uri??ni?wa&g&e&ko?man??ikot?o??k&ara?i&hsoy?mak???ru?zorokot??y&a&g&amuk?ihsok?otah??kuf??imo??ziin??e&bakusak?ogawak?sogo?ttas?zokoy??i&baraw?h&cugawak?s&oyim?ubustam???...
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Mar 21 21:04:43 GMT 2024 - 72.4K bytes - Viewed (1) -
android/guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
like to be rude, so she bore it as well as she could. `The game's going on rather better now,' she said, by way of keeping up the conversation a little. `'Tis so,' said the Duchess: `and the moral of that is--"Oh, 'tis love, 'tis love, that makes the world go round!"' `Somebody said,' Alice whispered, `that it's done by everybody minding their own business!'
Plain Text - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Apr 21 02:27:51 GMT 2017 - 145.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedPriorityBlockingQueue.java
* * <p>Operations on this class make no guarantees about the ordering of elements with equal * priority. If you need to enforce an ordering, you can define custom classes or comparators that * use a secondary key to break ties in primary priority values. For example, here is a class that * applies first-in-first-out tie-breaking to comparable elements. To use it, you would insert a * {@code new FIFOEntry(anEntry)} instead of a plain entry object. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 19.5K bytes - Viewed (0) -
guava-testlib/src/com/google/common/testing/ClassSanityTester.java
factory.setAccessible(true); } // Sorts methods/constructors with the least number of parameters first since it's likely easier // to fill dummy parameter values for them. Ties are broken by name then by the string form of // the parameter list. return BY_NUMBER_OF_PARAMETERS .compound(BY_METHOD_NAME) .compound(BY_PARAMETERS) .immutableSortedCopy(factories);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Feb 08 17:31:55 GMT 2024 - 33K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Comparators.java
return true; } /** * Returns a {@code Collector} that returns the {@code k} smallest (relative to the specified * {@code Comparator}) input elements, in ascending order, as an unmodifiable {@code List}. Ties * are broken arbitrarily. * * <p>For example: * * <pre>{@code * Stream.of("foo", "quux", "banana", "elephant") * .collect(least(2, comparingInt(String::length)))
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 08:42:51 GMT 2024 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
return (Multiset<T>) iterable; } /** * Returns a copy of {@code multiset} as an {@link ImmutableMultiset} whose iteration order puts * the highest count first, with ties broken by the iteration order of the original multiset. * * @since 11.0 */ public static <E> ImmutableMultiset<E> copyHighestCountFirst(Multiset<E> multiset) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 41.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/io/testdata/alice_in_wonderland.txt
like to be rude, so she bore it as well as she could. `The game's going on rather better now,' she said, by way of keeping up the conversation a little. `'Tis so,' said the Duchess: `and the moral of that is--"Oh, 'tis love, 'tis love, that makes the world go round!"' `Somebody said,' Alice whispered, `that it's done by everybody minding their own business!'
Plain Text - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Oct 29 21:35:03 GMT 2012 - 145.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/OrderingTest.java
assertTrue(result instanceof RandomAccess); assertListImmutable(result); assertEquals(ImmutableList.of(-1, 3, 4, 5), result); } public void testLeastOfIterable_ties() { Integer foo = new Integer(Integer.MAX_VALUE - 10); Integer bar = new Integer(Integer.MAX_VALUE - 10); assertNotSame(foo, bar); assertEquals(foo, bar);
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 42.5K bytes - Viewed (0)