- Sort Score
- Num 10 results
- Language All
Results 1 - 10 of 18 for precomputed (0.14 seconds)
-
android/guava-tests/test/com/google/common/base/CharMatcherTest.java
reallyTestNoMatchThenMatch(matcher.precomputed().negate(), s); } private void doTestNoMatchThenMatch(CharMatcher matcher, String s) { reallyTestNoMatchThenMatch(matcher, s); reallyTestMatchThenNoMatch(matcher.negate(), s); reallyTestNoMatchThenMatch(matcher.precomputed(), s); reallyTestMatchThenNoMatch(matcher.negate().precomputed(), s);
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Fri Mar 13 13:01:07 GMT 2026 - 32.4K bytes - Click Count (0) -
guava-gwt/src-super/com/google/common/base/super/com/google/common/base/Platform.java
/** * @author Jesse Wilson */ final class Platform { static CharMatcher precomputeCharMatcher(CharMatcher matcher) { // CharMatcher.precomputed() produces CharMatchers that are maybe a little // faster (and that's debatable), but definitely more memory-hungry. We're // choosing to turn .precomputed() into a no-op in GWT, because it doesn't // seem to be a worthwhile tradeoff in a browser. return matcher; }Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Mon Feb 03 21:52:39 GMT 2025 - 2.2K bytes - Click Count (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* memory, so it is only likely to be worthwhile if the precomputed matcher is queried very often. * * <p>This method has no effect (returns {@code this}) when called in GWT: it's unclear whether a * precomputed matcher is faster, but it certainly would consume more memory (which doesn't seem * like a worthwhile tradeoff in a browser). */ public CharMatcher precomputed() { return Platform.precomputeCharMatcher(this); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 53.9K bytes - Click Count (0) -
guava/src/com/google/common/base/CharMatcher.java
* memory, so it is only likely to be worthwhile if the precomputed matcher is queried very often. * * <p>This method has no effect (returns {@code this}) when called in GWT: it's unclear whether a * precomputed matcher is faster, but it certainly would consume more memory (which doesn't seem * like a worthwhile tradeoff in a browser). */ public CharMatcher precomputed() { return Platform.precomputeCharMatcher(this); }
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Thu Jan 29 22:14:05 GMT 2026 - 54.4K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
lookup table for variable-base, constant-time scalar muls. type projLookupTable struct { points [8]projCached } // A precomputed lookup table for fixed-base, constant-time scalar muls. type affineLookupTable struct { points [8]affineCached } // A dynamic lookup table for variable-base, variable-time scalar muls. type nafLookupTable5 struct { points [8]projCached } // A precomputed lookup table for fixed-base, variable-time scalar muls. type nafLookupTable8 struct { points [64]affineCached } // Constructors....Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
lib/fips140/v1.26.0.zip
lookup table for variable-base, constant-time scalar muls. type projLookupTable struct { points [8]projCached } // A precomputed lookup table for fixed-base, constant-time scalar muls. type affineLookupTable struct { points [8]affineCached } // A dynamic lookup table for variable-base, variable-time scalar muls. type nafLookupTable5 struct { points [8]projCached } // A precomputed lookup table for fixed-base, variable-time scalar muls. type nafLookupTable8 struct { points [64]affineCached } // Constructors....Created: Tue Apr 07 11:13:11 GMT 2026 - Last Modified: Thu Jan 08 17:58:32 GMT 2026 - 660.3K bytes - Click Count (0) -
android/guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
void pollAndAdd(int reps) { for (int i = 0; i < reps; i++) { // TODO(kevinb): precompute random #s? queue.add(queue.poll() ^ random.nextInt()); } } @Benchmark void populate(int reps) { for (int i = 0; i < reps; i++) { queue.clear(); for (int j = 0; j < size; j++) { // TODO(kevinb): precompute random #s? queue.add(random.nextInt()); } } } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 4.4K bytes - Click Count (0) -
guava-tests/benchmark/com/google/common/collect/MinMaxPriorityQueueBenchmark.java
void pollAndAdd(int reps) { for (int i = 0; i < reps; i++) { // TODO(kevinb): precompute random #s? queue.add(queue.poll() ^ random.nextInt()); } } @Benchmark void populate(int reps) { for (int i = 0; i < reps; i++) { queue.clear(); for (int j = 0; j < size; j++) { // TODO(kevinb): precompute random #s? queue.add(random.nextInt()); } } } /**
Created: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Sun Dec 22 03:38:46 GMT 2024 - 4.4K bytes - Click Count (0) -
build-tools-internal/src/main/groovy/elasticsearch.local-distribution.gradle
* The local distribution will be installed to * build/distributions/local * */ import org.elasticsearch.gradle.Architecture // gradle has an open issue of failing applying plugins in // precompiled script plugins (see https://github.com/gradle/gradle/issues/17004) // apply plugin:'elasticsearch.internal-distribution-download' elasticsearch_distributions { local { type = 'archive'
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Tue Jun 01 09:19:30 GMT 2021 - 1.1K bytes - Click Count (0) -
build-tools-internal/src/main/groovy/elasticsearch.run.gradle
* Side Public License, v 1. */ import org.elasticsearch.gradle.VersionProperties import org.elasticsearch.gradle.testclusters.RunTask // gradle has an open issue of failing applying plugins in // precompiled script plugins (see https://github.com/gradle/gradle/issues/17004) // apply plugin: 'elasticsearch.internal-testclusters' testClusters.register("runTask") {
Created: Wed Apr 08 16:19:15 GMT 2026 - Last Modified: Thu Sep 23 07:45:59 GMT 2021 - 1.8K bytes - Click Count (0)