- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 562 for ordered (0.05 sec)
-
guava-tests/test/com/google/common/primitives/IntsTest.java
assertThat(Ints.join(",", (int) 1, (int) 2)).isEqualTo("1,2"); assertThat(Ints.join("", (int) 1, (int) 2, (int) 3)).isEqualTo("123"); } public void testLexicographicalComparator() { List<int[]> ordered = Arrays.asList( new int[] {}, new int[] {LEAST}, new int[] {LEAST, LEAST}, new int[] {LEAST, (int) 1}, new int[] {(int) 1},
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 29.2K bytes - Viewed (0) -
guava/src/com/google/common/math/Stats.java
* for some instances where the statistics are mathematically equal, including instances * constructed from the same values in a different order... or (in the general case) even in the * same order. (It is guaranteed to return true for instances constructed from the same values in * the same order if {@code strictfp} is in effect, or if the system architecture guarantees * {@code strictfp}-like semantics.) */ @Override
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 24.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
policy, CycleDetectingLockFactory.createNodes(enumClass)); } public void testDeadlock_twoLocks() { // Establish an acquisition order of lockA -> lockB. lockA.lock(); lockB.lock(); lockA.unlock(); lockB.unlock(); // The opposite order should fail (Policies.THROW). PotentialDeadlockException firstException = null; lockB.lock(); PotentialDeadlockException expected =
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 16.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/CycleDetectingLockFactoryTest.java
policy, CycleDetectingLockFactory.createNodes(enumClass)); } public void testDeadlock_twoLocks() { // Establish an acquisition order of lockA -> lockB. lockA.lock(); lockB.lock(); lockA.unlock(); lockB.unlock(); // The opposite order should fail (Policies.THROW). PotentialDeadlockException firstException = null; lockB.lock(); PotentialDeadlockException expected =
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Dec 19 18:03:30 UTC 2024 - 16.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/ServiceManager.java
* invoked in the same order as the underlying service enters those states. Additionally, at most * one of the listener's callbacks will execute at once. However, multiple listeners' callbacks * may execute concurrently, and listeners may execute in an order different from the one in which * they were registered. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue May 13 17:27:14 UTC 2025 - 33.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/BooleansTest.java
assertThat(Booleans.join("", false, true, false)).isEqualTo("falsetruefalse"); } public void testLexicographicalComparator() { List<boolean[]> ordered = Arrays.asList( new boolean[] {}, new boolean[] {false}, new boolean[] {false, false}, new boolean[] {false, true}, new boolean[] {true},
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 25K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Table.java
import java.util.Collection; import java.util.Map; import java.util.Objects; import java.util.Set; import org.jspecify.annotations.Nullable; /** * A collection that associates an ordered pair of keys, called a row key and a column key, with a * single value. A table may be sparse, with only a small fraction of row key / column key pairs * possessing a corresponding value. *
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Tue Jul 08 18:32:10 UTC 2025 - 10.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/DoublesTest.java
assertThat(Doubles.join(",", 1.3, 2.4)).isEqualTo("1.3,2.4"); assertThat(Doubles.join("", 1.4, 2.5, 3.6)).isEqualTo("1.42.53.6"); } public void testLexicographicalComparator() { List<double[]> ordered = Arrays.asList( new double[] {}, new double[] {LEAST}, new double[] {LEAST, LEAST}, new double[] {LEAST, 1.0}, new double[] {1.0},
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 30.9K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/LongsTest.java
assertThat(Longs.join(",", 1L, 2L)).isEqualTo("1,2"); assertThat(Longs.join("", 1L, 2L, 3L)).isEqualTo("123"); } public void testLexicographicalComparator() { List<long[]> ordered = Arrays.asList( new long[] {}, new long[] {MIN_VALUE}, new long[] {MIN_VALUE, MIN_VALUE}, new long[] {MIN_VALUE, 1L}, new long[] {1L},
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 28.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/primitives/ShortsTest.java
Registered: Fri Sep 05 12:43:10 UTC 2025 - Last Modified: Thu Aug 07 16:05:33 UTC 2025 - 27.6K bytes - Viewed (0)