HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 201 - 225 of 954) sorted by null

1 2 3 4 5 6 7 891011>>

  /external/libcxx/test/std/strings/string.view/string.view.ops/
compare.pointer_size.pass.cpp 12 // constexpr int compare(size_type pos1, size_type n1, const charT* s) const;
24 size_t pos1, size_t n1, const CharT *s, int expected ) {
27 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
30 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
41 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected)
45 test1 ( sv1, pos1, n1, s2, expected );
  /external/tensorflow/tensorflow/python/profiler/
profiler_test.py 200 n1 = lib.SearchTFProfNode(
204 self.assertEqual(n1.exec_micros, 0)
205 self.assertEqual(n1.requested_bytes, 0)
206 self.assertEqual(n1.peak_bytes, 0)
207 self.assertEqual(n1.residual_bytes, 0)
  /libcore/ojluni/src/main/java/sun/util/calendar/
BaseCalendar.java 494 int n400, n100, n4, n1; local
505 n1 = d3 / 365;
515 n1 = CalendarUtils.floorDivide(d3, 365);
518 year = 400 * n400 + 100 * n100 + 4 * n4 + n1;
519 if (!(n100 == 4 || n1 == 4)) {
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/string.view/string.view.ops/
compare.pointer_size.pass.cpp 12 // constexpr int compare(size_type pos1, size_type n1, const charT* s) const;
24 size_t pos1, size_t n1, const CharT *s, int expected ) {
28 sv1.compare(pos1, n1, s);
36 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
42 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected)
46 test1 ( sv1, pos1, n1, s2, expected );
  /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/strings/string.view/string.view.ops/
compare.pointer_size.pass.cpp 12 // constexpr int compare(size_type pos1, size_type n1, const charT* s) const;
24 size_t pos1, size_t n1, const CharT *s, int expected ) {
27 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
30 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
41 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected)
45 test1 ( sv1, pos1, n1, s2, expected );
  /external/libchrome/base/third_party/nspr/
prtime.cc 836 int n1, n2, n3; local
845 n1 = (*s++ - '0'); /* first 1, 2 or 4 digits */
848 n1 = n1*10 + (*s++ - '0');
852 n1 = n1*10 + (*s++ - '0');
855 n1 = n1*10 + (*s++ - '0');
    [all...]
  /frameworks/native/opengl/tests/hwc/
