| /third_party/typescript/tests/baselines/reference/ |
| D | functionSignatureAssignmentCompat1.types | 15 var parsers: Parsers;
16 >parsers : Parsers
18 var c: ParserFunc = parsers.raw; // ok!
20 >parsers.raw : ParserFunc
21 >parsers : Parsers
24 var d: ParserFunc = parsers.readline; // not ok
26 >parsers.readline : (delimiter?: string) => ParserFunc
27 >parsers : Parsers
30 var e: ParserFunc = parsers.readline(); // ok
32 >parsers.readline() : ParserFunc
[all …]
|
| D | functionSignatureAssignmentCompat1.symbols | 21 var parsers: Parsers;
22 >parsers : Symbol(parsers, Decl(functionSignatureAssignmentCompat1.ts, 7, 3))
25 var c: ParserFunc = parsers.raw; // ok!
28 >parsers.raw : Symbol(Parsers.raw, Decl(functionSignatureAssignmentCompat1.ts, 3, 19))
29 >parsers : Symbol(parsers, Decl(functionSignatureAssignmentCompat1.ts, 7, 3))
32 var d: ParserFunc = parsers.readline; // not ok
35 >parsers.readline : Symbol(Parsers.readline, Decl(functionSignatureAssignmentCompat1.ts, 4, 20))
36 >parsers : Symbol(parsers, Decl(functionSignatureAssignmentCompat1.ts, 7, 3))
39 var e: ParserFunc = parsers.readline(); // ok
42 >parsers.readline : Symbol(Parsers.readline, Decl(functionSignatureAssignmentCompat1.ts, 4, 20))
[all …]
|
| D | functionSignatureAssignmentCompat1.js | 9 var parsers: Parsers; variable
10 var c: ParserFunc = parsers.raw; // ok!
11 var d: ParserFunc = parsers.readline; // not ok
12 var e: ParserFunc = parsers.readline(); // ok
15 var parsers; variable
16 var c = parsers.raw; // ok!
17 var d = parsers.readline; // not ok
18 var e = parsers.readline(); // ok
|
| D | functionSignatureAssignmentCompat1.errors.txt | 14 var parsers: Parsers;
15 var c: ParserFunc = parsers.raw; // ok!
16 var d: ParserFunc = parsers.readline; // not ok
22 var e: ParserFunc = parsers.readline(); // ok
|
| /third_party/node/test/sequential/ |
| D | test-http-regr-gh-2928.js | 11 const COUNT = httpCommon.parsers.max + 1;
13 const parsers = new Array(COUNT); constant
14 for (let i = 0; i < parsers.length; i++)
15 parsers[i] = httpCommon.parsers.alloc();
21 if (parsers.length === 0)
25 const parser = parsers.pop();
33 parsers.push(parser);
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/onnx/ |
| D | onnx_node_parser_registry.cc | 25 for (auto ite : parsers) { in ~OnnxNodeParserRegistry()
39 auto it = parsers.find(name); in GetNodeParser()
40 if (it != parsers.end()) { in GetNodeParser()
51 if (this->parsers.find(name) != this->parsers.end()) { in RegNodeParser()
55 this->parsers[name] = parser; in RegNodeParser()
|
| /third_party/typescript/tests/cases/compiler/ |
| D | functionSignatureAssignmentCompat1.ts | 8 var parsers: Parsers; variable
9 var c: ParserFunc = parsers.raw; // ok!
10 var d: ParserFunc = parsers.readline; // not ok
11 var e: ParserFunc = parsers.readline(); // ok
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/tf/ |
| D | tf_node_parser_registry.cc | 25 for (const auto &iter : parsers) { in ~TFNodeParserRegistry()
28 this->parsers.clear(); in ~TFNodeParserRegistry()
37 auto it = parsers.find(name); in GetNodeParser()
38 if (it != parsers.end()) { in GetNodeParser()
|
| /third_party/boost/libs/metaparse/doc/ |
| D | sequence.qbk | 18 `sequence` applies the `Ps...` parsers in sequence on the input. It accepts an
19 input when all of these parsers accept it. The result of parsing is a sequence
20 of the results of the parsers.
22 On compilers, which are not C++11-compliant, the maximum number of parsers
32 For any `n > 0`, `p0`, ..., `pn` parsers the result of `sequence<p0, ..., p1>`
33 is a compile-time sequence of the results of the parsers, applied after each
37 When one of the parsers returns an error, the combinator returns that error.
85 "when not all of the parsers accept the input, sequence should fail"
|
| D | repeated_one_of.qbk | 18 It applies the `Ps...` parsers repeatedly as long as any of them accepts the
19 input. In each iteration the parsers are tried in order and the first one
21 of parsing depends on the order of the `Ps...` parsers. The result of parsing
25 When none of the `Ps...` parsers accept the input in the first iteration,
30 parsers is defined by the `BOOST_METAPARSE_LIMIT_ONE_OF_SIZE` macro. Its default
39 For any `p1`, ..., `pn` parsers
|
| D | repeated_one_of1.qbk | 18 It applies the `Ps...` parsers repeatedly as long as any of them accepts the
19 input. In each iteration the parsers are tried in order and the first one
21 of parsing depends on the order of the `Ps...` parsers. The result of parsing
25 When none of the `Ps...` parsers accept the input in the first iteration,
29 parsers is defined by the `BOOST_METAPARSE_LIMIT_ONE_OF_SIZE` macro. Its default
38 For any `p1`, ..., `pn` parsers
|
| D | one_of.qbk | 18 It accepts an input when any of the `Ps...` parsers accept it. The result of
20 parsers are tried in order, therefore in case of ambiguous grammars the result
21 of parsing depends on the order of the `Ps...` parsers.
24 parsers is defined by the `BOOST_METAPARSE_LIMIT_ONE_OF_SIZE` macro. Its default
33 For any `p1`, ..., `pn` parsers, `s` compile-time string and `pos` source
|
| D | first_of.qbk | 18 `first_of` applies the `Ps...` parsers in sequence. It accepts an input when all
19 parsers accept it. The result of parsing is the result of the first parser.
21 On compilers, which are not C++11-compliant, the maximum number of parsers
31 For any `p1`, ... `pn` parsers
|
| D | last_of.qbk | 18 `last_of` applies the `Ps...` parsers in sequence. It accepts an input when all
19 parsers accept it. The result of parsing is the result of the last parser.
21 On compilers, which are not C++11-compliant, the maximum number of parsers
31 For any `p1`, ... `pn` parsers
|
| D | nth_of.qbk | 19 `nth_of` applies the `Ps...` parsers in sequence. It accepts an input when all
20 of these parsers accept it. The result of parsing is the result of the `N`.
23 On compilers, which are not C++11-compliant, the maximum number of parsers
33 For any `p0`, ..., `pn` parsers and `k` boxed integer value the following are
|
| D | nth_of_c.qbk | 19 `nth_of_c` applies the `Ps...` parsers in sequence. It accepts an input
20 when all of these parsers accept it. The result of parsing is the result of the
23 On compilers, which are not C++11-compliant, the maximum number of parsers
32 For any `p0`, ..., `pn` parsers and `k` integer value, where `0 <= k < n` the
|
| /third_party/mindspore/mindspore/lite/micro/coder/ |
| D | coder.cc | 110 std::vector<std::function<bool()>> parsers; in Init() local
111 parsers.emplace_back([&flags, config]() -> bool { in Init()
122 parsers.emplace_back([&flags, config]() -> bool { in Init()
129 parsers.emplace_back([&flags, config]() -> bool { in Init()
136 parsers.emplace_back([&flags, config]() -> bool { in Init()
145 parsers.emplace_back([&flags, config]() -> bool { in Init()
150 parsers.emplace_back([&flags, config]() -> bool { in Init()
172 if (!std::all_of(parsers.begin(), parsers.end(), [](auto &parser) -> bool { return parser(); })) { in Init()
|
| /third_party/python/Lib/test/test_email/ |
| D | test_parser.py | 42 for parser in self.parsers:
74 for parser in self.parsers:
81 for parser in self.parsers:
96 parsers = (email.message_from_string, message_from_file) variable in TestParser
106 parsers = (message_from_bytes, message_from_binary_file) variable in TestBytesParser
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/caffe/ |
| D | caffe_node_parser_registry.cc | 24 for (auto ite : parsers) { in ~CaffeNodeParserRegistry()
38 auto it = parsers.find(name); in GetNodeParser()
39 if (it != parsers.end()) { in GetNodeParser()
|
| /third_party/mindspore/mindspore/lite/tools/converter/parser/tflite/ |
| D | tflite_node_parser_registry.cc | 24 for (auto ite : parsers) { in ~TfliteNodeParserRegistry()
38 auto it = parsers.find(type); in GetNodeParser()
39 if (it != parsers.end()) { in GetNodeParser()
|
| /third_party/boost/libs/property_tree/doc/ |
| D | parsers.qbk | 8 [section:parsers How to Populate a Property Tree]
17 [/ These parsers will be dropped for now.]
24 [endsect] [/parsers]
|
| /third_party/boost/libs/spirit/doc/qi/ |
| D | basics.qbk | 12 Some parsers (e.g. primitives and non-terminals) may take in additional
13 attributes. Such parsers take the form:
29 Some parsers need to know which character set a `char` or `wchar_t` is
37 we place tagged versions of parsers such as `alnum`, `space` etc.
71 These functions test the parsers without attributes.
75 These functions test the parsers with user supplied attributes.
120 to customize the behavior of parsers are described in the section
|
| /third_party/boost/libs/mpl/doc/src/docutils/tools/ |
| D | rst2htmlrefdoc.py | 16 from docutils.parsers.rst import directives
17 from docutils.parsers.rst.directives import htmlrefdoc
|
| /third_party/boost/libs/beast/doc/qbk/04_http/ |
| D | 10_custom_parsers.qbk | 12 While the parsers included in the library will handle a broad number of
16 while the derived class decides what to do with those elements. Custom parsers
19 parsers are:
|
| /third_party/boost/libs/spirit/doc/notes/ |
| D | porting_from_1_8.qbk | 18 interface. Generally, there is no easy (or automated) way of converting parsers
20 guidelines on how to approach porting your older parsers to the current version
28 the needed header files for your new parsers. Moreover, each section in the
55 the primitives parsers now directly support lazy
111 Note, how character parsers are in a separate namespace (here
118 encoding their type: `"_p"` for parsers, `"_a"` for lazy actions, `"_d"` for
122 integer parser). Overall, most, if not all primitive parsers and directives
129 type. Most parsers expose the pair of iterators pointing to the matched input
130 sequence. As in __qi__ all parsers expose a parser specific attribute type it
134 very much encourage you to rewrite your parsers to take advantage of the
[all …]
|