- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 68 for sortable (0.16 sec)
-
android/guava/src/com/google/common/graph/UndirectedGraphConnections.java
switch (incidentEdgeOrder.type()) { case UNORDERED: return new UndirectedGraphConnections<>( new HashMap<N, V>(INNER_CAPACITY, INNER_LOAD_FACTOR)); case STABLE: return new UndirectedGraphConnections<>( new LinkedHashMap<N, V>(INNER_CAPACITY, INNER_LOAD_FACTOR)); default: throw new AssertionError(incidentEdgeOrder.type()); } }
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Oct 06 00:47:57 GMT 2021 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
* * <ul> * <li>{@code n - 1}, with approximate probability {@code 1/n} * <li>{@code consistentHash(h, n - 1)}, otherwise (probability {@code 1 - 1/n}) * </ul> * * <p>This method is suitable for the common use case of dividing work among buckets that meet the * following conditions: * * <ul> * <li>You want to assign the same fraction of inputs to each bucket.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableList.java
return construct(elements.clone()); } } /** * Returns an immutable list containing the given elements, sorted according to their natural * order. The sorting algorithm used is stable, so elements that compare as equal will stay in the * order in which they appear in the input. * * <p>If your data has no duplicates, or you wish to deduplicate elements, use {@code
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 30K bytes - Viewed (1) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* <li>10 levels: average of 184ns per lock()/unlock() * <li>20 levels: average of 393ns per lock()/unlock() * </ul> * </ul> * * <p>As such, the CycleDetectingLockFactory may not be suitable for performance-critical * applications which involve tightly-looped or deeply-nested locking algorithms. * * @author Darick Tong * @since 13.0 */ @J2ktIncompatible @GwtIncompatible
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/ArrayBasedEscaperMap.java
import com.google.common.annotations.GwtCompatible; import com.google.common.annotations.VisibleForTesting; import java.util.Collections; import java.util.Map; /** * An implementation-specific parameter class suitable for initializing {@link * ArrayBasedCharEscaper} or {@link ArrayBasedUnicodeEscaper} instances. This class should be used * when more than one escaper is created using the same character replacement mapping to allow the
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 18 20:55:09 GMT 2022 - 3.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/StandardRowSortedTable.java
@GwtCompatible @ElementTypesAreNonnullByDefault class StandardRowSortedTable<R, C, V> extends StandardTable<R, C, V> implements RowSortedTable<R, C, V> { /* * TODO(jlevy): Consider adding headTable, tailTable, and subTable methods, * which return a Table view with rows keys in a given range. Create a * RowSortedTable subinterface with the revised methods? */ StandardRowSortedTable(
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Jul 15 15:41:16 GMT 2021 - 4.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/collect/ListsTest.java
fail("transformed list iterator is addable"); } catch (UnsupportedOperationException | IllegalStateException expected) { } try { iterator.set("1"); fail("transformed list iterator is settable"); } catch (UnsupportedOperationException | IllegalStateException expected) { } } public void testTransformIteratorRandomAccess() { List<Integer> fromList = Lists.newArrayList(SOME_LIST);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 17 16:33:44 GMT 2024 - 35.2K bytes - Viewed (0) -
guava/src/com/google/common/base/Stopwatch.java
* Stopwatch} requires object allocation and additional method calls, which can reduce the accuracy * of the elapsed times reported. {@code Stopwatch} is still suitable for logging and metrics where * reasonably accurate values are sufficient. If the uncommon case that you need to maximize * accuracy, use {@code System.nanoTime()} directly instead. * * <p>Basic usage: *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 23 15:09:35 GMT 2023 - 9.2K bytes - Viewed (0) -
guava/src/com/google/common/cache/Striped64.java
busyOffset = UNSAFE.objectFieldOffset(sk.getDeclaredField("busy")); } catch (Exception e) { throw new Error(e); } } /** * Returns a sun.misc.Unsafe. Suitable for use in a 3rd party package. Replace with a simple call * to Unsafe.getUnsafe when integrating into a jdk. * * @return a sun.misc.Unsafe */ @SuppressWarnings("removal") // b/318391980
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:40:56 GMT 2024 - 11.5K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* including those in many JDK classes. * * <p>{@code Object.hashCode} implementations tend to be very fast, but have weak collision * prevention and <i>no</i> expectation of bit dispersion. This leaves them perfectly suitable for * use in hash tables, because extra collisions cause only a slight performance hit, while poor bit * dispersion is easily corrected using a secondary hash function (which all reasonable hash table
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0)