- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 116 for Indexes (0.31 sec)
-
pkg/controller/job/job_controller_test.go
{ Type: batch.JobFailed, Status: v1.ConditionTrue, Reason: batch.JobReasonFailedIndexes, Message: "Job has failed indexes", }, }, }, }, "job failed due to exceeding max failed indexes": { enableJobBackoffLimitPerIndex: true, job: batch.Job{ TypeMeta: metav1.TypeMeta{Kind: "Job"}, ObjectMeta: validObjectMeta,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 11 15:36:36 UTC 2024 - 229.2K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/storage/cacher/watch_cache.go
if err != nil { return nil, err } return objIndexFunc(seo) } } func storeElementIndexers(indexers *cache.Indexers) cache.Indexers { if indexers == nil { return cache.Indexers{} } ret := cache.Indexers{} for indexName, indexFunc := range *indexers { ret[indexName] = storeElementIndexFunc(indexFunc) } return ret } // watchCache implements a Store interface.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Tue Jun 11 10:20:57 UTC 2024 - 26.2K bytes - Viewed (0) -
src/math/rand/rand.go
m[i] = m[j] m[j] = i } return m } // Shuffle pseudo-randomizes the order of elements. // n is the number of elements. Shuffle panics if n < 0. // swap swaps the elements with indexes i and j. func (r *Rand) Shuffle(n int, swap func(i, j int)) { if n < 0 { panic("invalid argument to Shuffle") } // Fisher-Yates shuffle: https://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:09:08 UTC 2024 - 16.9K bytes - Viewed (0) -
samples/bookinfo/src/productpage/static/tailwind/tailwind.css
.end=this.source.end||{},Object.assign(this.source.end,this.last.source.end))},t.each=function(n){this.lastEach||(this.lastEach=0),this.indexes||(this.indexes={}),this.lastEach++;var a=this.lastEach;if(this.indexes[a]=0,!!this.length){for(var s,o;this.indexes[a]<this.length&&(s=this.indexes[a],o=n(this.at(s),s),o!==!1);)this.indexes[a]+=1;if(delete this.indexes[a],o===!1)return!1}},t.walk=function(n){return this.each(function(a,s){var o=n(a,s);if(o!==!1&&a.length&&(o=a.walk(n)),o===!1)return!1})...
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue May 28 14:48:01 UTC 2024 - 357.1K bytes - Viewed (1) -
JavadocStyleGuide.md
This fragment is very important: it is the only part of the text that appears in certain contexts such as class and method indexes: ```java /** * Returns an Image object that can then be painted on the screen. */ ``` ## 1.3 Code blocks and snippets `<pre>` is the default HTML tag for preformatted text.
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu Jun 06 15:43:07 UTC 2024 - 11.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/transforms/lower_static_tensor_list.cc
// function. llvm::SmallSet<int, 4> GetResizedTensorListIndexes( func::FuncOp func, const llvm::SmallSet<int, 4> &tensor_list_args) { // `indexes` stores the argument index of tensorlists which size may get // updated in the function. llvm::SmallSet<int, 4> indexes; for (BlockArgument &arg : func.getArguments()) { if (tensor_list_args.contains(arg.getArgNumber())) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Jun 11 20:00:43 UTC 2024 - 70.7K bytes - Viewed (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 := true if inconsistent > len(partsMetadata)/2 {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 12.5K bytes - Viewed (0) -
src/text/template/exec_test.go
{"out of range", "{{slice .SI 2 2 5}}", "", tVal, false}, {"len(s) < indexes < cap(s)", "{{slice .SICap 6 10}}", "[0 0 0 0]", tVal, true}, {"len(s) < indexes < cap(s)", "{{slice .SICap 6 10 10}}", "[0 0 0 0]", tVal, true}, {"indexes > cap(s)", "{{slice .SICap 10 11}}", "", tVal, false}, {"indexes > cap(s)", "{{slice .SICap 6 10 11}}", "", tVal, false}, {"array[:]", "{{slice .AI}}", "[3 4 5]", tVal, true},
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 22:23:55 UTC 2024 - 60.1K bytes - Viewed (0) -
cmd/endpoint.go
continue } foundSet.Add(endpoint.Hostname()) } } return foundSet.ToSlice() } // hostsSorted will return all hosts found. // The LOCAL host will be nil, but the indexes of all hosts should // remain consistent across the cluster. func (l EndpointServerPools) hostsSorted() []*xnet.Host { peers, localPeer := l.peers() sort.Strings(peers) hosts := make([]*xnet.Host, len(peers))
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 34.1K bytes - Viewed (0) -
src/cmd/go/internal/modload/init.go
readVendorList(VendorDir()) var indexes []*modFileIndex var modFiles []*modfile.File var modRoots []string for _, m := range MainModules.Versions() { indexes = append(indexes, MainModules.Index(m)) modFiles = append(modFiles, MainModules.ModFile(m)) modRoots = append(modRoots, MainModules.ModRoot(m)) } checkVendorConsistency(indexes, modFiles, modRoots) rs.initVendor(vendorList) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jun 06 18:36:30 UTC 2024 - 69.8K bytes - Viewed (0)