| /external/libcxx/test/std/numerics/complex.number/complex.ops/ |
| complex_divide_complex.pass.cpp | 46 switch (classify(x[i]))
49 switch (classify(x[j]))
52 assert(classify(r) == NaN);
55 assert(classify(r) == zero);
58 assert(classify(r) == zero);
61 assert(classify(r) == NaN);
64 assert(classify(r) == NaN);
69 switch (classify(x[j]))
72 assert(classify(r) == inf);
75 assert(classify(r) == non_zero)
[all...] |
| complex_times_complex.pass.cpp | 48 switch (classify(x[i]))
51 switch (classify(x[j]))
54 assert(classify(r) == zero);
57 assert(classify(r) == zero);
60 assert(classify(r) == NaN);
63 assert(classify(r) == NaN);
66 assert(classify(r) == NaN);
71 switch (classify(x[j]))
74 assert(classify(r) == zero);
77 assert(classify(r) == non_zero)
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/complex.number/complex.ops/ |
| complex_divide_complex.pass.cpp | 46 switch (classify(x[i]))
49 switch (classify(x[j]))
52 assert(classify(r) == NaN);
55 assert(classify(r) == zero);
58 assert(classify(r) == zero);
61 assert(classify(r) == NaN);
64 assert(classify(r) == NaN);
69 switch (classify(x[j]))
72 assert(classify(r) == inf);
75 assert(classify(r) == non_zero)
[all...] |
| complex_times_complex.pass.cpp | 48 switch (classify(x[i]))
51 switch (classify(x[j]))
54 assert(classify(r) == zero);
57 assert(classify(r) == zero);
60 assert(classify(r) == NaN);
63 assert(classify(r) == NaN);
66 assert(classify(r) == NaN);
71 switch (classify(x[j]))
74 assert(classify(r) == zero);
77 assert(classify(r) == non_zero)
[all...] |
| /external/libcxx/test/std/numerics/complex.number/complex.value.ops/ |
| polar.pass.cpp | 55 switch (classify(r))
58 if (std::signbit(r) || classify(theta) == inf || classify(theta) == NaN)
60 int c = classify(z);
69 if (std::signbit(r) || classify(theta) == inf || classify(theta) == NaN)
71 int c = classify(z);
82 int c = classify(z);
87 assert(classify(z) == inf);
88 if (classify(theta) != NaN && classify(theta) != inf
[all...] |
| proj.pass.cpp | 44 switch (classify(x[i]))
59 assert(classify(r) == classify(x[i]));
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/complex.number/complex.value.ops/ |
| polar.pass.cpp | 55 switch (classify(r))
58 if (std::signbit(r) || classify(theta) == inf || classify(theta) == NaN)
60 int c = classify(z);
69 if (std::signbit(r) || classify(theta) == inf || classify(theta) == NaN)
71 int c = classify(z);
82 int c = classify(z);
87 assert(classify(z) == inf);
88 if (classify(theta) != NaN && classify(theta) != inf
[all...] |
| proj.pass.cpp | 44 switch (classify(x[i]))
59 assert(classify(r) == classify(x[i]));
|
| /external/compiler-rt/test/builtins/Unit/ |
| divdc3_test.c | 26 classify(double _Complex x) function
62 switch (classify(dividend))
65 switch (classify(divisor))
68 if (classify(r) != NaN)
72 if (classify(r) != zero)
76 if (classify(r) != zero)
80 if (classify(r) != NaN)
84 if (classify(r) != NaN)
90 switch (classify(divisor))
93 if (classify(r) != inf
[all...] |
| divsc3_test.c | 26 classify(float _Complex x) function
62 switch (classify(dividend))
65 switch (classify(divisor))
68 if (classify(r) != NaN)
72 if (classify(r) != zero)
76 if (classify(r) != zero)
80 if (classify(r) != NaN)
84 if (classify(r) != NaN)
90 switch (classify(divisor))
93 if (classify(r) != inf
[all...] |
| divtc3_test.c | 30 classify(long double _Complex x) function
67 switch (classify(dividend))
70 switch (classify(divisor))
73 if (classify(r) != NaN)
77 if (classify(r) != zero)
81 if (classify(r) != zero)
85 if (classify(r) != NaN)
89 if (classify(r) != NaN)
95 switch (classify(divisor))
98 if (classify(r) != inf
[all...] |
| divxc3_test.c | 29 classify(long double _Complex x) function
65 switch (classify(dividend))
68 switch (classify(divisor))
71 if (classify(r) != NaN)
75 if (classify(r) != zero)
79 if (classify(r) != zero)
83 if (classify(r) != NaN)
87 if (classify(r) != NaN)
93 switch (classify(divisor))
96 if (classify(r) != inf
[all...] |
| muldc3_test.c | 26 classify(double _Complex x) function
62 switch (classify(dividend))
65 switch (classify(divisor))
68 if (classify(r) != zero)
72 if (classify(r) != zero)
76 if (classify(r) != NaN)
80 if (classify(r) != NaN)
84 if (classify(r) != NaN)
90 switch (classify(divisor))
93 if (classify(r) != zero
[all...] |
| mulsc3_test.c | 26 classify(float _Complex x) function
62 switch (classify(dividend))
65 switch (classify(divisor))
68 if (classify(r) != zero)
72 if (classify(r) != zero)
76 if (classify(r) != NaN)
80 if (classify(r) != NaN)
84 if (classify(r) != NaN)
90 switch (classify(divisor))
93 if (classify(r) != zero
[all...] |
| multc3_test.c | 30 classify(long double _Complex x) function
66 switch (classify(dividend))
69 switch (classify(divisor))
72 if (classify(r) != zero)
76 if (classify(r) != zero)
80 if (classify(r) != NaN)
84 if (classify(r) != NaN)
88 if (classify(r) != NaN)
94 switch (classify(divisor))
97 if (classify(r) != zero
[all...] |
| mulxc3_test.c | 29 classify(long double _Complex x) function
65 switch (classify(dividend))
68 switch (classify(divisor))
71 if (classify(r) != zero)
75 if (classify(r) != zero)
79 if (classify(r) != NaN)
83 if (classify(r) != NaN)
87 if (classify(r) != NaN)
93 switch (classify(divisor))
96 if (classify(r) != zero
[all...] |
| /external/iptables/extensions/ |
| libxt_CLASSIFY.man | 1 This module allows you to set the skb\->priority value (and thus classify the packet into a specific CBQ class).
|
| libxt_CLASSIFY.c | 18 "CLASSIFY target options:\n"
62 printf(" CLASSIFY set");
78 .name = "CLASSIFY",
|
| /external/guava/guava/src/com/google/common/collect/ |
| 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) {
|
| /frameworks/ml/bordeaux/service/src/android/bordeaux/services/ |
| BordeauxClassifier.java | 32 * For classifying: call classify
90 public int classify(final HashMap<Integer, Float> sample) { method in class:BordeauxClassifier
95 return mClassifier.Classify(getArrayList(sample));
97 Log.e(TAG,"Exception: classify the sample.");
|
| ILearning_MulticlassPA.aidl | 28 int Classify(in List<IntFloat> sample);
|
| /external/iproute2/examples/diffserv/ |
| README | 41 *classify:
74 classify based on the DSCPs and use the policer ids to decide tagging
77 *classify on ingress:
|
| /external/owasp/sanitizer/tools/ |
| update_tree_in_svn.py | 34 def classify(path): function in function:sync
112 src_t = classify(src)
113 dst_t = classify(dst)
|
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| BidiClassifier.java | 30 * <code>classify</code> of the custom <code>BidiClassifier</code> will be
93 public int classify(int c) { method in class:BidiClassifier
|
| /external/svox/pico/lib/ |
| picokdt.h | 142 classify function.
144 classify:
145 for every tree type there is a classify function to apply the
150 output is returned by the classify function in a variable.
217 /* classify a previously constructed input vector using tree 'this'
255 /* classify a previously constructed input vector using tree 'this'
309 /* classify a previously constructed input vector using tree 'this'
358 /* classify a previously constructed input vector using tree 'this'
418 /* classify a previously constructed input vector using tree 'this'
447 /* classify a previously constructed input vector using tree 'this
[all...] |
