- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for detector (0.15 sec)
-
guava/src/com/google/common/base/Throwables.java
throw new RuntimeException(throwable); } /** * Returns the innermost cause of {@code throwable}. The first throwable in a chain provides * context from when the error or exception was initially detected. Example usage: * * <pre> * assertEquals("Unable to assign a customer id", Throwables.getRootCause(e).getMessage()); * </pre> *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
throw new RuntimeException(throwable); } /** * Returns the innermost cause of {@code throwable}. The first throwable in a chain provides * context from when the error or exception was initially detected. Example usage: * * <pre> * assertEquals("Unable to assign a customer id", Throwables.getRootCause(e).getMessage()); * </pre> *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSet.java
} maxRunBeforeFallback = maxRunBeforeFallback(newTableSize); expandTableThreshold = (int) (DESIRED_LOAD_FACTOR * newTableSize); } /** * We attempt to detect deliberate hash flooding attempts. If one is detected, we fall back to a * wrapper around j.u.HashSet, which has built-in flooding protection. MAX_RUN_MULTIPLIER was * determined experimentally to match our desired probability of false positives.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 35.4K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsTest.java
assertEquals("2", iterator.next()); assertEquals("3", iterator.next()); assertEquals("4", iterator.next()); assertEquals(4, iterator.nextIndex()); try { iterator.next(); fail("did not detect end of list"); } catch (NoSuchElementException expected) { } assertEquals(3, iterator.previousIndex()); assertEquals("4", iterator.previous()); assertEquals("3", iterator.previous());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
private void appendUserObject(StringBuilder builder, @CheckForNull Object o) { // This is some basic recursion detection for when people create cycles via set/setFuture or // when deep chains of futures exist resulting in a StackOverflowException. We could detect // arbitrary cycles using a thread local but this should be a good enough solution (it is also // what jdk collections do in these cases)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/ListsTest.java
assertEquals("2", iterator.next()); assertEquals("3", iterator.next()); assertEquals("4", iterator.next()); assertEquals(4, iterator.nextIndex()); try { iterator.next(); fail("did not detect end of list"); } catch (NoSuchElementException expected) { } assertEquals(3, iterator.previousIndex()); assertEquals("4", iterator.previous()); assertEquals("3", iterator.previous());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
list.subList(k, list.size()).clear(); } list.trimToSize(); return Collections.unmodifiableList(list); } else { TopKSelector<E> selector = TopKSelector.least(k, this); selector.offerAll(iterator); return selector.topK(); } } /** * Returns the {@code k} greatest elements of the given iterable according to this ordering, in
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) -
android/guava/src/com/google/common/graph/Graphs.java
} visitedNodes.put(node, NodeVisitState.COMPLETE); return false; } /** * 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). */
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) -
guava-tests/test/com/google/common/collect/ArrayTableTest.java
@Override protected ArrayTable<String, Integer, Character> create(@Nullable Object... data) { // TODO: Specify different numbers of rows and columns, to detect problems // that arise when the wrong size is used. ArrayTable<String, Integer, Character> table = ArrayTable.create(asList("foo", "bar", "cat"), asList(1, 2, 3)); populate(table, data); return table;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:54:11 GMT 2024 - 17.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ArrayTableTest.java
@Override protected ArrayTable<String, Integer, Character> create(@Nullable Object... data) { // TODO: Specify different numbers of rows and columns, to detect problems // that arise when the wrong size is used. ArrayTable<String, Integer, Character> table = ArrayTable.create(asList("foo", "bar", "cat"), asList(1, 2, 3)); populate(table, data); return table;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Mar 04 16:54:11 GMT 2024 - 17.5K bytes - Viewed (0)