| /external/libcxx/test/std/numerics/complex.number/complex.ops/ |
| D | complex_divide_complex.pass.cpp | 46 switch (classify(x[i])) in test_edges()
49 switch (classify(x[j])) in test_edges()
52 assert(classify(r) == NaN); in test_edges()
55 assert(classify(r) == zero); in test_edges()
58 assert(classify(r) == zero); in test_edges()
61 assert(classify(r) == NaN); in test_edges()
64 assert(classify(r) == NaN); in test_edges()
69 switch (classify(x[j])) in test_edges()
72 assert(classify(r) == inf); in test_edges()
75 assert(classify(r) == non_zero); in test_edges()
[all …]
|
| D | complex_times_complex.pass.cpp | 48 switch (classify(x[i])) in test_edges()
51 switch (classify(x[j])) in test_edges()
54 assert(classify(r) == zero); in test_edges()
57 assert(classify(r) == zero); in test_edges()
60 assert(classify(r) == NaN); in test_edges()
63 assert(classify(r) == NaN); in test_edges()
66 assert(classify(r) == NaN); in test_edges()
71 switch (classify(x[j])) in test_edges()
74 assert(classify(r) == zero); in test_edges()
77 assert(classify(r) == non_zero); in test_edges()
[all …]
|
| /external/compiler-rt/test/builtins/Unit/ |
| D | divxc3_test.c | 29 classify(long double _Complex x) in classify() function
65 switch (classify(dividend)) in test__divxc3()
68 switch (classify(divisor)) in test__divxc3()
71 if (classify(r) != NaN) in test__divxc3()
75 if (classify(r) != zero) in test__divxc3()
79 if (classify(r) != zero) in test__divxc3()
83 if (classify(r) != NaN) in test__divxc3()
87 if (classify(r) != NaN) in test__divxc3()
93 switch (classify(divisor)) in test__divxc3()
96 if (classify(r) != inf) in test__divxc3()
[all …]
|
| D | divdc3_test.c | 27 classify(double _Complex x) in classify() function
63 switch (classify(dividend)) in test__divdc3()
66 switch (classify(divisor)) in test__divdc3()
69 if (classify(r) != NaN) in test__divdc3()
73 if (classify(r) != zero) in test__divdc3()
77 if (classify(r) != zero) in test__divdc3()
81 if (classify(r) != NaN) in test__divdc3()
85 if (classify(r) != NaN) in test__divdc3()
91 switch (classify(divisor)) in test__divdc3()
94 if (classify(r) != inf) in test__divdc3()
[all …]
|
| D | multc3_test.c | 30 classify(long double _Complex x) in classify() function
66 switch (classify(dividend)) in test__multc3()
69 switch (classify(divisor)) in test__multc3()
72 if (classify(r) != zero) in test__multc3()
76 if (classify(r) != zero) in test__multc3()
80 if (classify(r) != NaN) in test__multc3()
84 if (classify(r) != NaN) in test__multc3()
88 if (classify(r) != NaN) in test__multc3()
94 switch (classify(divisor)) in test__multc3()
97 if (classify(r) != zero) in test__multc3()
[all …]
|
| D | mulsc3_test.c | 27 classify(float _Complex x) in classify() function
63 switch (classify(dividend)) in test__mulsc3()
66 switch (classify(divisor)) in test__mulsc3()
69 if (classify(r) != zero) in test__mulsc3()
73 if (classify(r) != zero) in test__mulsc3()
77 if (classify(r) != NaN) in test__mulsc3()
81 if (classify(r) != NaN) in test__mulsc3()
85 if (classify(r) != NaN) in test__mulsc3()
91 switch (classify(divisor)) in test__mulsc3()
94 if (classify(r) != zero) in test__mulsc3()
[all …]
|
| D | divsc3_test.c | 27 classify(float _Complex x) in classify() function
63 switch (classify(dividend)) in test__divsc3()
66 switch (classify(divisor)) in test__divsc3()
69 if (classify(r) != NaN) in test__divsc3()
73 if (classify(r) != zero) in test__divsc3()
77 if (classify(r) != zero) in test__divsc3()
81 if (classify(r) != NaN) in test__divsc3()
85 if (classify(r) != NaN) in test__divsc3()
91 switch (classify(divisor)) in test__divsc3()
94 if (classify(r) != inf) in test__divsc3()
[all …]
|
| D | divtc3_test.c | 28 classify(long double _Complex x) in classify() function
65 switch (classify(dividend)) in test__divtc3()
68 switch (classify(divisor)) in test__divtc3()
71 if (classify(r) != NaN) in test__divtc3()
75 if (classify(r) != zero) in test__divtc3()
79 if (classify(r) != zero) in test__divtc3()
83 if (classify(r) != NaN) in test__divtc3()
87 if (classify(r) != NaN) in test__divtc3()
93 switch (classify(divisor)) in test__divtc3()
96 if (classify(r) != inf) in test__divtc3()
[all …]
|
| D | muldc3_test.c | 27 classify(double _Complex x) in classify() function
63 switch (classify(dividend)) in test__muldc3()
66 switch (classify(divisor)) in test__muldc3()
69 if (classify(r) != zero) in test__muldc3()
73 if (classify(r) != zero) in test__muldc3()
77 if (classify(r) != NaN) in test__muldc3()
81 if (classify(r) != NaN) in test__muldc3()
85 if (classify(r) != NaN) in test__muldc3()
91 switch (classify(divisor)) in test__muldc3()
94 if (classify(r) != zero) in test__muldc3()
[all …]
|
| D | mulxc3_test.c | 29 classify(long double _Complex x) in classify() function
65 switch (classify(dividend)) in test__mulxc3()
68 switch (classify(divisor)) in test__mulxc3()
71 if (classify(r) != zero) in test__mulxc3()
75 if (classify(r) != zero) in test__mulxc3()
79 if (classify(r) != NaN) in test__mulxc3()
83 if (classify(r) != NaN) in test__mulxc3()
87 if (classify(r) != NaN) in test__mulxc3()
93 switch (classify(divisor)) in test__mulxc3()
96 if (classify(r) != zero) in test__mulxc3()
[all …]
|
| /external/libcxx/test/std/numerics/complex.number/complex.value.ops/ |
| D | polar.pass.cpp | 55 switch (classify(r)) in test_edges()
58 if (std::signbit(r) || classify(theta) == inf || classify(theta) == NaN) in test_edges()
60 int c = classify(z); in test_edges()
69 if (std::signbit(r) || classify(theta) == inf || classify(theta) == NaN) in test_edges()
71 int c = classify(z); in test_edges()
82 int c = classify(z); in test_edges()
87 assert(classify(z) == inf); in test_edges()
88 if (classify(theta) != NaN && classify(theta) != inf) in test_edges()
90 assert(classify(real(z)) != NaN); in test_edges()
91 assert(classify(imag(z)) != NaN); in test_edges()
[all …]
|
| D | proj.pass.cpp | 44 switch (classify(x[i])) in test_edges()
59 assert(classify(r) == classify(x[i])); in test_edges()
|
| D | norm.pass.cpp | 35 switch (classify(x[i])) in test_edges()
|
| D | abs.pass.cpp | 35 switch (classify(x[i])) in test_edges()
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | ComparisonChain.java | 76 return classify(left.compareTo(right));
80 return classify(comparator.compare(left, right));
83 return classify(Ints.compare(left, right));
86 return classify(Longs.compare(left, right));
89 return classify(Float.compare(left, right));
92 return classify(Double.compare(left, right));
95 return classify(Booleans.compare(right, left)); // reversed
98 return classify(Booleans.compare(left, right));
100 ComparisonChain classify(int result) {
|
| /external/clang/lib/Analysis/ |
| D | UninitializedValues.cpp | 322 void classify(const Expr *E, Class C);
361 void ClassifyRefs::classify(const Expr *E, Class C) { in classify() function in ClassifyRefs
365 classify(CO->getTrueExpr(), C); in classify()
366 classify(CO->getFalseExpr(), C); in classify()
372 classify(BCO->getFalseExpr(), C); in classify()
377 classify(OVE->getSourceExpr(), C); in classify()
384 classify(ME->getBase(), C); in classify()
393 classify(BO->getLHS(), C); in classify()
396 classify(BO->getRHS(), C); in classify()
424 classify(BO->getLHS(), Use); in VisitBinaryOperator()
[all …]
|
| /external/owasp/sanitizer/tools/ |
| D | update_tree_in_svn.py | 34 def classify(path): function
112 src_t = classify(src)
113 dst_t = classify(dst)
|
| /external/iproute2/examples/diffserv/ |
| D | README | 41 *classify:
74 classify based on the DSCPs and use the policer ids to decide tagging
77 *classify on ingress:
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/dfp/ |
| D | DfpMath.java | 120 if (result[0].classify() == Dfp.INFINITE || result[0].equals(result[1])) { in splitMult()
330 if (a.classify() == Dfp.INFINITE) { in log()
552 … if (y.classify() == Dfp.FINITE && y.rint().equals(y) && !y.remainder(two).equals(zero)) { in pow()
576 if (x.greaterThan(one) && y.classify() == Dfp.INFINITE) { in pow()
584 if (x.lessThan(one) && y.classify() == Dfp.INFINITE) { in pow()
592 if (x.equals(one) && y.classify() == Dfp.INFINITE) { in pow()
597 if (x.classify() == Dfp.INFINITE) { in pow()
601 … if (y.classify() == Dfp.FINITE && y.rint().equals(y) && !y.remainder(two).equals(zero)) { in pow()
|
| D | DfpDec.java | 356 if (result.classify() == INFINITE && this.classify() != INFINITE) { in nextAfter()
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| D | BidiClassifier.java | 89 public int classify(int c) { in classify() method in BidiClassifier
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| D | BidiClassifier.java | 93 public int classify(int c) { in classify() method in BidiClassifier
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/bidi/ |
| D | TestClassOverride.java | 70 public int classify(int c) { in classify() method in TestClassOverride.CustomClassifier
73 : c >= nEntries ? super.classify(c) in classify()
|
| /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/bidi/ |
| D | TestClassOverride.java | 66 public int classify(int c) { in classify() method in TestClassOverride.CustomClassifier
69 : c >= nEntries ? super.classify(c) in classify()
|
| /external/iptables/extensions/ |
| D | libxt_CLASSIFY.man | 1 This module allows you to set the skb\->priority value (and thus classify the packet into a specifi…
|