- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 152 for integration (0.15 sec)
-
guava/src/com/google/common/collect/HashBasedTable.java
import com.google.common.base.Supplier; import java.io.Serializable; import java.util.LinkedHashMap; import java.util.Map; /** * Implementation of {@link Table} using linked hash tables. This guarantees predictable iteration * order of the various views. * * <p>The views returned by {@link #column}, {@link #columnKeySet()}, and {@link #columnMap()} have
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Jan 24 17:47:51 GMT 2022 - 4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/LinkedHashMultimap.java
* across the key-value mappings in the order they were added to the multimap. * * <p>The iteration ordering of the collections generated by {@code keySet}, {@code keys}, and * {@code asMap} has a few subtleties. As long as the set of keys remains unchanged, adding or * removing mappings does not affect the key iteration order. However, if you remove all values
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 23.6K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
throwable.printStackTrace(new PrintWriter(stringWriter)); return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
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
throwable.printStackTrace(new PrintWriter(stringWriter)); return stringWriter.toString(); } /** * Returns the stack trace of {@code throwable}, possibly providing slower iteration over the full * trace but faster iteration over parts of the trace. Here, "slower" and "faster" are defined in * comparison to the normal way to access the stack trace, {@link Throwable#getStackTrace()
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) -
android/guava/src/com/google/common/graph/NetworkBuilder.java
public NetworkBuilder<N, E> expectedEdgeCount(int expectedEdgeCount) { this.expectedEdgeCount = Optional.of(checkNonNegative(expectedEdgeCount)); return this; } /** * Specifies the order of iteration for the elements of {@link Network#nodes()}. * * <p>The default value is {@link ElementOrder#insertion() insertion order}. */ public <N1 extends N> NetworkBuilder<N1, E> nodeOrder(ElementOrder<N1> nodeOrder) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Jun 03 01:21:31 GMT 2022 - 7.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/DenseImmutableTable.java
private final @Nullable V[][] values; // For each cell in iteration order, the index of that cell's row key in the row key list. @SuppressWarnings("Immutable") // We don't modify this after construction. private final int[] cellRowIndices; // For each cell in iteration order, the index of that cell's column key in the column key list.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Nov 30 21:54:06 GMT 2023 - 10K bytes - Viewed (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
import java.util.Spliterators; import javax.annotation.CheckForNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * CompactLinkedHashSet is an implementation of a Set, which a predictable iteration order that * matches the insertion order. All optional operations (adding and removing) are supported. All * elements, including {@code null}, are permitted. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Feb 05 21:38:59 GMT 2024 - 9.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multisets.java
return (Multiset<T>) iterable; } /** * Returns a copy of {@code multiset} as an {@link ImmutableMultiset} whose iteration order puts * the highest count first, with ties broken by the iteration order of the original multiset. * * @since 11.0 */ public static <E> ImmutableMultiset<E> copyHighestCountFirst(Multiset<E> multiset) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 41.7K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/collect/testing/ListTestSuiteBuilder.java
testers.add(ListSubListTester.class); testers.add(ListToArrayTester.class); return testers; } /** * Specifies {@link CollectionFeature#KNOWN_ORDER} for all list tests, since lists have an * iteration ordering corresponding to the insertion order. */ @Override public TestSuite createTestSuite() { withFeatures(KNOWN_ORDER); return super.createTestSuite(); } @Override
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Feb 26 19:46:10 GMT 2024 - 6.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/base/JoinerBenchmark.java
append = true; } dummy ^= sb.toString().length(); } return dummy; } /** * Starts with an empty delimiter and changes to the desired value at the end of the iteration. */ @Benchmark int assignDelimiter(int reps) { int dummy = 0; for (int i = 0; i < reps; i++) { StringBuilder sb = new StringBuilder(); String delim = "";
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 4.9K bytes - Viewed (0)