- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 139 for Ismail (0.18 sec)
-
android/guava/src/com/google/common/collect/Sets.java
* using a {@code LinkedHashSet} instead, at the cost of increased memory footprint, to get * deterministic iteration behavior. * * <p>This method is just a small convenience, either for {@code newHashSet(}{@link Arrays#asList * asList}{@code (...))}, or for creating an empty set then calling {@link Collections#addAll}.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 77.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
Object[] newQueue = new Object[newCapacity]; System.arraycopy(queue, 0, newQueue, 0, queue.length); queue = newQueue; } } /** Returns ~2x the old capacity if small; ~1.5x otherwise. */ private int calculateNewCapacity() { int oldCapacity = queue.length; int newCapacity = (oldCapacity < 64) ? (oldCapacity + 1) * 2 : IntMath.checkedMultiply(oldCapacity / 2, 3);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 34K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/MoreExecutors.java
* been shutdown). * * <p>Although all tasks are immediately executed in the thread that submitted the task, this * {@code ExecutorService} imposes a small locking overhead on each task submission in order to * implement shutdown and termination behavior. * * <p>The implementation deviates from the {@code ExecutorService} specification with regards to
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 41.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/CharMatcher.java
* * <p>This implementation tries to be smart in a number of ways. It recognizes cases where the * negation is cheaper to precompute than the matcher itself; it tries to build small hash tables * for matchers that only match a few characters, and so on. In the worst-case scenario, it * constructs an eight-kilobyte bit array and queries that. In many situations this produces a
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Feb 09 15:49:48 GMT 2024 - 53.7K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/base/CharMatcherBenchmark.java
@Param({"0", "10", "50", "100"}) int percent; // Whether to use a precomputed CharMatcher @Param("true") boolean precomputed; enum Size { DEFAULT, SMALL; } @Param Size size; // Whether to ensure there is a matching character in the first position // to force the trimming code to run. @Param("false") boolean forceSlow;
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 194.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMakerInternalMap.java
int threshold; /** The per-segment table. */ @CheckForNull volatile AtomicReferenceArray<E> table; /** * A counter of the number of reads since the last write, used to drain queues on a small * fraction of read operations. */ final AtomicInteger readCount = new AtomicInteger(); Segment(MapMakerInternalMap<K, V, E, S> map, int initialCapacity) { this.map = map;
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 91.9K bytes - Viewed (0) -
src/main/java/org/codelibs/fess/sso/oic/OpenIdConnectAuthenticator.java
Java - Registered: Mon May 06 08:04:11 GMT 2024 - Last Modified: Thu Feb 22 01:37:57 GMT 2024 - 11.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/JSR166TestCase.java
* SMALL_DELAY_MS}, {@code MEDIUM_DELAY_MS}, {@code LONG_DELAY_MS}. The idea here is that a * SHORT is always discriminable from zero time, and always allows enough time for the small * amounts of computation (creating a thread, calling a few methods, etc) needed to reach a * timeout point. Similarly, a SMALL is always discriminable as larger than SHORT and smaller
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
Collection<Integer> indexes, int scale, double[] dataset); static double getMinValue(double[] array, int from) { // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the // method signature: we always search to the end of the array. int min = from; for (int i = from + 1; i < array.length; i++) { if (array[min] > array[i]) { min = i; }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/math/QuantilesAlgorithm.java
Collection<Integer> indexes, int scale, double[] dataset); static double getMinValue(double[] array, int from) { // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the // method signature: we always search to the end of the array. int min = from; for (int i = from + 1; i < array.length; i++) { if (array[min] > array[i]) { min = i; }
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Feb 01 16:30:37 GMT 2022 - 7.1K bytes - Viewed (0)