- Sort Score
- Result 10 results
- Languages All
Results 151 - 160 of 251 for Answers (0.23 sec)
-
src/runtime/debuglog_test.go
// make panic call a wrapper that is call printDebugLog if the // debuglog build tag is set, or otherwise do nothing. Then tests // could call printDebugLog directly. This is the right answer in // principle, but currently our linker reads in all symbols // regardless, so this would slow down and bloat all links. If the // linker gets more efficient about this, we should revisit this // approach.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 18 16:59:26 UTC 2022 - 4.9K bytes - Viewed (0) -
src/cmd/go/internal/bug/bug.go
if !web.OpenBrowser(url) { fmt.Print("Please file a new issue at golang.org/issue/new using this template:\n\n") fmt.Print(body) } } const bugHeader = `<!-- Please answer these questions before submitting your issue. Thanks! --> ` const bugFooter = `### What did you do? <!-- If possible, provide a recipe for reproducing the error. A complete runnable program is good.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 14:34:32 UTC 2024 - 5.7K bytes - Viewed (0) -
src/internal/fmtsort/sort.go
// If the types differ, it returns -1. // See the comment on Sort for the comparison rules. func compare(aVal, bVal reflect.Value) int { aType, bType := aVal.Type(), bVal.Type() if aType != bType { return -1 // No good answer possible, but don't return 0: they're not equal. } switch aVal.Kind() { case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64: return cmp.Compare(aVal.Int(), bVal.Int())
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 19:31:45 UTC 2024 - 4.9K bytes - Viewed (0) -
cmd/object-api-putobject_test.go
18: {bucketName: bucket, objName: object, inputData: nilBytes, inputMeta: map[string]string{"answer": "42"}, inputDataSize: int64(len(nilBytes)), expectedMd5: getMD5Hash(nilBytes)},
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Feb 22 06:26:06 UTC 2024 - 25.8K bytes - Viewed (0) -
guava/src/com/google/common/collect/ConcurrentHashMultiset.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Thu Feb 22 21:19:52 UTC 2024 - 20.9K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/server/filters/maxinflight.go
}() handler.ServeHTTP(w, r) default: // at this point we're about to return a 429, BUT not all actors should be rate limited. A system:master is so powerful // that they should always get an answer. It's a super-admin or a loopback connection. if currUser, ok := apirequest.UserFrom(ctx); ok { for _, group := range currUser.GetGroups() { if group == user.SystemPrivilegedGroup {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 08 11:34:15 UTC 2023 - 6.9K bytes - Viewed (0) -
src/math/gamma.go
-2.68132617805781232825e-03, 3.47222221605458667310e-03, 8.33333333333482257126e-02, } // Gamma function computed by Stirling's formula. // The pair of results must be multiplied together to get the actual answer. // The multiplication is left to the caller so that, if careful, the caller can avoid // infinity for 172 <= x <= 180. // The polynomial is valid for 33 <= x <= 172; larger values are only used
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 5.5K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/util/shufflesharding/shufflesharding_test.go
return } }) } } // ff computes the falling factorial `n!/(n-m)!` and requires n to be // positive and m to be in the range [0, n] and requires the answer to // fit in an int func ff(n, m int) int { ans := 1 for f := n; f > n-m; f-- { ans *= f } return ans } func TestUniformDistribution(t *testing.T) { const spare = 64 - MaxHashBits
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon Jan 25 06:44:08 UTC 2021 - 6.7K bytes - Viewed (0) -
src/math/log1p.go
// constants. The decimal values may be used, provided that the // compiler will convert from decimal to binary accurately enough // to produce the hexadecimal values shown. // // Note: Assuming log() return accurate answer, the following // algorithm can be used to compute log1p(x) to within a few ULP: // // u = 1+x; // if(u==1.0) return x ; else // return log(u)*(x/(u-1.0)); //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 11:59:09 UTC 2023 - 6.3K bytes - Viewed (0) -
tensorflow/compiler/jit/xla_cluster_util.cc
FunctionLibraryRuntime* lib_runtime, Direction direction, int depth) { const int kMaxDepth = 10; if (depth == kMaxDepth && !call_target_list.empty()) { // Conservative answer to avoid recursing too much. return true; } absl::flat_hash_set<Node*> callee_ref_nodes; for (const NameAttrList& call_target : call_target_list) { const OpRegistrationData* op_reg;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 29 08:39:39 UTC 2024 - 21.3K bytes - Viewed (0)