- Sort Score
- Result 10 results
- Languages All
Results 51 - 60 of 959 for Positions (0.17 sec)
-
tensorflow/cc/framework/gradient_checker.cc
} for (int i = 0; i < y_num; i++) { feed_list.insert({dys[i], dy_datas[i]}); } // x_stride and y_stride are used to calculate the correct jacobian row and // column position for a pair of elements at positions r, c within the x and y // tensors respectively. const int x_stride = JacobianStride<X_T>::value; const int y_stride = JacobianStride<Y_T>::value; ClientSession session(scope);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 13 05:57:22 UTC 2024 - 18.2K bytes - Viewed (0) -
src/cmd/compile/internal/types2/interface.go
methods []*Func // ordered list of explicitly declared methods embeddeds []Type // ordered list of explicitly embedded elements embedPos *[]syntax.Pos // positions of embedded elements; or nil (for error messages) - use pointer to save space implicit bool // interface is wrapper for type set literal (non-interface T, ~T, or A|B)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Nov 09 17:24:42 UTC 2023 - 6.2K bytes - Viewed (0) -
src/go/ast/print.go
return !v.IsNil() } return true } // Fprint prints the (sub-)tree starting at AST node x to w. // If fset != nil, position information is interpreted relative // to that file set. Otherwise positions are printed as integer // values (file set specific offsets). // // A non-nil [FieldFilter] f may be provided to control the output:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 21:32:41 UTC 2024 - 5.9K bytes - Viewed (0) -
src/go/doc/example.go
imps := make([]*ast.ImportSpec, len(origImps)) copy(imps, origImps) // Assume the imports are sorted by position. slices.SortFunc(imps, func(a, b *ast.ImportSpec) int { return cmp.Compare(a.Pos(), b.Pos()) }) // Assume gofmt has been applied, so there is a blank line between adjacent imps // if and only if they are more than 2 positions apart (newline, tab). var groupStarts []*ast.ImportSpec prevEnd := token.Pos(-2)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 21.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/block.go
phielimValue(phi) } // LackingPos indicates whether b is a block whose position should be inherited // from its successors. This is true if all the values within it have unreliable positions // and if it is "plain", meaning that there is no control flow that is also very likely // to correspond to a well-understood source position. func (b *Block) LackingPos() bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 15:44:14 UTC 2024 - 12.2K bytes - Viewed (0) -
src/go/types/stmt.go
return x } case constant.String: return constant.StringVal(val) } return nil } // A valueMap maps a case value (of a basic Go type) to a list of positions // where the same case value appeared, together with the corresponding case // types. // Since two case values may have the same "underlying" value but different
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.6K bytes - Viewed (0) -
src/cmd/cover/cover.go
} // seenPos2 tracks whether we have seen a token.Position pair. var seenPos2 = make(map[pos2]bool) // dedup takes a token.Position pair and returns a pair that does not // duplicate any existing pair. The returned pair will have the Offset // fields cleared. func dedup(p1, p2 token.Position) (r1, r2 token.Position) { key := pos2{ p1: p1, p2: p2, }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 34.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/RegularImmutableMap.java
* equivalent to RegularImmutableSet, save that instead of having a hash table containing the * elements directly and null for empty positions, we store indices of the keys in the hash table, * and ABSENT for empty positions. We then look up the keys in alternatingKeysAndValues. * * (The index actually stored is the index of the key in alternatingKeysAndValues, which is
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 15 22:32:14 UTC 2024 - 22.7K bytes - Viewed (0) -
cmd/preferredimports/preferredimports.go
isTerminal = term.IsTerminal(int(os.Stdout.Fd())) logPrefix = "" aliases = map[*regexp.Regexp]string{} ) type analyzer struct { fset *token.FileSet // positions are relative to fset ctx build.Context failed bool donePaths map[string]interface{} } func newAnalyzer() *analyzer { ctx := build.Default ctx.CgoEnabled = true a := &analyzer{
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri Mar 01 06:06:44 UTC 2024 - 7.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/stmt.go
x.typ = Typ[Bool] x.val = constant.MakeBool(true) // TODO(gri) should have a better position here pos := s.Rbrace if len(s.Body) > 0 { pos = s.Body[0].Pos() } x.expr = syntax.NewName(pos, "true") } check.multipleSwitchDefaults(s.Body) seen := make(valueMap) // map of seen case values to positions and types for i, clause := range s.Body { if clause == nil {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 19:19:55 UTC 2024 - 30.7K bytes - Viewed (0)