- Sort Score
- Result 10 results
- Languages All
Results 21 - 28 of 28 for Mitake (0.15 sec)
-
android/guava/src/com/google/common/primitives/Ints.java
// The Dolphin algorithm is attractive because it does the fewest array reads and writes: each // array slot is read and written exactly once. However, it can have very poor memory locality: // benchmarking shows it can take 7 times longer than the other two in some cases. The other two // do n swaps, minus a delta (0 or 2 for Reversal, gcd(d, n) for Successive), so that's about
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 29.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
} @Override public String toString() { return "Ordering.arbitrary()"; } /* * We need to be able to mock identityHashCode() calls for tests, because it * can take 1-10 seconds to find colliding objects. Mocking frameworks that * can do magic to mock static method calls still can't do so for a system * class, so we need the indirection. In production, Hotspot should still
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
guava/src/com/google/common/base/Converter.java
@GwtCompatible @ElementTypesAreNonnullByDefault /* * 1. The type parameter is <T> rather than <T extends @Nullable> so that we can use T in the * doForward and doBackward methods to indicate that the parameter cannot be null. (We also take * advantage of that for convertAll, as discussed on that method.) * * 2. The supertype of this class could be `Function<@Nullable A, @Nullable B>`, since
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 23K bytes - Viewed (1) -
android/guava/src/com/google/common/cache/LocalCache.java
* at table entries if it is 0. * * - All (synchronized) write operations should write to the "count" field after structurally * changing any bin. The operations must not take any action that could even momentarily cause a * concurrent read operation to see inconsistent data. This is made easier by the nature of the
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 144.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/google/MultimapPutTester.java
public void testPutNullValue_supported() { int size = getNumElements(); multimap().put(k3(), null); assertGet(k3(), Lists.newArrayList((V) null)); // ImmutableList.of can't take null. assertEquals(size + 1, multimap().size()); } @MapFeature.Require(value = SUPPORTS_PUT, absent = ALLOWS_NULL_VALUES) public void testPutNullValue_unsupported() { try {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Feb 21 16:49:06 GMT 2024 - 7.1K bytes - Viewed (0) -
guava-gwt/pom.xml
XML - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Apr 11 15:00:55 GMT 2024 - 19.8K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/Helpers.java
List<?> exp = copyToList(expected); List<?> act = copyToList(actual); String actString = act.toString(); // Of course we could take pains to give the complete description of the // problem on any failure. // Yeah it's n^2. for (Object object : exp) { if (!act.remove(object)) { Assert.fail(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 17.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
/** * Determines whether an edge has already been used during traversal. In the directed case a cycle * is always detected before reusing an edge, so no special logic is required. In the undirected * case, we must take care not to "backtrack" over an edge (i.e. going from A to B and then going * from B to A). */ private static boolean canTraverseWithoutReusingEdge(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 21.2K bytes - Viewed (0)