- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 60 for expensive (0.2 sec)
-
guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
*/ public class MinMaxPriorityQueueBenchmark { @Param private ComparatorType comparator; // TODO(kevinb): add 1000000 back when we have the ability to throw // NotApplicableException in the expensive comparator case. @Param({"100", "10000"}) private int size; @Param private HeapType heap; private Queue<Integer> queue; private final Random random = new Random(); @BeforeExperiment
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 4.3K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/CharEscaper.java
int charsLeft = slen - lastEscape; if (charsLeft > 0) { int sizeNeeded = destIndex + charsLeft; if (destSize < sizeNeeded) { // Regrow and copy, expensive! No padding as this is the final copy. dest = growBuffer(dest, destIndex, sizeNeeded); } s.getChars(lastEscape, slen, dest, destIndex); destIndex = sizeNeeded; }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 18 20:55:09 GMT 2022 - 6.7K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/StandardNetwork.java
this.allowsSelfLoops = builder.allowsSelfLoops; this.nodeOrder = builder.nodeOrder.cast(); this.edgeOrder = builder.edgeOrder.cast(); // Prefer the heavier "MapRetrievalCache" for nodes if lookup is expensive. This optimizes // methods that access the same node(s) repeatedly, such as Graphs.removeEdgesConnecting(). this.nodeConnections = (nodeConnections instanceof TreeMap)
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jan 22 17:29:38 GMT 2024 - 6.9K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/collect/MapBenchmark.java
Map<Element, Element> map = mapToTest; Element[] queries = this.queries; // Allows us to use & instead of %, acting on hearsay that division // operators (/%) are disproportionately expensive; should test this too! int mask = queries.length - 1; boolean dummy = false; for (int i = 0; i < reps; i++) { dummy ^= map.get(queries[i & mask]) != null; } return dummy; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Apr 26 20:07:17 GMT 2023 - 7.6K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
*/ public class MinMaxPriorityQueueBenchmark { @Param private ComparatorType comparator; // TODO(kevinb): add 1000000 back when we have the ability to throw // NotApplicableException in the expensive comparator case. @Param({"100", "10000"}) private int size; @Param private HeapType heap; private Queue<Integer> queue; private final Random random = new Random(); @BeforeExperiment
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 4.3K bytes - Viewed (0) -
guava-gwt/test/com/google/common/GwtTestSuite.java
import junit.framework.TestCase; import java.io.IOException; /** * Runs all _gwt tests. Grouping them into a suite is much faster than running each as a one-test * "suite," as the per-suite setup is expensive. */ public class GwtTestSuite extends TestCase { public static Test suite() throws IOException { GWTTestSuite suite = new GWTTestSuite(); for (ClassInfo info
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Jun 23 13:24:59 GMT 2016 - 1.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/ComparisonChain.java
* inputs' {@link Comparable#compareTo compareTo} and {@link Comparator#compare compare} methods as * soon as one of them returns a nonzero result. This optimization is typically important only in * the presence of expensive {@code compareTo} and {@code compare} implementations. * * <p>See the Guava User Guide article on <a href= * "https://github.com/google/guava/wiki/CommonObjectUtilitiesExplained#comparecompareto">{@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Sep 21 17:28:11 GMT 2022 - 11.2K bytes - Viewed (0) -
guava/src/com/google/common/base/Suppliers.java
// // We use two volatile reads. We could reduce this to one by // putting our fields into a holder class, but (at least on x86) // the extra memory consumption and indirection are more // expensive than the extra volatile reads. long nanos = expirationNanos; long now = System.nanoTime(); if (nanos == 0 || now - nanos >= 0) { synchronized (this) {
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 15.3K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/RateLimiter.java
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 04 09:45:04 GMT 2023 - 18.2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AggregateFutureState.java
* consistency with how weak references are cleared). That's a behavior change -- arguably the * removal of a feature. * * Fortunately, exceptions rarely contain references to expensive resources. */ // seenExceptionsLocal = newConcurrentHashSet(); /* * Other handleException() callers may see this as soon as we publish it. We need to populate
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Dec 14 20:35:03 GMT 2023 - 8.5K bytes - Viewed (0)