node 1912 3rdparty/libjasper/jpc_dec.c void jpc_seglist_insert(jpc_dec_seglist_t *list, jpc_dec_seg_t *ins, jpc_dec_seg_t *node) node 1918 3rdparty/libjasper/jpc_dec.c node->prev = prev; node 1920 3rdparty/libjasper/jpc_dec.c node->prev = prev; node 1921 3rdparty/libjasper/jpc_dec.c node->next = next; node 1923 3rdparty/libjasper/jpc_dec.c prev->next = node; node 1925 3rdparty/libjasper/jpc_dec.c list->head = node; node 1928 3rdparty/libjasper/jpc_dec.c next->prev = node; node 1930 3rdparty/libjasper/jpc_dec.c list->tail = node; node 690 3rdparty/libjasper/jpc_dec.h void jpc_seglist_remove(jpc_dec_seglist_t *list, jpc_dec_seg_t *node); node 694 3rdparty/libjasper/jpc_dec.h jpc_dec_seg_t *node); node 99 3rdparty/libjasper/jpc_tagtree.c jpc_tagtreenode_t *node; node 134 3rdparty/libjasper/jpc_tagtree.c node = tree->nodes_; node 142 3rdparty/libjasper/jpc_tagtree.c node->parent_ = parentnode; node 143 3rdparty/libjasper/jpc_tagtree.c ++node; node 145 3rdparty/libjasper/jpc_tagtree.c node->parent_ = parentnode; node 146 3rdparty/libjasper/jpc_tagtree.c ++node; node 158 3rdparty/libjasper/jpc_tagtree.c node->parent_ = 0; node 225 3rdparty/libjasper/jpc_tagtree.c jpc_tagtreenode_t *node; node 228 3rdparty/libjasper/jpc_tagtree.c node = tree->nodes_; node 231 3rdparty/libjasper/jpc_tagtree.c node->value_ = INT_MAX; node 232 3rdparty/libjasper/jpc_tagtree.c node->low_ = 0; node 233 3rdparty/libjasper/jpc_tagtree.c node->known_ = 0; node 234 3rdparty/libjasper/jpc_tagtree.c ++node; node 244 3rdparty/libjasper/jpc_tagtree.c jpc_tagtreenode_t *node; node 251 3rdparty/libjasper/jpc_tagtree.c node = leaf; node 252 3rdparty/libjasper/jpc_tagtree.c while (node && node->value_ > value) { node 253 3rdparty/libjasper/jpc_tagtree.c node->value_ = value; node 254 3rdparty/libjasper/jpc_tagtree.c node = node->parent_; node 272 3rdparty/libjasper/jpc_tagtree.c jpc_tagtreenode_t *node; node 283 3rdparty/libjasper/jpc_tagtree.c node = leaf; node 284 3rdparty/libjasper/jpc_tagtree.c while (node->parent_) { node 285 3rdparty/libjasper/jpc_tagtree.c *stkptr++ = node; node 286 3rdparty/libjasper/jpc_tagtree.c node = node->parent_; node 291 3rdparty/libjasper/jpc_tagtree.c if (low > node->low_) { node 294 3rdparty/libjasper/jpc_tagtree.c node->low_ = low; node 296 3rdparty/libjasper/jpc_tagtree.c low = node->low_; node 300 3rdparty/libjasper/jpc_tagtree.c if (low >= node->value_) { node 301 3rdparty/libjasper/jpc_tagtree.c if (!node->known_) { node 305 3rdparty/libjasper/jpc_tagtree.c node->known_ = 1; node 314 3rdparty/libjasper/jpc_tagtree.c node->low_ = low; node 318 3rdparty/libjasper/jpc_tagtree.c node = *--stkptr; node 332 3rdparty/libjasper/jpc_tagtree.c jpc_tagtreenode_t *node; node 343 3rdparty/libjasper/jpc_tagtree.c node = leaf; node 344 3rdparty/libjasper/jpc_tagtree.c while (node->parent_) { node 345 3rdparty/libjasper/jpc_tagtree.c *stkptr++ = node; node 346 3rdparty/libjasper/jpc_tagtree.c node = node->parent_; node 351 3rdparty/libjasper/jpc_tagtree.c if (low > node->low_) { node 352 3rdparty/libjasper/jpc_tagtree.c node->low_ = low; node 354 3rdparty/libjasper/jpc_tagtree.c low = node->low_; node 356 3rdparty/libjasper/jpc_tagtree.c while (low < threshold && low < node->value_) { node 361 3rdparty/libjasper/jpc_tagtree.c node->value_ = low; node 366 3rdparty/libjasper/jpc_tagtree.c node->low_ = low; node 370 3rdparty/libjasper/jpc_tagtree.c node = *--stkptr; node 373 3rdparty/libjasper/jpc_tagtree.c return (node->value_ < threshold) ? 1 : 0; node 382 3rdparty/libjasper/jpc_tagtree.c jpc_tagtreenode_t *node; node 385 3rdparty/libjasper/jpc_tagtree.c node = tree->nodes_; node 389 3rdparty/libjasper/jpc_tagtree.c (void *) node, (void *) node->parent_, node->value_, node->low_, node 390 3rdparty/libjasper/jpc_tagtree.c node->known_); node 391 3rdparty/libjasper/jpc_tagtree.c ++node; node 157 3rdparty/libwebp/dec/vp8l.c const HuffmanTreeNode* node = tree->root_; node 160 3rdparty/libwebp/dec/vp8l.c assert(node != NULL); node 161 3rdparty/libwebp/dec/vp8l.c while (!HuffmanTreeNodeIsLeaf(node)) { node 162 3rdparty/libwebp/dec/vp8l.c node = HuffmanTreeNextNode(node, bits & 1); node 167 3rdparty/libwebp/dec/vp8l.c return node->symbol_; node 630 3rdparty/libwebp/enc/quant.c const Node* const node = &NODE(n, best_node); node 632 3rdparty/libwebp/enc/quant.c out[n] = node->sign ? -node->level : node->level; node 633 3rdparty/libwebp/enc/quant.c nz |= (node->level != 0); node 635 3rdparty/libwebp/enc/quant.c best_node = node->prev; node 26 3rdparty/libwebp/utils/huffman.c static void TreeNodeInit(HuffmanTreeNode* const node) { node 27 3rdparty/libwebp/utils/huffman.c node->children_ = -1; // means: 'unassigned so far' node 30 3rdparty/libwebp/utils/huffman.c static int NodeIsEmpty(const HuffmanTreeNode* const node) { node 31 3rdparty/libwebp/utils/huffman.c return (node->children_ < 0); node 39 3rdparty/libwebp/utils/huffman.c HuffmanTreeNode* const node) { node 41 3rdparty/libwebp/utils/huffman.c node->children_ = (int)(children - node); node 42 3rdparty/libwebp/utils/huffman.c assert(children - node == (int)(children - node)); node 122 3rdparty/libwebp/utils/huffman.c HuffmanTreeNode* node = tree->root_; node 125 3rdparty/libwebp/utils/huffman.c if (node >= max_node) { node 128 3rdparty/libwebp/utils/huffman.c if (NodeIsEmpty(node)) { node 130 3rdparty/libwebp/utils/huffman.c AssignChildren(tree, node); node 131 3rdparty/libwebp/utils/huffman.c } else if (HuffmanTreeNodeIsLeaf(node)) { node 134 3rdparty/libwebp/utils/huffman.c node += node->children_ + ((code >> code_length) & 1); node 136 3rdparty/libwebp/utils/huffman.c if (NodeIsEmpty(node)) { node 137 3rdparty/libwebp/utils/huffman.c node->children_ = 0; // turn newly created node into a leaf. node 138 3rdparty/libwebp/utils/huffman.c } else if (!HuffmanTreeNodeIsLeaf(node)) { node 141 3rdparty/libwebp/utils/huffman.c node->symbol_ = symbol; // Add symbol in this node. node 40 3rdparty/libwebp/utils/huffman.h const HuffmanTreeNode* const node) { node 41 3rdparty/libwebp/utils/huffman.h return (node->children_ == 0); node 46 3rdparty/libwebp/utils/huffman.h const HuffmanTreeNode* node, int right_child) { node 47 3rdparty/libwebp/utils/huffman.h return node + node->children_ + right_child; node 626 3rdparty/zlib/trees.c int node; /* new node being created */ node 649 3rdparty/zlib/trees.c node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0); node 650 3rdparty/zlib/trees.c tree[node].Freq = 1; node 651 3rdparty/zlib/trees.c s->depth[node] = 0; node 652 3rdparty/zlib/trees.c s->opt_len--; if (stree) s->static_len -= stree[node].Len; node 665 3rdparty/zlib/trees.c node = elems; /* next internal node of the tree */ node 674 3rdparty/zlib/trees.c tree[node].Freq = tree[n].Freq + tree[m].Freq; node 675 3rdparty/zlib/trees.c s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ? node 677 3rdparty/zlib/trees.c tree[n].Dad = tree[m].Dad = (ush)node; node 681 3rdparty/zlib/trees.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq); node 685 3rdparty/zlib/trees.c s->heap[SMALLEST] = node++; node 252 apps/traincascade/boost.cpp bool CvCascadeBoostParams::read( const FileNode &node ) node 255 apps/traincascade/boost.cpp FileNode rnode = node[CC_BOOST_TYPE]; node 263 apps/traincascade/boost.cpp node[CC_MINHITRATE] >> minHitRate; node 264 apps/traincascade/boost.cpp node[CC_MAXFALSEALARM] >> maxFalseAlarm; node 265 apps/traincascade/boost.cpp node[CC_TRIM_RATE] >> weight_trim_rate ; node 266 apps/traincascade/boost.cpp node[CC_MAX_DEPTH] >> max_depth ; node 267 apps/traincascade/boost.cpp node[CC_WEAK_COUNT] >> weak_count ; node 956 apps/traincascade/boost.cpp CvDTreeNode* node = root; node 957 apps/traincascade/boost.cpp if( !node ) node 962 apps/traincascade/boost.cpp while( node->left ) node 964 apps/traincascade/boost.cpp CvDTreeSplit* split = node->split; node 966 apps/traincascade/boost.cpp node = val <= split->ord.c ? node->left : node->right; node 971 apps/traincascade/boost.cpp while( node->left ) node 973 apps/traincascade/boost.cpp CvDTreeSplit* split = node->split; node 975 apps/traincascade/boost.cpp node = CV_DTREE_CAT_DIR(c, split->subset) < 0 ? node->left : node->right; node 978 apps/traincascade/boost.cpp return node; node 1041 apps/traincascade/boost.cpp void CvCascadeBoostTree::read( const FileNode &node, CvBoost* _ensemble, node 1058 apps/traincascade/boost.cpp FileNode rnode = node[CC_INTERNAL_NODES]; node 1060 apps/traincascade/boost.cpp leafValsuesIt = node[CC_LEAF_VALUES].end(); node 1116 apps/traincascade/boost.cpp void CvCascadeBoostTree::split_node_data( CvDTreeNode* node ) node 1118 apps/traincascade/boost.cpp int n = node->sample_count, nl, nr, scount = data->sample_count; node 1122 apps/traincascade/boost.cpp int newBufIdx = data->get_child_buf_idx( node ); node 1130 apps/traincascade/boost.cpp complete_node_dir(node); node 1141 apps/traincascade/boost.cpp node->left = left = data->new_node( node, nl, newBufIdx, node->offset ); node 1142 apps/traincascade/boost.cpp node->right = right = data->new_node( node, nr, newBufIdx, node->offset + nl ); node 1144 apps/traincascade/boost.cpp splitInputData = node->depth + 1 < data->params.max_depth && node 1145 apps/traincascade/boost.cpp (node->left->sample_count > data->params.min_sample_count || node 1146 apps/traincascade/boost.cpp node->right->sample_count > data->params.min_sample_count); node 1155 apps/traincascade/boost.cpp int n1 = node->get_num_valid(vi); node 1161 apps/traincascade/boost.cpp data->get_ord_var_data(node, vi, src_val_buf, src_sorted_idx_buf, &src_val, &src_sorted_idx, src_sample_idx_buf); node 1223 apps/traincascade/boost.cpp const int* src_lbls = data->get_cv_labels(node, src_lbls_buf); node 1276 apps/traincascade/boost.cpp const int* sampleIdx_src = data->get_sample_indices(node, sampleIdx_src_buf); node 1331 apps/traincascade/boost.cpp data->free_node_data(node); node 1334 apps/traincascade/boost.cpp static void auxMarkFeaturesInMap( const CvDTreeNode* node, Mat& featureMap) node 1336 apps/traincascade/boost.cpp if ( node && node->split ) node 1338 apps/traincascade/boost.cpp featureMap.ptr<int>(0)[node->split->var_idx] = 1; node 1339 apps/traincascade/boost.cpp auxMarkFeaturesInMap( node->left, featureMap ); node 1340 apps/traincascade/boost.cpp auxMarkFeaturesInMap( node->right, featureMap ); node 1729 apps/traincascade/boost.cpp bool CvCascadeBoost::read( const FileNode &node, node 1738 apps/traincascade/boost.cpp node[CC_STAGE_THRESHOLD] >> threshold; node 1739 apps/traincascade/boost.cpp FileNode rnode = node[CC_WEAK_CLASSIFIERS]; node 17 apps/traincascade/boost.h bool read( const cv::FileNode &node ); node 58 apps/traincascade/boost.h void read( const cv::FileNode &node, CvBoost* _ensemble, CvDTreeTrainData* _data ); node 74 apps/traincascade/boost.h bool read( const cv::FileNode &node, const CvFeatureEvaluator* _featureEvaluator, node 40 apps/traincascade/cascadeclassifier.cpp bool CvCascadeParams::read( const FileNode &node ) node 42 apps/traincascade/cascadeclassifier.cpp if ( node.empty() ) node 45 apps/traincascade/cascadeclassifier.cpp FileNode rnode = node[CC_STAGE_TYPE]; node 52 apps/traincascade/cascadeclassifier.cpp rnode = node[CC_FEATURE_TYPE]; node 62 apps/traincascade/cascadeclassifier.cpp node[CC_HEIGHT] >> winSize.height; node 63 apps/traincascade/cascadeclassifier.cpp node[CC_WIDTH] >> winSize.width; node 375 apps/traincascade/cascadeclassifier.cpp bool CvCascadeClassifier::readParams( const FileNode &node ) node 377 apps/traincascade/cascadeclassifier.cpp if ( !node.isMap() || !cascadeParams.read( node ) ) node 381 apps/traincascade/cascadeclassifier.cpp FileNode rnode = node[CC_STAGE_PARAMS]; node 386 apps/traincascade/cascadeclassifier.cpp rnode = node[CC_FEATURE_PARAMS]; node 392 apps/traincascade/cascadeclassifier.cpp bool CvCascadeClassifier::readStages( const FileNode &node) node 394 apps/traincascade/cascadeclassifier.cpp FileNode rnode = node[CC_STAGES]; node 522 apps/traincascade/cascadeclassifier.cpp FileNode node = fs.getFirstTopLevelNode(); node 523 apps/traincascade/cascadeclassifier.cpp if ( !readParams( node ) ) node 534 apps/traincascade/cascadeclassifier.cpp node = fs.getFirstTopLevelNode(); node 539 apps/traincascade/cascadeclassifier.cpp if ( !tempStage->read( node, featureEvaluator, *stageParams )) node 74 apps/traincascade/cascadeclassifier.h bool read( const cv::FileNode &node ); node 109 apps/traincascade/cascadeclassifier.h bool readParams( const cv::FileNode &node ); node 110 apps/traincascade/cascadeclassifier.h bool readStages( const cv::FileNode &node ); node 49 apps/traincascade/features.cpp bool CvFeatureParams::read( const FileNode &node ) node 51 apps/traincascade/features.cpp if ( node.empty() ) node 53 apps/traincascade/features.cpp maxCatCount = node[CC_MAX_CAT_COUNT]; node 54 apps/traincascade/features.cpp featSize = node[CC_FEATURE_SIZE]; node 36 apps/traincascade/haarfeatures.cpp bool CvHaarFeatureParams::read( const FileNode &node ) node 38 apps/traincascade/haarfeatures.cpp if( !CvFeatureParams::read( node ) ) node 41 apps/traincascade/haarfeatures.cpp FileNode rnode = node[CC_MODE]; node 22 apps/traincascade/haarfeatures.h virtual bool read( const cv::FileNode &node ); node 148 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* storage, CvFileNode* node ); node 214 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* storage, CvFileNode* node ); node 525 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* storage, CvFileNode* node ); node 542 apps/traincascade/old_ml.hpp virtual void read_params( CvFileStorage* fs, CvFileNode* node ); node 677 apps/traincascade/old_ml.hpp virtual void read_params( CvFileStorage* fs, CvFileNode* node ); node 704 apps/traincascade/old_ml.hpp virtual void free_node_data( CvDTreeNode* node ); node 706 apps/traincascade/old_ml.hpp virtual void free_node( CvDTreeNode* node ); node 803 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node ); node 807 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node, node 833 apps/traincascade/old_ml.hpp virtual double calc_node_dir( CvDTreeNode* node ); node 834 apps/traincascade/old_ml.hpp virtual void complete_node_dir( CvDTreeNode* node ); node 838 apps/traincascade/old_ml.hpp virtual void calc_node_value( CvDTreeNode* node ); node 846 apps/traincascade/old_ml.hpp virtual void write_node( CvFileStorage* fs, CvDTreeNode* node ) const; node 848 apps/traincascade/old_ml.hpp virtual CvDTreeNode* read_node( CvFileStorage* fs, CvFileNode* node, CvDTreeNode* parent ); node 849 apps/traincascade/old_ml.hpp virtual CvDTreeSplit* read_split( CvFileStorage* fs, CvFileNode* node ); node 851 apps/traincascade/old_ml.hpp virtual void read_tree_nodes( CvFileStorage* fs, CvFileNode* node ); node 879 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node, CvRTrees* forest, CvDTreeTrainData* _data ); node 889 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node ); node 890 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node, node 952 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node ); node 1007 apps/traincascade/old_ml.hpp virtual double calc_node_dir( CvDTreeNode* node ); node 1070 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node, node 1082 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node ); node 1083 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node, node 1164 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* storage, CvFileNode* node ); node 1181 apps/traincascade/old_ml.hpp virtual void read_params( CvFileStorage* fs, CvFileNode* node ); node 1575 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node ); node 1685 apps/traincascade/old_ml.hpp void leaves_get( CvDTreeNode** leaves, int& count, CvDTreeNode* node ); node 1849 apps/traincascade/old_ml.hpp virtual void read( CvFileStorage* fs, CvFileNode* node ); node 1884 apps/traincascade/old_ml.hpp virtual void read_params( CvFileStorage* fs, CvFileNode* node ); node 134 apps/traincascade/old_ml_boost.cpp CvDTreeNode* node = root; node 142 apps/traincascade/old_ml_boost.cpp node->value *= _scale; node 143 apps/traincascade/old_ml_boost.cpp if( !node->left ) node 145 apps/traincascade/old_ml_boost.cpp node = node->left; node 148 apps/traincascade/old_ml_boost.cpp for( parent = node->parent; parent && parent->right == node; node 149 apps/traincascade/old_ml_boost.cpp node = parent, parent = parent->parent ) node 155 apps/traincascade/old_ml_boost.cpp node = parent->right; node 161 apps/traincascade/old_ml_boost.cpp CvBoostTree::try_split_node( CvDTreeNode* node ) node 163 apps/traincascade/old_ml_boost.cpp CvDTree::try_split_node( node ); node 165 apps/traincascade/old_ml_boost.cpp if( !node->left ) node 170 apps/traincascade/old_ml_boost.cpp cv::AutoBuffer<int> inn_buf(node->sample_count); node 171 apps/traincascade/old_ml_boost.cpp const int* labels = data->get_cv_labels( node, (int*)inn_buf ); node 172 apps/traincascade/old_ml_boost.cpp int i, count = node->sample_count; node 173 apps/traincascade/old_ml_boost.cpp double value = node->value; node 182 apps/traincascade/old_ml_boost.cpp CvBoostTree::calc_node_dir( CvDTreeNode* node ) node 186 apps/traincascade/old_ml_boost.cpp int i, n = node->sample_count, vi = node->split->var_idx; node 189 apps/traincascade/old_ml_boost.cpp assert( !node->split->inversed ); node 194 apps/traincascade/old_ml_boost.cpp const int* cat_labels = data->get_cat_var_data( node, vi, (int*)inn_buf ); node 195 apps/traincascade/old_ml_boost.cpp const int* subset = node->split->subset; node 218 apps/traincascade/old_ml_boost.cpp data->get_ord_var_data( node, vi, values_buf, sorted_indices_buf, &values, &sorted_indices, sample_indices_buf ); node 219 apps/traincascade/old_ml_boost.cpp int split_point = node->split->ord.split_point; node 220 apps/traincascade/old_ml_boost.cpp int n1 = node->get_num_valid(vi); node 245 apps/traincascade/old_ml_boost.cpp node->maxlr = MAX( L, R ); node 246 apps/traincascade/old_ml_boost.cpp return node->split->quality/(L + R); node 251 apps/traincascade/old_ml_boost.cpp CvBoostTree::find_split_ord_class( CvDTreeNode* node, int vi, float init_quality, node 257 apps/traincascade/old_ml_boost.cpp int n = node->sample_count; node 258 apps/traincascade/old_ml_boost.cpp int n1 = node->get_num_valid(vi); node 269 apps/traincascade/old_ml_boost.cpp data->get_ord_var_data( node, vi, values_buf, sorted_indices_buf, &values, &sorted_indices, sample_indices_buf ); node 271 apps/traincascade/old_ml_boost.cpp const int* responses = data->get_class_labels( node, responses_buf ); node 362 apps/traincascade/old_ml_boost.cpp CvBoostTree::find_split_cat_class( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _split, uchar* _ext_buf ) node 365 apps/traincascade/old_ml_boost.cpp int n = node->sample_count; node 376 apps/traincascade/old_ml_boost.cpp const int* cat_labels = data->get_cat_var_data(node, vi, cat_labels_buf); node 378 apps/traincascade/old_ml_boost.cpp const int* responses = data->get_class_labels(node, responses_buf); node 483 apps/traincascade/old_ml_boost.cpp CvBoostTree::find_split_ord_reg( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _split, uchar* _ext_buf ) node 487 apps/traincascade/old_ml_boost.cpp int n = node->sample_count; node 488 apps/traincascade/old_ml_boost.cpp int n1 = node->get_num_valid(vi); node 500 apps/traincascade/old_ml_boost.cpp data->get_ord_var_data( node, vi, values_buf, indices_buf, &values, &indices, sample_indices_buf ); node 502 apps/traincascade/old_ml_boost.cpp const float* responses = data->get_ord_responses( node, responses_buf, sample_indices_buf ); node 506 apps/traincascade/old_ml_boost.cpp double best_val = init_quality, lsum = 0, rsum = node->value*R; node 552 apps/traincascade/old_ml_boost.cpp CvBoostTree::find_split_cat_reg( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _split, uchar* _ext_buf ) node 556 apps/traincascade/old_ml_boost.cpp int n = node->sample_count; node 566 apps/traincascade/old_ml_boost.cpp const int* cat_labels = data->get_cat_var_data(node, vi, cat_labels_buf); node 569 apps/traincascade/old_ml_boost.cpp const float* responses = data->get_ord_responses(node, responses_buf, sample_indices_buf); node 648 apps/traincascade/old_ml_boost.cpp CvBoostTree::find_surrogate_split_ord( CvDTreeNode* node, int vi, uchar* _ext_buf ) node 651 apps/traincascade/old_ml_boost.cpp int n = node->sample_count; node 661 apps/traincascade/old_ml_boost.cpp data->get_ord_var_data( node, vi, values_buf, indices_buf, &values, &indices, sample_indices_buf ); node 665 apps/traincascade/old_ml_boost.cpp int n1 = node->get_num_valid(vi); node 673 apps/traincascade/old_ml_boost.cpp double worst_val = node->maxlr; node 718 apps/traincascade/old_ml_boost.cpp return best_i >= 0 && best_val > node->maxlr ? data->new_split_ord( vi, node 725 apps/traincascade/old_ml_boost.cpp CvBoostTree::find_surrogate_split_cat( CvDTreeNode* node, int vi, uchar* _ext_buf ) node 729 apps/traincascade/old_ml_boost.cpp int n = node->sample_count; node 738 apps/traincascade/old_ml_boost.cpp const int* cat_labels = data->get_cat_var_data(node, vi, cat_labels_buf); node 787 apps/traincascade/old_ml_boost.cpp if( split->quality <= node->maxlr ) node 795 apps/traincascade/old_ml_boost.cpp CvBoostTree::calc_node_value( CvDTreeNode* node ) node 797 apps/traincascade/old_ml_boost.cpp int i, n = node->sample_count; node 801 apps/traincascade/old_ml_boost.cpp const int* labels = data->get_cv_labels(node, labels_buf); node 809 apps/traincascade/old_ml_boost.cpp const int* _responses = data->get_class_labels(node, _responses_buf); node 825 apps/traincascade/old_ml_boost.cpp node->class_idx = rcw[1] > rcw[0]; node 831 apps/traincascade/old_ml_boost.cpp node->value = node->class_idx*2 - 1; node 839 apps/traincascade/old_ml_boost.cpp node->value = 0.5*log_ratio(p); node 851 apps/traincascade/old_ml_boost.cpp const float* values = data->get_ord_responses(node, values_buf, sample_indices_buf); node 865 apps/traincascade/old_ml_boost.cpp node->value = sum*iw; node 866 apps/traincascade/old_ml_boost.cpp node->node_risk = sum2 - (sum*iw)*sum; node 870 apps/traincascade/old_ml_boost.cpp node->node_risk *= n*iw*n*iw; node 1492 apps/traincascade/old_ml_boost.cpp const CvDTreeNode* node; node 1506 apps/traincascade/old_ml_boost.cpp node = wtree->get_root(); node 1507 apps/traincascade/old_ml_boost.cpp assert( node != 0 ); node 1513 apps/traincascade/old_ml_boost.cpp CvDTreeSplit* split = node->split; node 1516 apps/traincascade/old_ml_boost.cpp if( !node->left ) node 1518 apps/traincascade/old_ml_boost.cpp node = node->left; node 1521 apps/traincascade/old_ml_boost.cpp for( parent = node->parent; parent && parent->right == node; node 1522 apps/traincascade/old_ml_boost.cpp node = parent, parent = parent->parent ) node 1528 apps/traincascade/old_ml_boost.cpp node = parent->right; node 1560 apps/traincascade/old_ml_boost.cpp node = wtree->get_root(); node 1566 apps/traincascade/old_ml_boost.cpp CvDTreeSplit* split = node->split; node 1573 apps/traincascade/old_ml_boost.cpp if( !node->left ) node 1575 apps/traincascade/old_ml_boost.cpp node = node->left; node 1578 apps/traincascade/old_ml_boost.cpp for( parent = node->parent; parent && parent->right == node; node 1579 apps/traincascade/old_ml_boost.cpp node = parent, parent = parent->parent ) node 1585 apps/traincascade/old_ml_boost.cpp node = parent->right; node 1751 apps/traincascade/old_ml_boost.cpp const CvDTreeNode* node; node 1754 apps/traincascade/old_ml_boost.cpp node = wtree->get_root(); node 1755 apps/traincascade/old_ml_boost.cpp while( node->left ) node 1757 apps/traincascade/old_ml_boost.cpp CvDTreeSplit* split = node->split; node 1763 apps/traincascade/old_ml_boost.cpp node = dir < 0 ? node->left : node->right; node 1765 apps/traincascade/old_ml_boost.cpp sum += node->value; node 1777 apps/traincascade/old_ml_boost.cpp const CvDTreeNode* node; node 1780 apps/traincascade/old_ml_boost.cpp node = wtree->get_root(); node 1781 apps/traincascade/old_ml_boost.cpp while( node->left ) node 1783 apps/traincascade/old_ml_boost.cpp const CvDTreeSplit* split = node->split; node 1805 apps/traincascade/old_ml_boost.cpp int diff = node->right->sample_count - node->left->sample_count; node 1808 apps/traincascade/old_ml_boost.cpp node = dir < 0 ? node->left : node->right; node 1811 apps/traincascade/old_ml_boost.cpp weak_responses->data.fl[i*wstep] = (float)node->value; node 1812 apps/traincascade/old_ml_boost.cpp sum += node->value; node 1982 apps/traincascade/old_ml_boost.cpp CvBoost::read( CvFileStorage* fs, CvFileNode* node ) node 1994 apps/traincascade/old_ml_boost.cpp read_params( fs, node ); node 1999 apps/traincascade/old_ml_boost.cpp trees_fnode = cvGetFileNodeByName( fs, node, "trees" ); node 1184 apps/traincascade/old_ml_inner_functions.cpp CvSparseNode* node; node 1189 apps/traincascade/old_ml_inner_functions.cpp node = cvInitSparseMatIterator( sparse, &mat_iterator ); node 1204 apps/traincascade/old_ml_inner_functions.cpp for( ; node != 0; node = cvGetNextSparseNode(&mat_iterator) ) node 1206 apps/traincascade/old_ml_inner_functions.cpp int idx = *CV_NODE_IDX( sparse, node ); node 1213 apps/traincascade/old_ml_inner_functions.cpp row_sample[idx] = *(float*)CV_NODE_VAL( sparse, node ); node 1220 apps/traincascade/old_ml_inner_functions.cpp for( ; node != 0; node = cvGetNextSparseNode(&mat_iterator) ) node 1222 apps/traincascade/old_ml_inner_functions.cpp int idx = *CV_NODE_IDX( sparse, node ); node 1230 apps/traincascade/old_ml_inner_functions.cpp ptr->val = *(float*)CV_NODE_VAL( sparse, node ); node 1552 apps/traincascade/old_ml_inner_functions.cpp CvSparseNode* node; node 1586 apps/traincascade/old_ml_inner_functions.cpp node = cvInitSparseMatIterator( sparse, &mat_iterator ); node 1587 apps/traincascade/old_ml_inner_functions.cpp for( ; node != 0; node = cvGetNextSparseNode( &mat_iterator )) node 1589 apps/traincascade/old_ml_inner_functions.cpp int* idx = CV_NODE_IDX( sparse, node ); node 1597 apps/traincascade/old_ml_inner_functions.cpp *(float*)cvPtrND( sparse, &idx1, 0, 1, 0 ) = *(float*)CV_NODE_VAL( sparse, node ); node 354 apps/traincascade/old_ml_precomp.hpp DTreeBestSplitFinder(){ splitSize = 0, tree = 0; node = 0; } node 364 apps/traincascade/old_ml_precomp.hpp CvDTreeNode* node; node 1034 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = (CvDTreeNode*)cvSetNew( node_heap ); node 1036 apps/traincascade/old_ml_tree.cpp node->sample_count = count; node 1037 apps/traincascade/old_ml_tree.cpp node->depth = parent ? parent->depth + 1 : 0; node 1038 apps/traincascade/old_ml_tree.cpp node->parent = parent; node 1039 apps/traincascade/old_ml_tree.cpp node->left = node->right = 0; node 1040 apps/traincascade/old_ml_tree.cpp node->split = 0; node 1041 apps/traincascade/old_ml_tree.cpp node->value = 0; node 1042 apps/traincascade/old_ml_tree.cpp node->class_idx = 0; node 1043 apps/traincascade/old_ml_tree.cpp node->maxlr = 0.; node 1045 apps/traincascade/old_ml_tree.cpp node->buf_idx = storage_idx; node 1046 apps/traincascade/old_ml_tree.cpp node->offset = offset; node 1048 apps/traincascade/old_ml_tree.cpp node->num_valid = (int*)cvSetNew( nv_heap ); node 1050 apps/traincascade/old_ml_tree.cpp node->num_valid = 0; node 1051 apps/traincascade/old_ml_tree.cpp node->alpha = node->node_risk = node->tree_risk = node->tree_error = 0.; node 1052 apps/traincascade/old_ml_tree.cpp node->complexity = 0; node 1057 apps/traincascade/old_ml_tree.cpp node->Tn = INT_MAX; node 1058 apps/traincascade/old_ml_tree.cpp node->cv_Tn = (int*)cvSetNew( cv_heap ); node 1059 apps/traincascade/old_ml_tree.cpp node->cv_node_risk = (double*)cvAlignPtr(node->cv_Tn + cv_n, sizeof(double)); node 1060 apps/traincascade/old_ml_tree.cpp node->cv_node_error = node->cv_node_risk + cv_n; node 1064 apps/traincascade/old_ml_tree.cpp node->Tn = 0; node 1065 apps/traincascade/old_ml_tree.cpp node->cv_Tn = 0; node 1066 apps/traincascade/old_ml_tree.cpp node->cv_node_risk = 0; node 1067 apps/traincascade/old_ml_tree.cpp node->cv_node_error = 0; node 1070 apps/traincascade/old_ml_tree.cpp return node; node 1107 apps/traincascade/old_ml_tree.cpp void CvDTreeTrainData::free_node( CvDTreeNode* node ) node 1109 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* split = node->split; node 1110 apps/traincascade/old_ml_tree.cpp free_node_data( node ); node 1117 apps/traincascade/old_ml_tree.cpp node->split = 0; node 1118 apps/traincascade/old_ml_tree.cpp cvSetRemoveByPtr( node_heap, node ); node 1122 apps/traincascade/old_ml_tree.cpp void CvDTreeTrainData::free_node_data( CvDTreeNode* node ) node 1124 apps/traincascade/old_ml_tree.cpp if( node->num_valid ) node 1126 apps/traincascade/old_ml_tree.cpp cvSetRemoveByPtr( nv_heap, node->num_valid ); node 1127 apps/traincascade/old_ml_tree.cpp node->num_valid = 0; node 1352 apps/traincascade/old_ml_tree.cpp void CvDTreeTrainData::read_params( CvFileStorage* fs, CvFileNode* node ) node 1362 apps/traincascade/old_ml_tree.cpp is_classifier = (cvReadIntByName( fs, node, "is_classifier" ) != 0); node 1363 apps/traincascade/old_ml_tree.cpp var_all = cvReadIntByName( fs, node, "var_all" ); node 1364 apps/traincascade/old_ml_tree.cpp var_count = cvReadIntByName( fs, node, "var_count", var_all ); node 1365 apps/traincascade/old_ml_tree.cpp cat_var_count = cvReadIntByName( fs, node, "cat_var_count" ); node 1366 apps/traincascade/old_ml_tree.cpp ord_var_count = cvReadIntByName( fs, node, "ord_var_count" ); node 1368 apps/traincascade/old_ml_tree.cpp tparams_node = cvGetFileNodeByName( fs, node, "training_params" ); node 1404 apps/traincascade/old_ml_tree.cpp CV_CALL( var_idx = (CvMat*)cvReadByName( fs, node, "var_idx" )); node 1424 apps/traincascade/old_ml_tree.cpp vartype_node = cvGetFileNodeByName( fs, node, "var_type" ); node 1453 apps/traincascade/old_ml_tree.cpp CV_CALL( cat_count = (CvMat*)cvReadByName( fs, node, "cat_count" )); node 1454 apps/traincascade/old_ml_tree.cpp CV_CALL( cat_map = (CvMat*)cvReadByName( fs, node, "cat_map" )); node 1681 apps/traincascade/old_ml_tree.cpp void CvDTree::try_split_node( CvDTreeNode* node ) node 1684 apps/traincascade/old_ml_tree.cpp int i, n = node->sample_count, vi; node 1688 apps/traincascade/old_ml_tree.cpp calc_node_value( node ); node 1690 apps/traincascade/old_ml_tree.cpp if( node->sample_count <= data->params.min_sample_count || node 1691 apps/traincascade/old_ml_tree.cpp node->depth >= data->params.max_depth ) node 1707 apps/traincascade/old_ml_tree.cpp if( sqrt(node->node_risk)/n < data->params.regression_accuracy ) node 1713 apps/traincascade/old_ml_tree.cpp best_split = find_best_split(node); node 1715 apps/traincascade/old_ml_tree.cpp node->split = best_split; node 1719 apps/traincascade/old_ml_tree.cpp data->free_node_data(node); node 1723 apps/traincascade/old_ml_tree.cpp quality_scale = calc_node_dir( node ); node 1737 apps/traincascade/old_ml_tree.cpp split = find_surrogate_split_cat( node, vi ); node 1739 apps/traincascade/old_ml_tree.cpp split = find_surrogate_split_ord( node, vi ); node 1744 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* prev_split = node->split; node 1755 apps/traincascade/old_ml_tree.cpp split_node_data( node ); node 1756 apps/traincascade/old_ml_tree.cpp try_split_node( node->left ); node 1757 apps/traincascade/old_ml_tree.cpp try_split_node( node->right ); node 1772 apps/traincascade/old_ml_tree.cpp double CvDTree::calc_node_dir( CvDTreeNode* node ) node 1775 apps/traincascade/old_ml_tree.cpp int i, n = node->sample_count, vi = node->split->var_idx; node 1778 apps/traincascade/old_ml_tree.cpp assert( !node->split->inversed ); node 1784 apps/traincascade/old_ml_tree.cpp const int* labels = data->get_cat_var_data( node, vi, labels_buf ); node 1785 apps/traincascade/old_ml_tree.cpp const int* subset = node->split->subset; node 1807 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels(node, responses_buf); node 1824 apps/traincascade/old_ml_tree.cpp int split_point = node->split->ord.split_point; node 1825 apps/traincascade/old_ml_tree.cpp int n1 = node->get_num_valid(vi); node 1832 apps/traincascade/old_ml_tree.cpp data->get_ord_var_data( node, vi, val_buf, sorted_buf, &val, &sorted, sample_idx_buf); node 1852 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels(node, responses_buf); node 1875 apps/traincascade/old_ml_tree.cpp node->maxlr = MAX( L, R ); node 1876 apps/traincascade/old_ml_tree.cpp return node->split->quality/(L + R); node 1891 apps/traincascade/old_ml_tree.cpp node = _node; node 1906 apps/traincascade/old_ml_tree.cpp node = finder.node; node 1918 apps/traincascade/old_ml_tree.cpp int n = node->sample_count; node 1926 apps/traincascade/old_ml_tree.cpp if( node->get_num_valid(vi) <= 1 ) node 1932 apps/traincascade/old_ml_tree.cpp res = tree->find_split_cat_class( node, vi, bestSplit->quality, split, (uchar*)inn_buf ); node 1934 apps/traincascade/old_ml_tree.cpp res = tree->find_split_ord_class( node, vi, bestSplit->quality, split, (uchar*)inn_buf ); node 1939 apps/traincascade/old_ml_tree.cpp res = tree->find_split_cat_reg( node, vi, bestSplit->quality, split, (uchar*)inn_buf ); node 1941 apps/traincascade/old_ml_tree.cpp res = tree->find_split_ord_reg( node, vi, bestSplit->quality, split, (uchar*)inn_buf ); node 1957 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_best_split( CvDTreeNode* node ) node 1959 apps/traincascade/old_ml_tree.cpp DTreeBestSplitFinder finder( this, node ); node 1973 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_split_ord_class( CvDTreeNode* node, int vi, node 1977 apps/traincascade/old_ml_tree.cpp int n = node->sample_count; node 1978 apps/traincascade/old_ml_tree.cpp int n1 = node->get_num_valid(vi); node 1992 apps/traincascade/old_ml_tree.cpp data->get_ord_var_data( node, vi, values_buf, sorted_indices_buf, &values, node 1995 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels( node, responses_buf ); node 2188 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_split_cat_class( CvDTreeNode* node, int vi, float init_quality, node 2192 apps/traincascade/old_ml_tree.cpp int n = node->sample_count; node 2213 apps/traincascade/old_ml_tree.cpp const int* labels = data->get_cat_var_data(node, vi, labels_buf); node 2215 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels(node, responses_buf); node 2377 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_split_ord_reg( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _split, uchar* _ext_buf ) node 2380 apps/traincascade/old_ml_tree.cpp int n = node->sample_count; node 2381 apps/traincascade/old_ml_tree.cpp int n1 = node->get_num_valid(vi); node 2392 apps/traincascade/old_ml_tree.cpp data->get_ord_var_data( node, vi, values_buf, sorted_indices_buf, &values, &sorted_indices, sample_indices_buf ); node 2394 apps/traincascade/old_ml_tree.cpp const float* responses = data->get_ord_responses( node, responses_buf, sample_indices_buf ); node 2397 apps/traincascade/old_ml_tree.cpp double best_val = init_quality, lsum = 0, rsum = node->value*n; node 2436 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_split_cat_reg( CvDTreeNode* node, int vi, float init_quality, CvDTreeSplit* _split, uchar* _ext_buf ) node 2439 apps/traincascade/old_ml_tree.cpp int n = node->sample_count; node 2449 apps/traincascade/old_ml_tree.cpp const int* labels = data->get_cat_var_data(node, vi, labels_buf); node 2452 apps/traincascade/old_ml_tree.cpp const float* responses = data->get_ord_responses(node, responses_buf, sample_indices_buf); node 2529 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_surrogate_split_ord( CvDTreeNode* node, int vi, uchar* _ext_buf ) node 2533 apps/traincascade/old_ml_tree.cpp int n = node->sample_count, n1 = node->get_num_valid(vi); node 2543 apps/traincascade/old_ml_tree.cpp data->get_ord_var_data( node, vi, values_buf, sorted_indices_buf, &values, &sorted_indices, sample_indices_buf ); node 2554 apps/traincascade/old_ml_tree.cpp int worst_val = cvFloor(node->maxlr), _best_val = worst_val; node 2598 apps/traincascade/old_ml_tree.cpp double worst_val = node->maxlr; node 2602 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels(node, responses_buf); node 2646 apps/traincascade/old_ml_tree.cpp return best_i >= 0 && best_val > node->maxlr ? data->new_split_ord( vi, node 2651 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* CvDTree::find_surrogate_split_cat( CvDTreeNode* node, int vi, uchar* _ext_buf ) node 2654 apps/traincascade/old_ml_tree.cpp int n = node->sample_count; node 2665 apps/traincascade/old_ml_tree.cpp const int* labels = data->get_cat_var_data(node, vi, labels_buf); node 2709 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels(node, responses_buf); node 2746 apps/traincascade/old_ml_tree.cpp if( split->quality <= node->maxlr || l_win == 0 || l_win == mi ) node 2753 apps/traincascade/old_ml_tree.cpp void CvDTree::calc_node_value( CvDTreeNode* node ) node 2755 apps/traincascade/old_ml_tree.cpp int i, j, k, n = node->sample_count, cv_n = data->params.cv_folds; node 2765 apps/traincascade/old_ml_tree.cpp const int* cv_labels = data->get_cv_labels(node, cv_labels_buf); node 2780 apps/traincascade/old_ml_tree.cpp const int* responses = data->get_class_labels(node, responses_buf); node 2811 apps/traincascade/old_ml_tree.cpp if( data->have_priors && node->parent == 0 ) node 2837 apps/traincascade/old_ml_tree.cpp node->class_idx = max_k; node 2838 apps/traincascade/old_ml_tree.cpp node->value = data->cat_map->data.i[ node 2840 apps/traincascade/old_ml_tree.cpp node->node_risk = total_weight - max_val; node 2862 apps/traincascade/old_ml_tree.cpp node->cv_Tn[j] = INT_MAX; node 2863 apps/traincascade/old_ml_tree.cpp node->cv_node_risk[j] = sum - max_val; node 2864 apps/traincascade/old_ml_tree.cpp node->cv_node_error[j] = sum_k - max_val_k; node 2885 apps/traincascade/old_ml_tree.cpp const float* values = data->get_ord_responses(node, values_buf, sample_indices_buf); node 2929 apps/traincascade/old_ml_tree.cpp node->node_risk = sum2 - (sum/n)*sum; node 2930 apps/traincascade/old_ml_tree.cpp node->value = sum/n; node 2938 apps/traincascade/old_ml_tree.cpp node->cv_node_risk[j] = s2i - r*r*ci; node 2939 apps/traincascade/old_ml_tree.cpp node->cv_node_error[j] = s2 - 2*r*s + c*r*r; node 2940 apps/traincascade/old_ml_tree.cpp node->cv_Tn[j] = INT_MAX; node 2946 apps/traincascade/old_ml_tree.cpp void CvDTree::complete_node_dir( CvDTreeNode* node ) node 2948 apps/traincascade/old_ml_tree.cpp int vi, i, n = node->sample_count, nl, nr, d0 = 0, d1 = -1; node 2949 apps/traincascade/old_ml_tree.cpp int nz = n - node->get_num_valid(node->split->var_idx); node 2956 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* split = node->split->next; node 2965 apps/traincascade/old_ml_tree.cpp const int* labels = data->get_cat_var_data(node, vi, labels_buf); node 2988 apps/traincascade/old_ml_tree.cpp data->get_ord_var_data( node, vi, values_buf, sorted_indices_buf, &values, &sorted_indices, sample_indices_buf ); node 2990 apps/traincascade/old_ml_tree.cpp int n1 = node->get_num_valid(vi); node 3034 apps/traincascade/old_ml_tree.cpp void CvDTree::split_node_data( CvDTreeNode* node ) node 3036 apps/traincascade/old_ml_tree.cpp int vi, i, n = node->sample_count, nl, nr, scount = data->sample_count; node 3040 apps/traincascade/old_ml_tree.cpp int new_buf_idx = data->get_child_buf_idx( node ); node 3047 apps/traincascade/old_ml_tree.cpp complete_node_dir(node); node 3059 apps/traincascade/old_ml_tree.cpp node->left = left = data->new_node( node, nl, new_buf_idx, node->offset ); node 3060 apps/traincascade/old_ml_tree.cpp node->right = right = data->new_node( node, nr, new_buf_idx, node->offset + nl ); node 3062 apps/traincascade/old_ml_tree.cpp split_input_data = node->depth + 1 < data->params.max_depth && node 3063 apps/traincascade/old_ml_tree.cpp (node->left->sample_count > data->params.min_sample_count || node 3064 apps/traincascade/old_ml_tree.cpp node->right->sample_count > data->params.min_sample_count); node 3074 apps/traincascade/old_ml_tree.cpp int n1 = node->get_num_valid(vi); node 3080 apps/traincascade/old_ml_tree.cpp data->get_ord_var_data(node, vi, src_val_buf, src_sorted_idx_buf, &src_val, &src_sorted_idx, src_sample_idx_buf); node 3185 apps/traincascade/old_ml_tree.cpp int n1 = node->get_num_valid(vi), nr1 = 0; node 3191 apps/traincascade/old_ml_tree.cpp const int* src_lbls = data->get_cat_var_data(node, vi, src_lbls_buf); node 3262 apps/traincascade/old_ml_tree.cpp const int* sample_idx_src = data->get_sample_indices(node, sample_idx_src_buf); node 3314 apps/traincascade/old_ml_tree.cpp data->free_node_data(node); node 3477 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; node 3485 apps/traincascade/old_ml_tree.cpp int t = fold >= 0 ? node->cv_Tn[fold] : node->Tn; node 3486 apps/traincascade/old_ml_tree.cpp if( t <= T || !node->left ) node 3488 apps/traincascade/old_ml_tree.cpp node->complexity = 1; node 3489 apps/traincascade/old_ml_tree.cpp node->tree_risk = node->node_risk; node 3490 apps/traincascade/old_ml_tree.cpp node->tree_error = 0.; node 3493 apps/traincascade/old_ml_tree.cpp node->tree_risk = node->cv_node_risk[fold]; node 3494 apps/traincascade/old_ml_tree.cpp node->tree_error = node->cv_node_error[fold]; node 3498 apps/traincascade/old_ml_tree.cpp node = node->left; node 3501 apps/traincascade/old_ml_tree.cpp for( parent = node->parent; parent && parent->right == node; node 3502 apps/traincascade/old_ml_tree.cpp node = parent, parent = parent->parent ) node 3504 apps/traincascade/old_ml_tree.cpp parent->complexity += node->complexity; node 3505 apps/traincascade/old_ml_tree.cpp parent->tree_risk += node->tree_risk; node 3506 apps/traincascade/old_ml_tree.cpp parent->tree_error += node->tree_error; node 3516 apps/traincascade/old_ml_tree.cpp parent->complexity = node->complexity; node 3517 apps/traincascade/old_ml_tree.cpp parent->tree_risk = node->tree_risk; node 3518 apps/traincascade/old_ml_tree.cpp parent->tree_error = node->tree_error; node 3519 apps/traincascade/old_ml_tree.cpp node = parent->right; node 3528 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; node 3529 apps/traincascade/old_ml_tree.cpp if( !node->left ) node 3537 apps/traincascade/old_ml_tree.cpp int t = fold >= 0 ? node->cv_Tn[fold] : node->Tn; node 3538 apps/traincascade/old_ml_tree.cpp if( t <= T || !node->left ) node 3540 apps/traincascade/old_ml_tree.cpp if( node->alpha <= min_alpha + FLT_EPSILON ) node 3543 apps/traincascade/old_ml_tree.cpp node->cv_Tn[fold] = T; node 3545 apps/traincascade/old_ml_tree.cpp node->Tn = T; node 3546 apps/traincascade/old_ml_tree.cpp if( node == root ) node 3550 apps/traincascade/old_ml_tree.cpp node = node->left; node 3553 apps/traincascade/old_ml_tree.cpp for( parent = node->parent; parent && parent->right == node; node 3554 apps/traincascade/old_ml_tree.cpp node = parent, parent = parent->parent ) node 3560 apps/traincascade/old_ml_tree.cpp node = parent->right; node 3569 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; node 3578 apps/traincascade/old_ml_tree.cpp node->cv_Tn = 0; node 3579 apps/traincascade/old_ml_tree.cpp node->cv_node_error = node->cv_node_risk = 0; node 3580 apps/traincascade/old_ml_tree.cpp if( !node->left ) node 3582 apps/traincascade/old_ml_tree.cpp node = node->left; node 3585 apps/traincascade/old_ml_tree.cpp for( parent = node->parent; parent && parent->right == node; node 3586 apps/traincascade/old_ml_tree.cpp node = parent, parent = parent->parent ) node 3599 apps/traincascade/old_ml_tree.cpp node = parent->right; node 3625 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; node 3627 apps/traincascade/old_ml_tree.cpp if( !node ) node 3664 apps/traincascade/old_ml_tree.cpp while( node->Tn > pruned_tree_idx && node->left ) node 3666 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* split = node->split; node 3725 apps/traincascade/old_ml_tree.cpp double diff = node->right->sample_count - node->left->sample_count; node 3728 apps/traincascade/old_ml_tree.cpp node = dir < 0 ? node->left : node->right; node 3731 apps/traincascade/old_ml_tree.cpp return node; node 3746 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; node 3748 apps/traincascade/old_ml_tree.cpp if( !node ) node 3757 apps/traincascade/old_ml_tree.cpp for( ;; node = node->left ) node 3759 apps/traincascade/old_ml_tree.cpp CvDTreeSplit* split = node->split; node 3761 apps/traincascade/old_ml_tree.cpp if( !node->left || node->Tn <= pruned_tree_idx ) node 3768 apps/traincascade/old_ml_tree.cpp for( parent = node->parent; parent && parent->right == node; node 3769 apps/traincascade/old_ml_tree.cpp node = parent, parent = parent->parent ) node 3775 apps/traincascade/old_ml_tree.cpp node = parent->right; node 3822 apps/traincascade/old_ml_tree.cpp void CvDTree::write_node( CvFileStorage* fs, CvDTreeNode* node ) const node 3828 apps/traincascade/old_ml_tree.cpp cvWriteInt( fs, "depth", node->depth ); node 3829 apps/traincascade/old_ml_tree.cpp cvWriteInt( fs, "sample_count", node->sample_count ); node 3830 apps/traincascade/old_ml_tree.cpp cvWriteReal( fs, "value", node->value ); node 3833 apps/traincascade/old_ml_tree.cpp cvWriteInt( fs, "norm_class_idx", node->class_idx ); node 3835 apps/traincascade/old_ml_tree.cpp cvWriteInt( fs, "Tn", node->Tn ); node 3836 apps/traincascade/old_ml_tree.cpp cvWriteInt( fs, "complexity", node->complexity ); node 3837 apps/traincascade/old_ml_tree.cpp cvWriteReal( fs, "alpha", node->alpha ); node 3838 apps/traincascade/old_ml_tree.cpp cvWriteReal( fs, "node_risk", node->node_risk ); node 3839 apps/traincascade/old_ml_tree.cpp cvWriteReal( fs, "tree_risk", node->tree_risk ); node 3840 apps/traincascade/old_ml_tree.cpp cvWriteReal( fs, "tree_error", node->tree_error ); node 3842 apps/traincascade/old_ml_tree.cpp if( node->left ) node 3846 apps/traincascade/old_ml_tree.cpp for( split = node->split; split != 0; split = split->next ) node 3862 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = root; node 3870 apps/traincascade/old_ml_tree.cpp write_node( fs, node ); node 3871 apps/traincascade/old_ml_tree.cpp if( !node->left ) node 3873 apps/traincascade/old_ml_tree.cpp node = node->left; node 3876 apps/traincascade/old_ml_tree.cpp for( parent = node->parent; parent && parent->right == node; node 3877 apps/traincascade/old_ml_tree.cpp node = parent, parent = parent->parent ) node 3883 apps/traincascade/old_ml_tree.cpp node = parent->right; node 4016 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node = 0; node 4028 apps/traincascade/old_ml_tree.cpp CV_CALL( node = data->new_node( parent, 0, 0, 0 )); node 4030 apps/traincascade/old_ml_tree.cpp if( depth != node->depth ) node 4033 apps/traincascade/old_ml_tree.cpp node->sample_count = cvReadIntByName( fs, fnode, "sample_count" ); node 4034 apps/traincascade/old_ml_tree.cpp node->value = cvReadRealByName( fs, fnode, "value" ); node 4036 apps/traincascade/old_ml_tree.cpp node->class_idx = cvReadIntByName( fs, fnode, "norm_class_idx" ); node 4038 apps/traincascade/old_ml_tree.cpp node->Tn = cvReadIntByName( fs, fnode, "Tn" ); node 4039 apps/traincascade/old_ml_tree.cpp node->complexity = cvReadIntByName( fs, fnode, "complexity" ); node 4040 apps/traincascade/old_ml_tree.cpp node->alpha = cvReadRealByName( fs, fnode, "alpha" ); node 4041 apps/traincascade/old_ml_tree.cpp node->node_risk = cvReadRealByName( fs, fnode, "node_risk" ); node 4042 apps/traincascade/old_ml_tree.cpp node->tree_risk = cvReadRealByName( fs, fnode, "tree_risk" ); node 4043 apps/traincascade/old_ml_tree.cpp node->tree_error = cvReadRealByName( fs, fnode, "tree_error" ); node 4060 apps/traincascade/old_ml_tree.cpp node->split = last_split = split; node 4070 apps/traincascade/old_ml_tree.cpp return node; node 4090 apps/traincascade/old_ml_tree.cpp CvDTreeNode* node; node 4092 apps/traincascade/old_ml_tree.cpp CV_CALL( node = read_node( fs, (CvFileNode*)reader.ptr, parent != &_root ? parent : 0 )); node 4094 apps/traincascade/old_ml_tree.cpp parent->left = node; node 4096 apps/traincascade/old_ml_tree.cpp parent->right = node; node 4097 apps/traincascade/old_ml_tree.cpp if( node->split ) node 4098 apps/traincascade/old_ml_tree.cpp parent = node; node 4125 apps/traincascade/old_ml_tree.cpp void CvDTree::read( CvFileStorage* fs, CvFileNode* node, CvDTreeTrainData* _data ) node 4136 apps/traincascade/old_ml_tree.cpp tree_nodes = cvGetFileNodeByName( fs, node, "nodes" ); node 4140 apps/traincascade/old_ml_tree.cpp pruned_tree_idx = cvReadIntByName( fs, node, "best_tree_idx", -1 ); node 54 apps/traincascade/traincascade_features.h virtual bool read( const cv::FileNode &node ) = 0; node 69 apps/traincascade/traincascade_features.h virtual bool read( const cv::FileNode &node ); node 2410 modules/core/include/opencv2/core.hpp void load(const FileStorage& node); node 544 modules/core/include/opencv2/core/core_c.h if( mat_iterator->node->next ) node 545 modules/core/include/opencv2/core/core_c.h return mat_iterator->node = mat_iterator->node->next; node 551 modules/core/include/opencv2/core/core_c.h CvSparseNode* node = (CvSparseNode*)mat_iterator->mat->hashtable[idx]; node 552 modules/core/include/opencv2/core/core_c.h if( node ) node 555 modules/core/include/opencv2/core/core_c.h return mat_iterator->node = node; node 1896 modules/core/include/opencv2/core/core_c.h const void* node; node 1910 modules/core/include/opencv2/core/core_c.h CVAPI(void) cvInsertNodeIntoTree( void* node, void* parent, void* frame ); node 1913 modules/core/include/opencv2/core/core_c.h CVAPI(void) cvRemoveNodeFromTree( void* node, void* frame ); node 2316 modules/core/include/opencv2/core/core_c.h CV_INLINE int cvReadInt( const CvFileNode* node, int default_value CV_DEFAULT(0) ) node 2318 modules/core/include/opencv2/core/core_c.h return !node ? default_value : node 2319 modules/core/include/opencv2/core/core_c.h CV_NODE_IS_INT(node->tag) ? node->data.i : node 2320 modules/core/include/opencv2/core/core_c.h CV_NODE_IS_REAL(node->tag) ? cvRound(node->data.f) : 0x7fffffff; node 2347 modules/core/include/opencv2/core/core_c.h CV_INLINE double cvReadReal( const CvFileNode* node, double default_value CV_DEFAULT(0.) ) node 2349 modules/core/include/opencv2/core/core_c.h return !node ? default_value : node 2350 modules/core/include/opencv2/core/core_c.h CV_NODE_IS_INT(node->tag) ? (double)node->data.i : node 2351 modules/core/include/opencv2/core/core_c.h CV_NODE_IS_REAL(node->tag) ? node->data.f : 1e300; node 2377 modules/core/include/opencv2/core/core_c.h CV_INLINE const char* cvReadString( const CvFileNode* node, node 2380 modules/core/include/opencv2/core/core_c.h return !node ? default_value : CV_NODE_IS_STRING(node->tag) ? node->data.str.ptr : 0; node 2412 modules/core/include/opencv2/core/core_c.h CVAPI(void*) cvRead( CvFileStorage* fs, CvFileNode* node, node 2482 modules/core/include/opencv2/core/core_c.h const CvFileNode* node, int embed ); node 2490 modules/core/include/opencv2/core/core_c.h CVAPI(const char*) cvGetFileNodeName( const CvFileNode* node ); node 2647 modules/core/include/opencv2/core/mat.hpp Node* node(size_t nidx); node 2648 modules/core/include/opencv2/core/mat.hpp const Node* node(size_t nidx) const; node 2942 modules/core/include/opencv2/core/mat.hpp const SparseMat::Node* node() const; node 2987 modules/core/include/opencv2/core/mat.hpp SparseMat::Node* node() const; node 2716 modules/core/include/opencv2/core/mat.inl.hpp return (SparseMat::Node*)SparseMatConstIterator::node(); node 486 modules/core/include/opencv2/core/persistence.hpp FileNode(const CvFileStorage* fs, const CvFileNode* node); node 491 modules/core/include/opencv2/core/persistence.hpp FileNode(const FileNode& node); node 571 modules/core/include/opencv2/core/persistence.hpp const CvFileNode* node; node 595 modules/core/include/opencv2/core/persistence.hpp FileNodeIterator(const CvFileStorage* fs, const CvFileNode* node, size_t ofs=0); node 675 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, int& value, int default_value); node 676 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, float& value, float default_value); node 677 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, double& value, double default_value); node 678 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, String& value, const String& default_value); node 679 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, Mat& mat, const Mat& default_mat = Mat() ); node 680 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, SparseMat& mat, const SparseMat& default_mat = SparseMat() ); node 681 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, std::vector<KeyPoint>& keypoints); node 682 modules/core/include/opencv2/core/persistence.hpp CV_EXPORTS void read(const FileNode& node, std::vector<DMatch>& matches); node 684 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp> static inline void read(const FileNode& node, Point_<_Tp>& value, const Point_<_Tp>& default_value) node 686 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 690 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp> static inline void read(const FileNode& node, Point3_<_Tp>& value, const Point3_<_Tp>& default_value) node 692 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 697 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp> static inline void read(const FileNode& node, Size_<_Tp>& value, const Size_<_Tp>& default_value) node 699 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 703 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp> static inline void read(const FileNode& node, Complex<_Tp>& value, const Complex<_Tp>& default_value) node 705 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 709 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp> static inline void read(const FileNode& node, Rect_<_Tp>& value, const Rect_<_Tp>& default_value) node 711 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 716 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp, int cn> static inline void read(const FileNode& node, Vec<_Tp, cn>& value, const Vec<_Tp, cn>& default_value) node 718 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 722 modules/core/include/opencv2/core/persistence.hpp template<typename _Tp> static inline void read(const FileNode& node, Scalar_<_Tp>& value, const Scalar_<_Tp>& default_value) node 724 modules/core/include/opencv2/core/persistence.hpp std::vector<_Tp> temp; FileNodeIterator it = node.begin(); it >> temp; node 729 modules/core/include/opencv2/core/persistence.hpp static inline void read(const FileNode& node, Range& value, const Range& default_value) node 732 modules/core/include/opencv2/core/persistence.hpp read(node, temp, default_temp); node 993 modules/core/include/opencv2/core/persistence.hpp void read(const FileNode& node, bool& value, bool default_value) node 996 modules/core/include/opencv2/core/persistence.hpp read(node, temp, (int)default_value); node 1001 modules/core/include/opencv2/core/persistence.hpp void read(const FileNode& node, uchar& value, uchar default_value) node 1004 modules/core/include/opencv2/core/persistence.hpp read(node, temp, (int)default_value); node 1009 modules/core/include/opencv2/core/persistence.hpp void read(const FileNode& node, schar& value, schar default_value) node 1012 modules/core/include/opencv2/core/persistence.hpp read(node, temp, (int)default_value); node 1017 modules/core/include/opencv2/core/persistence.hpp void read(const FileNode& node, ushort& value, ushort default_value) node 1020 modules/core/include/opencv2/core/persistence.hpp read(node, temp, (int)default_value); node 1025 modules/core/include/opencv2/core/persistence.hpp void read(const FileNode& node, short& value, short default_value) node 1028 modules/core/include/opencv2/core/persistence.hpp read(node, temp, (int)default_value); node 1040 modules/core/include/opencv2/core/persistence.hpp void read( const FileNode& node, std::vector<_Tp>& vec, const std::vector<_Tp>& default_value = std::vector<_Tp>() ) node 1042 modules/core/include/opencv2/core/persistence.hpp if(!node.node) node 1046 modules/core/include/opencv2/core/persistence.hpp FileNodeIterator it = node.begin(); node 1170 modules/core/include/opencv2/core/persistence.hpp inline FileNode::FileNode(const FileNode& _node) : fs(_node.fs), node(_node.node) {} node 1171 modules/core/include/opencv2/core/persistence.hpp inline bool FileNode::empty() const { return node == 0; } node 1178 modules/core/include/opencv2/core/persistence.hpp inline CvFileNode* FileNode::operator *() { return (CvFileNode*)node; } node 1179 modules/core/include/opencv2/core/persistence.hpp inline const CvFileNode* FileNode::operator* () const { return node; } node 1184 modules/core/include/opencv2/core/persistence.hpp inline FileNodeIterator FileNode::begin() const { return FileNodeIterator(fs, node); } node 1185 modules/core/include/opencv2/core/persistence.hpp inline FileNodeIterator FileNode::end() const { return FileNodeIterator(fs, node, size()); } node 720 modules/core/include/opencv2/core/types_c.h CvSparseNode* node; node 725 modules/core/include/opencv2/core/types_c.h #define CV_NODE_VAL(mat,node) ((void*)((uchar*)(node) + (mat)->valoffset)) node 726 modules/core/include/opencv2/core/types_c.h #define CV_NODE_IDX(mat,node) ((int*)((uchar*)(node) + (mat)->idxoffset)) node 1775 modules/core/include/opencv2/core/types_c.h typedef void* (CV_CDECL *CvReadFunc)( CvFileStorage* storage, CvFileNode* node ); node 366 modules/core/src/alloc.cpp Node *node = block->publicFreeList; node 367 modules/core/src/alloc.cpp for( ; node != 0; node = node->next ) node 563 modules/core/src/alloc.cpp Node* node = block->privateFreeList; node 564 modules/core/src/alloc.cpp for(;node != 0; node = node->next) node 610 modules/core/src/alloc.cpp Node* node = (Node*)ptr; node 660 modules/core/src/alloc.cpp node->next = block->privateFreeList; node 661 modules/core/src/alloc.cpp block->privateFreeList = node; node 668 modules/core/src/alloc.cpp node->next = block->publicFreeList; node 669 modules/core/src/alloc.cpp block->publicFreeList = node; node 624 modules/core/src/array.cpp CvSparseNode* node = 0; node 634 modules/core/src/array.cpp iterator->node = 0; node 639 modules/core/src/array.cpp node = iterator->node = (CvSparseNode*)mat->hashtable[idx]; node 644 modules/core/src/array.cpp return node; node 656 modules/core/src/array.cpp CvSparseNode *node; node 679 modules/core/src/array.cpp for( node = (CvSparseNode*)mat->hashtable[tabidx]; node 680 modules/core/src/array.cpp node != 0; node = node->next ) node 682 modules/core/src/array.cpp if( node->hashval == hashval ) node 684 modules/core/src/array.cpp int* nodeidx = CV_NODE_IDX(mat,node); node 690 modules/core/src/array.cpp ptr = (uchar*)CV_NODE_VAL(mat,node); node 712 modules/core/src/array.cpp node = cvInitSparseMatIterator( mat, &iterator ); node 713 modules/core/src/array.cpp while( node ) node 716 modules/core/src/array.cpp int newidx = node->hashval & (newsize - 1); node 717 modules/core/src/array.cpp node->next = (CvSparseNode*)newtable[newidx]; node 718 modules/core/src/array.cpp newtable[newidx] = node; node 719 modules/core/src/array.cpp node = next; node 728 modules/core/src/array.cpp node = (CvSparseNode*)cvSetNew( mat->heap ); node 729 modules/core/src/array.cpp node->hashval = hashval; node 730 modules/core/src/array.cpp node->next = (CvSparseNode*)mat->hashtable[tabidx]; node 731 modules/core/src/array.cpp mat->hashtable[tabidx] = node; node 732 modules/core/src/array.cpp memcpy(CV_NODE_IDX(mat,node), idx, mat->dims*sizeof(idx[0])); node 733 modules/core/src/array.cpp ptr = (uchar*)CV_NODE_VAL(mat,node); node 750 modules/core/src/array.cpp CvSparseNode *node, *prev = 0; node 771 modules/core/src/array.cpp for( node = (CvSparseNode*)mat->hashtable[tabidx]; node 772 modules/core/src/array.cpp node != 0; prev = node, node = node->next ) node 774 modules/core/src/array.cpp if( node->hashval == hashval ) node 776 modules/core/src/array.cpp int* nodeidx = CV_NODE_IDX(mat,node); node 785 modules/core/src/array.cpp if( node ) node 788 modules/core/src/array.cpp prev->next = node->next; node 790 modules/core/src/array.cpp mat->hashtable[tabidx] = node->next; node 791 modules/core/src/array.cpp cvSetRemoveByPtr( mat->heap, node ); node 1331 modules/core/src/copy.cpp CvSparseNode* node; node 1349 modules/core/src/copy.cpp for( node = cvInitSparseMatIterator( src1, &iterator ); node 1350 modules/core/src/copy.cpp node != 0; node = cvGetNextSparseNode( &iterator )) node 1353 modules/core/src/copy.cpp int tabidx = node->hashval & (dst1->hashsize - 1); node 1354 modules/core/src/copy.cpp memcpy( node_copy, node, dst1->heap->elem_size ); node 2363 modules/core/src/datastructs.cpp CvPTreeNode node = { 0, 0, 0 }; node 2365 modules/core/src/datastructs.cpp node.element = reader.ptr; node 2366 modules/core/src/datastructs.cpp CV_WRITE_SEQ_ELEM( node, writer ); node 2381 modules/core/src/datastructs.cpp CvPTreeNode* node = (CvPTreeNode*)(reader0.ptr); node 2382 modules/core/src/datastructs.cpp CvPTreeNode* root = node; node 2385 modules/core/src/datastructs.cpp if( !node->element ) node 2396 modules/core/src/datastructs.cpp if( node2->element && node2 != node && node 2397 modules/core/src/datastructs.cpp is_equal( node->element, node2->element, userdata )) node 2426 modules/core/src/datastructs.cpp node2 = node; node 2436 modules/core/src/datastructs.cpp CV_NEXT_SEQ_ELEM( sizeof(*node), reader ); node 2447 modules/core/src/datastructs.cpp CvPTreeNode* node = (CvPTreeNode*)reader.ptr; node 2450 modules/core/src/datastructs.cpp if( node->element ) node 2452 modules/core/src/datastructs.cpp while( node->parent ) node 2453 modules/core/src/datastructs.cpp node = node->parent; node 2454 modules/core/src/datastructs.cpp if( node->rank >= 0 ) node 2455 modules/core/src/datastructs.cpp node->rank = ~class_idx++; node 2456 modules/core/src/datastructs.cpp idx = ~node->rank; node 2459 modules/core/src/datastructs.cpp CV_NEXT_SEQ_ELEM( sizeof(*node), reader ); node 3351 modules/core/src/datastructs.cpp void* node = cvNextTreeNode( &iterator ); node 3352 modules/core/src/datastructs.cpp if( !node ) node 3354 modules/core/src/datastructs.cpp cvSeqPush( allseq, &node ); node 3383 modules/core/src/datastructs.cpp CvTreeNode* node = (CvTreeNode*)_node; node 3386 modules/core/src/datastructs.cpp if( !node || !parent ) node 3389 modules/core/src/datastructs.cpp node->v_prev = _parent != _frame ? parent : 0; node 3390 modules/core/src/datastructs.cpp node->h_next = parent->v_next; node 3392 modules/core/src/datastructs.cpp assert( parent->v_next != node ); node 3395 modules/core/src/datastructs.cpp parent->v_next->h_prev = node; node 3396 modules/core/src/datastructs.cpp parent->v_next = node; node 3404 modules/core/src/datastructs.cpp CvTreeNode* node = (CvTreeNode*)_node; node 3407 modules/core/src/datastructs.cpp if( !node ) node 3410 modules/core/src/datastructs.cpp if( node == frame ) node 3413 modules/core/src/datastructs.cpp if( node->h_next ) node 3414 modules/core/src/datastructs.cpp node->h_next->h_prev = node->h_prev; node 3416 modules/core/src/datastructs.cpp if( node->h_prev ) node 3417 modules/core/src/datastructs.cpp node->h_prev->h_next = node->h_next; node 3420 modules/core/src/datastructs.cpp CvTreeNode* parent = node->v_prev; node 3426 modules/core/src/datastructs.cpp assert( parent->v_next == node ); node 3427 modules/core/src/datastructs.cpp parent->v_next = node->h_next; node 3443 modules/core/src/datastructs.cpp treeIterator->node = (void*)first; node 3453 modules/core/src/datastructs.cpp CvTreeNode* node; node 3459 modules/core/src/datastructs.cpp prevNode = node = (CvTreeNode*)treeIterator->node; node 3462 modules/core/src/datastructs.cpp if( node ) node 3464 modules/core/src/datastructs.cpp if( node->v_next && level+1 < treeIterator->max_level ) node 3466 modules/core/src/datastructs.cpp node = node->v_next; node 3471 modules/core/src/datastructs.cpp while( node->h_next == 0 ) node 3473 modules/core/src/datastructs.cpp node = node->v_prev; node 3476 modules/core/src/datastructs.cpp node = 0; node 3480 modules/core/src/datastructs.cpp node = node && treeIterator->max_level != 0 ? node->h_next : 0; node 3484 modules/core/src/datastructs.cpp treeIterator->node = node; node 3494 modules/core/src/datastructs.cpp CvTreeNode* node; node 3500 modules/core/src/datastructs.cpp prevNode = node = (CvTreeNode*)treeIterator->node; node 3503 modules/core/src/datastructs.cpp if( node ) node 3505 modules/core/src/datastructs.cpp if( !node->h_prev ) node 3507 modules/core/src/datastructs.cpp node = node->v_prev; node 3509 modules/core/src/datastructs.cpp node = 0; node 3513 modules/core/src/datastructs.cpp node = node->h_prev; node 3515 modules/core/src/datastructs.cpp while( node->v_next && level < treeIterator->max_level ) node 3517 modules/core/src/datastructs.cpp node = node->v_next; node 3520 modules/core/src/datastructs.cpp while( node->h_next ) node 3521 modules/core/src/datastructs.cpp node = node->h_next; node 3526 modules/core/src/datastructs.cpp treeIterator->node = node; node 4810 modules/core/src/matrix.cpp const Node* n = from.node(); node 4828 modules/core/src/matrix.cpp const Node* n = from.node(); node 4860 modules/core/src/matrix.cpp const Node* n = from.node(); node 4870 modules/core/src/matrix.cpp const Node* n = from.node(); node 4897 modules/core/src/matrix.cpp const Node* n = from.node(); node 4907 modules/core/src/matrix.cpp const Node* n = from.node(); node 5153 modules/core/src/matrix.cpp Node* n = node(nidx); node 5156 modules/core/src/matrix.cpp Node* prev = node(previdx); node 5280 modules/core/src/matrix.cpp minidx = it.node()->idx; node 5285 modules/core/src/matrix.cpp maxidx = it.node()->idx; node 5302 modules/core/src/matrix.cpp minidx = it.node()->idx; node 5307 modules/core/src/matrix.cpp maxidx = it.node()->idx; node 5428 modules/core/src/matrix.cpp const cv::SparseMat::Node* n = from.node(); node 577 modules/core/src/persistence.cpp CvStringHashNode* node = 0; node 602 modules/core/src/persistence.cpp for( node = (CvStringHashNode*)(map->table[i]); node != 0; node = node->next ) node 604 modules/core/src/persistence.cpp if( node->hashval == hashval && node 605 modules/core/src/persistence.cpp node->str.len == len && node 606 modules/core/src/persistence.cpp memcmp( node->str.ptr, str, len ) == 0 ) node 610 modules/core/src/persistence.cpp if( !node && create_missing ) node 612 modules/core/src/persistence.cpp node = (CvStringHashNode*)cvSetNew( (CvSet*)map ); node 613 modules/core/src/persistence.cpp node->hashval = hashval; node 614 modules/core/src/persistence.cpp node->str = cvMemStorageAllocString( map->storage, str, len ); node 615 modules/core/src/persistence.cpp node->next = (CvStringHashNode*)(map->table[i]); node 616 modules/core/src/persistence.cpp map->table[i] = node; node 619 modules/core/src/persistence.cpp return node; node 685 modules/core/src/persistence.cpp CvFileMapNode* node = (CvFileMapNode*)cvSetNew( (CvSet*)map ); node 686 modules/core/src/persistence.cpp node->key = key; node 688 modules/core/src/persistence.cpp node->next = (CvFileMapNode*)(map->table[i]); node 689 modules/core/src/persistence.cpp map->table[i] = node; node 690 modules/core/src/persistence.cpp value = (CvFileNode*)node; node 1032 modules/core/src/persistence.cpp icvYMLParseValue( CvFileStorage* fs, char* ptr, CvFileNode* node, node 1042 modules/core/src/persistence.cpp memset( node, 0, sizeof(*node) ); node 1079 modules/core/src/persistence.cpp node->info = cvFindType( ptr ); node 1080 modules/core/src/persistence.cpp if( !node->info ) node 1081 modules/core/src/persistence.cpp node->tag &= ~CV_NODE_USER; node 1116 modules/core/src/persistence.cpp node->tag = CV_NODE_REAL; node 1117 modules/core/src/persistence.cpp node->data.f = fval; node 1123 modules/core/src/persistence.cpp node->tag = CV_NODE_INT; node 1124 modules/core/src/persistence.cpp node->data.i = ival; node 1134 modules/core/src/persistence.cpp node->tag = CV_NODE_STRING; node 1198 modules/core/src/persistence.cpp node->data.str = cvMemStorageAllocString( fs->memstorage, buf, len ); node 1207 modules/core/src/persistence.cpp (node->info ? CV_NODE_USER : 0), node ); node 1224 modules/core/src/persistence.cpp if( node->data.seq->total != 0 ) node 1233 modules/core/src/persistence.cpp ptr = icvYMLParseKey( fs, ptr, node, &elem ); node 1240 modules/core/src/persistence.cpp elem = (CvFileNode*)cvSeqPush( node->data.seq, 0 ); node 1247 modules/core/src/persistence.cpp node->data.seq->flags |= is_simple ? CV_NODE_SEQ_SIMPLE : 0; node 1278 modules/core/src/persistence.cpp node->tag = CV_NODE_STRING; node 1283 modules/core/src/persistence.cpp node->data.str = cvMemStorageAllocString( fs->memstorage, ptr, (int)(str_end - ptr) ); node 1293 modules/core/src/persistence.cpp (node->info ? CV_NODE_USER : 0), node ); node 1304 modules/core/src/persistence.cpp ptr = icvYMLParseKey( fs, ptr, node, &elem ); node 1312 modules/core/src/persistence.cpp elem = (CvFileNode*)cvSeqPush( node->data.seq, 0 ); node 1333 modules/core/src/persistence.cpp node->data.seq->flags |= is_simple ? CV_NODE_SEQ_SIMPLE : 0; node 1821 modules/core/src/persistence.cpp icvXMLParseValue( CvFileStorage* fs, char* ptr, CvFileNode* node, node 1824 modules/core/src/persistence.cpp CvFileNode *elem = node; node 1827 modules/core/src/persistence.cpp memset( node, 0, sizeof(*node) ); node 1885 modules/core/src/persistence.cpp if( !CV_NODE_IS_COLLECTION(node->tag) ) node 1887 modules/core/src/persistence.cpp icvFSCreateCollection( fs, is_noname ? CV_NODE_SEQ : CV_NODE_MAP, node ); node 1889 modules/core/src/persistence.cpp else if( is_noname ^ CV_NODE_IS_SEQ(node->tag) ) node 1894 modules/core/src/persistence.cpp elem = (CvFileNode*)cvSeqPush( node->data.seq, 0 ); node 1896 modules/core/src/persistence.cpp elem = cvGetFileNode( fs, node, key, 1 ); node 1913 modules/core/src/persistence.cpp elem = node; node 1914 modules/core/src/persistence.cpp if( node->tag != CV_NODE_NONE ) node 1916 modules/core/src/persistence.cpp if( !CV_NODE_IS_COLLECTION(node->tag) ) node 1917 modules/core/src/persistence.cpp icvFSCreateCollection( fs, CV_NODE_SEQ, node ); node 1919 modules/core/src/persistence.cpp elem = (CvFileNode*)cvSeqPush( node->data.seq, 0 ); node 2042 modules/core/src/persistence.cpp if( (CV_NODE_TYPE(node->tag) == CV_NODE_NONE || node 2043 modules/core/src/persistence.cpp (CV_NODE_TYPE(node->tag) != value_type && node 2044 modules/core/src/persistence.cpp !CV_NODE_IS_COLLECTION(node->tag))) && node 2048 modules/core/src/persistence.cpp CV_NODE_MAP : CV_NODE_SEQ, node ); node 2052 modules/core/src/persistence.cpp value_type != CV_NODE_TYPE(node->tag) ) node 2055 modules/core/src/persistence.cpp if( CV_NODE_IS_COLLECTION(node->tag) && is_simple ) node 2056 modules/core/src/persistence.cpp node->data.seq->flags |= CV_NODE_SEQ_SIMPLE; node 2058 modules/core/src/persistence.cpp node->tag |= is_user_type ? CV_NODE_USER : 0; node 3251 modules/core/src/persistence.cpp CvFileNode* node = (CvFileNode*)reader->ptr; node 3252 modules/core/src/persistence.cpp if( CV_NODE_IS_INT(node->tag) ) node 3254 modules/core/src/persistence.cpp int ival = node->data.i; node 3295 modules/core/src/persistence.cpp else if( CV_NODE_IS_REAL(node->tag) ) node 3297 modules/core/src/persistence.cpp double fval = node->data.f; node 3384 modules/core/src/persistence.cpp icvWriteFileNode( CvFileStorage* fs, const char* name, const CvFileNode* node ); node 3387 modules/core/src/persistence.cpp icvWriteCollection( CvFileStorage* fs, const CvFileNode* node ) node 3389 modules/core/src/persistence.cpp int i, total = node->data.seq->total; node 3390 modules/core/src/persistence.cpp int elem_size = node->data.seq->elem_size; node 3391 modules/core/src/persistence.cpp int is_map = CV_NODE_IS_MAP(node->tag); node 3394 modules/core/src/persistence.cpp cvStartReadSeq( node->data.seq, &reader, 0 ); node 3409 modules/core/src/persistence.cpp icvWriteFileNode( CvFileStorage* fs, const char* name, const CvFileNode* node ) node 3411 modules/core/src/persistence.cpp switch( CV_NODE_TYPE(node->tag) ) node 3414 modules/core/src/persistence.cpp fs->write_int( fs, name, node->data.i ); node 3417 modules/core/src/persistence.cpp fs->write_real( fs, name, node->data.f ); node 3420 modules/core/src/persistence.cpp fs->write_string( fs, name, node->data.str.ptr, 0 ); node 3424 modules/core/src/persistence.cpp fs->start_write_struct( fs, name, CV_NODE_TYPE(node->tag) + node 3425 modules/core/src/persistence.cpp (CV_NODE_SEQ_IS_SIMPLE(node->data.seq) ? CV_NODE_FLOW : 0), node 3426 modules/core/src/persistence.cpp node->info ? node->info->type_name : 0 ); node 3427 modules/core/src/persistence.cpp icvWriteCollection( fs, node ); node 3442 modules/core/src/persistence.cpp const CvFileNode* node, int embed ) node 3447 modules/core/src/persistence.cpp if( !node ) node 3450 modules/core/src/persistence.cpp if( CV_NODE_IS_COLLECTION(node->tag) && embed ) node 3452 modules/core/src/persistence.cpp icvWriteCollection( fs, node ); node 3456 modules/core/src/persistence.cpp icvWriteFileNode( fs, new_node_name, node ); node 3534 modules/core/src/persistence.cpp icvFileNodeSeqLen( CvFileNode* node ) node 3536 modules/core/src/persistence.cpp return CV_NODE_IS_COLLECTION(node->tag) ? node->data.seq->total : node 3537 modules/core/src/persistence.cpp CV_NODE_TYPE(node->tag) != CV_NODE_NONE; node 3542 modules/core/src/persistence.cpp icvReadMat( CvFileStorage* fs, CvFileNode* node ) node 3550 modules/core/src/persistence.cpp rows = cvReadIntByName( fs, node, "rows", -1 ); node 3551 modules/core/src/persistence.cpp cols = cvReadIntByName( fs, node, "cols", -1 ); node 3552 modules/core/src/persistence.cpp dt = cvReadStringByName( fs, node, "dt", 0 ); node 3559 modules/core/src/persistence.cpp data = cvGetFileNodeByName( fs, node, "data" ); node 3626 modules/core/src/persistence.cpp icvReadMatND( CvFileStorage* fs, CvFileNode* node ) node 3636 modules/core/src/persistence.cpp sizes_node = cvGetFileNodeByName( fs, node, "sizes" ); node 3637 modules/core/src/persistence.cpp dt = cvReadStringByName( fs, node, "dt", 0 ); node 3651 modules/core/src/persistence.cpp data = cvGetFileNodeByName( fs, node, "data" ); node 3713 modules/core/src/persistence.cpp CvSparseNode* node; node 3735 modules/core/src/persistence.cpp node = cvInitSparseMatIterator( mat, &iterator ); node 3736 modules/core/src/persistence.cpp while( node ) node 3738 modules/core/src/persistence.cpp int* idx = CV_NODE_IDX( mat, node ); node 3740 modules/core/src/persistence.cpp node = cvGetNextSparseNode( &iterator ); node 3764 modules/core/src/persistence.cpp node = (CvSparseNode*)((uchar*)idx - mat->idxoffset ); node 3765 modules/core/src/persistence.cpp val = CV_NODE_VAL( mat, node ); node 3777 modules/core/src/persistence.cpp icvReadSparseMat( CvFileStorage* fs, CvFileNode* node ) node 3789 modules/core/src/persistence.cpp sizes_node = cvGetFileNodeByName( fs, node, "sizes" ); node 3790 modules/core/src/persistence.cpp dt = cvReadStringByName( fs, node, "dt", 0 ); node 3804 modules/core/src/persistence.cpp data = cvGetFileNodeByName( fs, node, "data" ); node 3915 modules/core/src/persistence.cpp icvReadImage( CvFileStorage* fs, CvFileNode* node ) node 3927 modules/core/src/persistence.cpp width = cvReadIntByName( fs, node, "width", 0 ); node 3928 modules/core/src/persistence.cpp height = cvReadIntByName( fs, node, "height", 0 ); node 3929 modules/core/src/persistence.cpp dt = cvReadStringByName( fs, node, "dt", 0 ); node 3930 modules/core/src/persistence.cpp origin = cvReadStringByName( fs, node, "origin", 0 ); node 3936 modules/core/src/persistence.cpp data_order = cvReadStringByName( fs, node, "layout", "interleaved" ); node 3940 modules/core/src/persistence.cpp data = cvGetFileNodeByName( fs, node, "data" ); node 3951 modules/core/src/persistence.cpp roi_node = cvGetFileNodeByName( fs, node, "roi" ); node 4186 modules/core/src/persistence.cpp if( !tree_iterator.node ) node 4188 modules/core/src/persistence.cpp icvWriteSeq( fs, 0, tree_iterator.node, attr, tree_iterator.level ); node 4199 modules/core/src/persistence.cpp icvReadSeq( CvFileStorage* fs, CvFileNode* node ) node 4215 modules/core/src/persistence.cpp flags_str = cvReadStringByName( fs, node, "flags", 0 ); node 4216 modules/core/src/persistence.cpp total = cvReadIntByName( fs, node, "count", -1 ); node 4217 modules/core/src/persistence.cpp dt = cvReadStringByName( fs, node, "dt", 0 ); node 4266 modules/core/src/persistence.cpp header_dt = cvReadStringByName( fs, node, "header_dt", 0 ); node 4267 modules/core/src/persistence.cpp header_node = cvGetFileNodeByName( fs, node, "header_user_data" ); node 4273 modules/core/src/persistence.cpp rect_node = cvGetFileNodeByName( fs, node, "rect" ); node 4274 modules/core/src/persistence.cpp origin_node = cvGetFileNodeByName( fs, node, "origin" ); node 4302 modules/core/src/persistence.cpp point_seq->color = cvReadIntByName( fs, node, "color", 0 ); node 4317 modules/core/src/persistence.cpp data = cvGetFileNodeByName( fs, node, "data" ); node 4339 modules/core/src/persistence.cpp icvReadSeqTree( CvFileStorage* fs, CvFileNode* node ) node 4342 modules/core/src/persistence.cpp CvFileNode *sequences_node = cvGetFileNodeByName( fs, node, "sequences" ); node 4561 modules/core/src/persistence.cpp icvReadGraph( CvFileStorage* fs, CvFileNode* node ) node 4582 modules/core/src/persistence.cpp flags_str = cvReadStringByName( fs, node, "flags", 0 ); node 4583 modules/core/src/persistence.cpp vtx_dt = cvReadStringByName( fs, node, "vertex_dt", 0 ); node 4584 modules/core/src/persistence.cpp edge_dt = cvReadStringByName( fs, node, "edge_dt", 0 ); node 4585 modules/core/src/persistence.cpp vtx_count = cvReadIntByName( fs, node, "vertex_count", -1 ); node 4586 modules/core/src/persistence.cpp edge_count = cvReadIntByName( fs, node, "edge_count", -1 ); node 4612 modules/core/src/persistence.cpp header_dt = cvReadStringByName( fs, node, "header_dt", 0 ); node 4613 modules/core/src/persistence.cpp header_node = cvGetFileNodeByName( fs, node, "header_user_data" ); node 4676 modules/core/src/persistence.cpp vtx_node = cvGetFileNodeByName( fs, node, "vertices" ); node 4677 modules/core/src/persistence.cpp edge_node = cvGetFileNodeByName( fs, node, "edges" ); node 4967 modules/core/src/persistence.cpp cvRead( CvFileStorage* fs, CvFileNode* node, CvAttrList* list ) node 4972 modules/core/src/persistence.cpp if( !node ) node 4975 modules/core/src/persistence.cpp if( !CV_NODE_IS_USER(node->tag) || !node->info ) node 4978 modules/core/src/persistence.cpp obj = node->info->read( fs, node ); node 5039 modules/core/src/persistence.cpp CvFileNode* node = 0; node 5046 modules/core/src/persistence.cpp node = cvGetFileNodeByName( *fs, 0, name ); node 5056 modules/core/src/persistence.cpp node = (CvFileNode*)cvGetSeqElem( (*fs)->roots, k ); node 5057 modules/core/src/persistence.cpp if( !CV_NODE_IS_MAP( node->tag )) node 5059 modules/core/src/persistence.cpp seq = node->data.seq; node 5060 modules/core/src/persistence.cpp node = 0; node 5069 modules/core/src/persistence.cpp node = (CvFileNode*)reader.ptr; node 5080 modules/core/src/persistence.cpp if( !node ) node 5083 modules/core/src/persistence.cpp real_name = cvGetFileNodeName( node ); node 5084 modules/core/src/persistence.cpp ptr = cvRead( *fs, node, 0 ); node 5287 modules/core/src/persistence.cpp return FileNode(fs, cvGetFileNodeByName(fs, node, nodename.c_str())); node 5292 modules/core/src/persistence.cpp return FileNode(fs, cvGetFileNodeByName(fs, node, nodename)); node 5297 modules/core/src/persistence.cpp return isSeq() ? FileNode(fs, (CvFileNode*)cvGetSeqElem(node->data.seq, i)) : node 5304 modules/core/src/persistence.cpp return !node || (str = cvGetFileNodeName(node)) == 0 ? String() : String(str); node 5309 modules/core/src/persistence.cpp if( !fs || !node ) node 5311 modules/core/src/persistence.cpp return cvRead( (CvFileStorage*)fs, (CvFileNode*)node ); node 5529 modules/core/src/persistence.cpp void read( const FileNode& node, Mat& mat, const Mat& default_mat ) node 5531 modules/core/src/persistence.cpp if( node.empty() ) node 5536 modules/core/src/persistence.cpp void* obj = cvRead((CvFileStorage*)node.fs, (CvFileNode*)*node); node 5554 modules/core/src/persistence.cpp void read( const FileNode& node, SparseMat& mat, const SparseMat& default_mat ) node 5556 modules/core/src/persistence.cpp if( node.empty() ) node 5561 modules/core/src/persistence.cpp Ptr<CvSparseMat> m((CvSparseMat*)cvRead((CvFileStorage*)node.fs, (CvFileNode*)*node)); node 5585 modules/core/src/persistence.cpp void read(const FileNode& node, std::vector<KeyPoint>& keypoints) node 5588 modules/core/src/persistence.cpp FileNodeIterator it = node.begin(), it_end = node.end(); node 5613 modules/core/src/persistence.cpp void read(const FileNode& node, std::vector<DMatch>& matches) node 5616 modules/core/src/persistence.cpp FileNodeIterator it = node.begin(), it_end = node.end(); node 5626 modules/core/src/persistence.cpp int FileNode::type() const { return !node ? NONE : (node->tag & TYPE_MASK); } node 5627 modules/core/src/persistence.cpp bool FileNode::isNamed() const { return !node ? false : (node->tag & NAMED) != 0; } node 5632 modules/core/src/persistence.cpp return t == MAP ? (size_t)((CvSet*)node->data.map)->active_count : node 5633 modules/core/src/persistence.cpp t == SEQ ? (size_t)node->data.seq->total : (size_t)!isNone(); node 5636 modules/core/src/persistence.cpp void read(const FileNode& node, int& value, int default_value) node 5638 modules/core/src/persistence.cpp value = !node.node ? default_value : node 5639 modules/core/src/persistence.cpp CV_NODE_IS_INT(node.node->tag) ? node.node->data.i : node 5640 modules/core/src/persistence.cpp CV_NODE_IS_REAL(node.node->tag) ? cvRound(node.node->data.f) : 0x7fffffff; node 5643 modules/core/src/persistence.cpp void read(const FileNode& node, float& value, float default_value) node 5645 modules/core/src/persistence.cpp value = !node.node ? default_value : node 5646 modules/core/src/persistence.cpp CV_NODE_IS_INT(node.node->tag) ? (float)node.node->data.i : node 5647 modules/core/src/persistence.cpp CV_NODE_IS_REAL(node.node->tag) ? (float)node.node->data.f : 1e30f; node 5650 modules/core/src/persistence.cpp void read(const FileNode& node, double& value, double default_value) node 5652 modules/core/src/persistence.cpp value = !node.node ? default_value : node 5653 modules/core/src/persistence.cpp CV_NODE_IS_INT(node.node->tag) ? (double)node.node->data.i : node 5654 modules/core/src/persistence.cpp CV_NODE_IS_REAL(node.node->tag) ? node.node->data.f : 1e300; node 5657 modules/core/src/persistence.cpp void read(const FileNode& node, String& value, const String& default_value) node 5659 modules/core/src/persistence.cpp value = !node.node ? default_value : CV_NODE_IS_STRING(node.node->tag) ? String(node.node->data.str.ptr) : String(); node 410 modules/core/test/test_io.cpp static inline void read(const FileNode& node, node 414 modules/core/test/test_io.cpp if(node.empty()) node 420 modules/core/test/test_io.cpp node["a"] >> value.a; node 421 modules/core/test/test_io.cpp node["b"] >> value.b; node 690 modules/features2d/src/mser.cpp static void initMSCRNode( MSCRNode* node ) node 692 modules/features2d/src/mser.cpp node->gmsr = node->tmsr = NULL; node 693 modules/features2d/src/mser.cpp node->reinit = 0xffff; node 694 modules/features2d/src/mser.cpp node->rank = 0; node 695 modules/features2d/src/mser.cpp node->sizei = node->size = 1; node 696 modules/features2d/src/mser.cpp node->prev = node->next = node->shortcut = node; node 700 modules/features2d/src/mser.cpp static int preprocessMSER_8uC3( MSCRNode* node, node 750 modules/features2d/src/mser.cpp MSCRNode* nodeptr = node; node 563 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h NodePtr node = branch.node; node 564 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h findNN(node, result, vec, checks, maxChecks, heap, checked); node 617 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void save_tree(FILE* stream, NodePtr node, int num) node 619 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h save_value(stream, *node); node 620 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h if (node->childs==NULL) { node 621 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h int indices_offset = (int)(node->indices - indices[num]); node 626 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h save_tree(stream, node->childs[i], num); node 632 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void load_tree(FILE* stream, NodePtr& node, int num) node 634 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node = pool.allocate<Node>(); node 635 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h load_value(stream, *node); node 636 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h if (node->childs==NULL) { node 639 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->indices = indices[num] + indices_offset; node 642 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs = pool.allocate<NodePtr>(branching_); node 644 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h load_tree(stream, node->childs[i], num); node 681 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void computeClustering(NodePtr node, int* dsindices, int indices_length, int branching, int level) node 683 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->size = indices_length; node 684 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->level = level; node 687 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->indices = dsindices; node 688 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h std::sort(node->indices,node->indices+indices_length); node 689 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs = NULL; node 700 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->indices = dsindices; node 701 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h std::sort(node->indices,node->indices+indices_length); node 702 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs = NULL; node 711 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs = pool.allocate<NodePtr>(branching); node 723 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs[i] = pool.allocate<Node>(); node 724 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs[i]->pivot = centers[i]; node 725 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs[i]->indices = NULL; node 726 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h computeClustering(node->childs[i],dsindices+start, end-start, branching, level+1); node 746 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h void findNN(NodePtr node, ResultSet<DistanceType>& result, const ElementType* vec, int& checks, int maxChecks, node 749 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h if (node->childs==NULL) { node 753 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h for (int i=0; i<node->size; ++i) { node 754 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h int index = node->indices[i]; node 766 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h domain_distances[best_index] = distance(vec, dataset[node->childs[best_index]->pivot], veclen_); node 768 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h domain_distances[i] = distance(vec, dataset[node->childs[i]->pivot], veclen_); node 775 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h heap->insert(BranchSt(node->childs[i],domain_distances[i])); node 779 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h findNN(node->childs[best_index],result,vec, checks, maxChecks, heap, checked); node 278 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr node = pool_.allocate<Node>(); // allocate memory node 282 modules/flann/include/opencv2/flann/kdtree_index.h node->child1 = node->child2 = NULL; /* Mark as leaf node. */ node 283 modules/flann/include/opencv2/flann/kdtree_index.h node->divfeat = *ind; /* Store index of this vec. */ node 291 modules/flann/include/opencv2/flann/kdtree_index.h node->divfeat = cutfeat; node 292 modules/flann/include/opencv2/flann/kdtree_index.h node->divval = cutval; node 293 modules/flann/include/opencv2/flann/kdtree_index.h node->child1 = divideTree(ind, idx); node 294 modules/flann/include/opencv2/flann/kdtree_index.h node->child2 = divideTree(ind+idx, count-idx); node 297 modules/flann/include/opencv2/flann/kdtree_index.h return node; node 453 modules/flann/include/opencv2/flann/kdtree_index.h searchLevel(result, vec, branch.node, branch.mindist, checkCount, maxCheck, epsError, heap, checked); node 467 modules/flann/include/opencv2/flann/kdtree_index.h void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, NodePtr node, DistanceType mindist, int& checkCount, int maxCheck, node 476 modules/flann/include/opencv2/flann/kdtree_index.h if ((node->child1 == NULL)&&(node->child2 == NULL)) { node 481 modules/flann/include/opencv2/flann/kdtree_index.h int index = node->divfeat; node 493 modules/flann/include/opencv2/flann/kdtree_index.h ElementType val = vec[node->divfeat]; node 494 modules/flann/include/opencv2/flann/kdtree_index.h DistanceType diff = val - node->divval; node 495 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr bestChild = (diff < 0) ? node->child1 : node->child2; node 496 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr otherChild = (diff < 0) ? node->child2 : node->child1; node 506 modules/flann/include/opencv2/flann/kdtree_index.h DistanceType new_distsq = mindist + distance_.accum_dist(val, node->divval, node->divfeat); node 519 modules/flann/include/opencv2/flann/kdtree_index.h void searchLevelExact(ResultSet<DistanceType>& result_set, const ElementType* vec, const NodePtr node, DistanceType mindist, const float epsError) node 522 modules/flann/include/opencv2/flann/kdtree_index.h if ((node->child1 == NULL)&&(node->child2 == NULL)) { node 523 modules/flann/include/opencv2/flann/kdtree_index.h int index = node->divfeat; node 530 modules/flann/include/opencv2/flann/kdtree_index.h ElementType val = vec[node->divfeat]; node 531 modules/flann/include/opencv2/flann/kdtree_index.h DistanceType diff = val - node->divval; node 532 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr bestChild = (diff < 0) ? node->child1 : node->child2; node 533 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr otherChild = (diff < 0) ? node->child2 : node->child1; node 543 modules/flann/include/opencv2/flann/kdtree_index.h DistanceType new_distsq = mindist + distance_.accum_dist(val, node->divval, node->divfeat); node 341 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr node = pool_.allocate<Node>(); // allocate memory node 345 modules/flann/include/opencv2/flann/kdtree_single_index.h node->child1 = node->child2 = NULL; /* Mark as leaf node. */ node 346 modules/flann/include/opencv2/flann/kdtree_single_index.h node->left = left; node 347 modules/flann/include/opencv2/flann/kdtree_single_index.h node->right = right; node 367 modules/flann/include/opencv2/flann/kdtree_single_index.h node->divfeat = cutfeat; node 371 modules/flann/include/opencv2/flann/kdtree_single_index.h node->child1 = divideTree(left, left+idx, left_bbox); node 375 modules/flann/include/opencv2/flann/kdtree_single_index.h node->child2 = divideTree(left+idx, right, right_bbox); node 377 modules/flann/include/opencv2/flann/kdtree_single_index.h node->divlow = left_bbox[cutfeat].high; node 378 modules/flann/include/opencv2/flann/kdtree_single_index.h node->divhigh = right_bbox[cutfeat].low; node 386 modules/flann/include/opencv2/flann/kdtree_single_index.h return node; node 542 modules/flann/include/opencv2/flann/kdtree_single_index.h void searchLevel(ResultSet<DistanceType>& result_set, const ElementType* vec, const NodePtr node, DistanceType mindistsq, node 546 modules/flann/include/opencv2/flann/kdtree_single_index.h if ((node->child1 == NULL)&&(node->child2 == NULL)) { node 548 modules/flann/include/opencv2/flann/kdtree_single_index.h for (int i=node->left; i<node->right; ++i) { node 559 modules/flann/include/opencv2/flann/kdtree_single_index.h int idx = node->divfeat; node 561 modules/flann/include/opencv2/flann/kdtree_single_index.h DistanceType diff1 = val - node->divlow; node 562 modules/flann/include/opencv2/flann/kdtree_single_index.h DistanceType diff2 = val - node->divhigh; node 568 modules/flann/include/opencv2/flann/kdtree_single_index.h bestChild = node->child1; node 569 modules/flann/include/opencv2/flann/kdtree_single_index.h otherChild = node->child2; node 570 modules/flann/include/opencv2/flann/kdtree_single_index.h cut_dist = distance_.accum_dist(val, node->divhigh, idx); node 573 modules/flann/include/opencv2/flann/kdtree_single_index.h bestChild = node->child2; node 574 modules/flann/include/opencv2/flann/kdtree_single_index.h otherChild = node->child1; node 575 modules/flann/include/opencv2/flann/kdtree_single_index.h cut_dist = distance_.accum_dist( val, node->divlow, idx); node 513 modules/flann/include/opencv2/flann/kmeans_index.h KMeansNodePtr node = branch.node; node 514 modules/flann/include/opencv2/flann/kmeans_index.h findNN(node, result, vec, checks, maxChecks, heap); node 610 modules/flann/include/opencv2/flann/kmeans_index.h void save_tree(FILE* stream, KMeansNodePtr node) node 612 modules/flann/include/opencv2/flann/kmeans_index.h save_value(stream, *node); node 613 modules/flann/include/opencv2/flann/kmeans_index.h save_value(stream, *(node->pivot), (int)veclen_); node 614 modules/flann/include/opencv2/flann/kmeans_index.h if (node->childs==NULL) { node 615 modules/flann/include/opencv2/flann/kmeans_index.h int indices_offset = (int)(node->indices - indices_); node 620 modules/flann/include/opencv2/flann/kmeans_index.h save_tree(stream, node->childs[i]); node 626 modules/flann/include/opencv2/flann/kmeans_index.h void load_tree(FILE* stream, KMeansNodePtr& node) node 628 modules/flann/include/opencv2/flann/kmeans_index.h node = pool_.allocate<KMeansNode>(); node 629 modules/flann/include/opencv2/flann/kmeans_index.h load_value(stream, *node); node 630 modules/flann/include/opencv2/flann/kmeans_index.h node->pivot = new DistanceType[veclen_]; node 631 modules/flann/include/opencv2/flann/kmeans_index.h load_value(stream, *(node->pivot), (int)veclen_); node 632 modules/flann/include/opencv2/flann/kmeans_index.h if (node->childs==NULL) { node 635 modules/flann/include/opencv2/flann/kmeans_index.h node->indices = indices_ + indices_offset; node 638 modules/flann/include/opencv2/flann/kmeans_index.h node->childs = pool_.allocate<KMeansNodePtr>(branching_); node 640 modules/flann/include/opencv2/flann/kmeans_index.h load_tree(stream, node->childs[i]); node 649 modules/flann/include/opencv2/flann/kmeans_index.h void free_centers(KMeansNodePtr node) node 651 modules/flann/include/opencv2/flann/kmeans_index.h delete[] node->pivot; node 652 modules/flann/include/opencv2/flann/kmeans_index.h if (node->childs!=NULL) { node 654 modules/flann/include/opencv2/flann/kmeans_index.h free_centers(node->childs[k]); node 666 modules/flann/include/opencv2/flann/kmeans_index.h void computeNodeStatistics(KMeansNodePtr node, int* indices, int indices_length) node 697 modules/flann/include/opencv2/flann/kmeans_index.h node->variance = variance; node 698 modules/flann/include/opencv2/flann/kmeans_index.h node->radius = radius; node 699 modules/flann/include/opencv2/flann/kmeans_index.h node->pivot = mean; node 714 modules/flann/include/opencv2/flann/kmeans_index.h void computeClustering(KMeansNodePtr node, int* indices, int indices_length, int branching, int level) node 716 modules/flann/include/opencv2/flann/kmeans_index.h node->size = indices_length; node 717 modules/flann/include/opencv2/flann/kmeans_index.h node->level = level; node 720 modules/flann/include/opencv2/flann/kmeans_index.h node->indices = indices; node 721 modules/flann/include/opencv2/flann/kmeans_index.h std::sort(node->indices,node->indices+indices_length); node 722 modules/flann/include/opencv2/flann/kmeans_index.h node->childs = NULL; node 732 modules/flann/include/opencv2/flann/kmeans_index.h node->indices = indices; node 733 modules/flann/include/opencv2/flann/kmeans_index.h std::sort(node->indices,node->indices+indices_length); node 734 modules/flann/include/opencv2/flann/kmeans_index.h node->childs = NULL; node 844 modules/flann/include/opencv2/flann/kmeans_index.h node->childs = pool_.allocate<KMeansNodePtr>(branching); node 866 modules/flann/include/opencv2/flann/kmeans_index.h node->childs[c] = pool_.allocate<KMeansNode>(); node 867 modules/flann/include/opencv2/flann/kmeans_index.h node->childs[c]->radius = radiuses[c]; node 868 modules/flann/include/opencv2/flann/kmeans_index.h node->childs[c]->pivot = centers[c]; node 869 modules/flann/include/opencv2/flann/kmeans_index.h node->childs[c]->variance = variance; node 870 modules/flann/include/opencv2/flann/kmeans_index.h node->childs[c]->mean_radius = mean_radius; node 871 modules/flann/include/opencv2/flann/kmeans_index.h node->childs[c]->indices = NULL; node 872 modules/flann/include/opencv2/flann/kmeans_index.h computeClustering(node->childs[c],indices+start, end-start, branching, level+1); node 892 modules/flann/include/opencv2/flann/kmeans_index.h void findNN(KMeansNodePtr node, ResultSet<DistanceType>& result, const ElementType* vec, int& checks, int maxChecks, node 897 modules/flann/include/opencv2/flann/kmeans_index.h DistanceType bsq = distance_(vec, node->pivot, veclen_); node 898 modules/flann/include/opencv2/flann/kmeans_index.h DistanceType rsq = node->radius; node 910 modules/flann/include/opencv2/flann/kmeans_index.h if (node->childs==NULL) { node 914 modules/flann/include/opencv2/flann/kmeans_index.h checks += node->size; node 915 modules/flann/include/opencv2/flann/kmeans_index.h for (int i=0; i<node->size; ++i) { node 916 modules/flann/include/opencv2/flann/kmeans_index.h int index = node->indices[i]; node 923 modules/flann/include/opencv2/flann/kmeans_index.h int closest_center = exploreNodeBranches(node, vec, domain_distances, heap); node 925 modules/flann/include/opencv2/flann/kmeans_index.h findNN(node->childs[closest_center],result,vec, checks, maxChecks, heap); node 937 modules/flann/include/opencv2/flann/kmeans_index.h int exploreNodeBranches(KMeansNodePtr node, const ElementType* q, DistanceType* domain_distances, Heap<BranchSt>* heap) node 941 modules/flann/include/opencv2/flann/kmeans_index.h domain_distances[best_index] = distance_(q, node->childs[best_index]->pivot, veclen_); node 943 modules/flann/include/opencv2/flann/kmeans_index.h domain_distances[i] = distance_(q, node->childs[i]->pivot, veclen_); node 952 modules/flann/include/opencv2/flann/kmeans_index.h domain_distances[i] -= cb_index_*node->childs[i]->variance; node 958 modules/flann/include/opencv2/flann/kmeans_index.h heap->insert(BranchSt(node->childs[i],domain_distances[i])); node 969 modules/flann/include/opencv2/flann/kmeans_index.h void findExactNN(KMeansNodePtr node, ResultSet<DistanceType>& result, const ElementType* vec) node 973 modules/flann/include/opencv2/flann/kmeans_index.h DistanceType bsq = distance_(vec, node->pivot, veclen_); node 974 modules/flann/include/opencv2/flann/kmeans_index.h DistanceType rsq = node->radius; node 987 modules/flann/include/opencv2/flann/kmeans_index.h if (node->childs==NULL) { node 988 modules/flann/include/opencv2/flann/kmeans_index.h for (int i=0; i<node->size; ++i) { node 989 modules/flann/include/opencv2/flann/kmeans_index.h int index = node->indices[i]; node 997 modules/flann/include/opencv2/flann/kmeans_index.h getCenterOrdering(node, vec, sort_indices); node 1000 modules/flann/include/opencv2/flann/kmeans_index.h findExactNN(node->childs[sort_indices[i]],result,vec); node 1013 modules/flann/include/opencv2/flann/kmeans_index.h void getCenterOrdering(KMeansNodePtr node, const ElementType* q, int* sort_indices) node 1017 modules/flann/include/opencv2/flann/kmeans_index.h DistanceType dist = distance_(q, node->childs[i]->pivot, veclen_); node 52 modules/flann/include/opencv2/flann/result_set.h T node; /* Tree node at which search resumes */ node 56 modules/flann/include/opencv2/flann/result_set.h BranchStruct(const T& aNode, DistanceType dist) : node(aNode), mindist(dist) {} node 2499 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); node 2500 modules/imgproc/src/histogram.cpp float v2 = PH2->value<float>(node->idx, (size_t*)&node->hashval); node 2514 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); node 2515 modules/imgproc/src/histogram.cpp s12 += v1*PH2->value<float>(node->idx, (size_t*)&node->hashval); node 2541 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); node 2542 modules/imgproc/src/histogram.cpp float v2 = PH2->value<float>(node->idx, (size_t*)&node->hashval); node 2554 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); node 2555 modules/imgproc/src/histogram.cpp double v2 = PH2->value<float>(node->idx, (size_t*)&node->hashval); node 2573 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); node 2574 modules/imgproc/src/histogram.cpp double v2 = PH2->value<float>(node->idx, (size_t*)&node->hashval); node 2708 modules/imgproc/src/histogram.cpp CvSparseNode *node; node 2710 modules/imgproc/src/histogram.cpp for( node = cvInitSparseMatIterator( mat, &iterator ); node 2711 modules/imgproc/src/histogram.cpp node != 0; node = cvGetNextSparseNode( &iterator )) node 2713 modules/imgproc/src/histogram.cpp float* val = (float*)CV_NODE_VAL( mat, node ); node 2743 modules/imgproc/src/histogram.cpp CvSparseNode *node; node 2746 modules/imgproc/src/histogram.cpp for( node = cvInitSparseMatIterator( mat, &iterator ); node 2747 modules/imgproc/src/histogram.cpp node != 0; node = cvGetNextSparseNode( &iterator )) node 2749 modules/imgproc/src/histogram.cpp sum += *(float*)CV_NODE_VAL(mat,node); node 2756 modules/imgproc/src/histogram.cpp for( node = cvInitSparseMatIterator( mat, &iterator ); node 2757 modules/imgproc/src/histogram.cpp node != 0; node = cvGetNextSparseNode( &iterator )) node 2759 modules/imgproc/src/histogram.cpp *(float*)CV_NODE_VAL(mat,node) *= scale; node 2828 modules/imgproc/src/histogram.cpp CvSparseNode *node; node 2836 modules/imgproc/src/histogram.cpp for( node = cvInitSparseMatIterator( mat, &iterator ); node 2837 modules/imgproc/src/histogram.cpp node != 0; node = cvGetNextSparseNode( &iterator )) node 2839 modules/imgproc/src/histogram.cpp int value = *(int*)CV_NODE_VAL(mat,node); node 2844 modules/imgproc/src/histogram.cpp minNode = node; node 2850 modules/imgproc/src/histogram.cpp maxNode = node; node 3234 modules/imgproc/src/histogram.cpp *(float*)cvPtrND(sparsemat, it.node()->idx, 0, -2) = (float)*(const int*)it.ptr; node 3693 modules/imgproc/src/histogram.cpp static void *icvReadHist( CvFileStorage * fs, CvFileNode * node ) node 3702 modules/imgproc/src/histogram.cpp type = cvReadIntByName( fs, node, "type", 0 ); node 3703 modules/imgproc/src/histogram.cpp is_uniform = cvReadIntByName( fs, node, "is_uniform", 0 ); node 3704 modules/imgproc/src/histogram.cpp have_ranges = cvReadIntByName( fs, node, "have_ranges", 0 ); node 3712 modules/imgproc/src/histogram.cpp CvMatND* mat = (CvMatND*)cvReadByName( fs, node, "mat" ); node 3735 modules/imgproc/src/histogram.cpp h->bins = cvReadByName( fs, node, "bins" ); node 3752 modules/imgproc/src/histogram.cpp thresh_node = cvGetFileNodeByName( fs, node, "thresh" ); node 102 modules/imgproc/src/segmentation.cpp int free_node = 0, node; node 123 modules/imgproc/src/segmentation.cpp node = free_node; \ node 125 modules/imgproc/src/segmentation.cpp storage[node].next = 0; \ node 126 modules/imgproc/src/segmentation.cpp storage[node].mask_ofs = mofs; \ node 127 modules/imgproc/src/segmentation.cpp storage[node].img_ofs = iofs; \ node 129 modules/imgproc/src/segmentation.cpp storage[q[idx].last].next=node; \ node 131 modules/imgproc/src/segmentation.cpp q[idx].first = node; \ node 132 modules/imgproc/src/segmentation.cpp q[idx].last = node; \ node 138 modules/imgproc/src/segmentation.cpp node = q[idx].first; \ node 139 modules/imgproc/src/segmentation.cpp q[idx].first = storage[node].next; \ node 140 modules/imgproc/src/segmentation.cpp if( !storage[node].next ) \ node 142 modules/imgproc/src/segmentation.cpp storage[node].next = free_node; \ node 143 modules/imgproc/src/segmentation.cpp free_node = node; \ node 144 modules/imgproc/src/segmentation.cpp mofs = storage[node].mask_ofs; \ node 145 modules/imgproc/src/segmentation.cpp iofs = storage[node].img_ofs; \ node 759 modules/imgproc/test/test_histograms.cpp CvSparseNode *node; node 761 modules/imgproc/test/test_histograms.cpp for( node = cvInitSparseMatIterator( sparse, &iterator ); node 762 modules/imgproc/test/test_histograms.cpp node != 0; node = cvGetNextSparseNode( &iterator )) node 764 modules/imgproc/test/test_histograms.cpp sum += *(float*)CV_NODE_VAL(sparse,node); node 852 modules/imgproc/test/test_histograms.cpp CvSparseNode* node; node 860 modules/imgproc/test/test_histograms.cpp for( node = cvInitSparseMatIterator( sparse, &iterator ), i = 0; node 861 modules/imgproc/test/test_histograms.cpp node != 0; node = cvGetNextSparseNode( &iterator ), i++ ) node 863 modules/imgproc/test/test_histograms.cpp const int* idx = CV_NODE_IDX(sparse,node); node 867 modules/imgproc/test/test_histograms.cpp values->data.fl[i] = *(float*)CV_NODE_VAL(sparse,node); node 1038 modules/imgproc/test/test_histograms.cpp CvSparseNode* node; node 1040 modules/imgproc/test/test_histograms.cpp for( node = cvInitSparseMatIterator( sparse0, &iterator ); node 1041 modules/imgproc/test/test_histograms.cpp node != 0; node = cvGetNextSparseNode( &iterator ) ) node 1043 modules/imgproc/test/test_histograms.cpp const int* idx = CV_NODE_IDX(sparse0, node); node 1044 modules/imgproc/test/test_histograms.cpp double v0 = *(float*)CV_NODE_VAL(sparse0, node); node 1065 modules/imgproc/test/test_histograms.cpp for( node = cvInitSparseMatIterator( sparse1, &iterator ); node 1066 modules/imgproc/test/test_histograms.cpp node != 0; node = cvGetNextSparseNode( &iterator ) ) node 1068 modules/imgproc/test/test_histograms.cpp double v1 = *(float*)CV_NODE_VAL(sparse1, node); node 170 modules/imgproc/test/test_houghLines.cpp FileNode node = fs[test_case_name]; node 171 modules/imgproc/test/test_houghLines.cpp if (node.empty()) node 145 modules/ml/src/boost.cpp Node *node = 0; node 152 modules/ml/src/boost.cpp node = &nodes[nidx]; node 153 modules/ml/src/boost.cpp node->value *= scale; node 154 modules/ml/src/boost.cpp if( node->left < 0 ) node 156 modules/ml/src/boost.cpp nidx = node->left; node 159 modules/ml/src/boost.cpp for( pidx = node->parent; pidx >= 0 && nodes[pidx].right == nidx; node 173 modules/ml/src/boost.cpp WNode* node = &w->wnodes[nidx]; node 176 modules/ml/src/boost.cpp node->value = node->class_idx == 0 ? -1 : 1; node 180 modules/ml/src/boost.cpp double p = (node->value+1)*0.5; node 181 modules/ml/src/boost.cpp node->value = 0.5*log_ratio(p); node 755 modules/ml/src/gbt.cpp void CvGBTrees::leaves_get( CvDTreeNode** leaves, int& count, CvDTreeNode* node ) node 757 modules/ml/src/gbt.cpp if (node->left != NULL) leaves_get(leaves, count, node->left); node 758 modules/ml/src/gbt.cpp if (node->right != NULL) leaves_get(leaves, count, node->right); node 759 modules/ml/src/gbt.cpp if ((node->left == NULL) && (node->right == NULL)) node 760 modules/ml/src/gbt.cpp leaves[count++] = node; node 1142 modules/ml/src/gbt.cpp void CvGBTrees::read( CvFileStorage* fs, CvFileNode* node ) node 1156 modules/ml/src/gbt.cpp read_params( fs, node ); node 1161 modules/ml/src/gbt.cpp base_value = (float)cvReadRealByName( fs, node, "base_value", 0.0 ); node 1162 modules/ml/src/gbt.cpp class_count = cvReadIntByName( fs, node, "class_count", 1 ); node 1171 modules/ml/src/gbt.cpp trees_fnode = cvGetFileNodeByName( fs, node, s.c_str() ); node 367 modules/ml/src/precomp.hpp static inline void readVectorOrMat(const FileNode & node, std::vector<T> & v) node 369 modules/ml/src/precomp.hpp if (node.type() == FileNode::MAP) node 372 modules/ml/src/precomp.hpp node >> m; node 375 modules/ml/src/precomp.hpp else if (node.type() == FileNode::SEQ) node 377 modules/ml/src/precomp.hpp node >> v; node 268 modules/ml/src/tree.cpp Node node; node 269 modules/ml/src/tree.cpp node.parent = pidx; node 270 modules/ml/src/tree.cpp node.classIdx = wnode.class_idx; node 271 modules/ml/src/tree.cpp node.value = wnode.value; node 272 modules/ml/src/tree.cpp node.defaultDir = wnode.defaultDir; node 298 modules/ml/src/tree.cpp node.split = (int)splits.size(); node 302 modules/ml/src/tree.cpp nodes.push_back(node); node 355 modules/ml/src/tree.cpp WNode& node = w->wnodes.back(); node 357 modules/ml/src/tree.cpp node.parent = parent; node 358 modules/ml/src/tree.cpp node.depth = parent >= 0 ? w->wnodes[parent].depth + 1 : 0; node 368 modules/ml/src/tree.cpp int i, n = node.sample_count = (int)sidx.size(); node 374 modules/ml/src/tree.cpp if( n <= params.getMinSampleCount() || node.depth >= params.getMaxDepth() ) node 389 modules/ml/src/tree.cpp if( sqrt(node.node_risk) < params.getRegressionAccuracy() ) node 394 modules/ml/src/tree.cpp node.split = findBestSplit( sidx ); node 398 modules/ml/src/tree.cpp if( node.split >= 0 ) node 400 modules/ml/src/tree.cpp node.defaultDir = calcDir( node.split, sidx, sleft, sright ); node 466 modules/ml/src/tree.cpp WNode* node = &w->wnodes[nidx]; node 537 modules/ml/src/tree.cpp node->class_idx = max_k; node 538 modules/ml/src/tree.cpp node->value = classLabels[max_k]; node 539 modules/ml/src/tree.cpp node->node_risk = total_weight - max_val; node 634 modules/ml/src/tree.cpp node->node_risk = sum2 - (sum/sumw)*sum; node 635 modules/ml/src/tree.cpp node->value = sum/sumw; node 1273 modules/ml/src/tree.cpp WNode *node = 0, *parent = 0; node 1277 modules/ml/src/tree.cpp node = &w->wnodes[nidx]; node 1278 modules/ml/src/tree.cpp double t = fold >= 0 ? w->cv_Tn[nidx*cv_n + fold] : node->Tn; node 1279 modules/ml/src/tree.cpp if( t <= T || node->left < 0 ) node 1281 modules/ml/src/tree.cpp node->complexity = 1; node 1282 modules/ml/src/tree.cpp node->tree_risk = node->node_risk; node 1283 modules/ml/src/tree.cpp node->tree_error = 0.; node 1286 modules/ml/src/tree.cpp node->tree_risk = w->cv_node_risk[nidx*cv_n + fold]; node 1287 modules/ml/src/tree.cpp node->tree_error = w->cv_node_error[nidx*cv_n + fold]; node 1291 modules/ml/src/tree.cpp nidx = node->left; node 1294 modules/ml/src/tree.cpp for( pidx = node->parent; pidx >= 0 && w->wnodes[pidx].right == nidx; node 1297 modules/ml/src/tree.cpp node = &w->wnodes[nidx]; node 1299 modules/ml/src/tree.cpp parent->complexity += node->complexity; node 1300 modules/ml/src/tree.cpp parent->tree_risk += node->tree_risk; node 1301 modules/ml/src/tree.cpp parent->tree_error += node->tree_error; node 1311 modules/ml/src/tree.cpp node = &w->wnodes[nidx]; node 1313 modules/ml/src/tree.cpp parent->complexity = node->complexity; node 1314 modules/ml/src/tree.cpp parent->tree_risk = node->tree_risk; node 1315 modules/ml/src/tree.cpp parent->tree_error = node->tree_error; node 1325 modules/ml/src/tree.cpp WNode* node = &w->wnodes[root]; node 1326 modules/ml/src/tree.cpp if( node->left < 0 ) node 1333 modules/ml/src/tree.cpp node = &w->wnodes[nidx]; node 1334 modules/ml/src/tree.cpp double t = fold >= 0 ? w->cv_Tn[nidx*cv_n + fold] : node->Tn; node 1335 modules/ml/src/tree.cpp if( t <= T || node->left < 0 ) node 1337 modules/ml/src/tree.cpp if( node->alpha <= min_alpha + FLT_EPSILON ) node 1342 modules/ml/src/tree.cpp node->Tn = T; node 1347 modules/ml/src/tree.cpp nidx = node->left; node 1350 modules/ml/src/tree.cpp for( pidx = node->parent; pidx >= 0 && w->wnodes[pidx].right == nidx; node 1409 modules/ml/src/tree.cpp const Node& node = nodes[nidx]; node 1410 modules/ml/src/tree.cpp if( node.split < 0 ) node 1412 modules/ml/src/tree.cpp const Split& split = splits[node.split]; node 1420 modules/ml/src/tree.cpp nidx = node.defaultDir < 0 ? node.left : node.right; node 1427 modules/ml/src/tree.cpp nidx = val <= split.c ? node.left : node.right; node 1463 modules/ml/src/tree.cpp nidx = CV_DTREE_CAT_DIR(u, subset) < 0 ? node.left : node.right; node 1628 modules/ml/src/tree.cpp const Node& node = nodes[nidx]; node 1631 modules/ml/src/tree.cpp fs << "value" << node.value; node 1634 modules/ml/src/tree.cpp fs << "norm_class_idx" << node.classIdx; node 1636 modules/ml/src/tree.cpp if( node.split >= 0 ) node 1640 modules/ml/src/tree.cpp for( int splitidx = node.split; splitidx >= 0; splitidx = splits[splitidx].next ) node 1654 modules/ml/src/tree.cpp const Node *node = 0; node 1662 modules/ml/src/tree.cpp node = &nodes[nidx]; node 1663 modules/ml/src/tree.cpp if( node->left < 0 ) node 1665 modules/ml/src/tree.cpp nidx = node->left; node 1669 modules/ml/src/tree.cpp for( pidx = node->parent; pidx >= 0 && nodes[pidx].right == nidx; node 1866 modules/ml/src/tree.cpp Node node; node 1867 modules/ml/src/tree.cpp node.value = (double)fn["value"]; node 1870 modules/ml/src/tree.cpp node.classIdx = (int)fn["norm_class_idx"]; node 1884 modules/ml/src/tree.cpp node.split = splitidx; node 1890 modules/ml/src/tree.cpp nodes.push_back(node); node 1904 modules/ml/src/tree.cpp Node& node = nodes[nidx]; node 1905 modules/ml/src/tree.cpp node.parent = pidx; node 1916 modules/ml/src/tree.cpp if( node.split >= 0 ) node 244 modules/objdetect/include/opencv2/objdetect.hpp CV_WRAP bool read( const FileNode& node ); node 528 modules/objdetect/src/cascadedetect.cpp bool HaarEvaluator::Feature :: read( const FileNode& node ) node 530 modules/objdetect/src/cascadedetect.cpp FileNode rnode = node[CC_RECTS]; node 547 modules/objdetect/src/cascadedetect.cpp tilted = (int)node[CC_TILTED] != 0; node 565 modules/objdetect/src/cascadedetect.cpp bool HaarEvaluator::read(const FileNode& node, Size _origWinSize) node 567 modules/objdetect/src/cascadedetect.cpp if (!FeatureEvaluator::read(node, _origWinSize)) node 569 modules/objdetect/src/cascadedetect.cpp size_t i, n = node.size(); node 578 modules/objdetect/src/cascadedetect.cpp FileNodeIterator it = node.begin(); node 743 modules/objdetect/src/cascadedetect.cpp bool LBPEvaluator::Feature :: read(const FileNode& node ) node 745 modules/objdetect/src/cascadedetect.cpp FileNode rnode = node[CC_RECT]; node 762 modules/objdetect/src/cascadedetect.cpp bool LBPEvaluator::read( const FileNode& node, Size _origWinSize ) node 764 modules/objdetect/src/cascadedetect.cpp if (!FeatureEvaluator::read(node, _origWinSize)) node 773 modules/objdetect/src/cascadedetect.cpp features->resize(node.size()); node 775 modules/objdetect/src/cascadedetect.cpp FileNodeIterator it = node.begin(), it_end = node.end(); node 901 modules/objdetect/src/cascadedetect.cpp void CascadeClassifierImpl::read(const FileNode& node) node 903 modules/objdetect/src/cascadedetect.cpp read_(node); node 1482 modules/objdetect/src/cascadedetect.cpp DTreeNode node; node 1483 modules/objdetect/src/cascadedetect.cpp node.left = (int)*internalNodesIter; ++internalNodesIter; node 1484 modules/objdetect/src/cascadedetect.cpp node.right = (int)*internalNodesIter; ++internalNodesIter; node 1485 modules/objdetect/src/cascadedetect.cpp node.featureIdx = (int)*internalNodesIter; ++internalNodesIter; node 1490 modules/objdetect/src/cascadedetect.cpp node.threshold = 0.f; node 1494 modules/objdetect/src/cascadedetect.cpp node.threshold = (float)*internalNodesIter; ++internalNodesIter; node 1496 modules/objdetect/src/cascadedetect.cpp nodes.push_back(node); node 1517 modules/objdetect/src/cascadedetect.cpp const DTreeNode& node = nodes[nodeOfs]; node 1518 modules/objdetect/src/cascadedetect.cpp stumps.push_back(Stump(node.featureIdx, node.threshold, node 37 modules/objdetect/src/cascadedetect.hpp virtual bool read(const FileNode& node, Size origWinSize); node 85 modules/objdetect/src/cascadedetect.hpp void read( const FileNode& node ); node 86 modules/objdetect/src/cascadedetect.hpp bool read_( const FileNode& node ); node 198 modules/objdetect/src/cascadedetect.hpp bool read(const FileNode &node); node 322 modules/objdetect/src/cascadedetect.hpp bool read( const FileNode& node ); node 349 modules/objdetect/src/cascadedetect.hpp virtual bool read( const FileNode& node, Size origWinSize); node 417 modules/objdetect/src/cascadedetect.hpp bool read(const FileNode& node ); node 434 modules/objdetect/src/cascadedetect.hpp virtual bool read( const FileNode& node, Size origWinSize ); node 510 modules/objdetect/src/cascadedetect.hpp CascadeClassifierImpl::Data::DTreeNode& node = cascadeNodes[root + idx]; node 511 modules/objdetect/src/cascadedetect.hpp double val = featureEvaluator(node.featureIdx); node 512 modules/objdetect/src/cascadedetect.hpp idx = val < node.threshold ? node.left : node.right; node 551 modules/objdetect/src/cascadedetect.hpp CascadeClassifierImpl::Data::DTreeNode& node = cascadeNodes[root + idx]; node 552 modules/objdetect/src/cascadedetect.hpp int c = featureEvaluator(node.featureIdx); node 554 modules/objdetect/src/cascadedetect.hpp idx = (subset[c>>5] & (1 << (c & 31))) ? node.left : node.right; node 155 modules/objdetect/src/cascadedetect_convert.cpp HaarClassifierNode node; node 156 modules/objdetect/src/cascadedetect_convert.cpp node.f = (int)features.size(); node 171 modules/objdetect/src/cascadedetect_convert.cpp node.threshold = nnode[ICV_HAAR_THRESHOLD_NAME]; node 175 modules/objdetect/src/cascadedetect_convert.cpp node.left = -(int)weak.leaves.size(); node 180 modules/objdetect/src/cascadedetect_convert.cpp node.left = (int)nnode[ICV_HAAR_LEFT_NODE_NAME]; node 185 modules/objdetect/src/cascadedetect_convert.cpp node.right = -(int)weak.leaves.size(); node 190 modules/objdetect/src/cascadedetect_convert.cpp node.right = (int)nnode[ICV_HAAR_RIGHT_NODE_NAME]; node 192 modules/objdetect/src/cascadedetect_convert.cpp weak.nodes.push_back(node); node 98 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node; node 312 modules/objdetect/src/haar.cpp hid_classifier->node = haar_node_ptr; node 317 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = hid_classifier->node + l; node 319 modules/objdetect/src/haar.cpp memset( node, -1, sizeof(*node) ); node 320 modules/objdetect/src/haar.cpp node->threshold = classifier->threshold[l]; node 321 modules/objdetect/src/haar.cpp node->left = classifier->left[l]; node 322 modules/objdetect/src/haar.cpp node->right = classifier->right[l]; node 327 modules/objdetect/src/haar.cpp memset( &(node->feature.rect[2]), 0, sizeof(node->feature.rect[2]) ); node 520 modules/objdetect/src/haar.cpp &cascade->stage_classifier[i].classifier[j].node[l].feature; node 653 modules/objdetect/src/haar.cpp nodes[0] = (classifier+0)->node + idxV[0]; node 654 modules/objdetect/src/haar.cpp nodes[1] = (classifier+1)->node + idxV[1]; node 655 modules/objdetect/src/haar.cpp nodes[2] = (classifier+2)->node + idxV[2]; node 656 modules/objdetect/src/haar.cpp nodes[3] = (classifier+3)->node + idxV[3]; node 657 modules/objdetect/src/haar.cpp nodes[4] = (classifier+4)->node + idxV[4]; node 658 modules/objdetect/src/haar.cpp nodes[5] = (classifier+5)->node + idxV[5]; node 659 modules/objdetect/src/haar.cpp nodes[6] = (classifier+6)->node + idxV[6]; node 660 modules/objdetect/src/haar.cpp nodes[7] = (classifier+7)->node + idxV[7]; node 800 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node + idx; node 801 modules/objdetect/src/haar.cpp double t = node->threshold * variance_norm_factor; node 803 modules/objdetect/src/haar.cpp double sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight; node 804 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight; node 806 modules/objdetect/src/haar.cpp if( node->feature.rect[2].p0 ) node 807 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[2],p_offset) * node->feature.rect[2].weight; node 809 modules/objdetect/src/haar.cpp idx = sum < t ? node->left : node->right; node 918 modules/objdetect/src/haar.cpp nodes[0] = classifiers[0]->node; node 920 modules/objdetect/src/haar.cpp nodes[1] = classifiers[1]->node; node 922 modules/objdetect/src/haar.cpp nodes[2] = classifiers[2]->node; node 924 modules/objdetect/src/haar.cpp nodes[3] = classifiers[3]->node; node 926 modules/objdetect/src/haar.cpp nodes[4] = classifiers[4]->node; node 928 modules/objdetect/src/haar.cpp nodes[5] = classifiers[5]->node; node 930 modules/objdetect/src/haar.cpp nodes[6] = classifiers[6]->node; node 932 modules/objdetect/src/haar.cpp nodes[7] = classifiers[7]->node; node 1008 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node; node 1010 modules/objdetect/src/haar.cpp double t = node->threshold*variance_norm_factor; node 1011 modules/objdetect/src/haar.cpp double sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight; node 1012 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight; node 1023 modules/objdetect/src/haar.cpp nodes[0] = classifiers[0]->node; node 1025 modules/objdetect/src/haar.cpp nodes[1] = classifiers[1]->node; node 1027 modules/objdetect/src/haar.cpp nodes[2] = classifiers[2]->node; node 1029 modules/objdetect/src/haar.cpp nodes[3] = classifiers[3]->node; node 1031 modules/objdetect/src/haar.cpp nodes[4] = classifiers[4]->node; node 1033 modules/objdetect/src/haar.cpp nodes[5] = classifiers[5]->node; node 1035 modules/objdetect/src/haar.cpp nodes[6] = classifiers[6]->node; node 1037 modules/objdetect/src/haar.cpp nodes[7] = classifiers[7]->node; node 1136 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node; node 1138 modules/objdetect/src/haar.cpp double t = node->threshold*variance_norm_factor; node 1139 modules/objdetect/src/haar.cpp double sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight; node 1140 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight; node 1141 modules/objdetect/src/haar.cpp if( node->feature.rect[2].p0 ) node 1142 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[2],p_offset) * node->feature.rect[2].weight; node 1162 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node; node 1165 modules/objdetect/src/haar.cpp __m128d t = _mm_set_sd(node->threshold*variance_norm_factor); node 1168 modules/objdetect/src/haar.cpp __m128d sum = _mm_set_sd(calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight + node 1169 modules/objdetect/src/haar.cpp calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight); node 1179 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node; node 1181 modules/objdetect/src/haar.cpp __m128d t = _mm_set_sd(node->threshold*variance_norm_factor); node 1184 modules/objdetect/src/haar.cpp double _sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight; node 1185 modules/objdetect/src/haar.cpp _sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight; node 1186 modules/objdetect/src/haar.cpp if( node->feature.rect[2].p0 ) node 1187 modules/objdetect/src/haar.cpp _sum += calc_sum(node->feature.rect[2],p_offset) * node->feature.rect[2].weight; node 1210 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node; node 1211 modules/objdetect/src/haar.cpp double t = node->threshold*variance_norm_factor; node 1212 modules/objdetect/src/haar.cpp double sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight; node 1213 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight; node 1222 modules/objdetect/src/haar.cpp CvHidHaarTreeNode* node = classifier->node; node 1223 modules/objdetect/src/haar.cpp double t = node->threshold*variance_norm_factor; node 1224 modules/objdetect/src/haar.cpp double sum = calc_sum(node->feature.rect[0],p_offset) * node->feature.rect[0].weight; node 1225 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[1],p_offset) * node->feature.rect[1].weight; node 1226 modules/objdetect/src/haar.cpp if( node->feature.rect[2].p0 ) node 1227 modules/objdetect/src/haar.cpp sum += calc_sum(node->feature.rect[2],p_offset) * node->feature.rect[2].weight; node 2051 modules/objdetect/src/haar.cpp icvReadHaarClassifier( CvFileStorage* fs, CvFileNode* node ) node 2064 modules/objdetect/src/haar.cpp stages_fn = cvGetFileNodeByName( fs, node, ICV_HAAR_STAGES_NAME ); node 2072 modules/objdetect/src/haar.cpp seq_fn = cvGetFileNodeByName( fs, node, ICV_HAAR_SIZE_NAME ); node 154 modules/objdetect/src/opencl/cascadedetect.cl __global const Node* node = nodes; node 194 modules/objdetect/src/opencl/cascadedetect.cl for( i = 0; i < ntrees; i++, node += NODE_COUNT, leaves += NODE_COUNT+1 ) node 199 modules/objdetect/src/opencl/cascadedetect.cl int4 n = node[idx].n; node 248 modules/objdetect/src/opencl/cascadedetect.cl __global const Node* node = nodes + stages[stageIdx].first*NODE_COUNT; node 300 modules/objdetect/src/opencl/cascadedetect.cl int4 n = node[i*2 + idx].n; node 319 modules/objdetect/test/test_cascadeandhog.cpp FileNode node = validationFS.getFirstTopLevelNode()[VALIDATION][detectorNames[detectorIdx]][imageIdxStr]; node 321 modules/objdetect/test/test_cascadeandhog.cpp if( node.size() != 0 ) node 323 modules/objdetect/test/test_cascadeandhog.cpp for( FileNodeIterator it2 = node.begin(); it2 != node.end(); ) node 203 modules/ts/include/opencv2/ts/ts_perf.hpp void verify(cv::FileNode node, cv::InputArray array, double eps, ERROR_TYPE err); node 204 modules/ts/include/opencv2/ts/ts_perf.hpp void verify(cv::FileNode node, cv::Mat actual, double eps, std::string argname, ERROR_TYPE err); node 185 modules/ts/src/ts.cpp CvFileNode* node = cvGetFileNodeByName(fs, 0, get_name().c_str()); node 186 modules/ts/src/ts.cpp return node ? cvGetFileNodeByName( fs, node, param_name ) : 0; node 342 modules/ts/src/ts_perf.cpp void Regression::verify(cv::FileNode node, cv::Mat actual, double eps, std::string argname, ERROR_TYPE err) node 346 modules/ts/src/ts_perf.cpp double expect_min = (double)node["min"]; node 347 modules/ts/src/ts_perf.cpp double expect_max = (double)node["max"]; node 360 modules/ts/src/ts_perf.cpp cv::FileNode last = node["last"]; node 373 modules/ts/src/ts_perf.cpp cv::FileNode rng1 = node["rng1"]; node 386 modules/ts/src/ts_perf.cpp cv::FileNode rng2 = node["rng2"]; node 449 modules/ts/src/ts_perf.cpp void Regression::verify(cv::FileNode node, cv::InputArray array, double eps, ERROR_TYPE err) node 451 modules/ts/src/ts_perf.cpp int expected_kind = (int)node["kind"]; node 452 modules/ts/src/ts_perf.cpp int expected_type = (int)node["type"]; node 453 modules/ts/src/ts_perf.cpp ASSERT_EQ(expected_kind, array.kind()) << " Argument \"" << node.name() << "\" has unexpected kind"; node 454 modules/ts/src/ts_perf.cpp ASSERT_EQ(expected_type, array.type()) << " Argument \"" << node.name() << "\" has unexpected type"; node 456 modules/ts/src/ts_perf.cpp cv::FileNode valnode = node["val"]; node 459 modules/ts/src/ts_perf.cpp int expected_length = (int)node["len"]; node 460 modules/ts/src/ts_perf.cpp ASSERT_EQ(expected_length, (int)array.total()) << " Vector \"" << node.name() << "\" has unexpected length"; node 461 modules/ts/src/ts_perf.cpp int idx = node["idx"]; node 468 modules/ts/src/ts_perf.cpp << " \"" << node.name() << "[" << idx << "]\" has unexpected number of elements"; node 469 modules/ts/src/ts_perf.cpp verify(node, actual, eps, cv::format("%s[%d]", node.name().c_str(), idx), err); node 479 modules/ts/src/ts_perf.cpp << " expected empty " << node.name() << "[" << idx<< "]"; node 484 modules/ts/src/ts_perf.cpp << " " << node.name() << "[" << idx<< "] has unexpected size"; node 500 modules/ts/src/ts_perf.cpp << node.name() << "[" << idx << "]\" and expected value is greater than " << eps; node 513 modules/ts/src/ts_perf.cpp << node.name() << "[" << idx << "]\" and expected value is greater than " << eps << " in " << violations << " points"; node 524 modules/ts/src/ts_perf.cpp << " Argument \"" << node.name() << "\" has unexpected number of elements"; node 525 modules/ts/src/ts_perf.cpp verify(node, array.getMat(), eps, "Argument \"" + node.name() + "\"", err); node 536 modules/ts/src/ts_perf.cpp << " expected empty " << node.name(); node 541 modules/ts/src/ts_perf.cpp << " Argument \"" << node.name() << "\" has unexpected size"; node 556 modules/ts/src/ts_perf.cpp FAIL() << " Difference (=" << max << ") between argument1 \"" << node.name() node 569 modules/ts/src/ts_perf.cpp FAIL() << " Relative difference (" << maxv << " of " << maxa << " allowed) between argument \"" << node.name() node 217 modules/videoio/src/cap_dc1394.cpp cameras[numCameras].cam.node = camera_nodes[i]; node 248 modules/videoio/src/cap_dc1394.cpp if (dc1394_query_supported_formats(pcap->handle, pcap->camera->node, &formats)<0) { node 255 modules/videoio/src/cap_dc1394.cpp if (dc1394_query_supported_modes(pcap->handle, pcap->camera->node, i+FORMAT_MIN, &modes[i])<0) { node 297 modules/videoio/src/cap_dc1394.cpp if (dc1394_dma_setup_capture(pcap->handle, pcap->camera->node, index+1 /*channel*/, node 306 modules/videoio/src/cap_dc1394.cpp if(dc1394_dma_setup_format7_capture(pcap->handle,pcap->camera->node,index+1 /*channel*/, node 317 modules/videoio/src/cap_dc1394.cpp if (dc1394_start_iso_transmission(pcap->handle, pcap->camera->node)!=DC1394_SUCCESS) { node 325 modules/videoio/src/cap_dc1394.cpp if (dc1394_get_iso_status(pcap->handle, pcap->camera->node, &status)!=DC1394_SUCCESS) { node 349 modules/videoio/src/cap_dc1394.cpp dc1394_stop_iso_transmission(capture->handle, capture->camera->node); node 465 modules/videoio/src/cap_dc1394.cpp CV_DC1394_CALL(dc1394_get_video_framerate(capture->handle, capture->camera->node, node 495 modules/videoio/src/cap_dc1394.cpp CV_DC1394_CALL( dc1394_is_feature_present(capture->handle, capture->camera->node, node 502 modules/videoio/src/cap_dc1394.cpp dc1394_get_feature_value(capture->handle, capture->camera->node, index, &value); node 624 modules/videoio/src/cap_dc1394.cpp if (dc1394_query_supported_formats(capture->handle, capture->camera->node, &formats)<0) { node 635 modules/videoio/src/cap_dc1394.cpp if (dc1394_query_supported_modes(capture->handle, capture->camera->node, format, &modes)<0){ node 654 modules/videoio/src/cap_dc1394.cpp if (dc1394_dma_setup_capture(capture->handle, capture->camera->node, capture->camera->channel /*channel*/, node 661 modules/videoio/src/cap_dc1394.cpp dc1394_start_iso_transmission(capture->handle, capture->camera->node); node 676 modules/videoio/src/cap_dc1394.cpp if (dc1394_query_supported_framerates(capture->handle, capture->camera->node, node 719 modules/videoio/src/cap_dc1394.cpp dc1394_set_video_framerate(capture->handle, capture->camera->node,fps); node 720 modules/videoio/src/cap_dc1394.cpp dc1394_get_video_framerate(capture->handle, capture->camera->node, node 785 modules/videoio/src/cap_dc1394.cpp if( dc1394_is_feature_on(capture->handle, capture->camera->node, feature_id, &isOn) node 791 modules/videoio/src/cap_dc1394.cpp if( dc1394_feature_on_off(capture->handle, capture->camera->node, feature_id, 1) == DC1394_FAILURE ) { node 798 modules/videoio/src/cap_dc1394.cpp dc1394_has_auto_mode(capture->handle, capture->camera->node, feature_id, &hasAutoCapability); node 802 modules/videoio/src/cap_dc1394.cpp if( dc1394_is_feature_auto(capture->handle, capture->camera->node, feature_id, &isAutoOn ) == DC1394_FAILURE ) { node 816 modules/videoio/src/cap_dc1394.cpp if(dc1394_auto_on_off(capture->handle, capture->camera->node, feature_id, 1) == DC1394_FAILURE ) { node 826 modules/videoio/src/cap_dc1394.cpp if(dc1394_auto_on_off(capture->handle, capture->camera->node, feature_id, 0) == DC1394_FAILURE ) { node 833 modules/videoio/src/cap_dc1394.cpp CV_DC1394_CALL( dc1394_get_min_value(capture->handle, capture->camera->node, feature_id, &minval)); node 834 modules/videoio/src/cap_dc1394.cpp CV_DC1394_CALL( dc1394_get_max_value(capture->handle, capture->camera->node, feature_id, &maxval)); node 838 modules/videoio/src/cap_dc1394.cpp if (dc1394_set_feature_value(capture->handle, capture->camera->node, feature_id, val) == node 843 modules/videoio/src/cap_dc1394.cpp if (dc1394_get_feature_value(capture->handle, capture->camera->node, feature_id, &nval) == node 45 samples/cpp/filestorage.cpp void read(const FileNode& node) //Read serialization for this class node 48 samples/cpp/filestorage.cpp A = (int)node["A"]; node 49 samples/cpp/filestorage.cpp X = (double)node["X"]; node 50 samples/cpp/filestorage.cpp id = (string)node["id"]; node 58 samples/cpp/filestorage.cpp static void read(const FileNode& node, MyData& x, const MyData& default_value = MyData()){ node 59 samples/cpp/filestorage.cpp if(node.empty()) node 62 samples/cpp/filestorage.cpp x.read(node); node 58 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp void read(const FileNode& node) //Read serialization for this class node 60 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["BoardSize_Width" ] >> boardSize.width; node 61 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["BoardSize_Height"] >> boardSize.height; node 62 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Calibrate_Pattern"] >> patternToUse; node 63 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Square_Size"] >> squareSize; node 64 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Calibrate_NrOfFrameToUse"] >> nrFrames; node 65 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Calibrate_FixAspectRatio"] >> aspectRatio; node 66 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Write_DetectedFeaturePoints"] >> writePoints; node 67 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Write_extrinsicParameters"] >> writeExtrinsics; node 68 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Write_outputFileName"] >> outputFileName; node 69 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Calibrate_AssumeZeroTangentialDistortion"] >> calibZeroTangentDist; node 70 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Calibrate_FixPrincipalPointAtTheCenter"] >> calibFixPrincipalPoint; node 71 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Input_FlipAroundHorizontalAxis"] >> flipVertical; node 72 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Show_UndistortedImage"] >> showUndistorsed; node 73 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Input"] >> input; node 74 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp node["Input_Delay"] >> delay; node 206 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp static inline void read(const FileNode& node, Settings& x, const Settings& default_value = Settings()) node 208 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp if(node.empty()) node 211 samples/cpp/tutorial_code/calib3d/camera_calibration/camera_calibration.cpp x.read(node); node 32 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp void read(const FileNode& node) //Read serialization for this class node 34 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp A = (int)node["A"]; node 35 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp X = (double)node["X"]; node 36 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp id = (string)node["id"]; node 49 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp static void read(const FileNode& node, MyData& x, const MyData& default_value = MyData()){ node 50 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp if(node.empty()) node 53 samples/cpp/tutorial_code/core/file_input_output/file_input_output.cpp x.read(node);