- Sort Score
- Num 10 results
- Language All
Results 51 - 60 of 89 for Indexed (0.49 seconds)
-
android/guava/src/com/google/common/collect/package-info.java
* values enables it to support an {@linkplain BiMap#inverse inverse view} -- which is another * instance of {@code BiMap}. * <dt>{@link Table} * <dd>A new type, which is similar to {@link java.util.Map}, but which indexes its values by an * ordered pair of keys, a row key and column key. * <dt>{@link Multiset} * <dd>An extension of {@link java.util.Collection} that may contain duplicate values like aCreated: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Sat Dec 21 14:50:24 GMT 2024 - 5K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashMap.java
* they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 8.4K bytes - Click Count (0) -
cmd/storage-interface.go
// Read all. ReadAll(ctx context.Context, volume string, path string) (buf []byte, err error) GetDiskLoc() (poolIdx, setIdx, diskIdx int) // Retrieve location indexes.
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Fri Apr 25 05:41:04 GMT 2025 - 5.3K bytes - Click Count (0) -
cmd/endpoint-ellipses.go
// divisor, it avoids loops. slices.Sort(setCounts) return setCounts } // getSetIndexes returns list of indexes which provides the set size // on each index, this function also determines the final set size // The final set size has the affinity towards choosing smaller // indexes (total sets)
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 14.7K bytes - Click Count (0) -
cmd/xl-storage-format-v1.go
// - erasure algorithm is different // - data blocks are different // - parity blocks are different // - block size is different // - distribution array size is different // - distribution indexes are different func (ei ErasureInfo) Equal(nei ErasureInfo) bool { if ei.Algorithm != nei.Algorithm { return false } if ei.DataBlocks != nei.DataBlocks { return false }
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Tue Oct 22 15:30:50 GMT 2024 - 8.4K bytes - Click Count (0) -
docs/en/mkdocs.yml
name: Switch to system preference features: - content.code.annotate - content.code.copy - content.footnote.tooltips - content.tabs.link - content.tooltips - navigation.footer - navigation.indexes - navigation.instant - navigation.instant.prefetch - navigation.instant.progress - navigation.path - navigation.tabs - navigation.tabs.sticky - navigation.top - navigation.tracking
Created: Sun Dec 28 07:19:09 GMT 2025 - Last Modified: Wed Dec 17 10:44:55 GMT 2025 - 9.2K bytes - Click Count (0) -
android/guava/src/com/google/common/collect/CompactLinkedHashSet.java
* they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.4K bytes - Click Count (0) -
guava/src/com/google/common/collect/CompactLinkedHashSet.java
* they're defined above -- including logic to add and subtract 1 to map between the values stored * in the predecessor/successor arrays and the indexes in the elements array that they identify. */
Created: Fri Dec 26 12:43:10 GMT 2025 - Last Modified: Wed Aug 06 14:59:07 GMT 2025 - 9.6K bytes - Click Count (0) -
cmd/kms-handlers.go
if err != nil { writeCustomErrorResponseJSON(ctx, w, errorCodes.ToAPIErr(ErrInternalError), err.Error(), r.URL) return } writeSuccessResponseJSON(w, resp) return } // 2. Verify that we can indeed decrypt the (encrypted) key decryptedKey, err := GlobalKMS.Decrypt(ctx, &kms.DecryptRequest{ Name: key.KeyID, Ciphertext: key.Ciphertext, AssociatedData: kmsContext, }) if err != nil {Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Aug 18 06:43:03 GMT 2024 - 10.1K bytes - Click Count (0) -
cmd/erasure-healing-common.go
// Erasure distribution seems to have lesser // number of items than number of online disks. inconsistent++ continue } if meta.Erasure.Distribution[i] != meta.Erasure.Index { // Mismatch indexes with distribution order inconsistent++ } } } erasureDistributionReliable := inconsistent <= len(partsMetadata)/2 metaErrs := make([]error, len(errs)) for i := range onlineDisks {
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 12K bytes - Click Count (0)