- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 77 for x1 (0.06 sec)
-
guava/src/com/google/common/collect/Range.java
/* * For an explanation of the basic principle behind this check, see * https://stackoverflow.com/a/35754308/28465 * * In that explanation's notation, our `overlap` check would be `x1 < y2 && y1 < x2`. We've * flipped one part of the check so that we're using "less than" in both cases (rather than a * mix of "less than" and "greater than"). We've also switched to "strictly less than" rather
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
src/reflect/all_test.go
// Check that DeepEqual can look at unexported fields. x1 := UnexpT{map[int]int{1: 2}} x2 := UnexpT{map[int]int{1: 2}} if !DeepEqual(&x1, &x2) { t.Error("DeepEqual(x1, x2) = false, want true") } y1 := UnexpT{map[int]int{2: 3}} if DeepEqual(&x1, &y1) { t.Error("DeepEqual(x1, y1) = true, want false") } } var deepEqualPerfTests = []struct { x, y any
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 218.8K bytes - Viewed (0) -
src/cmd/compile/internal/typecheck/func.go
// supposing the closure captures an int i and a string s // and has one float64 argument and no results, // the generated code looks like: // // clos = &struct{F uintptr; X0 *int; X1 *string}{func.1, &i, &s} // // The use of the struct provides type information to the garbage // collector so that it can walk the closure. We could use (in this
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 06 15:23:18 UTC 2024 - 21.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Range.java
/* * For an explanation of the basic principle behind this check, see * https://stackoverflow.com/a/35754308/28465 * * In that explanation's notation, our `overlap` check would be `x1 < y2 && y1 < x2`. We've * flipped one part of the check so that we're using "less than" in both cases (rather than a * mix of "less than" and "greater than"). We've also switched to "strictly less than" rather
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 27.8K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/ir/tfl_ops.td
pruning away boxes that have high intersection-over-union (IOU) overlap with previously selected boxes. Bounding boxes with score less than `score_threshold` are removed. Bounding boxes are supplied as [y1, x1, y2, x2], where (y1, x1) and (y2, x2) are the coordinates of any diagonal pair of box corners and the coordinates can be provided as normalized (i.e., lying in the interval [0, 1]) or absolute. Note that this algorithm
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Jun 06 19:09:08 UTC 2024 - 186K bytes - Viewed (0) -
cmd/server_test.go
{getListObjectsV1URL(s.endPoint, bucketName, "", "1000", "url"), []string{"<Key>foo+bar+1</Key>", "<Key>foo+bar+2</Key>", "<Key>foo+%01+bar</Key>"}}, { getListObjectsV2URL(s.endPoint, bucketName, "", "1000", "", "", ""), []string{ "<Key>foo bar 1</Key>", "<Key>foo bar 2</Key>", "<Key>foo  bar</Key>",
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 115.3K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
changed = true } } if changed { r := *t r.Fields = &fields return &r } case *ast.StarExpr: // Pointer type. x1 := p.rewriteUnsafe(t.X) if x1 != t.X { r := *t r.X = x1 return &r } } return t } // rewriteRef rewrites all the C.xxx references in f.AST to refer to the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 07 12:37:15 UTC 2024 - 75.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/AbstractClosingFutureTest.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Tue May 07 12:37:15 UTC 2024 - 75.3K bytes - Viewed (0) -
src/crypto/sha256/sha256block_amd64.s
#define numBytes DX // input, number of input bytes to be processed #define sha256Constants AX // round contents from K256 table, indexed by round number x 32 #define msg X0 // input data #define state0 X1 // round intermediates and outputs #define state1 X2 #define m0 X3 // m0, m1,... m4 -- round message temps #define m1 X4 #define m2 X5 #define m3 X6 #define m4 X7
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 04 17:29:44 UTC 2024 - 47.3K bytes - Viewed (0)