- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 65 for followers (0.17 sec)
-
android/guava/src/com/google/common/math/Quantiles.java
* computeInPlace} instead of {@code compute}. * * <h3>Definition and notes on interpolation</h3> * * <p>The definition of the kth q-quantile of N values is as follows: define x = k * (N - 1) / q; if * x is an integer, the result is the value which would appear at index x in the sorted dataset * (unless there are {@link Double#NaN NaN} values, see below); otherwise, the result is the average
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* semantics as the built-in Java language synchronization primitives. * * <p>A call to any of the <i>enter</i> methods with <b>void</b> return type should always be * followed immediately by a <i>try/finally</i> block to ensure that the current thread leaves the * monitor cleanly: * * <pre>{@code * monitor.enter(); * try { * // do things while occupying the monitor * } finally {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero * <i>if and only if</i> {@code a.equals(b)}. If this advice is not followed, the resulting * collection will not correctly obey its specification. * * <p>See the Guava User Guide article on <a href= * "https://github.com/google/guava/wiki/ImmutableCollectionsExplained">immutable collections</a>.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 36.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
a >>= aTwos; // divide out all 2s int bTwos = Long.numberOfTrailingZeros(b); b >>= bTwos; // divide out all 2s while (a != b) { // both a, b are odd // The key to the binary GCD algorithm is as follows: // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b). // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedMap.java
* equals</i>. That is, {@code a.compareTo(b)} or {@code comparator.compare(a, b)} should equal zero * <i>if and only if</i> {@code a.equals(b)}. If this advice is not followed, the resulting map will * not correctly obey its specification. * * <p>See the Guava User Guide article on <a href= * "https://github.com/google/guava/wiki/ImmutableCollectionsExplained">immutable collections</a>. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 53.2K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LongAdder.java
* concurrently updating. */ public void reset() { internalReset(0L); } /** * Equivalent in effect to {@link #sum} followed by {@link #reset}. This method may apply for * example during quiescent points between multithreaded computations. If there are updates * concurrent with this method, the returned value is not guaranteed to be the final
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 20 18:43:59 GMT 2021 - 5.4K bytes - Viewed (0) -
android/guava-testlib/src/com/google/common/testing/EqualsTester.java
* <li>the hash codes of any two equal objects are equal * </ul> * * <p>When a test fails, the error message labels the objects involved in the failed comparison as * follows: * * <ul> * <li>"{@code [group }<i>i</i>{@code , item }<i>j</i>{@code ]}" refers to the * <i>j</i><sup>th</sup> item in the <i>i</i><sup>th</sup> equality group, where both equality
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Tue Oct 31 19:11:50 GMT 2023 - 6K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RangeSet.java
*/ boolean encloses(Range<C> otherRange); /** * Returns {@code true} if for each member range in {@code other} there exists a member range in * this range set which {@linkplain Range#encloses encloses} it. It follows that {@code * this.contains(value)} whenever {@code other.contains(value)}. Returns {@code true} if {@code * other} is empty. *
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 9.8K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/AbstractMapBasedMultimap.java
keyIterator.remove(); } totalSize--; } } /** * {@inheritDoc} * * <p>The iterator generated by the returned collection traverses the values for one key, followed * by the values of a second key, and so on. */ @Override public Collection<V> values() { return super.values(); } @Override Collection<V> createValues() {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Fri Oct 13 14:11:58 GMT 2023 - 46.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
// protocol for completing a future is to assign the value field (which sets isDone to true) and // then to release waiters, followed by executing afterDone(), followed by releasing listeners. // That means that it is possible to observe that the future isDone and that your listeners // don't execute 'immediately'. By checking isDone here we avoid that.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0)