- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 72 for ellipsisOk (0.19 sec)
-
src/go/printer/testdata/parser.go
return &ast.SelectorExpr{ident, sel} } return ident } func (p *parser) parseArrayType(ellipsisOk bool) ast.Expr { if p.trace { defer un(trace(p, "ArrayType")) } lbrack := p.expect(token.LBRACK) var len ast.Expr if ellipsisOk && p.tok == token.ELLIPSIS { len = &ast.Ellipsis{p.pos, nil} p.next() } else if p.tok != token.RBRACK { len = p.parseRhs() } p.expect(token.RBRACK)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 20 20:19:51 UTC 2023 - 50.5K bytes - Viewed (0) -
tests/test_params_repr.py
"Param(Ellipsis)", ) def test_param_repr_number(): assert repr(Param(1)) == "Param(1)" def test_param_repr_list(): assert repr(Param([])) == "Param([])" def test_path_repr(): assert repr(Path()) == IsOneOf( "Path(PydanticUndefined)", # TODO: remove when deprecating Pydantic v1 "Path(Ellipsis)", )
Registered: Mon Jun 17 08:32:26 UTC 2024 - Last Modified: Fri Jul 07 17:12:13 UTC 2023 - 3.3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/ast/astutil/enclosing.go
tok(n.TokPos, len(n.Tok.String()))) case *ast.CallExpr: children = append(children, tok(n.Lparen, len("(")), tok(n.Rparen, len(")"))) if n.Ellipsis != 0 { children = append(children, tok(n.Ellipsis, len("..."))) } case *ast.CaseClause: if n.List == nil { children = append(children, tok(n.Case, len("default"))) } else { children = append(children,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Dec 18 21:28:13 UTC 2023 - 15.9K bytes - Viewed (0) -
tensorflow/cc/gradients/linalg_grad.cc
constexpr absl::string_view kEllipsis = "..."; // Returns the axis (possibly negative) corresponding to a label. // // Returns the axis index of the axis label if it is before an ellipsis (or if // the ellipsis is not present), and the negative index if it occurs after the // ellipsis. E.g. index of `b` in `ab...cd`, is `1`, but that of `c` is `-2`. // // For multiple occurrences, returns the leftmost one. If not found, returns // absl::nullopt. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Mar 07 23:11:54 UTC 2022 - 20.4K bytes - Viewed (0) -
src/go/types/util.go
// hasDots reports whether the last argument in the call is followed by ... func hasDots(call *ast.CallExpr) bool { return call.Ellipsis.IsValid() } // dddErrPos returns the positioner for reporting an invalid ... use in a call. func dddErrPos(call *ast.CallExpr) positioner { return atPos(call.Ellipsis) } // argErrPos returns positioner for reporting an invalid argument count.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:01:18 UTC 2024 - 1.7K bytes - Viewed (0) -
src/main/webapp/css/style.css
} .searchFormBox { margin-top: 4em; } #result .info { display: none; } #result .more { display: block; } #result .description { overflow: hidden; text-overflow: ellipsis; white-space: nowrap; }
Registered: Wed Jun 12 13:08:18 UTC 2024 - Last Modified: Thu Jun 02 11:39:35 UTC 2022 - 2K bytes - Viewed (0) -
src/go/ast/ast.go
Obj *Object // denoted object, or nil. Deprecated: see Object. } // An Ellipsis node stands for the "..." type in a // parameter list or the "..." length in an array type. // Ellipsis struct { Ellipsis token.Pos // position of "..." Elt Expr // ellipsis element type (parameter lists only); or nil } // A BasicLit node represents a literal of basic type.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 21:32:41 UTC 2024 - 35.6K bytes - Viewed (0) -
src/go/parser/parser.go
if p.trace { defer un(trace(p, "ArrayType")) } if len == nil { p.exprLev++ // always permit ellipsis for more fault-tolerant parsing if p.tok == token.ELLIPSIS { len = &ast.Ellipsis{Ellipsis: p.pos} p.next() } else if p.tok != token.RBRACK { len = p.parseRhs() } p.exprLev-- } if p.tok == token.COMMA {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 20:07:50 UTC 2023 - 72.2K bytes - Viewed (0) -
src/net/netip/netip.go
} // If didn't parse enough, expand ellipsis. if i < 16 { if ellipsis < 0 { return Addr{}, parseAddrError{in: in, msg: "address string too short"} } n := 16 - i for j := i - 1; j >= ellipsis; j-- { ip[j+n] = ip[j] } clear(ip[ellipsis : ellipsis+n]) } else if ellipsis >= 0 { // Ellipsis must represent at least one 0 group.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 17:10:01 UTC 2024 - 43.2K bytes - Viewed (0) -
src/cmd/gofmt/rewrite.go
return true case callExprType: // For calls, the Ellipsis fields (token.Pos) must // match since that is how f(x) and f(x...) are different. // Check them here but fall through for the remaining fields. p := pattern.Interface().(*ast.CallExpr) v := val.Interface().(*ast.CallExpr) if p.Ellipsis.IsValid() != v.Ellipsis.IsValid() { return false } } p := reflect.Indirect(pattern)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jul 27 22:07:13 UTC 2023 - 8.1K bytes - Viewed (0)