HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 226 - 250 of 657) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/
CollationServiceTest.java 261 int n1 = checkAvailable("before registerFactory"); local
305 assertTrue("register increases count", n2>n1);
306 assertTrue("unregister restores count", n3==n1);
  /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
CollationServiceTest.java 257 int n1 = checkAvailable("before registerFactory"); local
301 assertTrue("register increases count", n2>n1);
302 assertTrue("unregister restores count", n3==n1);
  /external/javassist/src/test/test/javassist/convert/
ArrayAccessReplaceTest.java 409 Number n1, n2, n3, n4; local
420 n1 = ns[1];
430 return n1;
  /external/opencv3/apps/traincascade/
old_ml_tree.cpp 1825 int n1 = node->get_num_valid(vi); local
1978 int n1 = node->get_num_valid(vi); local
2381 int n1 = node->get_num_valid(vi); local
2533 int n = node->sample_count, n1 = node->get_num_valid(vi); local
2990 int n1 = node->get_num_valid(vi); local
3074 int n1 = node->get_num_valid(vi); local
3185 int n1 = node->get_num_valid(vi), nr1 = 0; local
    [all...]
  /external/protobuf/gtest/test/
gtest_output_test_.cc 230 // waits for n1 | SCOPED_TRACE("Trace B");
232 // | notifies n1
250 Notification n1; member in struct:CheckPoints
260 check_points->n1.Notify();
278 check_points.n1.WaitForNotification();
    [all...]
gtest_unittest.cc 2239 const int n1 = 1; local
2257 const int n1 = 1; local
2274 int n1 = 0; local
2286 n1++, n2++, n3++, n4++, n5++) local
    [all...]
  /external/vulkan-validation-layers/tests/gtest-1.7.0/test/
gtest_output_test_.cc 256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();
  /frameworks/native/opengl/tests/hwc/
hwcCommit.cpp 394 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
395 formats.push_back(hwcTestGraphicFormat[n1].desc);
    [all...]
  /ndk/sources/third_party/googletest/googletest/test/
gtest_output_test_.cc 256 // waits for n1 | SCOPED_TRACE("Trace B");
258 // | notifies n1
276 Notification n1; member in struct:CheckPoints
286 check_points->n1.Notify();
304 check_points.n1.WaitForNotification();
  /external/clang/test/CXX/expr/expr.const/
p2-0x.cpp 14 int n1[this->this1]; // expected-warning {{variable length array}} local
16 (void)n1, (void)n2;
230 constexpr int n1 = 2 * 3 * 3 * 7 * 11 * 31 * 151 * 331; // ok member in namespace:UndefinedBehavior::Overflow
232 constexpr int n3 = n1 + 1; // ok
  /external/clang/test/Modules/
macros.c 188 int n1 = TOP_OTHER_REDEF1; // expected-warning{{ambiguous expansion of macro 'TOP_OTHER_REDEF1'}} variable
  /external/eigen/Eigen/src/Eigenvalues/
SelfAdjointEigenSolver.h 555 Scalar n0, n1; local
558 n1 = (c1 = representative.cross(mat.col((i0+2)%3))).squaredNorm();
559 if(n0>n1) res = c0/std::sqrt(n0);
560 else res = c1/std::sqrt(n1);
  /external/eigen/unsupported/Eigen/src/FFT/
ei_kissfft_impl.h 283 void fwd2( Complex * dst,const Complex *src,int n0,int n1)
288 EIGEN_UNUSED_VARIABLE(n1);
292 void inv2( Complex * dst,const Complex *src,int n0,int n1)
297 EIGEN_UNUSED_VARIABLE(n1);
  /external/icu/icu4c/source/test/intltest/
svccoll.cpp 346 int32_t n1, n2, n3; local
396 n1 = checkAvailable("before registerFactory");
401 assertTrue("count after > count before", n2 > n1);
468 assertTrue("count after unregister == count before register", n3 == n1);
  /external/iptables/iptables/
iptables-apply 151 read -n1 -t "${TIMEOUT:-15}" ret 2>&1 || :
  /external/opencv/ml/src/
mltree.cpp 1479 int n1 = node->get_num_valid(vi); local
1572 int n1 = node->get_num_valid(vi); local
2053 int n1 = node->get_num_valid(vi); local
2472 int n1 = node->get_num_valid(vi); local
2554 int n1 = node->get_num_valid(vi); local
2601 int n1 = node->get_num_valid(vi), nr1 = 0; local
    [all...]
  /external/opencv3/samples/cpp/
select3dobj.cpp 253 float n1 = (float)norm(d1), n2 = (float)norm(d2); local
254 if( n1*n2 < eps )
258 Z = d1.dot(d2)/(n1*n1);
  /external/skia/platform_tools/android/bin/utils/
setup_toolchain.sh 81 GCC=$(command ls $ANDROID_TOOLCHAIN/*-gcc | head -n1)
  /ndk/sources/host-tools/nawk-20071023/
lib.c 71 void makefields(int n1, int n2) /* create $n1..$n2 inclusive */
76 for (i = n1; i <= n2; i++) {
357 void cleanfld(int n1, int n2) /* clean out fields n1 .. n2 inclusive */
362 for (i = n1; i <= n2; i++) {
  /external/libcxx/test/std/strings/basic.string/string.ops/string_compare/
size_size_pointer.pass.cpp 12 // int compare(size_type pos, size_type n1, const charT *s) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1,
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
  /external/v8/src/compiler/
raw-machine-assembler.h 719 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) {
720 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
722 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) {
723 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
725 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) {
726 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
743 Node* AddNode(const Operator* op, Node* n1, TArgs... args) {
744 Node* buffer[] = {n1, args...};
  /external/v8/test/mjsunit/regress/
regress-842.js 36 var obj = { name: "n1" };
  /external/valgrind/coregrind/m_debuginfo/
image.c 290 ULong n1, ULong n2, ULong n3 )
297 write_ULong_le(&f->data[4 + 0*8], n1);
317 /*OUT*/ULong* n1 )
324 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
329 /*OUT*/ULong* n1, /*OUT*/ULong* n2 )
336 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
369 /*OUT*/ULong* n1, /*OUT*/ULong* n2, /*OUT*/ULong* n3,
378 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_compare/
size_size_pointer.pass.cpp 12 // int compare(size_type pos, size_type n1, const charT *s) const;
31 test(const S& s, typename S::size_type pos1, typename S::size_type n1,
36 assert(sign(s.compare(pos1, n1, str)) == sign(x));
  /bionic/libc/upstream-openbsd/lib/libc/gdtoa/
misc.c 465 int i, k1, n, n1; local
471 n1 = n + b->wds + 1;
472 for(i = b->maxwds; n1 > i; i <<= 1)
492 ++n1;
502 ++n1;
508 b1->wds = n1 - 1;

Completed in 1065 milliseconds

1 2 3 4 5 6 7 8 91011>>