hwcTestLib.cpp 360 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
361 if (string(desc) == string(hwcTestGraphicFormat[n1].desc)) {
362 return &hwcTestGraphicFormat[n1];
374 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
375 if (id == hwcTestGraphicFormat[n1].format) {
376 return &hwcTestGraphicFormat[n1];
    [all...]
  /external/boringssl/src/crypto/fipsmodule/bn/
div.c 141 BN_ULONG n0, BN_ULONG n1, BN_ULONG d0) {
162 : "a"(n1), "d"(n0), "rm"(d0)
168 : "a"(n1), "d"(n0), "rm"(d0)
172 BN_ULLONG n = (((BN_ULLONG)n0) << BN_BITS2) | n1;
175 *quotient_out = bn_div_words(n0, n1, d0);
177 *rem_out = n1 - (*quotient_out * d0);
308 BN_ULONG n0, n1, rm = 0; local
311 n1 = wnump[-1];
316 bn_div_rem_words(&q, &rm, n0, n1, d0);
  /prebuilts/go/darwin-x86/src/runtime/
runtime_test.go 338 n1, ok := GoroutineProfile(nil) // should fail, there's at least 1 goroutine
339 if n1 < 1 || ok {
340 t.Fatalf("GoroutineProfile(nil) = %d, %v, want >0, false", n1, ok)
342 n2, ok := GoroutineProfile(make([]StackRecord, n1))
343 if n2 == n1 && ok {
346 t.Logf("GoroutineProfile(%d) = %d, %v, want %d, true", n1, n2, ok, n1)
  /prebuilts/go/linux-x86/src/runtime/
runtime_test.go 338 n1, ok := GoroutineProfile(nil) // should fail, there's at least 1 goroutine
339 if n1 < 1 || ok {
340 t.Fatalf("GoroutineProfile(nil) = %d, %v, want >0, false", n1, ok)
342 n2, ok := GoroutineProfile(make([]StackRecord, n1))
343 if n2 == n1 && ok {
346 t.Logf("GoroutineProfile(%d) = %d, %v, want %d, true", n1, n2, ok, n1)
  /external/tensorflow/tensorflow/compiler/xla/
reference_util.cc 111 Array4D<float> a4dlhs(lhs.n1(), lhs.n2(), lhs.n3(), 1);
117 Array4D<float> a4drhs(rhs.n1(), rhs.n2(), rhs.n3(), 1);
272 i0_base + i0_win < operand.n1() &&
288 std::vector<int64> dim_lengths{operand.n1(), operand.n2(), operand.n3()};
313 i2_base + i2_win >= 0 && i0_base + i0_win < operand.n1() &&
335 std::vector<int64> dim_lengths{operand.n1(), operand.n2(), operand.n3(),
349 std::vector<int64> dim_lengths{operand.n1(), operand.n2(), operand.n3(),
379 i0_base + i0_win < operand.n1() &&
428 auto result = MakeUnique<Array4D<float>>(operand.n1(), operand.n2(),
430 std::vector<int64> dim_lengths{operand.n1(), operand.n2(), operand.n3()
    [all...]
  /external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
TreeWizard.cs 435 int n1 = adaptor.GetChildCount(t1);
437 if (n1 != n2) {
440 for (int i = 0; i < n1; i++) {
514 int n1 = adaptor.GetChildCount(t1);
516 if (n1 != n2) {
519 for (int i = 0; i < n1; i++) {
  /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
TreeWizard.cs 499 int n1 = adaptor.GetChildCount( t1 );
501 if ( n1 != n2 )
505 for ( int i = 0; i < n1; i++ )
588 int n1 = adaptor.GetChildCount( t1 );
590 if ( n1 != n2 )
594 for ( int i = 0; i < n1; i++ )
  /packages/apps/LegacyCamera/jni/feature_stab/db_vlvm/
db_utilities_poly.h 302 double C[16],n0,n1,n2,n3,m; local
352 n1=db_sqr(C[4]) +db_sqr(C[5]) +db_sqr(C[6]) +db_sqr(C[7]);
358 if(n0>=n1 && n0>=n2 && n0>=n3)
363 else if(n1>=n2 && n1>=n3)
365 m=db_SafeReciprocal(sqrt(n1));
  /external/toolchain-utils/cros_utils/
stats.py 198 ## 99-06-24 ... fixed bug(?) in attest_ind (n1=a.shape[0])
954 n1 = 0
963 n1 = n1 + 1
    [all...]
  /external/expat/
coverage.sh 75 local mingw_gcc_dll_dir="$(dirname "$(ls -1 /usr/lib*/gcc/i686-w64-mingw32/*/libgcc_s_sjlj-1.dll | head -n1)")"
83 local mingw_pthread_dll_dir="$(dirname "$(ls -1 /usr/i686-w64-mingw32/lib*/libwinpthread-1.dll | head -n1)")"
  /external/gemmlowp/profiling/
profiler.h 170 static bool CompareNodes(Node* n1, Node* n2) {
171 return n1->weight > n2->weight;
  /external/protobuf/objectivec/DevTools/
compile_testing_protos.sh 49 | sort -n | tail -n1 | cut -f2- -d" ")
55 | sort -n -r | tail -n1 | cut -f2- -d" ")
  /external/valgrind/callgrind/
events.c 71 EventGroup* CLG_(register_event_group) (int id, const HChar* n1)
74 eg->name[0] = n1;
79 EventGroup* CLG_(register_event_group2)(int id, const HChar* n1,
83 eg->name[0] = n1;
89 EventGroup* CLG_(register_event_group3)(int id, const HChar* n1,
93 eg->name[0] = n1;
100 EventGroup* CLG_(register_event_group4)(int id, const HChar* n1,
105 eg->name[0] = n1;
  /prebuilts/go/darwin-x86/src/compress/gzip/
gzip_test.go 183 n1 := buf.Len()
184 if n1 == 0 {
191 if n1 != n2 {
192 t.Fatalf("after writing a single byte, size changed from %d to %d; want no change", n1, n2)
  /prebuilts/go/darwin-x86/test/
const5.go 24 n1 = len(b.a)
23 n1 = len(b.a) const
  /prebuilts/go/linux-x86/src/compress/gzip/
gzip_test.go 183 n1 := buf.Len()
184 if n1 == 0 {
191 if n1 != n2 {
192 t.Fatalf("after writing a single byte, size changed from %d to %d; want no change", n1, n2)
  /prebuilts/go/linux-x86/test/
const5.go 24 n1 = len(b.a)
23 n1 = len(b.a) const
  /system/core/libutils/
Unicode.cpp 324 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2)
326 const char16_t* e1 = s1+n1;
336 return n1 < n2
338 : (n1 > n2
343 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2)
345 const char16_t* e1 = s1H+n1;
357 return n1 < n2
359 : (n1 > n2
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
InsnFormat.java 441 * @param n1 {@code 0..15;} medium-low nibble
446 protected static short codeUnit(int n0, int n1, int n2, int n3) {
451 if ((n1 & 0xf) != n1) {
452 throw new IllegalArgumentException("n1 out of range 0..15");
463 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));

Completed in 936 milliseconds

1 2 3 4 5 6 7 891011>>