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

1 2 3 4 5 6 78 91011>>

  /external/dexmaker/src/dx/java/com/android/dx/dex/code/
InsnFormat.java 541 * @param n1 {@code 0..15;} medium-low nibble
546 protected static short codeUnit(int n0, int n1, int n2, int n3) {
551 if ((n1 & 0xf) != n1) {
552 throw new IllegalArgumentException("n1 out of range 0..15");
563 return (short) (n0 | (n1 << 4) | (n2 << 8) | (n3 << 12));
  /external/libcxx/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;
23 size_t pos1, size_t n1, const CharT *s, int expected ) {
25 assert(sign(sv1.compare(pos1, n1, s)) == sign(expected));
33 test( const CharT *s1, size_t pos1, size_t n1, const CharT *s2, int expected)
37 test1 ( sv1, pos1, n1, s2, expected );
  /external/opencv3/modules/shape/src/
emdL1_def.hpp 104 bool initBaseTrees(int n1=0, int n2=0, int n3=0);
  /frameworks/base/tests/backup/
test_restore.sh 69 restore_set=$(a shell bmgr list sets | head -n1 | awk '{print $1}')
  /frameworks/native/opengl/tests/hwc/
hwcColorEquiv.cpp 433 for (unsigned int n1 = 0; n1 < NUMA(hwcTestGraphicFormat); n1++) {
434 testPrintE(" %s", hwcTestGraphicFormat[n1].desc);
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/javax/security/
OldSHA1PRNGSecureRandomTest.java 148 int n1 = 10; local
151 byte[][] bytes1 = new byte[10][n1];
162 int i1 = k / n1;
163 int i2 = k % n1;
  /external/clang/test/CodeGenCXX/
debug-info-use-after-free.cpp 276 n1 { namespace
287 n1::Test {
296 n1::C7 <
  /external/eigen/bench/
eig33.cpp 156 Scalar n1 = evecs.col(1).norm(); local
157 if(n1<=Eigen::NumTraits<Scalar>::epsilon())
160 evecs.col(1) /= n1;
  /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/util/
TestBagFormatter.java 77 double n1 = Double.parseDouble((String)o1); local
79 return n1 < n2 ? -1 : n1 > n2 ? 1 : 0;
  /external/icu/icu4j/main/tests/translit/src/com/ibm/icu/dev/test/util/
TestBagFormatter.java 76 double n1 = Double.parseDouble((String)o1); local
78 return n1 < n2 ? -1 : n1 > n2 ? 1 : 0;
  /external/opencv3/3rdparty/openexr/Imath/
ImathLineAlgo.h 101 T n1 = d1d2 * d2w - d1w; local
107 (abs (n1) < limits<T>::max() * absD &&
110 point1 = line1 (n1 / d);
  /external/pdfium/core/src/fxcrt/
fx_basic_coords.cpp 191 CFX_FloatRect n1 = *this;
192 n1.Normalize();
195 if (n2.left >= n1.left && n2.right <= n1.right && n2.bottom >= n1.bottom &&
196 n2.top <= n1.top) {
202 CFX_FloatRect n1 = *this;
203 n1.Normalize();
204 return x <= n1.right && x >= n1.left && y <= n1.top && y >= n1.bottom
    [all...]
  /libcore/ojluni/src/main/java/java/io/
BufferedReader.java 300 int n1 = read1(cbuf, off + n, len - n); local
301 if (n1 <= 0) break;
302 n += n1;
  /external/opencv/ml/src/
mlann_mlp.cpp 182 int n1 = layer_sizes->data.i[i-1]; local
184 double val = 0, G = n2 > 2 ? 0.7*pow((double)n1,1./(n2-1)) : 1.;
191 for( k = 0; k <= n1; k++ )
201 for( k = 0; k <= n1; k++ )
203 w[n1*n2 + j] *= G*(-1+j*2./n2);
1017 int n1 = layer_sizes->data.i[i-1], n2 = layer_sizes->data.i[i]; local
1020 cvInitMatHeader( &_w, n1+1, n2, CV_64F, weights[i] );
1021 cvInitMatHeader( &_dw, n1+1, n2, CV_64F, dw->data.db + (weights[i] - weights[0]) );
1022 cvInitMatHeader( x1, n1+1, 1, CV_64F, x[i-1] );
1023 x[i-1][n1] = 1.
1129 int n1, n2, si, j, k; local
    [all...]
  /external/bison/lib/
quotearg.c 774 /* FIXME: technically, the type of n1 should be 'unsigned int',
779 size_t n1 = n0 + 1; local
782 if (xalloc_oversized (n1, sizeof *sv))
785 slotvec = sv = xrealloc (preallocated ? NULL : sv, n1 * sizeof *sv);
788 memset (sv + nslots, 0, (n1 - nslots) * sizeof *sv);
789 nslots = n1;
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/
WNafUtil.java 135 int n0 = ((k0.intValue() >>> offset) + d0) & 7, n1 = ((k1.intValue() >>> offset) + d1) & 7; local
141 if ((n0 + u0) == 4 && (n1 & 3) == 2)
147 int u1 = n1 & 1;
150 u1 -= (n1 & 2);
151 if ((n1 + u1) == 4 && (n0 & 3) == 2)
  /external/libvorbis/lib/
vorbisfile.c 2147 int n1,n2,i,ret,hs1,hs2; local
2201 int n1,n2,ch1,ch2,hs; local
2262 int n1,n2,ch1,ch2,hs; local
    [all...]
  /external/libgdx/extensions/gdx-jnigen/libs/
javaparser-core-2.3.0.jar 
  /external/llvm/lib/ProfileData/
SampleProfReader.cpp 62 size_t n1 = Input.rfind(':', n2 - 1); local
63 FName = Input.substr(0, n1);
64 if (Input.substr(n1 + 1, n2 - n1 - 1).getAsInteger(10, NumSamples))
97 size_t n1 = Input.find(':');
98 StringRef Loc = Input.substr(Depth, n1 - Depth);
111 StringRef Rest = Input.substr(n1 + 2);
  /external/tremolo/Tremolo/
mdct.c 468 void mdct_unroll_lap(int n0,int n1,
479 DATA_TYPE *l=in+(W&&lW ? n1>>1 : n0>>1);
480 DATA_TYPE *r=right+(lW ? n1>>2 : n0>>2);
482 LOOKUP_T *wR=(W && lW ? w1+(n1>>1) : w0+(n0>>1));
485 int preLap=(lW && !W ? (n1>>2)-(n0>>2) : 0 );
486 int halfLap=(lW && W ? (n1>>2) : (n0>>2) );
487 int postLap=(!lW && W ? (n1>>2)-(n0>>2) : 0 );
  /external/opencv3/modules/core/src/
rand.cpp 507 int n1 = (int)_param1.total(); local
512 _parambuf.allocate(cn*8 + n1 + n2);
517 if( !_param1.isContinuous() || _param1.type() != CV_64F || n1 != cn )
522 if( n1 < cn )
523 for( j = n1; j < cn; j++ )
524 p1[j] = p1[j-n1];
621 _parambuf.allocate(MAX(n1, cn) + MAX(n2, cn));
636 if( n1 < cn )
637 for( j = n1*esz; j < cn*esz; j++ )
638 mean[j] = mean[j - n1*esz]
    [all...]
  /external/antlr/antlr-3.4/runtime/Python/antlr3/
treewizard.py 567 n1 = self.adaptor.getChildCount(t1)
569 if n1 != n2:
572 for i in range(n1):
608 n1 = adaptor.getChildCount(t1)
610 if n1 != n2:
613 for i in range(n1):
  /external/speex/libspeex/
lsp.c 532 float *pw,*n1,*n2,*n3,*n4=NULL; local
562 n1 = pw+(i*4);
563 n2 = n1 + 1;
566 xout1 = xin1 - 2.f*x_freq[i2] * *n1 + *n2;
568 *n2 = *n1;
570 *n1 = xin1;
  /system/bt/stack/smp/
smp_int.h 386 UINT8 *key_id, UINT8 *n1,
389 extern void smp_f5_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
391 extern void smp_f6_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r,
526 extern BOOLEAN smp_calculate_f5(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
529 UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1,
532 extern BOOLEAN smp_calculate_f6(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r, UINT8 *iocap,
  /external/icu/icu4c/source/i18n/
gregoimp.cpp 109 int32_t n1 = ClockMath::floorDivide(doy, 365, doy); local
110 year = 400*n400 + 100*n100 + 4*n4 + n1;
111 if (n100 == 4 || n1 == 4) {

Completed in 1010 milliseconds

1 2 3 4 5 6 78 91011>>