root 43 3rdparty/zlib/inftrees.c unsigned root; /* number of index bits for root table */ root 113 3rdparty/zlib/inftrees.c root = *bits; root 116 3rdparty/zlib/inftrees.c if (root > max) root = max; root 128 3rdparty/zlib/inftrees.c if (root < min) root = min; root 204 3rdparty/zlib/inftrees.c curr = root; /* current table index bits */ root 207 3rdparty/zlib/inftrees.c used = 1U << root; /* use root table entries */ root 260 3rdparty/zlib/inftrees.c if (len > root && (huff & mask) != low) { root 263 3rdparty/zlib/inftrees.c drop = root; root 287 3rdparty/zlib/inftrees.c (*table)[low].bits = (unsigned char)root; root 304 3rdparty/zlib/inftrees.c *bits = root; root 346 apps/traincascade/boost.cpp CvDTreeNode* root = 0; root 380 apps/traincascade/boost.cpp root = new_node( 0, 1, 0, 0 ); root 381 apps/traincascade/boost.cpp temp = *root; root 382 apps/traincascade/boost.cpp *root = *data_root; root 383 apps/traincascade/boost.cpp root->num_valid = temp.num_valid; root 384 apps/traincascade/boost.cpp if( root->num_valid ) root 387 apps/traincascade/boost.cpp root->num_valid[i] = data_root->num_valid[i]; root 389 apps/traincascade/boost.cpp root->cv_Tn = temp.cv_Tn; root 390 apps/traincascade/boost.cpp root->cv_node_risk = temp.cv_node_risk; root 391 apps/traincascade/boost.cpp root->cv_node_error = temp.cv_node_error; root 401 apps/traincascade/boost.cpp root = new_node( 0, count, 1, 0 ); root 439 apps/traincascade/boost.cpp unsigned short* udst_idx = (unsigned short*)(buf->data.s + root->buf_idx*get_length_subbuf() + root 452 apps/traincascade/boost.cpp int* idst_idx = buf->data.i + root->buf_idx*get_length_subbuf() + root 453 apps/traincascade/boost.cpp (size_t)vi*sample_count + root->offset; root 469 apps/traincascade/boost.cpp unsigned short* udst = (unsigned short*)(buf->data.s + root->buf_idx*get_length_subbuf() + root 470 apps/traincascade/boost.cpp (size_t)(workVarCount-1)*sample_count + root->offset); root 476 apps/traincascade/boost.cpp int* idst = buf->data.i + root->buf_idx*get_length_subbuf() + root 477 apps/traincascade/boost.cpp (size_t)(workVarCount-1)*sample_count + root->offset; root 486 apps/traincascade/boost.cpp unsigned short* sample_idx_dst = (unsigned short*)(buf->data.s + root->buf_idx*get_length_subbuf() + root 487 apps/traincascade/boost.cpp (size_t)workVarCount*sample_count + root->offset); root 493 apps/traincascade/boost.cpp int* sample_idx_dst = buf->data.i + root->buf_idx*get_length_subbuf() + root 494 apps/traincascade/boost.cpp (size_t)workVarCount*sample_count + root->offset; root 500 apps/traincascade/boost.cpp root->set_num_valid(vi, count); root 506 apps/traincascade/boost.cpp return root; root 956 apps/traincascade/boost.cpp CvDTreeNode* node = root; root 992 apps/traincascade/boost.cpp CV_DbgAssert( root ); root 993 apps/traincascade/boost.cpp internalNodesQueue.push( root ); root 1112 apps/traincascade/boost.cpp root = internalNodesQueue.front(); root 1346 apps/traincascade/boost.cpp auxMarkFeaturesInMap( root, featureMap ); root 853 apps/traincascade/old_ml.hpp CvDTreeNode* root; root 134 apps/traincascade/old_ml_boost.cpp CvDTreeNode* node = root; root 99 apps/traincascade/old_ml_inner_functions.cpp CvFileNode* root = cvGetRootFileNode( fs ); root 100 apps/traincascade/old_ml_inner_functions.cpp if( root->data.seq->total > 0 ) root 101 apps/traincascade/old_ml_inner_functions.cpp model_node = (CvFileNode*)cvGetSeqElem( root->data.seq, 0 ); root 697 apps/traincascade/old_ml_tree.cpp CvDTreeNode* root = 0; root 735 apps/traincascade/old_ml_tree.cpp root = new_node( 0, 1, 0, 0 ); root 736 apps/traincascade/old_ml_tree.cpp temp = *root; root 737 apps/traincascade/old_ml_tree.cpp *root = *data_root; root 738 apps/traincascade/old_ml_tree.cpp root->num_valid = temp.num_valid; root 739 apps/traincascade/old_ml_tree.cpp if( root->num_valid ) root 742 apps/traincascade/old_ml_tree.cpp root->num_valid[i] = data_root->num_valid[i]; root 744 apps/traincascade/old_ml_tree.cpp root->cv_Tn = temp.cv_Tn; root 745 apps/traincascade/old_ml_tree.cpp root->cv_node_risk = temp.cv_node_risk; root 746 apps/traincascade/old_ml_tree.cpp root->cv_node_error = temp.cv_node_error; root 757 apps/traincascade/old_ml_tree.cpp root = new_node( 0, count, 1, 0 ); root 787 apps/traincascade/old_ml_tree.cpp unsigned short* udst = (unsigned short*)(buf->data.s + root->buf_idx*get_length_subbuf() + root 788 apps/traincascade/old_ml_tree.cpp (size_t)vi*sample_count + root->offset); root 798 apps/traincascade/old_ml_tree.cpp int* idst = buf->data.i + root->buf_idx*get_length_subbuf() + root 799 apps/traincascade/old_ml_tree.cpp (size_t)vi*sample_count + root->offset; root 809 apps/traincascade/old_ml_tree.cpp root->set_num_valid(vi, num_valid); root 824 apps/traincascade/old_ml_tree.cpp unsigned short* udst_idx = (unsigned short*)(buf->data.s + root->buf_idx*get_length_subbuf() + root 835 apps/traincascade/old_ml_tree.cpp root->set_num_valid(vi, j); root 848 apps/traincascade/old_ml_tree.cpp int* idst_idx = buf->data.i + root->buf_idx*get_length_subbuf() + root 849 apps/traincascade/old_ml_tree.cpp (size_t)vi*sample_count + root->offset; root 859 apps/traincascade/old_ml_tree.cpp root->set_num_valid(vi, j); root 876 apps/traincascade/old_ml_tree.cpp unsigned short* sample_idx_dst = (unsigned short*)(buf->data.s + root->buf_idx*get_length_subbuf() + root 877 apps/traincascade/old_ml_tree.cpp (size_t)workVarCount*sample_count + root->offset); root 883 apps/traincascade/old_ml_tree.cpp int* sample_idx_dst = buf->data.i + root->buf_idx*get_length_subbuf() + root 884 apps/traincascade/old_ml_tree.cpp (size_t)workVarCount*sample_count + root->offset; root 895 apps/traincascade/old_ml_tree.cpp return root; root 1539 apps/traincascade/old_ml_tree.cpp root = 0; root 1552 apps/traincascade/old_ml_tree.cpp return root; root 1657 apps/traincascade/old_ml_tree.cpp root = data->subsample_data( _subsample_idx ); root 1659 apps/traincascade/old_ml_tree.cpp CV_CALL( try_split_node(root)); root 1661 apps/traincascade/old_ml_tree.cpp if( root->split ) root 1663 apps/traincascade/old_ml_tree.cpp CV_Assert( root->left ); root 1664 apps/traincascade/old_ml_tree.cpp CV_Assert( root->right ); root 3389 apps/traincascade/old_ml_tree.cpp int ti, j, tree_count = 0, cv_n = data->params.cv_folds, n = root->sample_count; root 3442 apps/traincascade/old_ml_tree.cpp err[j*tree_count + tk] = root->tree_error; root 3477 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; root 3528 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; root 3546 apps/traincascade/old_ml_tree.cpp if( node == root ) root 3569 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; root 3609 apps/traincascade/old_ml_tree.cpp if( root && data && data->shared ) root 3613 apps/traincascade/old_ml_tree.cpp data->free_node(root); root 3614 apps/traincascade/old_ml_tree.cpp root = 0; root 3625 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; root 3746 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; root 3862 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; root 4108 apps/traincascade/old_ml_tree.cpp root = _root.left; root 1664 modules/calib3d/src/calibinit.cpp CvSeq *root; root 1676 modules/calib3d/src/calibinit.cpp root = cvCreateSeq( 0, sizeof(CvSeq), sizeof(CvSeq*), temp_storage ); root 1747 modules/calib3d/src/calibinit.cpp cvSeqPush( root, &dst_contour ); root 1757 modules/calib3d/src/calibinit.cpp *out_quads = (CvCBQuad*)cvAlloc((root->total+root->total / 2) * sizeof((*out_quads)[0])); root 1758 modules/calib3d/src/calibinit.cpp *out_corners = (CvCBCorner*)cvAlloc((root->total+root->total / 2) * 4 * sizeof((*out_corners)[0])); root 1761 modules/calib3d/src/calibinit.cpp for( idx = 0; idx < root->total; idx++ ) root 1764 modules/calib3d/src/calibinit.cpp src_contour = *(CvSeq**)cvGetSeqElem( root, idx ); root 461 modules/core/include/opencv2/core/operations.hpp int root = i; root 464 modules/core/include/opencv2/core/operations.hpp while( nodes[root][PARENT] >= 0 ) root 465 modules/core/include/opencv2/core/operations.hpp root = nodes[root][PARENT]; root 476 modules/core/include/opencv2/core/operations.hpp if( root2 != root ) root 479 modules/core/include/opencv2/core/operations.hpp int rank = nodes[root][RANK], rank2 = nodes[root2][RANK]; root 481 modules/core/include/opencv2/core/operations.hpp nodes[root2][PARENT] = root; root 484 modules/core/include/opencv2/core/operations.hpp nodes[root][PARENT] = root2; root 486 modules/core/include/opencv2/core/operations.hpp root = root2; root 488 modules/core/include/opencv2/core/operations.hpp CV_Assert( nodes[root][PARENT] < 0 ); root 495 modules/core/include/opencv2/core/operations.hpp nodes[k][PARENT] = root; root 503 modules/core/include/opencv2/core/operations.hpp nodes[k][PARENT] = root; root 516 modules/core/include/opencv2/core/operations.hpp int root = i; root 517 modules/core/include/opencv2/core/operations.hpp while( nodes[root][PARENT] >= 0 ) root 518 modules/core/include/opencv2/core/operations.hpp root = nodes[root][PARENT]; root 520 modules/core/include/opencv2/core/operations.hpp if( nodes[root][RANK] >= 0 ) root 521 modules/core/include/opencv2/core/operations.hpp nodes[root][RANK] = ~nclasses++; root 522 modules/core/include/opencv2/core/operations.hpp labels[i] = ~nodes[root][RANK]; root 392 modules/core/include/opencv2/core/persistence.hpp CV_WRAP FileNode root(int streamidx=0) const; root 1167 modules/core/include/opencv2/core/persistence.hpp inline FileNode FileStorage::getFirstTopLevelNode() const { FileNode r = root(); FileNodeIterator it = r.begin(); return it != r.end() ? *it : FileNode(); } root 2382 modules/core/src/datastructs.cpp CvPTreeNode* root = node; root 2389 modules/core/src/datastructs.cpp while( root->parent ) root 2390 modules/core/src/datastructs.cpp root = root->parent; root 2405 modules/core/src/datastructs.cpp if( root2 != root ) root 2407 modules/core/src/datastructs.cpp if( root->rank > root2->rank ) root 2408 modules/core/src/datastructs.cpp root2->parent = root; root 2411 modules/core/src/datastructs.cpp root->parent = root2; root 2412 modules/core/src/datastructs.cpp root2->rank += root->rank == root2->rank; root 2413 modules/core/src/datastructs.cpp root = root2; root 2415 modules/core/src/datastructs.cpp assert( root->parent == 0 ); root 2422 modules/core/src/datastructs.cpp temp->parent = root; root 2431 modules/core/src/datastructs.cpp temp->parent = root; root 4344 modules/core/src/persistence.cpp CvSeq* root = 0; root 4368 modules/core/src/persistence.cpp if( !root ) root 4369 modules/core/src/persistence.cpp root = seq; root 4393 modules/core/src/persistence.cpp ptr = root; root 520 modules/core/test/test_mat.cpp lPCA.read( fs.root() ); root 479 modules/cudaobjdetect/src/cascadeclassifier.cpp bool load(const FileNode &root); root 634 modules/cudaobjdetect/src/cascadeclassifier.cpp bool LbpCascade_Impl::load(const FileNode &root) root 655 modules/cudaobjdetect/src/cascadeclassifier.cpp String stageTypeStr = (String)root[CUDA_CC_STAGE_TYPE]; root 658 modules/cudaobjdetect/src/cascadeclassifier.cpp String featureTypeStr = (String)root[CUDA_CC_FEATURE_TYPE]; root 661 modules/cudaobjdetect/src/cascadeclassifier.cpp NxM.width = (int)root[CUDA_CC_WIDTH]; root 662 modules/cudaobjdetect/src/cascadeclassifier.cpp NxM.height = (int)root[CUDA_CC_HEIGHT]; root 665 modules/cudaobjdetect/src/cascadeclassifier.cpp isStumps = ((int)(root[CUDA_CC_STAGE_PARAMS][CUDA_CC_MAX_DEPTH]) == 1) ? true : false; root 668 modules/cudaobjdetect/src/cascadeclassifier.cpp FileNode fn = root[CUDA_CC_FEATURE_PARAMS]; root 677 modules/cudaobjdetect/src/cascadeclassifier.cpp fn = root[CUDA_CC_STAGES]; root 748 modules/cudaobjdetect/src/cascadeclassifier.cpp fn = root[CUDA_CC_FEATURES]; root 171 modules/features2d/misc/java/src/cpp/features2d_manual.hpp wrapped->read(fs.root()); root 285 modules/features2d/misc/java/src/cpp/features2d_manual.hpp wrapped->read(fs.root()); root 390 modules/features2d/misc/java/src/cpp/features2d_manual.hpp wrapped->read(fs.root()); root 870 modules/features2d/src/mser.cpp MSCRNode* root = x; root 874 modules/features2d/src/mser.cpp x->shortcut = root; root 878 modules/features2d/src/mser.cpp return root; root 359 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h : dataset(inputData), params(index_params), root(NULL), indices(NULL), distance(d) root 388 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root = new NodePtr[trees_]; root 392 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root[i] = NULL; root 409 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h if (root!=NULL) { root 410 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h delete[] root; root 477 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root[i] = pool.allocate<Node>(); root 478 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h computeClustering(root[i], indices[i], (int)size_, branching_,0); root 498 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h save_tree(stream, root[i], i); root 508 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h if (root!=NULL) { root 509 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h delete[] root; root 523 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root = new NodePtr[trees_]; root 527 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h load_tree(stream, root[i], i); root 558 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h findNN(root[i], result, vec, checks, maxChecks, heap, checked); root 810 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h NodePtr* root; root 1060 modules/flann/include/opencv2/flann/kmeans_index.h int getMinVarianceClusters(KMeansNodePtr root, KMeansNodePtr* clusters, int clusters_length, DistanceType& varianceValue) root 1063 modules/flann/include/opencv2/flann/kmeans_index.h clusters[0] = root; root 1065 modules/flann/include/opencv2/flann/kmeans_index.h DistanceType meanVariance = root->variance*root->size; root 1099 modules/flann/include/opencv2/flann/kmeans_index.h varianceValue = meanVariance/root->size; root 123 modules/imgproc/src/connectedcomponents.cpp LabelT root = i; root 124 modules/imgproc/src/connectedcomponents.cpp while(P[root] < root){ root 125 modules/imgproc/src/connectedcomponents.cpp root = P[root]; root 127 modules/imgproc/src/connectedcomponents.cpp return root; root 133 modules/imgproc/src/connectedcomponents.cpp void setRoot(LabelT *P, LabelT i, LabelT root){ root 136 modules/imgproc/src/connectedcomponents.cpp P[i] = root; root 139 modules/imgproc/src/connectedcomponents.cpp P[i] = root; root 146 modules/imgproc/src/connectedcomponents.cpp LabelT root = findRoot(P, i); root 147 modules/imgproc/src/connectedcomponents.cpp setRoot(P, i, root); root 148 modules/imgproc/src/connectedcomponents.cpp return root; root 155 modules/imgproc/src/connectedcomponents.cpp LabelT root = findRoot(P, i); root 158 modules/imgproc/src/connectedcomponents.cpp if(root > rootj){ root 159 modules/imgproc/src/connectedcomponents.cpp root = rootj; root 161 modules/imgproc/src/connectedcomponents.cpp setRoot(P, j, root); root 163 modules/imgproc/src/connectedcomponents.cpp setRoot(P, i, root); root 164 modules/imgproc/src/connectedcomponents.cpp return root; root 142 modules/ml/src/boost.cpp void scaleTree( int root, double scale ) root 144 modules/ml/src/boost.cpp int nidx = root, pidx = 0; root 193 modules/ml/src/boost.cpp int root = addTree( sidx ); root 194 modules/ml/src/boost.cpp if( root < 0 ) root 322 modules/ml/src/precomp.hpp virtual int pruneCV( int root ); root 324 modules/ml/src/precomp.hpp virtual double updateTreeRNC( int root, double T, int fold ); root 325 modules/ml/src/precomp.hpp virtual bool cutTree( int root, double T, int fold, double min_alpha ); root 333 modules/ml/src/precomp.hpp virtual void writeTree( FileStorage& fs, int root ) const; root 181 modules/ml/src/rtrees.cpp int root = addTree( sidx ); root 182 modules/ml/src/rtrees.cpp if( root < 0 ) root 263 modules/ml/src/tree.cpp int root = (int)nodes.size(); root 342 modules/ml/src/tree.cpp roots.push_back(root); root 343 modules/ml/src/tree.cpp return root; root 1194 modules/ml/src/tree.cpp int DTreesImpl::pruneCV( int root ) root 1202 modules/ml/src/tree.cpp int ti, tree_count = 0, j, cv_n = params.getCVFolds(), n = w->wnodes[root].sample_count; root 1211 modules/ml/src/tree.cpp double min_alpha = updateTreeRNC(root, tree_count, -1); root 1212 modules/ml/src/tree.cpp if( cutTree(root, tree_count, -1, min_alpha) ) root 1233 modules/ml/src/tree.cpp double min_alpha = updateTreeRNC(root, tj, j); root 1234 modules/ml/src/tree.cpp if( cutTree(root, tj, j, min_alpha) ) root 1241 modules/ml/src/tree.cpp err_jk.at<double>(j, tk) = w->wnodes[root].tree_error; root 1266 modules/ml/src/tree.cpp double DTreesImpl::updateTreeRNC( int root, double T, int fold ) root 1268 modules/ml/src/tree.cpp int nidx = root, pidx = -1, cv_n = params.getCVFolds(); root 1322 modules/ml/src/tree.cpp bool DTreesImpl::cutTree( int root, double T, int fold, double min_alpha ) root 1324 modules/ml/src/tree.cpp int cv_n = params.getCVFolds(), nidx = root, pidx = -1; root 1325 modules/ml/src/tree.cpp WNode* node = &w->wnodes[root]; root 1343 modules/ml/src/tree.cpp if( nidx == root ) root 1649 modules/ml/src/tree.cpp void DTreesImpl::writeTree( FileStorage& fs, int root ) const root 1653 modules/ml/src/tree.cpp int nidx = root, pidx = 0, depth = 0; root 1896 modules/ml/src/tree.cpp int i, n = (int)fn.size(), root = -1, pidx = -1; root 1907 modules/ml/src/tree.cpp root = nidx; root 1924 modules/ml/src/tree.cpp roots.push_back(root); root 1925 modules/ml/src/tree.cpp return root; root 229 modules/ml/test/test_save_load.cpp FileNode root = fs.getFirstTopLevelNode(); root 230 modules/ml/test/test_save_load.cpp root["cat_map"] >> catMap; root 231 modules/ml/test/test_save_load.cpp root["cat_count"] >> catCount; root 232 modules/ml/test/test_save_load.cpp root["var_type"] >> varTypes; root 1393 modules/objdetect/src/cascadedetect.cpp bool CascadeClassifierImpl::Data::read(const FileNode &root) root 1398 modules/objdetect/src/cascadedetect.cpp String stageTypeStr = (String)root[CC_STAGE_TYPE]; root 1404 modules/objdetect/src/cascadedetect.cpp String featureTypeStr = (String)root[CC_FEATURE_TYPE]; root 1417 modules/objdetect/src/cascadedetect.cpp origWinSize.width = (int)root[CC_WIDTH]; root 1418 modules/objdetect/src/cascadedetect.cpp origWinSize.height = (int)root[CC_HEIGHT]; root 1422 modules/objdetect/src/cascadedetect.cpp FileNode fn = root[CC_FEATURE_PARAMS]; root 1431 modules/objdetect/src/cascadedetect.cpp fn = root[CC_STAGES]; root 1528 modules/objdetect/src/cascadedetect.cpp bool CascadeClassifierImpl::read_(const FileNode& root) root 1536 modules/objdetect/src/cascadedetect.cpp if( !data.read(root) ) root 1541 modules/objdetect/src/cascadedetect.cpp FileNode fn = root[CC_FEATURES]; root 1579 modules/objdetect/src/cascadedetect.cpp bool CascadeClassifier::read(const FileNode &root) root 1582 modules/objdetect/src/cascadedetect.cpp bool ok = ccimpl->read_(root); root 506 modules/objdetect/src/cascadedetect.hpp int idx = 0, root = nodeOfs; root 510 modules/objdetect/src/cascadedetect.hpp CascadeClassifierImpl::Data::DTreeNode& node = cascadeNodes[root + idx]; root 548 modules/objdetect/src/cascadedetect.hpp int idx = 0, root = nodeOfs; root 551 modules/objdetect/src/cascadedetect.hpp CascadeClassifierImpl::Data::DTreeNode& node = cascadeNodes[root + idx]; root 553 modules/objdetect/src/cascadedetect.hpp const int* subset = &cascadeSubsets[(root + idx)*subsetSize]; root 1367 modules/objdetect/test/test_cascadeandhog.cpp String root = cvtest::TS::ptr()->get_data_path() + "cascadeandhog/cascades/"; root 1370 modules/objdetect/test/test_cascadeandhog.cpp root + "haarcascade_frontalface_alt.xml", root 1371 modules/objdetect/test/test_cascadeandhog.cpp root + "lbpcascade_frontalface.xml", root 1237 modules/python/src2/cv2.cpp static void init_submodule(PyObject * root, const char * name, PyMethodDef * methods, ConstDef * consts) root 1251 modules/python/src2/cv2.cpp PyObject * d = PyModule_GetDict(root); root 1260 modules/python/src2/cv2.cpp root = submod; root 1264 modules/python/src2/cv2.cpp PyObject * d = PyModule_GetDict(root); root 215 modules/ts/src/ts_perf.cpp rootIn = storageIn.root();