- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 198 for Indexes (0.14 sec)
-
platforms/core-configuration/declarative-dsl-core/src/test/kotlin/org/gradle/internal/declarativedsl/parsing/BasicParsingTest.kt
val expected = """ Assignment [indexes: 0..5, line/column: 1/1..1/6, file: test] ( lhs = PropertyAccess [indexes: 0..1, line/column: 1/1..1/2, file: test] ( name = a ) rhs = IntLiteral [indexes: 4..5, line/column: 1/5..1/6, file: test] (1) ) Assignment [indexes: 6..16, line/column: 2/1..2/11, file: test] (
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Tue May 14 22:06:18 UTC 2024 - 19.1K bytes - Viewed (0) -
staging/src/k8s.io/api/batch/v1/types_swagger_doc_generated.go
"succeededIndexes": "succeededIndexes specifies the set of indexes which need to be contained in the actual set of the succeeded indexes for the Job. The list of indexes must be within 0 to \".spec.completions-1\" and must not contain duplicates. At least one element is required. The indexes are represented as intervals separated by commas. The intervals can be a decimal integer or a pair of decimal integers separated by a...
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 12:01:28 UTC 2024 - 27.5K bytes - Viewed (0) -
staging/src/k8s.io/api/batch/v1/types.go
type SuccessPolicyRule struct { // succeededIndexes specifies the set of indexes // which need to be contained in the actual set of the succeeded indexes for the Job. // The list of indexes must be within 0 to ".spec.completions-1" and // must not contain duplicates. At least one element is required. // The indexes are represented as intervals separated by commas.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 05 18:37:07 UTC 2024 - 40.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/mod/sumdb/tlog/tile.go
size = 1 << uint(t.H) } start := t.N << uint(t.H) indexes := make([]int64, size) for i := 0; i < size; i++ { indexes[i] = StoredHashIndex(t.H*t.L, start+int64(i)) } hashes, err := r.ReadHashes(indexes) if err != nil { return nil, err } if len(hashes) != len(indexes) { return nil, fmt.Errorf("tlog: ReadHashes(%d indexes) = %d hashes", len(indexes), len(hashes)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 02:38:00 UTC 2024 - 13K bytes - Viewed (0) -
pkg/apis/batch/types.go
type SuccessPolicyRule struct { // succeededIndexes specifies the set of indexes // which need to be contained in the actual set of the succeeded indexes for the Job. // The list of indexes must be within 0 to ".spec.completions-1" and // must not contain duplicates. At least one element is required. // The indexes are represented as intervals separated by commas.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 12:01:28 UTC 2024 - 33K bytes - Viewed (0) -
staging/src/k8s.io/api/batch/v1/generated.proto
message SuccessPolicyRule { // succeededIndexes specifies the set of indexes // which need to be contained in the actual set of the succeeded indexes for the Job. // The list of indexes must be within 0 to ".spec.completions-1" and // must not contain duplicates. At least one element is required. // The indexes are represented as intervals separated by commas.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed May 29 12:01:28 UTC 2024 - 29.1K bytes - Viewed (0) -
cmd/endpoint-ellipses_test.go
} if !reflect.DeepEqual(testCase.indexes, gotIndexes) { t.Errorf("Expected %v, got %v", testCase.indexes, gotIndexes) } }) } } // Test tests calculating set indexes. func TestGetSetIndexes(t *testing.T) { testCases := []struct { args []string totalSizes []uint64 indexes [][]uint64 success bool }{ // Invalid inputs. {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 15.2K bytes - Viewed (0) -
pkg/controller/job/indexed_job_utils_test.go
if diff := cmp.Diff(tc.wantStatusIntervals, gotStatusIntervals); diff != "" { t.Errorf("Unexpected completed indexes from status (-want,+got):\n%s", diff) } if diff := cmp.Diff(tc.wantIntervals, gotIntervals); diff != "" { t.Errorf("Unexpected completed indexes (-want,+got):\n%s", diff) } }) } } func TestIsIndexFailed(t *testing.T) { logger, _ := ktesting.NewTestContext(t)
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Apr 24 18:25:29 UTC 2024 - 27.9K bytes - Viewed (0) -
src/text/template/funcs.go
// argument must be a string, slice, or array. func slice(item reflect.Value, indexes ...reflect.Value) (reflect.Value, error) { item = indirectInterface(item) if !item.IsValid() { return reflect.Value{}, fmt.Errorf("slice of untyped nil") } if len(indexes) > 3 { return reflect.Value{}, fmt.Errorf("too many slice indexes: %d", len(indexes)) } var cap int switch item.Kind() { case reflect.String:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 22:23:55 UTC 2024 - 20.9K bytes - Viewed (0) -
src/slices/iter.go
// The indexes range in the usual order, from 0 through len(s)-1. func All[Slice ~[]E, E any](s Slice) iter.Seq2[int, E] { return func(yield func(int, E) bool) { for i, v := range s { if !yield(i, v) { return } } } } // Backward returns an iterator over index-value pairs in the slice, // traversing it backward. The indexes range from len(s)-1 down to 0.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 21:40:32 UTC 2024 - 2.9K bytes - Viewed (0)