/external/opencv3/modules/ml/src/ |
H A D | kdtree.cpp | 211 int depth = stack[top].depth, nidx = stack[top].nodeIdx; 220 nodes[nidx].idx = ~idx; 248 nodes[nidx].idx = dim; 249 nodes[nidx].left = left; 250 nodes[nidx].right = right; 251 nodes[nidx].boundary = medianPartition(ptofs, first, last, data + dim); 300 int nidx; 303 nidx = 0; 309 nidx = pqueue[0].idx; 335 if( nidx < [all...] |
H A D | tree.cpp | 301 int nidx = (int)nodes.size(); local 308 nodes[pidx].left = nidx; 313 nodes[pidx].right = nidx; 320 pidx = nidx; 330 nidx = pidx; 354 int nidx = (int)(w->wnodes.size() - 1); local 363 w->cv_Tn.resize((nidx+1)*nfolds); 364 w->cv_node_error.resize((nidx+1)*nfolds); 365 w->cv_node_risk.resize((nidx+1)*nfolds); 372 calcValue( nidx, sid 464 calcValue( int nidx, const vector<int>& _sidx ) argument 1324 int cv_n = params.getCVFolds(), nidx = root, pidx = -1; local 1404 int nidx = roots[ridx], prev = nidx, c = 0; local [all...] |
H A D | boost.cpp | 144 int nidx = root, pidx = 0; local 152 node = &nodes[nidx]; 156 nidx = node->left; 159 for( pidx = node->parent; pidx >= 0 && nodes[pidx].right == nidx; 160 nidx = pidx, pidx = nodes[pidx].parent ) 166 nidx = nodes[pidx].right; 170 void calcValue( int nidx, const vector<int>& _sidx ) argument 172 DTreesImpl::calcValue(nidx, _sidx); 173 WNode* node = &w->wnodes[nidx];
|
H A D | precomp.hpp | 310 virtual void calcValue( int nidx, const vector<int>& _sidx ); 332 virtual void writeNode( FileStorage& fs, int nidx, int depth ) const;
|
/external/opencv3/modules/core/src/ |
H A D | matrix.cpp | 4924 size_t hidx = h & (hdr->hashtab.size() - 1), nidx = hdr->hashtab[hidx]; 4926 while( nidx != 0 ) 4928 Node* elem = (Node*)(pool + nidx); 4931 nidx = elem->next; 4946 size_t hidx = h & (hdr->hashtab.size() - 1), nidx = hdr->hashtab[hidx]; 4948 while( nidx != 0 ) 4950 Node* elem = (Node*)(pool + nidx); 4953 nidx = elem->next; 4968 size_t hidx = h & (hdr->hashtab.size() - 1), nidx = hdr->hashtab[hidx]; 4970 while( nidx ! 5015 size_t hidx = h & (hdr->hashtab.size() - 1), nidx = hdr->hashtab[hidx], previdx=0; local 5034 size_t hidx = h & (hdr->hashtab.size() - 1), nidx = hdr->hashtab[hidx], previdx=0; local 5055 size_t hidx = h & (hdr->hashtab.size() - 1), nidx = hdr->hashtab[hidx], previdx=0; local 5090 size_t nidx = hdr->hashtab[i]; local 5127 size_t nidx = hdr->freeList; local 5151 removeNode(size_t hidx, size_t nidx, size_t previdx) argument 5177 size_t nidx = htab[i]; local 5201 size_t nidx = hdr.hashtab[i]; local [all...] |
H A D | stat.cpp | 3591 nidx = &_nidx; 3610 int* nidxptr = nidx->ptr<int>(i); 3638 Mat *nidx; 3667 Mat dist = _dist.getMat(), nidx; 3671 nidx = _nidx.getMat(); 3677 nidx = Scalar::all(-1); 3688 // As a result, if nidx[idx] = i*, it means that idx-th element of src1 is the nearest 3690 // If nidx[idx] = -1, it means that there is no such ideal couple for it in src2. 3701 nidx.at<int>(idx) = i + update; 3714 nidx [all...] |
/external/opencv3/modules/ml/ |
H A D | precomp.hpp | 310 virtual void calcValue( int nidx, const vector<int>& _sidx ); 332 virtual void writeNode( FileStorage& fs, int nidx, int depth ) const;
|
/external/opencv3/modules/java/src/ |
H A D | core+Core.java | 781 // C++: void batchDistance(Mat src1, Mat src2, Mat& dist, int dtype, Mat& nidx, int normType = NORM_L2, int K = 0, Mat mask = Mat(), int update = 0, bool crosscheck = false) 784 //javadoc: batchDistance(src1, src2, dist, dtype, nidx, normType, K, mask, update, crosscheck) 785 public static void batchDistance(Mat src1, Mat src2, Mat dist, int dtype, Mat nidx, int normType, int K, Mat mask, int update, boolean crosscheck) argument 788 batchDistance_0(src1.nativeObj, src2.nativeObj, dist.nativeObj, dtype, nidx.nativeObj, normType, K, mask.nativeObj, update, crosscheck); 793 //javadoc: batchDistance(src1, src2, dist, dtype, nidx, normType, K) 794 public static void batchDistance(Mat src1, Mat src2, Mat dist, int dtype, Mat nidx, int normType, int K) argument 797 batchDistance_1(src1.nativeObj, src2.nativeObj, dist.nativeObj, dtype, nidx.nativeObj, normType, K); 802 //javadoc: batchDistance(src1, src2, dist, dtype, nidx) 803 public static void batchDistance(Mat src1, Mat src2, Mat dist, int dtype, Mat nidx) argument 806 batchDistance_2(src1.nativeObj, src2.nativeObj, dist.nativeObj, dtype, nidx [all...] |
H A D | core.cpp | 1267 // void batchDistance(Mat src1, Mat src2, Mat& dist, int dtype, Mat& nidx, int normType = NORM_L2, int K = 0, Mat mask = Mat(), int update = 0, bool crosscheck = false) 1281 Mat& nidx = *((Mat*)nidx_nativeObj); local 1283 cv::batchDistance( src1, src2, dist, (int)dtype, nidx, (int)normType, (int)K, mask, (int)update, (bool)crosscheck ); 1306 Mat& nidx = *((Mat*)nidx_nativeObj); local 1307 cv::batchDistance( src1, src2, dist, (int)dtype, nidx, (int)normType, (int)K ); 1330 Mat& nidx = *((Mat*)nidx_nativeObj); local 1331 cv::batchDistance( src1, src2, dist, (int)dtype, nidx );
|
/external/opencv3/modules/features2d/src/ |
H A D | matchers.cpp | 809 Mat dist, nidx; local 820 batchDistance(queryDescriptors, trainDescCollection[iIdx], dist, dtype, nidx, 835 const int* nidxptr = nidx.ptr<int>(qIdx); 841 for( int k = 0; k < nidx.cols; k++ )
|
/external/opencv3/modules/core/include/opencv2/core/ |
H A D | mat.hpp | 2647 Node* node(size_t nidx); 2648 const Node* node(size_t nidx) const; 2651 void removeNode(size_t hidx, size_t nidx, size_t previdx);
|
H A D | mat.inl.hpp | 1892 SparseMat::Node* SparseMat::node(size_t nidx) argument 1894 return (Node*)(void*)&hdr->pool[nidx]; 1898 const SparseMat::Node* SparseMat::node(size_t nidx) const 1900 return (const Node*)(const void*)&hdr->pool[nidx];
|
/external/opencv3/modules/core/include/opencv2/ |
H A D | core.hpp | 677 OutputArray dist, int dtype, OutputArray nidx,
|
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | bcel.jar | META-INF/ META-INF/MANIFEST.MF org/ org/apache/ org/apache/bcel/ org/apache/bcel/classfile/ ... |
/external/robolectric/v3/libs/ |
H A D | vtd-xml-2.11.jar | META-INF/ META-INF/MANIFEST.MF com/ com/ximpleware/ com/ximpleware/extended/ com/ximpleware/extended/parser/ ... |