- Sort Score
- Result 10 results
- Languages All
Results 81 - 90 of 112 for Walks (0.06 sec)
-
pkg/scheduler/framework/plugins/dynamicresources/dynamicresources_test.go
sort.Slice(objects, func(i, j int) bool { if objects[i].GetNamespace() < objects[j].GetNamespace() { return true } return objects[i].GetName() < objects[j].GetName() }) } // update walks through all existing objects, finds the corresponding update // function based on name and kind, and replaces those objects that have an // update function. The rest is left unchanged.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 27 07:57:10 UTC 2024 - 61.9K bytes - Viewed (0) -
staging/src/k8s.io/apiextensions-apiserver/test/integration/ratcheting_test.go
nil, // No need for selectable fields ) return func(new, old *unstructured.Unstructured) { _ = strategy.ValidateUpdate(context.TODO(), new, old) }, nil } // Recursively walks the provided directory and parses the YAML files into // unstructured objects. If there are more than one object in a single file, // they are all added to the returned slice.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue May 28 08:48:22 UTC 2024 - 59.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Iterators.java
* elements. */ @SafeVarargs public static <T extends @Nullable Object> Iterator<T> cycle(T... elements) { return cycle(Lists.newArrayList(elements)); } /** * Returns an Iterator that walks the specified array, nulling out elements behind it. This can * avoid memory leaks when an element is no longer necessary. * * <p>This method accepts an array with element type {@code @Nullable T}, but callers must pass an
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 03 14:46:32 UTC 2024 - 50.2K bytes - Viewed (0) -
guava/src/com/google/common/collect/Iterators.java
* elements. */ @SafeVarargs public static <T extends @Nullable Object> Iterator<T> cycle(T... elements) { return cycle(Lists.newArrayList(elements)); } /** * Returns an Iterator that walks the specified array, nulling out elements behind it. This can * avoid memory leaks when an element is no longer necessary. * * <p>This method accepts an array with element type {@code @Nullable T}, but callers must pass an
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 03 14:46:32 UTC 2024 - 50.2K bytes - Viewed (0) -
src/regexp/regexp.go
return m } // put returns a machine to the correct machine pool. func (re *Regexp) put(m *machine) { m.re = nil m.p = nil m.inputs.clear() matchPool[re.mpool].Put(m) } // minInputLen walks the regexp to find the minimum length of any matchable input. func minInputLen(re *syntax.Regexp) int { switch re.Op { default: return 0 case syntax.OpAnyChar, syntax.OpAnyCharNotNL, syntax.OpCharClass:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Feb 26 20:50:01 UTC 2024 - 38.5K bytes - Viewed (0) -
src/cmd/compile/internal/rangefunc/rewrite.go
tv := syntax.TypeAndValue{Type: obj.Type()} tv.SetIsValue() tv.SetIsRuntimeHelper() n.SetTypeInfo(tv) info.Uses[n] = obj return n } // setPos walks the top structure of x that has no position assigned // and assigns it all to have position pos. // When setPos encounters a syntax node with a position assigned, // setPos does not look inside that node.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:05:44 UTC 2024 - 41.6K bytes - Viewed (0) -
src/cmd/compile/internal/types/type.go
f := &Field{ Pos: pos, Sym: sym, Type: typ, Offset: BADWIDTH, } if typ == nil { base.Fatalf("typ is nil") } return f } // SubstAny walks t, replacing instances of "any" with successive // elements removed from types. It returns the substituted type. func SubstAny(t *Type, types *[]*Type) *Type { if t == nil { return nil } switch t.kind {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 04 14:29:45 UTC 2024 - 49.5K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
if forced { print(" (forced)") } else if scavenger.printControllerReset { print(" [controller reset]") scavenger.printControllerReset = false } println() printunlock() } // scavengeOne walks over the chunk at chunk index ci and searches for // a contiguous run of pages to scavenge. It will try to scavenge // at most max bytes at once, but may scavenge more to avoid
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
src/cmd/link/internal/ld/dwarf.go
return expandGoroot(fname) } // writeDirFileTables emits the portion of the DWARF line table // prologue containing the include directories and file names, // described in section 6.2.4 of the DWARF 4 standard. It walks the // filepaths for the unit to discover any common directories, which // are emitted to the directory table first, then the file table is // emitted after that.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 16:25:18 UTC 2024 - 72.4K bytes - Viewed (0) -
cmd/xl-storage.go
sync.RWMutex formatData []byte nrRequests uint64 major, minor uint32 fsType string immediatePurge chan string // mutex to prevent concurrent read operations overloading walks. rotational bool walkMu *sync.Mutex walkReadMu *sync.Mutex } // checkPathLength - returns error if given path name length more than 255 func checkPathLength(pathName string) error {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 85.3K bytes - Viewed (2)