- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 11 for Racine (0.37 sec)
-
guava-tests/test/com/google/common/graph/TraverserTest.java
*/ private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH = createDirectedGraph("ab", "ac", "bc", "cd", "da"); /** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h * /|\ * / | \ * / | \ * d e g * /|\ | * / | \ | * a b c f * }</pre>
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Ascii.java
* * @since 8.0 */ public static final byte NUL = 0; /** * Start of Heading: A communication control character used at the beginning of a sequence of * characters which constitute a machine-sensible address or routing information. Such a sequence * is referred to as the "heading." An STX character has the effect of terminating a heading. * * @since 8.0 */ public static final byte SOH = 1;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
// For each listener we add a task that submits it to the executor directly for the blocking // get use case and another task that adds it as a listener to the future to exercise both // racing addListener calls and addListener calls completing after the future completes. final Runnable listener = k % 2 == 0 ? collectResultsRunnable : collectResultsTimedGetRunnable;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 46.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Traverser.java
* of nodes that have been seen but not yet visited, that is, the "horizon"). * </ul> * * <p><b>Examples</b> (all edges are directed facing downwards) * * <p>The graph below would be valid input with start nodes of {@code a, f, c}. However, if {@code * b} were <i>also</i> a start node, then there would be multiple paths to reach {@code e} and
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 30 20:12:45 GMT 2023 - 19.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/LongMathTest.java
} } @J2ktIncompatible // slow enough to cause flakiness @GwtIncompatible // far too slow public void testSqrtOfPerfectSquareAsDoubleIsPerfect() { // This takes just over a minute on my machine. for (long n = 0; n <= LongMath.FLOOR_SQRT_MAX_LONG; n++) { long actual = (long) Math.sqrt(n * n); assertTrue(actual == n); } } public void testSqrtOfLongIsAtMostFloorSqrtMaxLong() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0) -
android/guava/src/com/google/common/io/Files.java
if (parent == null) { /* * The given directory is a filesystem root. All zero of its ancestors exist. This doesn't * mean that the root itself exists -- consider x:\ on a Windows machine without such a drive * -- or even that the caller can create it, but this method makes no such guarantees even for * non-root files. */ return; } parent.mkdirs();
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 33.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/TraverserTest.java
*/ private static final SuccessorsFunction<Character> TWO_CYCLES_GRAPH = createDirectedGraph("ab", "ac", "bc", "cd", "da"); /** * A tree-shaped graph that looks as follows (all edges are directed facing downwards): * * <pre>{@code * h * /|\ * / | \ * / | \ * d e g * /|\ | * / | \ | * a b c f * }</pre>
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 47.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractFutureTest.java
// For each listener we add a task that submits it to the executor directly for the blocking // get use case and another task that adds it as a listener to the future to exercise both // racing addListener calls and addListener calls completing after the future completes. final Runnable listener = k % 2 == 0 ? collectResultsRunnable : collectResultsTimedGetRunnable;
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 13 14:28:25 GMT 2024 - 46.8K bytes - Viewed (0) -
guava/src/com/google/common/base/Ascii.java
* * @since 8.0 */ public static final byte NUL = 0; /** * Start of Heading: A communication control character used at the beginning of a sequence of * characters which constitute a machine-sensible address or routing information. Such a sequence * is referred to as the "heading." An STX character has the effect of terminating a heading. * * @since 8.0 */ public static final byte SOH = 1;
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/LongMathTest.java
} } @J2ktIncompatible // slow enough to cause flakiness @GwtIncompatible // far too slow public void testSqrtOfPerfectSquareAsDoubleIsPerfect() { // This takes just over a minute on my machine. for (long n = 0; n <= LongMath.FLOOR_SQRT_MAX_LONG; n++) { long actual = (long) Math.sqrt(n * n); assertTrue(actual == n); } } public void testSqrtOfLongIsAtMostFloorSqrtMaxLong() {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 20:15:57 GMT 2024 - 32.5K bytes - Viewed (0)