Searched refs:n2 (Results 126 - 150 of 267) sorted by relevance

1234567891011

/external/libcxx/test/std/strings/basic.string/string.modifiers/string_replace/
H A Diter_iter_size_char.pass.cpp24 test(S s, typename S::size_type pos1, typename S::size_type n1, typename S::size_type n2, argument
31 s.replace(first, last, n2, c);
34 typename S::size_type rlen = n2;
H A Dsize_size_size_char.pass.cpp13 // replace(size_type pos, size_type n1, size_type n2, charT c);
26 typename S::size_type n2, typename S::value_type c,
33 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
45 s.replace(pos, n1, n2, c);
25 test(S s, typename S::size_type pos, typename S::size_type n1, typename S::size_type n2, typename S::value_type c, S expected) argument
/external/libvorbis/lib/
H A Dvorbisfile.c2034 int n1, int n2,
2041 if(n1>n2){
2042 n=n2;
2147 int n1,n2,i,ret,hs1,hs2; local
2169 n2=vorbis_info_blocksize(vi2,0)>>(1+hs2);
2189 _ov_splice(pcm,lappcm,n1,n2,vi1->channels,vi2->channels,w1,w2);
2201 int n1,n2,ch1,ch2,hs; local
2231 n2=vorbis_info_blocksize(vi,0)>>(1+hs);
2238 _ov_splice(pcm,lappcm,n1,n2,ch1,ch2,w1,w2);
2262 int n1,n2,ch local
2033 _ov_splice(float **pcm,float **lappcm, int n1, int n2, int ch1, int ch2, float *w1, float *w2) argument
[all...]
/external/protobuf/gtest/test/
H A Dgtest_output_test_.cc234 // SCOPED_TRACE("Trace A"); | waits for n2
236 // notifies n2 |
251 Notification n2; member in struct:CheckPoints
261 check_points->n2.WaitForNotification();
284 check_points.n2.Notify();
H A Dgtest_unittest.cc2131 bool SumIsEven2(int n1, int n2) { argument
2132 return IsEven(n1 + n2);
2138 bool operator()(int n1, int n2, int n3) { argument
2139 return IsEven(n1 + n2 + n3);
2147 int n1, int n2, int n3, int n4) {
2148 const int sum = n1 + n2 + n3 + n4;
2155 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2165 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2166 const int sum = n1 + n2 + n3 + n4 + n5;
2174 << n1 << " + " << n2 << "
2145 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2163 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2240 const int n2 = 2; local
2258 const int n2 = 2; local
2275 int n2 = 0; local
2286 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/v8/testing/gtest/test/
H A Dgtest_output_test_.cc264 // SCOPED_TRACE("Trace A"); | waits for n2
266 // notifies n2 |
281 Notification n2; member in struct:CheckPoints
291 check_points->n2.WaitForNotification();
314 check_points.n2.Notify();
H A Dgtest_unittest.cc2160 bool SumIsEven2(int n1, int n2) { argument
2161 return IsEven(n1 + n2);
2167 bool operator()(int n1, int n2, int n3) { argument
2168 return IsEven(n1 + n2 + n3);
2176 int n1, int n2, int n3, int n4) {
2177 const int sum = n1 + n2 + n3 + n4;
2184 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2194 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2195 const int sum = n1 + n2 + n3 + n4 + n5;
2203 << n1 << " + " << n2 << "
2174 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2192 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2269 const int n2 = 2; local
2287 const int n2 = 2; local
2304 int n2 = 0; local
2315 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/v8/tools/
H A Dprofile.js418 result.sort(function(n1, n2) {
419 return n2.ticks - n1.ticks || (n2.name < n1.name ? -1 : 1)
/external/vulkan-validation-layers/tests/gtest-1.7.0/test/
H A Dgtest_output_test_.cc260 // SCOPED_TRACE("Trace A"); | waits for n2
262 // notifies n2 |
277 Notification n2; member in struct:CheckPoints
287 check_points->n2.WaitForNotification();
310 check_points.n2.Notify();
H A Dgtest_unittest.cc2153 bool SumIsEven2(int n1, int n2) { argument
2154 return IsEven(n1 + n2);
2160 bool operator()(int n1, int n2, int n3) { argument
2161 return IsEven(n1 + n2 + n3);
2169 int n1, int n2, int n3, int n4) {
2170 const int sum = n1 + n2 + n3 + n4;
2177 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2187 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2188 const int sum = n1 + n2 + n3 + n4 + n5;
2196 << n1 << " + " << n2 << "
2167 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2185 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2262 const int n2 = 2; local
2280 const int n2 = 2; local
2297 int n2 = 0; local
2308 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/ImageMagick/www/api/
H A Dquantize.php84 <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 &gt; 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 &gt; 0) &gt; required maximum number of colors prune all nodes such that E &lt;= 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 &gt; 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 pixel
[all...]
/external/clang/test/Modules/
H A Dmacros.c195 int n2 = TOP_OTHER_REDEF2; // ok variable
/external/tremolo/Tremolo/
H A Dmdct.c64 STIN void presymmetry(DATA_TYPE *in,int n2,int step){ argument
68 int n4=n2>>1;
70 aX = in+n2-3;
86 aX = in+n2-4;
/external/skia/tests/
H A DFontHostTest.cpp119 int n2 = SkFontStream::GetTableTags(stream, ttcIndex, array.get()); local
120 REPORTER_ASSERT(reporter, n == n2);
/external/chromium-trace/catapult/telemetry/third_party/modulegraph/modulegraph_tests/
H A Dtest_imports.py119 n2 = self.mf.findNode(nm)
120 ed = self.mf.edgeData(n, n2)
168 n2 = self.mf.findNode('pkg.mod')
170 n2 = self.mf.findNode('mod')
171 self.assertEqual(refs, set([self.mf.findNode('pkg'), n2]))
172 ed = self.mf.edgeData(n, n2)
/external/valgrind/auxprogs/
H A Dvalgrind-di-server.c475 static Frame* mk_Frame_le64_le64 ( const HChar* tag, ULong n1, ULong n2 )
483 write_ULong_le(&f->data[4 + 1*8], n2);
488 /*OUT*/ULong* n1, /*OUT*/ULong* n2,
497 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
504 ULong n1, ULong n2, ULong n3, ULong n_data,
513 write_ULong_le(&f->data[4 + 1*8], n2);
487 parse_Frame_le64_le64_le64( Frame* fr, const HChar* tag, ULong* n1, ULong* n2, ULong* n3 ) argument
502 mk_Frame_le64_le64_le64_bytes( const HChar* tag, ULong n1, ULong n2, ULong n3, ULong n_data, UChar** data ) argument
/external/sqlite/dist/orig/
H A Dshell.c1309 int n2 = sqlite3_column_bytes(pStmt, i); local
1311 hash_step_vformat(&cx,"T%d:",n2);
1312 SHA3Update(&cx, z2, n2);
1316 int n2 = sqlite3_column_bytes(pStmt, i); local
1318 hash_step_vformat(&cx,"B%d:",n2);
1319 SHA3Update(&cx, z2, n2);
5190 int i, n2; local
5203 n2 = strlen30(azArg[1]);
5205 if( sqlite3_strnicmp(aLimit[i].zLimitName, azArg[1], n2)==0 ){
5270 int n2 local
6209 int n2 = nAlloc*2 + 10; local
6294 int i, n2; local
[all...]
/external/sqlite/dist/
H A Dshell.c1315 int n2 = sqlite3_column_bytes(pStmt, i); local
1317 hash_step_vformat(&cx,"T%d:",n2);
1318 SHA3Update(&cx, z2, n2);
1322 int n2 = sqlite3_column_bytes(pStmt, i); local
1324 hash_step_vformat(&cx,"B%d:",n2);
1325 SHA3Update(&cx, z2, n2);
5212 int i, n2; local
5225 n2 = strlen30(azArg[1]);
5227 if( sqlite3_strnicmp(aLimit[i].zLimitName, azArg[1], n2)==0 ){
5292 int n2 local
6231 int n2 = nAlloc*2 + 10; local
6316 int i, n2; local
[all...]
/external/libcxx/test/std/experimental/string.view/string.view.ops/
H A Dcompare.size_size_sv_pointer_size.pass.cpp13 // const charT* s, size_type n2) const;
25 const CharT *s2, size_t n2,
30 sv1.compare(pos1, n1, s2, n2);
39 assert(sign(sv1.compare(pos1, n1, s2, n2)) == sign(expected));
47 const CharT *s2, size_t n2,
51 test1 (sv1, pos1, n1, s2, n2, expected);
24 test1( std::experimental::basic_string_view<CharT> sv1, size_t pos1, size_t n1, const CharT *s2, size_t n2, int expected ) argument
46 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, size_t n2, int expected ) argument
/external/libcxx/test/std/strings/string.view/string.view.ops/
H A Dcompare.size_size_sv_pointer_size.pass.cpp13 // const charT* s, size_type n2) const;
25 const CharT *s2, size_t n2, int expected ) {
28 assert(sign(sv1.compare(pos1, n1, s2, n2)) == sign(expected));
31 assert(sign(sv1.compare(pos1, n1, s2, n2)) == sign(expected));
43 const CharT *s2, size_t n2,
47 test1 (sv1, pos1, n1, s2, n2, expected);
24 test1( std::basic_string_view<CharT> sv1, size_t pos1, size_t n1, const CharT *s2, size_t n2, int expected ) argument
42 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, size_t n2, int expected ) argument
/external/google-breakpad/src/testing/gtest/test/
H A Dgtest_unittest.cc2298 bool SumIsEven2(int n1, int n2) { argument
2299 return IsEven(n1 + n2);
2305 bool operator()(int n1, int n2, int n3) { argument
2306 return IsEven(n1 + n2 + n3);
2314 int n1, int n2, int n3, int n4) {
2315 const int sum = n1 + n2 + n3 + n4;
2322 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2332 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2333 const int sum = n1 + n2 + n3 + n4 + n5;
2341 << n1 << " + " << n2 << "
2312 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2330 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2407 const int n2 = 2; local
2425 const int n2 = 2; local
2442 int n2 = 0; local
2453 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/googletest/googletest/test/
H A Dgtest_unittest.cc2160 bool SumIsEven2(int n1, int n2) { argument
2161 return IsEven(n1 + n2);
2167 bool operator()(int n1, int n2, int n3) { argument
2168 return IsEven(n1 + n2 + n3);
2176 int n1, int n2, int n3, int n4) {
2177 const int sum = n1 + n2 + n3 + n4;
2184 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4
2194 const char* e5, int n1, int n2, int n3, int n4, int n5) {
2195 const int sum = n1 + n2 + n3 + n4 + n5;
2203 << n1 << " + " << n2 << "
2174 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument
2192 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument
2269 const int n2 = 2; local
2287 const int n2 = 2; local
2304 int n2 = 0; local
2315 n1++, n2++, n3++, n4++, n5++) local
[all...]
/external/clang/test/CXX/expr/expr.const/
H A Dp2-0x.cpp15 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/
H A Dsvccoll.cpp349 int32_t n1, n2, n3; local
403 n2 = checkAvailable("after registerFactory");
404 assertTrue("count after > count before", n2 > n1);
/external/swiftshader/third_party/PowerVR_SDK/Tools/
H A DPVRTVector.h2081 VERTTYPE n2 = VERTTYPEMUL(f2vt(2),nearPlane); local
2087 result.f[0] = 0; result.f[4]=VERTTYPEDIV(-n2,width); result.f[8]=0; result.f[12]=0;
2088 result.f[1] = VERTTYPEDIV(n2,height); result.f[5]=0; result.f[9]=0; result.f[13]=0;
2092 result.f[0] = VERTTYPEDIV(n2,width); result.f[4]=0; result.f[8]=0; result.f[12]=0;
2093 result.f[1] = 0; result.f[5]=VERTTYPEDIV(n2,height); result.f[9]=0; result.f[13]=0;
2101 result.f[2] = 0; result.f[6]=0; result.f[10]=VERTTYPEMUL(farPlane+nearPlane,rcpnmf); result.f[14]=VERTTYPEMUL(VERTTYPEMUL(farPlane,rcpnmf),n2);
2132 VERTTYPE n2 = VERTTYPEMUL(2,nearPlane); local
2137 result.f[0] = 0; result.f[4]=VERTTYPEDIV(-n2,width); result.f[8]=0; result.f[12]=0;
2138 result.f[1] = VERTTYPEDIV(n2,height); result.f[5]=0; result.f[9]=0; result.f[13]=0;
2142 result.f[0] = VERTTYPEDIV(n2,widt
[all...]

Completed in 865 milliseconds

1234567891011