| /external/stlport/src/ |
| H A D | complex_trig.cpp | 107 _Tp re2 = 2.f * z._M_re; local
113 _Tp den = ::cos(re2) + ::cosh(im2);
114 return complex<_Tp>(::sin(re2) / den, ::sinh(im2) / den);
171 _Tp re2 = 2.f * z._M_re; local
173 if (::abs(re2) > Tp_limit)
174 return complex<_Tp>((re2 > 0 ? 1.f : -1.f), 0.f);
176 _Tp den = ::cosh(re2) + ::cos(im2);
177 return complex<_Tp>(::sinh(re2) / den, ::sin(im2) / den);
|
| /external/regex-re2/re2/ |
| H A D | bitstate.cc | 20 #include "re2/prog.h"
21 #include "re2/regexp.h"
23 namespace re2 { namespace
378 } // namespace re2
|
| H A D | compile.cc | 11 #include "re2/prog.h"
12 #include "re2/re2.h"
13 #include "re2/regexp.h"
14 #include "re2/walker-inl.h"
16 namespace re2 { namespace
1139 } // namespace re2
|
| H A D | dfa.cc | 24 #include "re2/prog.h"
25 #include "re2/stringpiece.h"
34 namespace re2 { namespace
2132 } // namespace re2
|
| H A D | filtered_re2.cc | 7 #include "re2/filtered_re2.h"
8 #include "re2/prefilter.h"
9 #include "re2/prefilter_tree.h"
11 namespace re2 { namespace
102 } // namespace re2
|
| H A D | filtered_re2.h | 25 #include "re2/re2.h"
27 namespace re2 { namespace
99 } // namespace re2
|
| H A D | mimics_pcre.cc | 26 #include "re2/regexp.h"
27 #include "re2/walker-inl.h"
29 namespace re2 { namespace
185 } // namespace re2
|
| H A D | nfa.cc | 27 #include "re2/prog.h"
28 #include "re2/regexp.h"
32 namespace re2 { namespace
708 } // namespace re2
|
| H A D | onepass.cc | 58 #include "re2/prog.h"
59 #include "re2/stringpiece.h"
61 namespace re2 { namespace
614 } // namespace re2
|
| H A D | parse.cc | 20 #include "re2/regexp.h"
21 #include "re2/stringpiece.h"
22 #include "re2/unicode_casefold.h"
23 #include "re2/unicode_groups.h"
25 namespace re2 { namespace
1073 Regexp* re2; local
1074 if ((re1 = stacktop_) == NULL || (re2 = re1->down_) == NULL)
1079 if (re2->op_ != kRegexpLiteral && re2->op_ != kRegexpLiteralString)
1081 if ((re1->parse_flags_ & FoldCase) != (re2
[all...] |
| H A D | perl_groups.cc | 4 #include "re2/unicode_groups.h"
6 namespace re2 { namespace
119 } // namespace re2
|
| H A D | prefilter.cc | 6 #include "re2/prefilter.h"
7 #include "re2/re2.h"
8 #include "re2/unicode_casefold.h"
9 #include "re2/walker-inl.h"
11 namespace re2 { namespace
703 Prefilter* Prefilter::FromRE2(const RE2* re2) { argument
704 if (re2 == NULL)
707 Regexp* regexp = re2->Regexp();
715 } // namespace re2
[all...] |
| H A D | prefilter.h | 14 namespace re2 { namespace
52 static Prefilter* FromRE2(const RE2* re2);
103 } // namespace re2
|
| H A D | prefilter_tree.cc | 7 #include "re2/prefilter.h"
8 #include "re2/prefilter_tree.h"
9 #include "re2/re2.h"
15 namespace re2 { namespace
398 } // namespace re2
|
| H A D | prefilter_tree.h | 22 namespace re2 { namespace
|
| H A D | prog.cc | 10 #include "re2/prog.h"
11 #include "re2/stringpiece.h"
13 namespace re2 { namespace
340 } // namespace re2
|
| H A D | prog.h | 13 #include "re2/re2.h"
15 namespace re2 { namespace
154 // Match ID to identify this match (for re2::Set).
374 } // namespace re2
|
| H A D | re2.cc | 10 #include "re2/re2.h"
18 #include "re2/prog.h"
19 #include "re2/regexp.h"
23 namespace re2 { namespace
36 const int RE2::Options::kDefaultMaxMem; // initialized in re2.h
74 static RE2::ErrorCode RegexpErrorToRE2(re2::RegexpStatusCode code) {
76 case re2::kRegexpSuccess:
78 case re2::kRegexpInternalError:
80 case re2
[all...] |
| H A D | re2.h | 8 // C++ interface to the re2 regular-expression library.
15 // This module uses the re2 library and hence supports
20 // See http://code.google.com/p/re2/wiki/Syntax for the syntax
186 #include "re2/stringpiece.h"
187 #include "re2/variadic_function.h"
189 namespace re2 { namespace
296 re2::Regexp* Regexp() const { return entire_regexp_; }
702 re2::Prog* ReverseProg() const;
709 re2::Regexp* entire_regexp_; // parsed regular expression
710 re2
[all...] |
| H A D | regexp.cc | 9 #include "re2/regexp.h"
10 #include "re2/stringpiece.h"
11 #include "re2/walker-inl.h"
13 namespace re2 { namespace
931 } // namespace re2
|
| H A D | regexp.h | 7 // you should use re2/re2.h, which provides a class RE2 that
90 #include "re2/stringpiece.h"
92 namespace re2 { namespace
631 } // namespace re2
|
| H A D | set.h | 11 #include "re2/re2.h"
13 namespace re2 { namespace
45 vector<re2::Regexp*> re_;
46 re2::Prog* prog_;
53 } // namespace re2
|
| H A D | simplify.cc | 10 #include "re2/regexp.h"
11 #include "re2/walker-inl.h"
13 namespace re2 { namespace
118 // Creates a concatenation of two Regexp, consuming refs to re1 and re2.
120 static Regexp* Concat2(Regexp* re1, Regexp* re2, Regexp::ParseFlags flags);
295 // Creates a concatenation of two Regexp, consuming refs to re1 and re2.
297 Regexp* SimplifyWalker::Concat2(Regexp* re1, Regexp* re2, argument
303 subs[1] = re2;
393 } // namespace re2
|
| H A D | stringpiece.h | 27 namespace re2 { namespace
177 } // namespace re2
180 extern std::ostream& operator<<(std::ostream& o, const re2::StringPiece& piece);
|
| /external/regex-re2/re2/testing/ |
| H A D | backtrack.cc | 27 #include "re2/prog.h"
28 #include "re2/regexp.h"
30 namespace re2 { namespace
254 } // namespace re2
|