Searched refs:rbrace (Results 1 - 10 of 10) sorted by relevance

/macosx-10.10.1/ruby-106/ruby/test/ripper/
H A Dtest_scanner_events.rb393 scan('rbrace', '')
395 scan('rbrace', '3.times{ }')
397 scan('rbrace', '3.times { }')
399 scan('rbrace', '3.times{}')
401 scan('rbrace', '"{}"')
403 scan('rbrace', '{1=>2}')
/macosx-10.10.1/awk-20/src/
H A Dawkgram.y72 %type <i> pst opt_pst lbrace rbrace rparen comma nl opt_nl and bor
276 rbrace: label
277 '}' | rbrace NL
328 | lbrace stmtlist rbrace { $$ = $2; }
/macosx-10.10.1/llvmCore-3425.0.34/lib/AsmParser/
H A DLLToken.h28 lbrace, rbrace, // { } enumerator in enum:llvm::lltok::Kind
H A DLLParser.cpp497 if (Lex.getKind() != lltok::rbrace)
507 if (ParseToken(lltok::rbrace, "expected end of metadata node"))
529 ParseToken(lltok::rbrace, "expected end of metadata node"))
1638 if (EatIfPresent(lltok::rbrace))
1659 return ParseToken(lltok::rbrace, "expected '}' at end of struct");
2018 ParseToken(lltok::rbrace, "expected end of struct constant"))
2037 ParseToken(lltok::rbrace, "expected end of packed struct")) ||
2456 if (Lex.getKind() == lltok::rbrace ||
2480 ParseToken(lltok::rbrace, "expected end of metadata node"))
2875 if (Lex.getKind() == lltok::rbrace)
[all...]
H A DLLLexer.cpp246 case '}': return lltok::rbrace;
/macosx-10.10.1/cxxfilt-11/cxxfilt/etc/
H A Dtexi2pod.pl216 s/\@\}/&rbrace;/g;
428 s/&rbrace;/\}/g;
/macosx-10.10.1/ruby-106/ruby/
H A Ddir.c1602 const char *lbrace = 0, *rbrace = 0; local
1610 rbrace = p;
1619 if (lbrace && rbrace) {
1628 while (p < rbrace) {
1631 while (p < rbrace && !(*p == ',' && nest == 0)) {
1635 if (++p == rbrace) break;
1640 strlcpy(buf+shift+(p-t), rbrace+1, len-(shift+(p-t)));
1646 else if (!lbrace && !rbrace) {
/macosx-10.10.1/vim-55/runtime/syntax/
H A Dtex.vim386 syn keyword texMathDelimKey contained Downarrow lgroup rbrace rvert updownarrow
/macosx-10.10.1/Heimdal-398.1.2/lib/hcrypto/libtommath/
H A Dbn.tex1805 symbol. The result is stored in $c$ and can take on one of three values $\lbrace -1, 0, 1 \rbrace$. If $p$ is prime
H A Dtommath.tex627 if \textbf{dp} contains $\lbrace a, b, c, \ldots \rbrace$ where \textbf{dp}$_0 = a$, \textbf{dp}$_1 = b$, \textbf{dp}$_2 = c$, $\ldots$ then
2651 \vec x_n = \sum_{i+j = n} a_ib_j, \forall n \in \lbrace 0, 1, 2, \ldots, i + j \rbrace
6188 0 \equiv x^{p-1} - 1 \equiv \left \lbrace \left (x^2 \right )^{(p-1)/2} - a^{(p-1)/2} \right \rbrace + \left ( a^{(p-1)/2} - 1 \right ) \mbox{ (mod }p\mbox{)}

Completed in 138 milliseconds