- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 468 for We (0.14 sec)
-
maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java
* <ul> * <li>collect all the vertices for the projects that we want to build.</li> * <li>iterate through the deps of each project and if that dep is within * the set of projects we want to build then add an edge, otherwise throw * the edge away because that dependency is not within the set of projects * we are trying to build. we assume a closed set.</li> * <li>do a topo sort on the graph that remains.</li>
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Fri Sep 22 06:02:04 GMT 2023 - 10.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* objects per entry. Instead we use an open-addressed hash table. This design is basically * equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 15 22:32:14 GMT 2024 - 22.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DenseImmutableTable.java
private final ImmutableMap<C, ImmutableMap<R, V>> columnMap; @SuppressWarnings("Immutable") // We don't modify this after construction. private final int[] rowCounts; @SuppressWarnings("Immutable") // We don't modify this after construction. private final int[] columnCounts; @SuppressWarnings("Immutable") // We don't modify this after construction. private final @Nullable V[][] values;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 10K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
*/ private static void selectInPlace(int required, double[] array, int from, int to) { // If we are looking for the least element in the range, we can just do a linear search for it. // (We will hit this whenever we are doing quantile interpolation: our first selection finds // the lower value, our second one finds the upper value by looking for the next least element.)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/artifact/resolver/DefaultArtifactResolver.java
// The root artifact may, or may not be resolved so we need to check before we attempt to resolve. // This is often an artifact like a POM that is taken from disk and we already have hold of the // file reference. But this may be a Maven Plugin that we need to resolve from a remote repository // as well as its dependencies.
Java - Registered: Sun Apr 28 03:35:10 GMT 2024 - Last Modified: Thu Apr 25 05:46:50 GMT 2024 - 24.8K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/Types.java
* cannot implement that interface in source code in a way that will compile on both Java 7 and * Java 8. If we include the {@code getAnnotatedBounds()} method then its return type means it * won't compile on Java 7, while if we don't include the method then the compiler will complain * that an abstract method is unimplemented. So instead we use a dynamic proxy to get an
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 23.1K bytes - Viewed (0) -
guava-testlib/src/com/google/common/collect/testing/AbstractIteratorTester.java
&& knownOrder == KnownOrder.UNKNOWN_ORDER) { /* * We already know the iterator is an Iterator<E>, and now we know that * we called next(), so the returned element must be of type E. */ @SuppressWarnings("unchecked") E targetReturnValueFromNext = (E) targetReturnValue; /* * We have an Iterator<E> and want to cast it to
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.3K bytes - Viewed (0) -
android/guava/src/com/google/common/reflect/TypeResolver.java
* Therefore, we can always create our own TypeVariable. * * 2. Starting with JDK 7u51, the JDK TypeVariable implementations does not interoperate * with ours. Therefore, we have to be careful about whether we create our own TypeVariable: * * 2a. If the resolved types are identical to the original types, then we can return the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 24.2K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
/* * We wish to test whether or not x <= (sqrtFloor + 0.5)^2 = halfSquare + 0.25. Since both x * and halfSquare are integers, this is equivalent to testing whether or not x <= * halfSquare. (We have to deal with overflow, though.) * * If we treat halfSquare as an unsigned long, we know that * sqrtFloor^2 <= x < (sqrtFloor + 1)^2
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/RateLimiterTest.java
assertTrue(afterBurst >= 1000); } } /** * This neat test shows that no matter what weights we use in our requests, if we push X amount of * permits in a cool state, where X = rate * timeToCoolDown, and we have specified a * timeToWarmUp() period, it will cost as the prescribed amount of time. E.g., calling * [acquire(5), acquire(1)] takes exactly the same time as [acquire(2), acquire(3), acquire(1)]. */
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 21.6K bytes - Viewed (0)