- Sort Score
- Result 10 results
- Languages All
Results 421 - 430 of 527 for Once (0.02 sec)
-
android/guava/src/com/google/common/collect/Multisets.java
* Elements are added in encounter order. * * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the element * will be added more than once, with the count summed over all appearances of the element. * * <p>Note that {@code stream.collect(toMultiset(function, e -> 1, supplier))} is equivalent to
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 41.7K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Ints.java
// The Dolphin algorithm is attractive because it does the fewest array reads and writes: each // array slot is read and written exactly once. However, it can have very poor memory locality: // benchmarking shows it can take 7 times longer than the other two in some cases. The other two
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Fri Oct 25 18:05:56 UTC 2024 - 31K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Streams.java
return false; } }, isParallel) .onClose(streamA::close) .onClose(streamB::close); } /** * Invokes {@code consumer} once for each pair of <i>corresponding</i> elements in {@code streamA} * and {@code streamB}. If one stream is longer than the other, the extra elements are silently
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Thu Oct 31 14:20:11 UTC 2024 - 37.4K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
assertFalse(powerSet(makeSetOfZeroToTwentyNine()).contains(ImmutableSet.of(30))); } private static Set<Integer> makeSetOfZeroToTwentyNine() { // TODO: use Range once it's publicly available Set<Integer> zeroToTwentyNine = newHashSet(); for (int i = 0; i < 30; i++) { zeroToTwentyNine.add(i); } return zeroToTwentyNine; }
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Wed Oct 30 16:15:19 UTC 2024 - 48.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multisets.java
* Elements are added in encounter order. * * <p>If the mapped elements contain duplicates (according to {@link Object#equals}), the element * will be added more than once, with the count summed over all appearances of the element. * * <p>Note that {@code stream.collect(toMultiset(function, e -> 1, supplier))} is equivalent to
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 41.5K bytes - Viewed (0) -
doc/go1.17_spec.html
</p> <p> The range expression <code>x</code> is evaluated once before beginning the loop, with one exception: if at most one iteration variable is present and <code>len(x)</code> is <a href="#Length_and_capacity">constant</a>, the range expression is not evaluated. </p> <p> Function calls on the left are evaluated once per iteration. For each iteration, iteration values are produced as follows
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Thu Oct 10 18:25:45 UTC 2024 - 211.6K bytes - Viewed (0) -
src/bytes/bytes.go
// is too large we are basically just thrashing the CPU D-cache. // So if the result length is larger than an empirically-found // limit (8KB), we stop growing the source string once the limit // is reached and keep reusing the same source string - that // should therefore be always resident in the L1 cache - until we // have completed the construction of the result.
Registered: Tue Nov 05 11:13:11 UTC 2024 - Last Modified: Tue Sep 03 20:55:15 UTC 2024 - 35.6K bytes - Viewed (0) -
fess-crawler/src/test/resources/ajax/js/jquery-2.1.1.min.js
b||[],b=[a,b.slice?b.slice():b],d?i.push(b):j(b)),this},fire:function(){return k.fireWith(this,arguments),this},fired:function(){return!!c}};return k},n.extend({Deferred:function(a){var b=[["resolve","done",n.Callbacks("once memory"),"resolved"],["reject","fail",n.Callbacks("once memory"),"rejected"],["notify","progress",n.Callbacks("memory")]],c="pending",d={state:function(){return c},always:function(){return e.done(arguments).fail(arguments),this},then:function(){var a=arguments;return n.Defer...
Registered: Sun Nov 10 03:50:12 UTC 2024 - Last Modified: Sun Oct 11 02:16:55 UTC 2015 - 82.3K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Maps.java
* TODO(cpovirk): Consider checking onlyOnRight.containsKey instead of right.containsKey. * That could change behavior if the input maps use different equivalence relations (and so * a key that appears once in `right` might appear multiple times in `left`). We don't * guarantee behavior in that case, anyway, and the current behavior is likely undesirable.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 161.6K bytes - Viewed (0) -
guava/src/com/google/common/collect/Maps.java
* TODO(cpovirk): Consider checking onlyOnRight.containsKey instead of right.containsKey. * That could change behavior if the input maps use different equivalence relations (and so * a key that appears once in `right` might appear multiple times in `left`). We don't * guarantee behavior in that case, anyway, and the current behavior is likely undesirable.
Registered: Fri Nov 01 12:43:10 UTC 2024 - Last Modified: Sat Oct 19 00:05:46 UTC 2024 - 167.4K bytes - Viewed (0)