- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 116 for RANGE (0.12 sec)
-
cmd/endpoint-ellipses.go
return layout, errInvalidArgument } for _, list := range pools { var endpointsList endpointsList for _, arg := range list.args { switch { case ellipses.HasList(arg): patterns, err := ellipses.FindListPatterns(arg) if err != nil { return layout, err } for _, exp := range patterns.Expand() { for _, ep := range exp { if err := endpointsList.add(ep); err != nil {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 14.7K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeSet.java
} /** * Returns an immutable range set containing the specified single range. If {@link Range#isEmpty() * range.isEmpty()}, this is equivalent to {@link ImmutableRangeSet#of()}. */ public static <C extends Comparable> ImmutableRangeSet<C> of(Range<C> range) { checkNotNull(range); if (range.isEmpty()) { return of(); } else if (range.equals(Range.all())) { return all(); } else {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 27.2K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableRangeMap.java
return null; } else { Range<K> range = ranges.get(index); return range.contains(key) ? Maps.immutableEntry(range, values.get(index)) : null; } } @Override public Range<K> span() { if (ranges.isEmpty()) { throw new NoSuchElementException(); } Range<K> firstRange = ranges.get(0); Range<K> lastRange = ranges.get(ranges.size() - 1);
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 14.5K bytes - Viewed (0) -
scan.go
if db.Statement.Schema != nil { for idx, name := range columns { if field := db.Statement.Schema.LookUpField(name); field != nil { values[idx] = reflect.New(reflect.PtrTo(field.FieldType)).Interface() continue } values[idx] = new(interface{}) } } else if len(columnTypes) > 0 { for idx, columnType := range columnTypes { if columnType.ScanType() != nil {
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Fri Apr 26 09:53:11 GMT 2024 - 9.8K bytes - Viewed (0) -
migrator/migrator.go
} var ( parseIndexes = stmt.Schema.ParseIndexes() parseCheckConstraints = stmt.Schema.ParseCheckConstraints() ) for _, dbName := range stmt.Schema.DBNames { var foundColumn gorm.ColumnType for _, columnType := range columnTypes { if columnType.Name() == dbName { foundColumn = columnType break } } if foundColumn == nil {
Go - Registered: Sun May 05 09:35:13 GMT 2024 - Last Modified: Fri Apr 26 07:15:49 GMT 2024 - 29K bytes - Viewed (0) -
cmd/format-erasure_test.go
for i, format := range formats { if format == nil { continue } h := sha256.New() for _, set := range format.Erasure.Sets { for _, diskID := range set { h.Write([]byte(diskID)) } } formatHashes[i] = hex.EncodeToString(h.Sum(nil)) } formatCountMap := make(map[string]int) for _, hash := range formatHashes { if hash == "" { continue
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Mon Apr 15 08:25:46 GMT 2024 - 12.9K bytes - Viewed (0) -
cmd/format-erasure.go
newFormats := make([][]*formatErasureV3, setCount) for i := range refFormat.Erasure.Sets { newFormats[i] = make([]*formatErasureV3, setDriveCount) } currentDisksInfo := make([][]DiskInfo, setCount) for i := range refFormat.Erasure.Sets { currentDisksInfo[i] = make([]DiskInfo, setDriveCount) } for i := range refFormat.Erasure.Sets { for j := range refFormat.Erasure.Sets[i] {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri May 03 15:54:03 GMT 2024 - 23.2K bytes - Viewed (0) -
cmd/erasure-metadata.go
h.Reset() } } metaHashCountMap := make(map[string]int) for _, hash := range metaHashes { if hash == "" { continue } metaHashCountMap[hash]++ } maxHash := "" maxCount := 0 for hash, count := range metaHashCountMap { if count > maxCount { maxCount = count maxHash = hash } } if maxCount < quorum {
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Sun Apr 28 17:53:50 GMT 2024 - 19.2K bytes - Viewed (1) -
cmd/metacache-entries.go
for i, entry := range m { if entry.name != "" { n++ if first == nil { first = &m[i] } } } return first, n } // names will return all names in order. // Since this allocates it should not be used in critical functions. func (m metaCacheEntries) names() []string { res := make([]string, 0, len(m)) for _, obj := range m { res = append(res, obj.name) }
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Fri Apr 19 16:43:43 GMT 2024 - 23.2K bytes - Viewed (0) -
cmd/erasure-server-pool-decom.go
} return false } func (pd *PoolDecommissionInfo) isBucketDecommissioned(bucket string) bool { for _, b := range pd.DecommissionedBuckets { if b == bucket { return true } } return false } func (pd *PoolDecommissionInfo) bucketPush(bucket decomBucketInfo) { for _, b := range pd.QueuedBuckets { if pd.isBucketDecommissioned(b) { return } if b == bucket.String() { return
Go - Registered: Sun May 05 19:28:20 GMT 2024 - Last Modified: Wed May 01 15:18:21 GMT 2024 - 41.5K bytes - Viewed (1)