| /external/opencv3/modules/cudev/include/opencv2/cudev/functional/ |
| tuple_adapter.hpp | 78 template <class Op, int n0, int n1> struct BinaryTupleAdapter
87 return op(get<n0>(t), get<n1>(t));
91 template <int n0, int n1, class Op>
92 __host__ __device__ BinaryTupleAdapter<Op, n0, n1> binaryTupleAdapter(const Op& op)
94 BinaryTupleAdapter<Op, n0, n1> a;
|
| /external/protobuf/gtest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/webrtc/webrtc/system_wrappers/include/ |
| ntp_time.h | 55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) {
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) {
59 return !(n1 == n2);
|
| /ndk/sources/host-tools/toolbox/ |
| cmp_win.c | 70 int n1, n2, ret = 0; local
72 n1 = fread(buf1, 1, BUFSIZE, f1);
74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
75 } while (!ret && n1 == BUFSIZE);
|
| /ndk/sources/third_party/googletest/googletest/samples/ |
| sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
|
| /external/bzip2/ |
| bzmore | 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
|
| /external/elfutils/libelf/ |
| elf32_fsize.c | 67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/v8/src/compiler/ |
| graph.h | 67 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
68 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
69 Node* nodes[] = {n1, n2};
72 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
73 Node* nodes[] = {n1, n2, n3};
76 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
77 Node* nodes[] = {n1, n2, n3, n4};
80 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
82 Node* nodes[] = {n1, n2, n3, n4, n5}
[all...] |
| /art/test/963-default-range-smali/src/ |
| Iface.java | 17 public default String SayHi(String n1,
|
| /external/clang/test/Sema/ |
| attr-section.c | 13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute only applies to functions and global variables}} local
|
| /external/llvm/utils/ |
| GetRepositoryPath | 22 git remote -v | grep 'fetch' | awk '{ print $2 }' | head -n1
|
| /libcore/ojluni/src/main/java/sun/misc/ |
| ASCIICaseInsensitiveComparator.java | 41 int n1=s1.length(), n2=s2.length(); local
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
|
| /external/iproute2/ip/ |
| rtmon.c | 34 struct nlmsghdr *n1 = (void*)buf; local
37 n1->nlmsg_type = NLMSG_TSTAMP;
38 n1->nlmsg_flags = 0;
39 n1->nlmsg_seq = 0;
40 n1->nlmsg_pid = 0;
41 n1->nlmsg_len = NLMSG_LENGTH(4*2);
43 ((__u32*)NLMSG_DATA(n1))[0] = tv.tv_sec;
44 ((__u32*)NLMSG_DATA(n1))[1] = tv.tv_usec;
45 fwrite((void*)n1, 1, NLMSG_ALIGN(n1->nlmsg_len), fp)
[all...] |
| /external/v8/test/unittests/compiler/ |
| value-numbering-reducer-unittest.cc | 47 Node* n1 = graph()->NewNode(&kOp1, na); local
49 EXPECT_FALSE(Reduce(n1).Changed());
56 Node* n1 = graph()->NewNode(&kOp1, n0); local
57 EXPECT_FALSE(Reduce(n1).Changed());
58 n1->Kill();
66 Node* n1 = graph()->NewNode(&op); local
68 EXPECT_FALSE(Reduce(n1).Changed());
83 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); local
84 Reduction r1 = Reduce(n1);
92 EXPECT_EQ(n1, r2.replacement())
[all...] |
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_fftw_impl.h | 82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
83 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
88 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
125 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
130 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
166 if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT)
206 get_plan(n0,n1,false,dst,src).fwd2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
227 get_plan(n0,n1,true,dst,src).inv2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_object_graph.py | 50 n1 = Node("n1")
55 n1b = Node("n1")
60 graph.addNode(n1)
64 self.assertTrue(n1 in graph)
66 self.assertTrue("n1" in graph)
69 self.assertTrue(graph.findNode(n1) is n1)
70 self.assertTrue(graph.findNode(n1b) is n1)
73 self.assertTrue(graph.findNode("n1") is n1
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/stat/inference/ |
| TTestImpl.java | 228 * <code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
230 * where <strong><code>n1</code></strong> is the size of first sample;
237 * <code>var = sqrt(((n1 - 1)var1 + (n2 - 1)var2) / ((n1-1) + (n2-1)))</code>
270 * <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
272 * where <strong><code>n1</code></strong> is the size of the first sample
309 * <code> t = (m1 - m2) / sqrt(var1/n1 + var2/n2)</code>
311 * where <strong><code>n1</code></strong> is the size of the first sample;
350 * <code> t = (m1 - m2) / (sqrt(1/n1 +1/n2) sqrt(var))</code>
352 * where <strong><code>n1</code></strong> is the size of first sample
[all...] |
| /external/guava/guava-tests/benchmark/com/google/common/math/ |
| BigIntegerMathBenchmark.java | 68 * Returns the product of {@code n1} exclusive through {@code n2} inclusive.
70 private static BigInteger oldSlowFactorial(int n1, int n2) {
71 assert n1 <= n2; local
72 if (IntMath.log2(n2, CEILING) * (n2 - n1) < Long.SIZE - 1) {
75 for (int i = n1 + 1; i <= n2; i++) {
85 int mid = (n1 + n2) >>> 1;
86 return oldSlowFactorial(n1, mid).multiply(oldSlowFactorial(mid, n2));
|
| /external/clang/test/CodeGenCXX/ |
| nested-base-member-access.cpp | 50 N n1; local
51 n1.PR();
|
| /external/skia/platform_tools/android/bin/ |
| android_gdb_native | 48 GDB_COMMAND=$(command ls "$ANDROID_TOOLCHAIN"/*-gdb | head -n1)
|
| /external/testng/src/main/java/org/testng/ |
| SuiteResult.java | 53 String n1 = getTestContext().getName(); local
55 result = n1.compareTo(n2);
|
| /external/icu/icu4c/source/samples/uciter8/ |
| uciter8.c | 43 compareIterators(UCharIterator *iter1, const char *n1,
52 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
61 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
75 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
84 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
94 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
102 log_err("%s->move(start) failed\n", n1);
106 log_err("%s->hasNext() at the start returns FALSE\n", n1);
124 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
130 log_err("%s->hasNext() at the end returns TRUE\n", n1);
[all...] |
| /external/opencv3/modules/photo/test/ |
| test_inpaint.cpp | 94 double n1 = cvtest::norm(diff1.reshape(1), NORM_INF, inv_mask.reshape(1)); local
97 if (n1 != 0 || n2 != 0)
106 n1 = cvtest::norm(diff1.reshape(1), NORM_INF, mask.reshape(1));
110 if (n1 > jpeg_thres || n2 > jpeg_thres)
|
| /system/extras/tests/binder/benchmarks/ |
| binderAddInts.cpp | 223 for (unsigned int n1 = 0; n1 < str.size(); n1++) {
224 if ((str[n1] > 0x20) && (str[n1] < 0x80)) {
225 stream << (char) str[n1];
236 for (unsigned int n1 = 0; n1 < CPU_SETSIZE; n1++) {
237 if (CPU_ISSET(n1, &set))
239 stream << n1; local
[all...] |
