| /third_party/boost/libs/math/tools/ |
| D | generate_rational_code.cpp | 62 for(int bracket = 2; bracket < order; ++bracket) in print_polynomials() local
130 for(int bracket = 0; bracket < (order - 1) / 2 - 1; ++bracket) in print_polynomials() local
138 for(int bracket = 0; bracket < (order - 1) / 2 - 1; ++bracket) in print_polynomials() local
149 for(int bracket = 0; bracket < (order - 1) / 2; ++bracket) in print_polynomials() local
157 for(int bracket = 0; bracket < (order - 1) / 2 - 1; ++bracket) in print_polynomials() local
304 for(int bracket = 2; bracket < order; ++bracket) in print_rationals() local
313 for(int bracket = 2; bracket < order; ++bracket) in print_rationals() local
323 for(int bracket = order - 1; bracket > 1; --bracket) in print_rationals() local
332 for(int bracket = 2; bracket < order; ++bracket) in print_rationals() local
402 for(int bracket = 0; bracket < (order - 1) / 2 - 1; ++bracket) in print_rationals() local
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | overloadResolutionOverNonCTObjectLit.types | 12 bracket:number;
13 >bracket : number
34 tokens.push({ startIndex: 1, type: '', bracket: 3 });
35 >tokens.push({ startIndex: 1, type: '', bracket: 3 }) : number
39 >{ startIndex: 1, type: '', bracket: 3 } : { startIndex: number; type: string; bracket: number; }
44 >bracket : number
47 … tokens.push(<IToken>({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 }));
48 >tokens.push(<IToken>({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 })) : number
52 ><IToken>({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 }) : IToken
53 >({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 }) : { startIndex: number; type: s…
[all …]
|
| D | overloadResolutionOverNonCTObjectLit.symbols | 14 bracket:number;
15 >bracket : Symbol(IToken.bracket, Decl(overloadResolutionOverNonCTObjectLit.ts, 3, 44))
41 tokens.push({ startIndex: 1, type: '', bracket: 3 });
47 >bracket : Symbol(bracket, Decl(overloadResolutionOverNonCTObjectLit.ts, 17, 70))
49 … tokens.push(<IToken>({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 }));
56 >bracket : Symbol(bracket, Decl(overloadResolutionOverNonCTObjectLit.ts, 18, 79))
|
| D | overloadResolutionOverNonCTObjectLit.js | 6 bracket:number;
19 tokens.push({ startIndex: 1, type: '', bracket: 3 }); property
20 … tokens.push(<IToken>({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 })); property
29 tokens.push({ startIndex: 1, type: '', bracket: 3 }); property
30 tokens.push(({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 })); property
|
| /third_party/mesa3d/src/gallium/auxiliary/tgsi/ |
| D | tgsi_text.c | 689 struct parsed_dcl_bracket *bracket) in parse_register_dcl_bracket() argument
692 memset(bracket, 0, sizeof(struct parsed_dcl_bracket)); in parse_register_dcl_bracket()
700 bracket->first = 0; in parse_register_dcl_bracket()
701 bracket->last = ctx->implied_array_size - 1; in parse_register_dcl_bracket()
707 bracket->first = uindex; in parse_register_dcl_bracket()
720 bracket->last = (int) uindex; in parse_register_dcl_bracket()
724 bracket->last = bracket->first; in parse_register_dcl_bracket()
814 struct parsed_bracket bracket[2]; in parse_dst_operand() local
817 if (!parse_register_dst( ctx, &file, &bracket[0] )) in parse_dst_operand()
819 if (!parse_opt_register_src_bracket(ctx, &bracket[1], &parsed_opt_brackets)) in parse_dst_operand()
[all …]
|
| /third_party/typescript/tests/cases/compiler/ |
| D | overloadResolutionOverNonCTObjectLit.ts | 5 bracket:number; property
18 tokens.push({ startIndex: 1, type: '', bracket: 3 });
19 … tokens.push(<IToken>({ startIndex: 1, type: '', bracket: 3, state: null, length: 10 }));
|
| /third_party/boost/libs/regex/doc/ |
| D | collating_names.qbk | 30 [pre \[\[.left-square-bracket.\]\[.right-square-bracket.\]\]]
101 [[left-square-bracket] [\[]]
103 [[right-square-bracket][\]]]
107 [[left-curly-bracket][{]]
109 [[right-curly-bracket][}]]
|
| /third_party/boost/libs/sort/test/ |
| D | string_sort_test.cpp | 26 struct bracket { struct
61 update_offset(input.begin(), input.end(), char_offset, bracket(), get_size()); in update_offset_test()
121 string_sort(test_vec.begin(), test_vec.end(), bracket(), get_size()); in string_test()
125 string_sort(test_vec.begin(), test_vec.end(), bracket(), get_size(), in string_test()
134 reverse_string_sort(test_vec.begin(), test_vec.end(), bracket(), get_size(), in string_test()
|
| /third_party/gettext/gettext-tools/tests/ |
| D | xgettext-lua-1 | 18 First newline in long bracket is ignored.]=]))
21 Second newline in long bracket is extracted.]=]))
23 Newlines inside a long bracket string
|
| /third_party/glib/gio/ |
| D | gsimpleproxyresolver.c | 157 gchar *host, *tmp, *colon, *bracket; in reparse_ignore_hosts() local
199 bracket = strchr (host, ']'); in reparse_ignore_hosts()
200 if (!bracket || !bracket[1] || bracket[1] != ':') in reparse_ignore_hosts()
203 port = strtoul (bracket + 2, &tmp, 10); in reparse_ignore_hosts()
207 *bracket = '\0'; in reparse_ignore_hosts()
|
| /third_party/boost/libs/hana/example/misc/ |
| D | from_json.cpp | 86 char bracket; in from_json() local
87 in >> bracket; in from_json()
98 in >> bracket; in from_json()
|
| /third_party/typescript_eslint/packages/eslint-plugin/docs/rules/ |
| D | consistent-type-assertions.md | 18 assertionStyle: 'as' | 'angle-bracket';
36 - `angle-bracket` will enforce that you always use `<foo>...`
39 Most codebases will want to enforce not using `angle-bracket` style because it conflicts with JSX s…
93 - TSLint: [no-angle-bracket-type-assertion](https://palantir.github.io/tslint/rules/no-angle-bracke…
|
| /third_party/boost/libs/spirit/test/lex/ |
| D | regression_wide.cpp | 93 , bracket (L"[\\(\\)\\[\\]]", ID_BRACKET) in mega_tokens()
102 | bracket [ test(_tokenid, _val) ] in mega_tokens()
109 lex::token_def<wchar_t, wchar_t, tokenids> bracket; member
|
| /third_party/boost/tools/quickbook/test/ |
| D | hr-1_5.quickbook | 25 ---- This doesn't have an open bracket.]
27 ---- [ This doesn't have a close bracket.
|
| D | templates-1_4.quickbook | 26 [binary [1..2] [/ {(1-2} but with a square bracket ]
37 [ternary [1..2..3] [/ {(1-2-3} (but with a square bracket) ]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/ |
| D | regcomp.c | 923 char bracket[3]; in bothcases() local
927 p->next = bracket; in bothcases()
928 p->end = bracket+2; in bothcases()
929 bracket[0] = ch; in bothcases()
930 bracket[1] = ']'; in bothcases()
931 bracket[2] = '\0'; in bothcases()
933 assert(p->next == bracket+2); in bothcases()
965 char bracket[4]; in nonnewline() local
967 p->next = bracket; in nonnewline()
968 p->end = bracket+3; in nonnewline()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
| D | regcomp.c | 1051 char bracket[3]; in bothcases() local
1055 p->next = bracket; in bothcases()
1056 p->end = bracket+2; in bothcases()
1057 bracket[0] = ch; in bothcases()
1058 bracket[1] = ']'; in bothcases()
1059 bracket[2] = '\0'; in bothcases()
1061 assert(p->next == bracket+2); in bothcases()
1093 char bracket[4]; in nonnewline() local
1095 p->next = bracket; in nonnewline()
1096 p->end = bracket+3; in nonnewline()
[all …]
|
| /third_party/node/deps/npm/node_modules/query-string/ |
| D | readme.md | 71 - `'bracket'`: Parse arrays with bracket representation:
74 queryString.parse('foo[]=1&foo[]=2&foo[]=3', {arrayFormat: 'bracket'});
157 - `'bracket'`: Serialize arrays using bracket representation:
160 queryString.stringify({foo: [1, 2, 3]}, {arrayFormat: 'bracket'});
|
| /third_party/boost/libs/math/doc/roots/ |
| D | roots_without_derivatives.qbk | 184 [[min] [The left bracket of the interval known to contain the root.]]
185 [[max] [The right bracket of the interval known to contain the root.[br]
199 [*Returns]: a pair of values ['r] that bracket the root so that:
256 from ['guess] then many iterations will be needed to bracket the root in spite of
266 [[factor][A scaling factor that is used to bracket the root: the value
268 until two values are found that bracket the root. A value
288 [*Returns]: a pair of values ['r] that bracket the root so that:
359 rather than trying to bracket the root yourself as this function requires.
364 It also has the useful property of decreasing the bracket size
376 may have multiple roots. However, the bounds given must bracket a single root.]]
[all …]
|
| /third_party/node/deps/npm/docs/src/components/home/ |
| D | Terminal.js | 6 import bracket from '../../images/bracket.svg'
75 background: center / contain no-repeat url(${bracket});
|
| /third_party/cef/tools/yapf/yapf/yapflib/ |
| D | format_decision_state.py | 175 bracket = current if current.ClosesScope() else previous
176 if format_token.Subtype.SUBSCRIPT_BRACKET not in bracket.subtypes:
177 if bracket.OpensScope():
183 if (not _IsLastScopeInLine(bracket) or
184 unwrapped_line.IsSurroundedByBrackets(bracket)):
185 last_token = bracket.matching_bracket
187 last_token = _LastTokenInLine(bracket.matching_bracket)
189 if not self._FitsOnLine(bracket, last_token):
|
| /third_party/boost/libs/sort/example/ |
| D | charstringsample.cpp | 29 struct bracket { struct
76 string_sort(array.begin(), array.end(), bracket(), getsize()); in main()
|
| D | caseinsensitive.cpp | 34 struct bracket { struct
79 string_sort(array.begin(), array.end(), bracket(), getsize(), lessthan()); in main()
|
| D | reversestringfunctorsample.cpp | 33 struct bracket { struct
89 reverse_string_sort(array.begin(), array.end(), bracket(), getsize(), in main()
|
| /third_party/boost/boost/math/tools/ |
| D | toms748_solve.hpp | 88 void bracket(F f, T& a, T& b, T c, T& fa, T& fb, T& d, T& fd) in bracket() function
348 detail::bracket(f, a, b, c, fa, fb, d, fd); in toms748_solve()
360 detail::bracket(f, a, b, c, fa, fb, d, fd); in toms748_solve()
395 detail::bracket(f, a, b, c, fa, fb, d, fd); in toms748_solve()
415 detail::bracket(f, a, b, c, fa, fb, d, fd); in toms748_solve()
442 detail::bracket(f, a, b, c, fa, fb, d, fd); in toms748_solve()
458 detail::bracket(f, a, b, T(a + (b - a) / 2), fa, fb, d, fd); in toms748_solve()
|