Home
last modified time | relevance | path

Searched refs:re_ (Results 1 – 12 of 12) sorted by relevance

/external/llvm-project/flang/include/flang/Evaluate/
Dcomplex.h29 constexpr Complex(const Part &r, const Part &i) : re_{r}, im_{i} {} in Complex()
30 explicit constexpr Complex(const Part &r) : re_{r} {} in Complex()
35 return re_ == that.re_ && im_ == that.im_;
38 constexpr const Part &REAL() const { return re_; } in REAL()
40 constexpr Complex CONJG() const { return {re_, im_.Negate()}; } in CONJG()
41 constexpr Complex Negate() const { return {re_.Negate(), im_.Negate()}; } in Negate()
44 return re_.Compare(that.re_) == Relation::Equal && in Equals()
48 constexpr bool IsZero() const { return re_.IsZero() || im_.IsZero(); } in IsZero()
51 return re_.IsInfinite() || im_.IsInfinite(); in IsInfinite()
55 return re_.IsNotANumber() || im_.IsNotANumber(); in IsNotANumber()
[all …]
/external/llvm-project/flang/lib/Evaluate/
Dcomplex.cpp18 Part reSum{re_.Add(that.re_, rounding).AccumulateFlags(flags)}; in Add()
27 Part reDiff{re_.Subtract(that.re_, rounding).AccumulateFlags(flags)}; in Subtract()
37 Part ac{re_.Multiply(that.re_, rounding).AccumulateFlags(flags)}; in Multiply()
39 Part ad{re_.Multiply(that.im_, rounding).AccumulateFlags(flags)}; in Multiply()
40 Part bc{im_.Multiply(that.re_, rounding).AccumulateFlags(flags)}; in Multiply()
55 bool cGEd{that.re_.ABS().Compare(that.im_.ABS()) != Relation::Less}; in Divide()
57 scale = that.im_.Divide(that.re_, rounding).AccumulateFlags(flags); in Divide()
59 scale = that.re_.Divide(that.im_, rounding).AccumulateFlags(flags); in Divide()
64 den = dS.Add(that.re_, rounding).AccumulateFlags(flags); in Divide()
66 Part cS{scale.Multiply(that.re_, rounding).AccumulateFlags(flags)}; in Divide()
[all …]
/external/google-benchmark/src/
Dre.h80 std::regex re_; variable
82 regex_t re_; variable
96 re_ = std::regex(spec, std::regex_constants::extended); in Init()
115 return std::regex_search(str, re_); in Match()
120 int ec = regcomp(&re_, spec.c_str(), REG_EXTENDED | REG_NOSUB); in Init()
123 size_t needed = regerror(ec, &re_, nullptr, 0); in Init()
125 regerror(ec, &re_, errbuf, needed); in Init()
144 regfree(&re_); in ~Regex()
152 return regexec(&re_, str.c_str(), 0, nullptr, 0) == 0; in Match()
/external/llvm-project/llvm/utils/benchmark/src/
Dre.h75 std::regex re_; variable
77 regex_t re_; variable
91 re_ = std::regex(spec, std::regex_constants::extended); in Init()
109 return std::regex_search(str, re_); in Match()
114 int ec = regcomp(&re_, spec.c_str(), REG_EXTENDED | REG_NOSUB); in Init()
117 size_t needed = regerror(ec, &re_, nullptr, 0); in Init()
119 regerror(ec, &re_, errbuf, needed); in Init()
138 regfree(&re_); in ~Regex()
146 return regexec(&re_, str.c_str(), 0, nullptr, 0) == 0; in Match()
/external/libcxx/utils/google-benchmark/src/
Dre.h80 std::regex re_; variable
82 regex_t re_; variable
96 re_ = std::regex(spec, std::regex_constants::extended); in Init()
115 return std::regex_search(str, re_); in Match()
120 int ec = regcomp(&re_, spec.c_str(), REG_EXTENDED | REG_NOSUB); in Init()
123 size_t needed = regerror(ec, &re_, nullptr, 0); in Init()
125 regerror(ec, &re_, errbuf, needed); in Init()
144 regfree(&re_); in ~Regex()
152 return regexec(&re_, str.c_str(), 0, nullptr, 0) == 0; in Match()
/external/llvm-project/libcxx/utils/google-benchmark/src/
Dre.h80 std::regex re_; variable
82 regex_t re_; variable
96 re_ = std::regex(spec, std::regex_constants::extended); in Init()
115 return std::regex_search(str, re_); in Match()
120 int ec = regcomp(&re_, spec.c_str(), REG_EXTENDED | REG_NOSUB); in Init()
123 size_t needed = regerror(ec, &re_, nullptr, 0); in Init()
125 regerror(ec, &re_, errbuf, needed); in Init()
144 regfree(&re_); in ~Regex()
152 return regexec(&re_, str.c_str(), 0, nullptr, 0) == 0; in Match()
/external/tensorflow/tensorflow/core/kernels/
Dregex_full_match_op.cc93 re_ = MakeUnique<RE2>(pattern); in StaticRegexFullMatchOp()
94 OP_REQUIRES(ctx, re_->ok(), in StaticRegexFullMatchOp()
96 ", error: ", re_->error())); in StaticRegexFullMatchOp()
109 output_flat(i) = RE2::FullMatch(input_flat(i), *re_); in Compute()
114 std::unique_ptr<RE2> re_; member in tensorflow::StaticRegexFullMatchOp
Dregex_replace_op.cc130 re_ = MakeUnique<RE2>(pattern); in StaticRegexReplaceOp()
131 OP_REQUIRES(ctx, re_->ok(), in StaticRegexReplaceOp()
133 ", error: ", re_->error())); in StaticRegexReplaceOp()
140 InternalCompute(*re_, rewrite_str_, replace_global_, ctx)); in Compute()
144 std::unique_ptr<RE2> re_; member in tensorflow::StaticRegexReplaceOp
/external/rust/crates/grpcio-sys/grpc/third_party/re2/re2/testing/
Dtester.cc181 re_(NULL), in TestInstance()
269 re_ = new PCRE("("+re+")", o); in TestInstance()
270 if (!re_->error().empty()) { in TestInstance()
283 delete re_; in ~TestInstance()
420 if (!re_ || text.begin() != context.begin() || in RunSearch()
461 re_->ClearHitLimit(); in RunSearch()
463 re_->DoMatch(text, in RunSearch()
467 if (re_->HitLimit()) { in RunSearch()
Dtester.h84 PCRE* re_; // PCRE implementation variable
/external/scapy/test/
Dnmap.uts56 import re as re_
61 assert re_.match(r"\w{2,4}\(.*\)", x)
/external/libwebsockets/minimal-examples/api-tests/api-test-fts/
Dles-mis-utf8.txt5583 fût prononcée _parmentière_, et n'y réussissait point. L'abbé Grégoire,
11793 _Une belle jupe avec sa brassière_