- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 1,003 for Implementation (0.22 sec)
-
staging/src/k8s.io/cli-runtime/pkg/printers/yaml.go
package printers import ( "fmt" "io" "reflect" "sync/atomic" "sigs.k8s.io/yaml" metav1 "k8s.io/apimachinery/pkg/apis/meta/v1" "k8s.io/apimachinery/pkg/runtime" ) // YAMLPrinter is an implementation of ResourcePrinter which outputs an object as YAML. // The input object is assumed to be in the internal version of an API and is converted // to the given version first.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jun 02 14:15:25 UTC 2022 - 2.5K bytes - Viewed (0) -
pkg/kube/krt/internal.go
ak, ok := any(a).(Equaler[O]) if ok { return ak.Equals(b) } pk, ok := any(&a).(Equaler[O]) if ok { return pk.Equals(b) } // Future improvement: add a default Kubernetes object implementation // ResourceVersion is tempting but probably not safe. If we are comparing objects from the API server its fine, // but often we will be operating on types generated by the controller itself.
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Fri May 10 23:33:56 UTC 2024 - 5.6K bytes - Viewed (0) -
src/sort/zsortfunc.go
// The algorithm based on pattern-defeating quicksort(pdqsort), but without the optimizations from BlockQuicksort. // pdqsort paper: https://arxiv.org/pdf/2106.05123.pdf // C++ implementation: https://github.com/orlp/pdqsort // Rust implementation: https://docs.rs/pdqsort/latest/pdqsort/ // limit is the number of allowed bad (very unbalanced) pivots before falling back to heapsort. func pdqsort_func(data lessSwap, a, b, limit int) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 13 20:16:24 UTC 2022 - 11.5K bytes - Viewed (0) -
pkg/proxy/conntrack/cleanup_test.go
// We need to construct a proxy.ServicePortMap to pass to CleanStaleEntries. // ServicePortMap is just map[string]proxy.ServicePort, but there are no public // constructors for any implementation of proxy.ServicePort, so we have to either // provide our own implementation of that interface, or else use a // proxy.ServiceChangeTracker to construct them and fill in the map for us. sct := proxy.NewServiceChangeTracker(nil, v1.IPv4Protocol, nil, nil)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 15 18:09:05 UTC 2024 - 7.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/unix/syscall_darwin.go
} func xattrPointer(dest []byte) *byte { // It's only when dest is set to NULL that the OS X implementations of // getxattr() and listxattr() return the current sizes of the named attributes. // An empty byte array is not sufficient. To maintain the same behaviour as the // linux implementation, we wrap around the system calls and pass in NULL when // dest is empty. var destp *byte if len(dest) > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 10 16:32:44 UTC 2023 - 20.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/typeset.go
} if hasTerms { buf.WriteString(s.terms.String()) } buf.WriteString("}") return buf.String() } // ---------------------------------------------------------------------------- // Implementation // hasTerms reports whether the type set has specific type terms. func (s *_TypeSet) hasTerms() bool { return !s.terms.isEmpty() && !s.terms.isAll() } // subsetOf reports whether s1 ⊆ s2.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 13.6K bytes - Viewed (0) -
src/cmd/asm/internal/lex/slice.go
// position to discover whether there is a blank before the parenthesis. // We only get here if defining a macro inside a macro. // This imperfect implementation means we cannot tell the difference between // #define A #define B(x) x // and // #define A #define B (x) x // The first definition of B has an argument, the second doesn't. Because we let
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 29 22:49:50 UTC 2023 - 1.6K bytes - Viewed (0) -
src/io/fs/readdir.go
// license that can be found in the LICENSE file. package fs import ( "errors" "internal/bytealg" "slices" ) // ReadDirFS is the interface implemented by a file system // that provides an optimized implementation of [ReadDir]. type ReadDirFS interface { FS // ReadDir reads the named directory // and returns a list of directory entries sorted by filename. ReadDir(name string) ([]DirEntry, error) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 1.9K bytes - Viewed (0) -
cmd/kubeadm/app/util/dryrun/dryrun.go
} fmt.Fprintf(w, "[dryrun] Would write file %q with content:\n", outputFilePath) apiclient.PrintBytesWithLinePrefix(w, fileBytes, "\t") } return errorsutil.NewAggregate(errs) } // Waiter is an implementation of apiclient.Waiter that should be used for dry-running type Waiter struct{} // NewWaiter returns a new Waiter object that talks to the given Kubernetes cluster func NewWaiter() apiclient.Waiter { return &Waiter{} }
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat Jun 01 07:10:31 UTC 2024 - 6.5K bytes - Viewed (0) -
pkg/kubelet/cm/topologymanager/bitmask/bitmask.go
bits = append(bits, int(i)) } } return bits } // And is a package level implementation of 'and' between first and masks func And(first BitMask, masks ...BitMask) BitMask { s := *first.(*bitMask) s.And(masks...) return &s } // Or is a package level implementation of 'or' between first and masks func Or(first BitMask, masks ...BitMask) BitMask { s := *first.(*bitMask)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Nov 03 09:45:09 UTC 2022 - 5.1K bytes - Viewed (0)