| /ndk/sources/third_party/googletest/googletest/test/ |
| gtest_unittest.cc | 2271 const int n2 = 2; local
2289 const int n2 = 2; local
2306 int n2 = 0; local
2317 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/ImageMagick/www/api/ |
| quantize.php | 84 <p>n2: Number of pixels whose color is not represented in a node at lower depth in the tree; initially, n2 = 0 for all nodes except leaves of the tree.</p>
86 <p>Sr, Sg, Sb: Sums of the red, green, and blue component values for all pixels not classified at a lower depth. The combination of these sums and n2 will ultimately characterize the mean color of a set of pixels represented by this node.</p>
90 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 > 0 is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose E count is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, Ep, to govern node selection as follows:</p>
95 <dd> Ep = 0 while number of nodes with (n2 > 0) > required maximum number of colors prune all nodes such that E <= Ep Set Ep to minimum E in remaining nodes </dd>
99 <dd> When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. n2, Sr, Sg, and Sb in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging. </dd>
101 <dd> For each node, n2 pixels exist for which that node represents the smallest volume in RGB space containing those pixel's colors. When n2 > 0 the node will uniquely define a color in the output image. At the beginning of reduction, n2 = 0 for all nodes except a the leaves of the tree which represent colors present in the input image. </dd>
103 <dd> The other pixel count, n1, indicates the total number of colors within the cubic volume which the node represents. This includes n1 - n2 pixels whose colors should be defined by nodes at a lower level in the tree. </dd
[all...] |
| /external/clang/test/CXX/expr/expr.const/ |
| p2-0x.cpp | 15 int n2[this1]; // expected-warning {{variable length array}} local
16 (void)n1, (void)n2;
231 constexpr int n2 = 65536 * 32768; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} member in namespace:UndefinedBehavior::Overflow
|
| /external/icu/icu4c/source/test/intltest/ |
| svccoll.cpp | 346 int32_t n1, n2, n3; local
400 n2 = checkAvailable("after registerFactory");
401 assertTrue("count after > count before", n2 > n1);
|
| /external/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/ |
| size_size_size_char.pass.cpp | 13 // replace(size_type pos, size_type n1, size_type n2, charT c);
25 typename S::size_type n2, typename S::value_type c,
32 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
| size_size_size_char.pass.cpp | 13 // replace(size_type pos, size_type n1, size_type n2, charT c);
25 typename S::size_type n2, typename S::value_type c,
32 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
|
| /external/bzip2/ |
| bzlib.c | 970 Int32 n, n2, ret; local
996 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
998 if (n != n2 || ferror(bzf->handle))
1030 Int32 n, n2, ret; local
1055 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
[all...] |
| /external/valgrind/coregrind/m_debuginfo/ |
| image.c | 290 ULong n1, ULong n2, ULong n3 )
298 write_ULong_le(&f->data[4 + 1*8], n2);
329 /*OUT*/ULong* n1, /*OUT*/ULong* n2 )
337 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
369 /*OUT*/ULong* n1, /*OUT*/ULong* n2, /*OUT*/ULong* n3,
379 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
[all...] |
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/notifications/ |
| NotificationListenerVerifierActivity.java | 121 Notification n2 = new Notification.Builder(mContext) local
130 mNm.notify(mTag2, mId2, n2);
|
| /external/chromium-trace/catapult/telemetry/third_party/webpagereplay/third_party/dns/ |
| query.py | 80 n2 = dns.inet.inet_pton(af, a2[0])
81 return n1 == n2 and a1[1:] == a2[1:]
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| CollationServiceTest.java | 266 int n2 = checkAvailable("after registerFactory"); local
305 assertTrue("register increases count", n2>n1);
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| CollationServiceTest.java | 262 int n2 = checkAvailable("after registerFactory"); local
301 assertTrue("register increases count", n2>n1);
|
| /frameworks/base/core/java/android/text/format/ |
| TimeFormatter.java | 237 int n2 = (wallTime.getHour() % 12 != 0) ? (wallTime.getHour() % 12) : 12; local
238 numberFormatter.format(getFormat(modifier, "%2d", "%2d", "%d", "%02d"), n2); local
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/x86/ |
| gsubr.go | 572 var n2 gc.Node
575 gc.Nodreg(&n2, gc.Types[gc.TINT64], reg)
576 gins(as, &n1, &n2)
583 func ginscon(as int, c int64, n2 *gc.Node) {
586 gins(as, &n1, n2)
589 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog {
591 if (n1.Op == gc.OLITERAL || n1.Op == gc.OADDR && n1.Left.Op == gc.ONAME) && n2.Op != gc.OLITERAL {
594 n1, n2 = n2, n1
608 if n2.Op == gc.OLITERAL && gc.Isint[t.Etype] || n2.Op == gc.OADDR && n2.Left.Op == gc.ONAME && n2.Left.C (…)
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/x86/ |
| gsubr.go | 569 var n2 gc.Node
572 gc.Nodreg(&n2, gc.Types[gc.TINT64], reg)
573 gins(as, &n1, &n2)
580 func ginscon(as int, c int64, n2 *gc.Node) {
583 gins(as, &n1, n2)
586 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog {
588 if (n1.Op == gc.OLITERAL || n1.Op == gc.OADDR && n1.Left.Op == gc.ONAME) && n2.Op != gc.OLITERAL {
591 n1, n2 = n2, n1
605 if n2.Op == gc.OLITERAL && gc.Isint[t.Etype] || n2.Op == gc.OADDR && n2.Left.Op == gc.ONAME && n2.Left.C (…)
[all...] |
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/x86/ |
| gsubr.go | 572 var n2 gc.Node
575 gc.Nodreg(&n2, gc.Types[gc.TINT64], reg)
576 gins(as, &n1, &n2)
583 func ginscon(as int, c int64, n2 *gc.Node) {
586 gins(as, &n1, n2)
589 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog {
591 if (n1.Op == gc.OLITERAL || n1.Op == gc.OADDR && n1.Left.Op == gc.ONAME) && n2.Op != gc.OLITERAL {
594 n1, n2 = n2, n1
608 if n2.Op == gc.OLITERAL && gc.Isint[t.Etype] || n2.Op == gc.OADDR && n2.Left.Op == gc.ONAME && n2.Left.C (…)
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/x86/ |
| gsubr.go | 569 var n2 gc.Node
572 gc.Nodreg(&n2, gc.Types[gc.TINT64], reg)
573 gins(as, &n1, &n2)
580 func ginscon(as int, c int64, n2 *gc.Node) {
583 gins(as, &n1, n2)
586 func ginscmp(op int, t *gc.Type, n1, n2 *gc.Node, likely int) *obj.Prog {
588 if (n1.Op == gc.OLITERAL || n1.Op == gc.OADDR && n1.Left.Op == gc.ONAME) && n2.Op != gc.OLITERAL {
591 n1, n2 = n2, n1
605 if n2.Op == gc.OLITERAL && gc.Isint[t.Etype] || n2.Op == gc.OADDR && n2.Left.Op == gc.ONAME && n2.Left.C (…)
[all...] |
| /hardware/broadcom/wlan/bcmdhd/dhdutil/ |
| dhdu.c | 176 "logstamp [<n1>] [<n2>] -- add a message to the log"},
1060 int n1, n2; local
1063 n2 = (int)((unsigned char)*inptr++);
1064 if (!isxdigit(n1) || !isxdigit(n2)) {
1066 (isxdigit(n1) ? n2 : n1));
1072 n2 = isdigit(n2) ? (n2 - '0')
1073 : ((islower(n2) ? (toupper(n2)) : n2) - 'A' + 10)
[all...] |
| /toolchain/binutils/binutils-2.25/binutils/ |
| stabs.c | 1657 bfd_signed_vma n2, n3; local
[all...] |
| /external/ImageMagick/coders/ |
| sixel.c | 149 static int hue_to_rgb(int n1, int n2, int hue)
162 return (n1 + (((n2 - n1) * hue + (HLSMAX / 12)) / (HLSMAX / 6)));
165 return (n2);
168 return (n1 + (((n2 - n1) * (((HLSMAX * 2) / 3) - hue) + (HLSMAX / 12))/(HLSMAX / 6)));
[all...] |
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| AlphabeticIndex.java | 797 String n2 = nfkdNormalizer.normalize(other); local
798 int result = n1.codePointCount(0, n1.length()) - n2.codePointCount(0, n2.length());
802 result = binaryCmp.compare(n1, n2);
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| AlphabeticIndex.java | 825 String n2 = nfkdNormalizer.normalize(other); local
826 int result = n1.codePointCount(0, n1.length()) - n2.codePointCount(0, n2.length());
830 result = binaryCmp.compare(n1, n2);
[all...] |
| /external/libcxx/test/std/experimental/string.view/string.view.ops/ |
| compare.size_size_sv_pointer_size.pass.cpp | 14 // const charT* s, size_type n2) const;
25 const CharT *s2, size_t n2,
30 assert ( sign( sv1.compare(pos1, n1, s2, n2)) == sign(expected));
39 const CharT *s2, size_t n2,
44 test1 (sv1, pos1, n1, s2, n2, expected);
[all...] |
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionDispatch/ |
| btBoxBoxDetector.cpp | 331 // normal (n1,n2,n3) is relative to box 1.
333 #define TST(expr1,expr2,n1,n2,n3,cc) \
336 l = btSqrt((n1)*(n1) + (n2)*(n2) + (n3)*(n3)); \
342 normalC[0] = (n1)/l; normalC[1] = (n2)/l; normalC[2] = (n3)/l; \
|
| /external/opencv3/modules/cudaoptflow/src/cuda/ |
| tvl1flow.cu | 291 const float n2 = (u2OldVal - u2NewVal) * (u2OldVal - u2NewVal);
292 error(y, x) = n1 + n2;
|
