/external/libmojo/mojo/public/cpp/bindings/tests/ |
equals_unittest.cc | 63 NamedRegionPtr n1(NamedRegion::New()); 64 n1->name.emplace("n1"); 65 n1->rects.emplace(); 66 n1->rects->push_back(CreateRect()); 67 NamedRegionPtr n2(n1.Clone()); 68 EXPECT_TRUE(n1.Equals(n2)); 71 EXPECT_FALSE(n1.Equals(n2)); 73 EXPECT_FALSE(n1.Equals(n2)); 77 EXPECT_FALSE(n1.Equals(n2)) [all...] |
string_unittest.cc | 73 String n1; local 75 EXPECT_TRUE(n1 == n1); 76 EXPECT_FALSE(n1 != n2); 77 EXPECT_TRUE(n1 == n2); 78 EXPECT_FALSE(n1 != n2); 79 EXPECT_TRUE(n1 != s); 80 EXPECT_FALSE(n1 == s); 81 EXPECT_TRUE(s != n1); 82 EXPECT_FALSE(s == n1); [all...] |
/external/llvm/utils/ |
GetRepositoryPath | 22 git remote -v | grep 'fetch' | awk '{ print $2 }' | head -n1
|
/external/tensorflow/tensorflow/core/graph/ |
algorithm.h | 33 bool operator()(const Node* n1, const Node* n2) const { 34 return n1->id() < n2->id(); 40 bool operator()(const Node* n1, const Node* n2) const { 41 return n1->name() < n2->name();
|
/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;
|
/art/test/706-checker-scheduler/src/ |
Main.java | 20 int n1; field in class:Main.ExampleObj 23 public ExampleObj(int n1, int n2) { 24 this.n1 = n1; 414 my_obj.n1++; 454 my_obj.n1++; 495 my_obj.n1++;
|
/external/iproute2/ip/ |
rtmon.c | 33 struct nlmsghdr *n1 = (void *)buf; local 36 n1->nlmsg_type = NLMSG_TSTAMP; 37 n1->nlmsg_flags = 0; 38 n1->nlmsg_seq = 0; 39 n1->nlmsg_pid = 0; 40 n1->nlmsg_len = NLMSG_LENGTH(4*2); 42 ((__u32 *)NLMSG_DATA(n1))[0] = tv.tv_sec; 43 ((__u32 *)NLMSG_DATA(n1))[1] = tv.tv_usec; 44 fwrite((void *)n1, 1, NLMSG_ALIGN(n1->nlmsg_len), fp) [all...] |
/external/dtc/tests/ |
path-references.c | 69 int n1, n2, n3, n4; local 74 n1 = fdt_path_offset(fdt, "/node1"); 75 if (n1 < 0) 76 FAIL("fdt_path_offset(/node1): %s", fdt_strerror(n1)); 81 check_ref(fdt, n1, "/node2");
|
references.c | 79 int n1, n2, n3, n4, n5; local 85 n1 = fdt_path_offset(fdt, "/node1"); 86 if (n1 < 0) 87 FAIL("fdt_path_offset(/node1): %s", fdt_strerror(n1)); 101 h1 = fdt_get_phandle(fdt, n1); 120 check_ref(fdt, n1, h2);
|
/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/swiftshader/third_party/LLVM/unittests/VMCore/ |
MetadataTest.cpp | 90 MDNode *n1 = MDNode::get(Context, V); local 91 Value *const c1 = n1; 94 EXPECT_NE(n1, n2); 96 EXPECT_EQ(n1, n3); 101 EXPECT_EQ(3u, n1->getNumOperands()); 102 EXPECT_EQ(s1, n1->getOperand(0)); 103 EXPECT_EQ(CI, n1->getOperand(1)); 104 EXPECT_EQ(s2, n1->getOperand(2)); 107 EXPECT_EQ(n1, n2->getOperand(0));
|
/frameworks/base/services/tests/uiservicestests/src/com/android/server/notification/ |
NotificationTest.java | 172 Notification.Builder n1 = new Notification.Builder(mContext, "test"); local 175 assertFalse(Notification.areStyledNotificationsVisiblyDifferent(n1, n2)); 180 Notification.Builder n1 = new Notification.Builder(mContext, "test"); local 184 assertTrue(Notification.areStyledNotificationsVisiblyDifferent(n1, n2)); 190 Notification.Builder n1 = new Notification.Builder(mContext, "test") local 193 assertTrue(Notification.areStyledNotificationsVisiblyDifferent(n1, n2)); 198 Notification.Builder n1 = new Notification.Builder(mContext, "test") local 203 assertTrue(Notification.areStyledNotificationsVisiblyDifferent(n1, n2)); 322 Notification.Builder n1 = new Notification.Builder(mContext, "test") local 325 assertTrue(Notification.areRemoteViewsChanged(n1, n2)) 354 Notification.Builder n1 = new Notification.Builder(mContext, "test").setContent(a); local 374 Notification.Builder n1 = new Notification.Builder(mContext, "test").setContent(a); local 396 Notification.Builder n1 = new Notification.Builder(mContext, "test").setContent(a); local 418 Notification.Builder n1 = new Notification.Builder(mContext, "test").setContent(a); local 433 Notification n1 = new Notification.Builder(mContext, "test") local 446 Notification n1 = new Notification.Builder(mContext, "test") local 461 Notification n1 = new Notification.Builder(mContext, "test") local 476 Notification n1 = new Notification.Builder(mContext, "test") local 495 Notification n1 = new Notification.Builder(mContext, "test") local 512 Notification n1 = new Notification.Builder(mContext, "test") local 527 Notification n1 = new Notification.Builder(mContext, "test") local [all...] |
/prebuilts/go/darwin-x86/test/bench/go1/ |
gob_test.go | 52 n1 := new(JSONNode) 53 *n1 = *n 54 if len(n1.Kids) == 0 { 55 n1.Kids = nil 57 for i, k := range n1.Kids { 58 n1.Kids[i] = gobNode(k) 61 return n1
|
/prebuilts/go/linux-x86/test/bench/go1/ |
gob_test.go | 52 n1 := new(JSONNode) 53 *n1 = *n 54 if len(n1.Kids) == 0 { 55 n1.Kids = nil 57 for i, k := range n1.Kids { 58 n1.Kids[i] = gobNode(k) 61 return n1
|
/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...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Parser/ |
node.c | 79 PyNode_AddChild(register node *n1, int type, char *str, int lineno, int col_offset)
81 const int nch = n1->n_nchildren;
97 n = n1->n_child;
102 n1->n_child = n;
105 n = &n1->n_child[n1->n_nchildren++];
|
/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/python/cpython2/Parser/ |
node.c | 79 PyNode_AddChild(register node *n1, int type, char *str, int lineno, int col_offset) 81 const int nch = n1->n_nchildren; 97 n = n1->n_child; 102 n1->n_child = n; 105 n = &n1->n_child[n1->n_nchildren++];
|
/external/python/cpython3/Parser/ |
node.c | 79 PyNode_AddChild(node *n1, int type, char *str, int lineno, int col_offset) 81 const int nch = n1->n_nchildren; 97 n = n1->n_child; 102 n1->n_child = n; 105 n = &n1->n_child[n1->n_nchildren++];
|
/prebuilts/go/darwin-x86/test/ken/ |
divmod.go | 13 n1 = +5 31 if n1/d1 != q1 || n1%d1 != r1 { 32 println("ideal-1", n1, d1, n1/d1, n1%d1) 39 if n1/d2 != q3 || n1%d2 != r3 { 40 println("ideal-3", n1, d2, n1/d2, n1%d2 11 n1 = +5 const [all...] |
/prebuilts/go/linux-x86/test/ken/ |
divmod.go | 13 n1 = +5 31 if n1/d1 != q1 || n1%d1 != r1 { 32 println("ideal-1", n1, d1, n1/d1, n1%d1) 39 if n1/d2 != q3 || n1%d2 != r3 { 40 println("ideal-3", n1, d2, n1/d2, n1%d2 11 n1 = +5 const [all...] |
/external/clang/test/CodeGenCXX/ |
nested-base-member-access.cpp | 50 N n1; local 51 n1.PR();
|
/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 | 53 compareIterators(UCharIterator *iter1, const char *n1, 62 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); 71 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1); 85 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); 94 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)); 104 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)); 112 log_err("%s->move(start) failed\n", n1); 116 log_err("%s->hasNext() at the start returns FALSE\n", n1); 134 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 140 log_err("%s->hasNext() at the end returns TRUE\n", n1); [all...] |
/external/brotli/java/org/brotli/dec/ |
DictionaryData.java | 24 int n1 = data1.length(); local [all...] |