| /external/opencv3/apps/traincascade/ |
| old_ml_inner_functions.cpp | 1031 CvSampleResponsePair* pairs = 0; local
1045 CV_CALL( pairs = (CvSampleResponsePair*)cvAlloc( (sample_count+1)*sizeof(pairs[0])));
1049 pairs[i].sample = samples[i];
1050 pairs[i].mask = (mask) ? (mask[i]) : 0;
1051 pairs[i].response = classes->data.i[i];
1052 pairs[i].index = i;
1056 qsort( pairs, sample_count, sizeof(pairs[0]), icvCmpSampleResponsePairs );
1057 pairs[sample_count].response = -1
[all...] |
| /external/valgrind/callgrind/ |
| callgrind_annotate.in | [all...] |
| /toolchain/binutils/binutils-2.25/ |
| ylwrap | 85 Any number of OUTPUT,DESIRED pairs may be used.
|
| /external/icu/icu4c/source/tools/gennorm2/ |
| n2builder.cpp | 129 UVector32 *compositions; // (trail, composite) pairs
389 const CompositionPair *pairs=leadNorm->getCompositionPairs(length); local
391 if(trail==pairs[i].trail) {
398 if(trail<pairs[i].trail) {
412 const CompositionPair *pairs=norm.getCompositionPairs(length); local
414 uint8_t trailCC=getCC(pairs[i].trail);
425 const CompositionPair *pairs=norm.getCompositionPairs(length); local
427 if(trail==pairs[i].trail) {
428 return pairs[i].composite;
430 if(trail<pairs[i].trail)
766 const CompositionPair *pairs=p->getCompositionPairs(length); local
[all...] |
| /external/autotest/site_utils/ |
| devserver_history.py | 75 pairs = ['%-20s: %s' % (attr, getattr(self, attr)) for attr in dir(self)
78 return '\n'.join(pairs)
|
| /external/bison/build-aux/ |
| ylwrap | 54 Any number of OUTPUT,DESIRED pairs may be used.
|
| /external/chromium-trace/catapult/third_party/WebOb/webob/ |
| compat.py | 106 pairs = [s2 for s1 in qs.split(b'&') for s2 in s1.split(b';') if s2]
107 for name_value in pairs:
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/BroadphaseCollision/ |
| btDbvtBroadphase.cpp | 396 printf("fixed(%u) dynamics(%u) pairs(%u)\r\n",m_sets[1].m_leaves,m_sets[0].m_leaves,m_paircache->getNumOverlappingPairs());
425 //perform a sort, to find duplicates and to sort 'invalid' pairs to the end
483 //perform a sort, to sort 'invalid' pairs to the end
561 btBroadphasePairArray& pairs=m_paircache->getOverlappingPairArray(); local
562 if(pairs.size()>0)
565 int ni=btMin(pairs.size(),btMax<int>(m_newpairs,(pairs.size()*m_cupdates)/100));
568 btBroadphasePair& p=pairs[(m_cid+i)%pairs.size()];
581 if(pairs.size()>0) m_cid=(m_cid+ni)%pairs.size(); else m_cid=0
[all...] |
| /external/skia/src/effects/gradients/ |
| SkGradientShaderPriv.h | 28 int pairs = count >> 1; local
29 for (int i = 0; i < pairs; i++) {
|
| /prebuilts/go/darwin-x86/test/ |
| import5.go | 29 // Each of these pairs tests both `` vs "" strings
|
| /prebuilts/go/linux-x86/test/ |
| import5.go | 29 // Each of these pairs tests both `` vs "" strings
|
| /external/v8/tools/gcmole/ |
| gcmole.lua | 224 for condition, files in pairs(sources) do
249 for k, v in pairs(self) do e[k] = v end
250 for k, v in pairs(t) do e[k] = v end
350 for caller, _ in pairs(callers) do
359 for funcname, callers in pairs(funcs) do
376 for name, value in pairs(gc) do if value then out:write (name, '\n') end end
381 for name, causes in pairs(gc_caused) do
|
| /external/ImageMagick/www/api/ |
| distort.php | 120 <dd> Affine, Perspective, and Bilinear, do least squares fitting of the distrotion when more than the minimum number of control point pairs are provided. </dd>
122 <dd> Perspective, and Bilinear, fall back to a Affine distortion when less than 4 control point pairs are provided. While Affine distortions let you use any number of control point pairs, that is Zero pairs is a No-Op (viewport only) distortion, one pair is a translation and two pairs of control points do a scale-rotate-translate, without any shearing. </dd>
|
| /prebuilts/go/darwin-x86/src/encoding/base64/ |
| base64_test.go | 22 var pairs = []testpair{ var
104 for _, p := range pairs {
114 for _, p := range pairs {
144 for _, p := range pairs {
164 for _, p := range pairs {
|
| /prebuilts/go/darwin-x86/src/index/suffixarray/ |
| suffixarray.go | 224 // result into match pairs
238 pairs := make([]int, 2*len(indices))
249 pairs[j+0] = i
250 pairs[j+1] = i + len(lit)
251 result[count] = pairs[j : j+2]
|
| /prebuilts/go/linux-x86/src/encoding/base64/ |
| base64_test.go | 22 var pairs = []testpair{ var
104 for _, p := range pairs {
114 for _, p := range pairs {
144 for _, p := range pairs {
164 for _, p := range pairs {
|
| /prebuilts/go/linux-x86/src/index/suffixarray/ |
| suffixarray.go | 224 // result into match pairs
238 pairs := make([]int, 2*len(indices))
249 pairs[j+0] = i
250 pairs[j+1] = i + len(lit)
251 result[count] = pairs[j : j+2]
|
| /bootable/recovery/applypatch/ |
| applypatch.cpp | 126 size_t pairs = (pieces.size() - 2) / 2; // # of (size, sha1) pairs in filename local
127 std::vector<size_t> index(pairs);
128 std::vector<size_t> size(pairs);
129 std::vector<std::string> sha1sum(pairs);
131 for (size_t i = 0; i < pairs; ++i) {
141 // Sort the index[] array so it indexes the pairs in order of increasing size.
185 std::vector<unsigned char> data(size[index[pairs-1]]);
190 for (size_t i = 0; i < pairs; ++i) {
249 // Ran off the end of the list of (size,sha1) pairs without finding a match
[all...] |
| /dalvik/dexgen/src/com/android/dexgen/dex/file/ |
| ValueEncoder.java | 324 Collection<NameValuePair> pairs = annotation.getNameValuePairs(); local
325 int size = pairs.size();
334 for (NameValuePair pair : pairs) {
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/route53/ |
| connection.py | 95 pairs = []
99 pairs.append(key + '=' + urllib.parse.quote(str(val)))
100 path += '?' + '&'.join(pairs)
|
| /frameworks/base/core/java/android/view/inputmethod/ |
| InputMethodSubtype.java | 525 final String[] pairs = mSubtypeExtraValue.split(EXTRA_VALUE_PAIR_SEPARATOR); local
526 final int N = pairs.length;
528 final String[] pair = pairs[i].split(EXTRA_VALUE_KEY_VALUE_SEPARATOR);
|
| /external/chromium-trace/catapult/perf_insights/perf_insights/ |
| map_single_trace.py | 124 for k, v in found_dict['pairs'].iteritems():
132 if not (len(result.pairs) or len(result.failures)):
|
| /external/libvpx/libvpx/third_party/libyuv/source/ |
| row_x86.asm | 121 punpcklbw m2, m0, m1 // first 8 UV pairs
122 punpckhbw m0, m0, m1 // next 8 UV pairs
|
| /external/skia/tests/ |
| BlurTest.cpp | 395 } pairs[] = { local
401 for (size_t i = 0; i < SK_ARRAY_COUNT(pairs); ++i) {
402 if (bmf & pairs[i].fBlurMaskFilterFlag) {
403 bdl |= pairs[i].fBlurDrawLooperFlag;
|
| /prebuilts/gdb/darwin-x86/lib/python2.7/json/ |
| __init__.py | 275 result of any object literal decoded with an ordered list of pairs. The
278 order that the key and value pairs are decoded (for example,
309 result of any object literal decoded with an ordered list of pairs. The
312 order that the key and value pairs are decoded (for example,
|
