- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 64 for accumulate (0.14 sec)
-
guava/src/com/google/common/collect/ImmutableSet.java
static final int SPLITERATOR_CHARACTERISTICS = ImmutableCollection.SPLITERATOR_CHARACTERISTICS | Spliterator.DISTINCT; /** * Returns a {@code Collector} that accumulates the input elements into a new {@code * ImmutableSet}. Elements appear in the resulting set in the encounter order of the stream; if * the stream contains duplicates (according to {@link Object#equals(Object)}), only the firstRegistered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Fri Nov 07 16:09:47 UTC 2025 - 35.3K bytes - Viewed (0) -
docs/en/docs/deployment/docker.md
And as you would be building the container image again and again during development to check that your code changes are working, there's a lot of accumulated time this would save.
Registered: Sun Dec 28 07:19:09 UTC 2025 - Last Modified: Sat Sep 20 12:58:04 UTC 2025 - 29.5K bytes - Viewed (1) -
guava/src/com/google/common/cache/LocalCache.java
/** Measures time in a testable way. */ final Ticker ticker; /** Factory used to create new entries. */ final EntryFactory entryFactory; /** * Accumulates global cache statistics. Note that there are also per-segments stats counters which * must be aggregated to obtain a global stats view. */ final StatsCounter globalStatsCounter;
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Thu Sep 11 19:35:11 UTC 2025 - 148.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
checkEntryNotNull(key, value); enumMap.put(key, value); } return ImmutableEnumMap.asImmutable(enumMap); } /** * Returns a {@link Collector} that accumulates elements into an {@code ImmutableMap} whose keys * and values are the result of applying the provided mapping functions to the input elements. The
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Tue Sep 23 17:50:58 UTC 2025 - 157.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Maps.java
checkEntryNotNull(key, value); enumMap.put(key, value); } return ImmutableEnumMap.asImmutable(enumMap); } /** * Returns a {@link Collector} that accumulates elements into an {@code ImmutableMap} whose keys * and values are the result of applying the provided mapping functions to the input elements. The
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Nov 17 22:50:48 UTC 2025 - 163.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Sets.java
return ImmutableEnumSet.asImmutable(enumSet); } else { return ImmutableSet.of(); } } } /** * Returns a {@code Collector} that accumulates the input elements into a new {@code ImmutableSet} * with an implementation specialized for enums. Unlike {@link ImmutableSet#toImmutableSet}, the
Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 18:35:44 UTC 2025 - 81.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimaps.java
* specified supplier. The keys and values of the entries are the result of applying the provided * mapping functions to the input elements, accumulated in the encounter order of the stream. * * <p>Example: * * {@snippet : * static final ListMultimap<Character, String> FIRST_LETTER_MULTIMAP =Registered: Fri Dec 26 12:43:10 UTC 2025 - Last Modified: Mon Sep 22 18:35:44 UTC 2025 - 86.5K bytes - Viewed (0) -
lib/fips140/v1.0.0-c2097c7c.zip
x_1*16^0*B + x_3*16^2*B + ... + x_63*16^62*B) // // We use a lookup table for each i to get x_i*16^(2*i)*B // and do four doublings to multiply by 16. digits := x.signedRadix16() multiple := &affineCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} // Accumulate the odd components first v.Set(NewIdentityPoint()) for i := 1; i < 64; i += 2 { basepointTable[i/2].SelectInto(multiple, digits[i]) tmp1.AddAffine(v, multiple) v.fromP1xP1(tmp1) } // Multiply by 16 tmp2.FromP3(v) // tmp2 = v in P2 coords tmp1.Double(tmp2)...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Sep 25 19:53:19 UTC 2025 - 642.7K bytes - Viewed (0) -
lib/fips140/v1.1.0-rc1.zip
x_1*16^0*B + x_3*16^2*B + ... + x_63*16^62*B) // // We use a lookup table for each i to get x_i*16^(2*i)*B // and do four doublings to multiply by 16. digits := x.signedRadix16() multiple := &affineCached{} tmp1 := &projP1xP1{} tmp2 := &projP2{} // Accumulate the odd components first v.Set(NewIdentityPoint()) for i := 1; i < 64; i += 2 { basepointTable[i/2].SelectInto(multiple, digits[i]) tmp1.AddAffine(v, multiple) v.fromP1xP1(tmp1) } // Multiply by 16 tmp2.FromP3(v) // tmp2 = v in P2 coords tmp1.Double(tmp2)...
Registered: Tue Dec 30 11:13:12 UTC 2025 - Last Modified: Thu Dec 11 16:27:41 UTC 2025 - 663K bytes - Viewed (0) -
CHANGELOG/CHANGELOG-1.5.md
Registered: Fri Dec 26 09:05:12 UTC 2025 - Last Modified: Thu Dec 24 02:28:26 UTC 2020 - 136.4K bytes - Viewed (0)