- Sort Score
- Num 10 results
- Language All
Results 131 - 140 of 157 for varsa (0.02 seconds)
-
android/guava/src/com/google/common/collect/Tables.java
* calling {@code get(rowKey, columnKey)} on the original table. Updating the original table * changes the contents of the transposed table and vice versa. * * <p>The returned table supports update operations as long as the input table supports the * analogous operation with swapped rows and columns. For example, in a {@link HashBasedTable}Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 24.9K bytes - Click Count (0) -
okhttp/src/commonJvmAndroid/kotlin/okhttp3/internal/http2/Http2Connection.kt
Created: Fri Dec 26 11:42:13 GMT 2025 - Last Modified: Thu Jul 31 04:18:40 GMT 2025 - 31.8K bytes - Click Count (0) -
src/main/resources/fess_indices/_aws/fess.json
}, "swedish_keywords": { "type": "keyword_marker", "keywords": ["Hallå", "material", "sök"] }, "swedish_stemmer": {Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Jun 14 00:36:40 GMT 2025 - 117.3K bytes - Click Count (0) -
src/main/resources/fess_indices/_cloud/fess.json
}, "swedish_keywords": { "type": "keyword_marker", "keywords": ["Hallå", "material", "sök"] }, "swedish_stemmer": {Created: Sat Dec 20 09:19:18 GMT 2025 - Last Modified: Sat Feb 27 09:26:16 GMT 2021 - 117.3K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/MinMaxPriorityQueue.java
if (leftChildIndex < 0) { return -1; } return findMin(getLeftChildIndex(leftChildIndex), 4); } /** * Moves an element one level up from a min level to a max level (or vice versa). Returns the * new position of the element. */ int crossOverUp(int index, E x) { if (index == 0) { queue[0] = x; return 0; }
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Sep 22 18:35:44 GMT 2025 - 33.9K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactHashSet.java
* @author Jon Noack */ @GwtIncompatible // not worth using in GWT for now class CompactHashSet<E extends @Nullable Object> extends AbstractSet<E> implements Serializable { // TODO(user): cache all field accesses in local vars /** Creates an empty {@code CompactHashSet} instance. */ public static <E extends @Nullable Object> CompactHashSet<E> create() { return new CompactHashSet<>(); } /**
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Tue Jul 08 18:32:10 GMT 2025 - 24.7K bytes - Click Count (0) -
cmd/common-main.go
// in-place update is off. globalInplaceUpdateDisabled = strings.EqualFold(env.Get(config.EnvUpdate, config.EnableOn), config.EnableOff) // Check if the supported credential env vars, // "MINIO_ROOT_USER" and "MINIO_ROOT_PASSWORD" are provided // Warn user if deprecated environment variables, // "MINIO_ACCESS_KEY" and "MINIO_SECRET_KEY", are defined // Check all error conditions first
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Aug 29 02:39:48 GMT 2025 - 32.5K bytes - Click Count (3) -
guava/src/com/google/common/collect/ImmutableSet.java
* * (And I don't believe there's any situation in which we call x.combine(y) when x is a plain * ImmutableSet.Builder but y is an ImmutableSortedSet.Builder (or vice versa). Certainly * ImmutableSortedSet.Builder.combine() is written as if its argument will never be a plain * ImmutableSet.Builder: It casts immediately to ImmutableSortedSet.Builder.) */Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Fri Nov 07 16:09:47 GMT 2025 - 35.3K bytes - Click Count (0) -
guava/src/com/google/common/collect/AbstractMapBasedMultimap.java
} /** * Generates a decorated collection that remains consistent with the values in the multimap for * the provided key. Changes to the multimap may alter the returned collection, and vice versa. */ Collection<V> wrapCollection(@ParametricNullness K key, Collection<V> collection) { return new WrappedCollection(key, collection, null); } final List<V> wrapList(
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Mon Nov 17 22:50:48 GMT 2025 - 48.4K bytes - Click Count (0) -
src/archive/tar/common.go
} } return dst } // invertSparseEntries converts a sparse map from one form to the other. // If the input is sparseHoles, then it will output sparseDatas and vice-versa. // The input must have been already validated. // // This function mutates src and returns a normalized map where: // - adjacent fragments are coalesced together // - only the last fragment may be empty
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Tue Oct 07 19:46:36 GMT 2025 - 24.5K bytes - Click Count (0)