- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 496 for index (0.07 sec)
-
src/vendor/golang.org/x/crypto/internal/alias/alias.go
// corresponding) index. The memory beyond the slice length is ignored. func AnyOverlap(x, y []byte) bool { return len(x) > 0 && len(y) > 0 && uintptr(unsafe.Pointer(&x[0])) <= uintptr(unsafe.Pointer(&y[len(y)-1])) && uintptr(unsafe.Pointer(&y[0])) <= uintptr(unsafe.Pointer(&x[len(x)-1])) } // InexactOverlap reports whether x and y share memory at any non-corresponding
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 1.1K bytes - Viewed (0) -
src/strconv/bytealg_bootstrap.go
// Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. //go:build compiler_bootstrap package strconv // index returns the index of the first instance of c in s, or -1 if missing. func index(s string, c byte) int { for i := 0; i < len(s); i++ { if s[i] == c { return i } } return -1
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:27 UTC 2023 - 401 bytes - Viewed (0) -
pilot/pkg/serviceregistry/util/workloadinstances/selector.go
} } // FindAllInIndex returns a list of workload instances in the index // that match given predicate. // // The returned list is not ordered. func FindAllInIndex(index Index, predicate func(*model.WorkloadInstance) bool) []*model.WorkloadInstance { var instances []*model.WorkloadInstance index.ForEach(func(instance *model.WorkloadInstance) { if predicate(instance) {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri Apr 07 04:26:56 UTC 2023 - 1.4K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/internal/alias/alias_purego.go
// because the unsafe package and cgo are disallowed. import "reflect" // AnyOverlap reports whether x and y share memory at any (not necessarily // corresponding) index. The memory beyond the slice length is ignored. func AnyOverlap(x, y []byte) bool { return len(x) > 0 && len(y) > 0 && reflect.ValueOf(&x[0]).Pointer() <= reflect.ValueOf(&y[len(y)-1]).Pointer() &&
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 23:33:33 UTC 2023 - 1.2K bytes - Viewed (0) -
pkg/apis/core/pods/helpers.go
fldPath := specPath.Child("initContainers") for i := range podSpec.InitContainers { if !visitor(&podSpec.InitContainers[i], fldPath.Index(i)) { return false } } fldPath = specPath.Child("containers") for i := range podSpec.Containers { if !visitor(&podSpec.Containers[i], fldPath.Index(i)) { return false } } fldPath = specPath.Child("ephemeralContainers") for i := range podSpec.EphemeralContainers {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Jul 14 01:35:30 UTC 2023 - 3.2K bytes - Viewed (0) -
src/net/http/pprof/pprof_test.go
{"/debug/pprof/mutex", Index, http.StatusOK, "application/octet-stream", `attachment; filename="mutex"`, nil}, {"/debug/pprof/block?seconds=1", Index, http.StatusOK, "application/octet-stream", `attachment; filename="block-delta"`, nil}, {"/debug/pprof/goroutine?seconds=1", Index, http.StatusOK, "application/octet-stream", `attachment; filename="goroutine-delta"`, nil},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 07 19:52:28 UTC 2023 - 9.7K bytes - Viewed (0) -
src/vendor/golang.org/x/net/http2/hpack/tables.go
} // search finds f in the table. If there is no match, i is 0. // If both name and value match, i is the matched index and nameValueMatch // becomes true. If only name matches, i points to that index and // nameValueMatch becomes false. // // The returned index is a 1-based HPACK index. For dynamic tables, HPACK says // that index 1 should be the newest entry, but t.ents[0] is the oldest entry,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Nov 18 22:32:44 UTC 2022 - 7.5K bytes - Viewed (0) -
cmd/xl-storage-format-v1.go
// ParityBlocks is the number of parity blocks for erasure-coding ParityBlocks int `json:"parity"` // BlockSize is the size of one erasure-coded block BlockSize int64 `json:"blockSize"` // Index is the index of the current disk Index int `json:"index"` // Distribution is the distribution of the data and parity blocks Distribution []int `json:"distribution"` // Checksums holds all bitrot checksums of all erasure encoded blocks
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Apr 04 12:04:40 UTC 2024 - 8.2K bytes - Viewed (0) -
pkg/test/loadbalancersim/loadbalancer/edf.go
// Less implements heap.Interface/sort.Interface func (pq priorityQueue) Less(i, j int) bool { // Flip logic to make this a min queue. if pq[i].deadline == pq[j].deadline { return pq[i].index < pq[j].index } return pq[i].deadline < pq[j].deadline } // Swap implements heap.Interface/sort.Interface func (pq priorityQueue) Swap(i, j int) { pq[i], pq[j] = pq[j], pq[i] }
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Thu Jul 20 19:13:32 UTC 2023 - 2.8K bytes - Viewed (0) -
pkg/util/iptables/save_restore.go
// chain defined in that table. func GetChainsFromTable(save []byte) sets.Set[Chain] { chainsSet := sets.New[Chain]() for { i := bytes.Index(save, []byte("\n:")) if i == -1 { break } start := i + 2 save = save[start:] end := bytes.Index(save, []byte(" ")) if end == -1 { // shouldn't happen, but... break } chain := Chain(save[:end]) chainsSet.Insert(chain)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Dec 19 01:20:51 UTC 2023 - 1.4K bytes - Viewed (0)