Lines Matching defs:node
2641 CvPTreeNode node = { 0, 0, 0 };
2643 node.element = reader.ptr;
2644 CV_WRITE_SEQ_ELEM( node, writer );
2659 CvPTreeNode* node = (CvPTreeNode*)(reader0.ptr);
2660 CvPTreeNode* root = node;
2663 if( !node->element )
2674 if( node2->element && node2 != node &&
2675 is_equal( node->element, node2->element, userdata ))
2703 // Compress path from node to the root:
2704 node2 = node;
2714 CV_NEXT_SEQ_ELEM( sizeof(*node), reader );
2725 CvPTreeNode* node = (CvPTreeNode*)reader.ptr;
2728 if( node->element )
2730 while( node->parent )
2731 node = node->parent;
2732 if( node->rank >= 0 )
2733 node->rank = ~class_idx++;
2734 idx = ~node->rank;
2737 CV_NEXT_SEQ_ELEM( sizeof(*node), reader );
3795 void* node = cvNextTreeNode( &iterator );
3796 if( !node )
3798 cvSeqPush( allseq, &node );
3831 CvTreeNode* node = (CvTreeNode*)_node;
3834 if( !node || !parent )
3837 node->v_prev = _parent != _frame ? parent : 0;
3838 node->h_next = parent->v_next;
3840 assert( parent->v_next != node );
3843 parent->v_next->h_prev = node;
3844 parent->v_next = node;
3858 CvTreeNode* node = (CvTreeNode*)_node;
3861 if( !node )
3864 if( node == frame )
3865 CV_ERROR( CV_StsBadArg, "frame node could not be deleted" );
3867 if( node->h_next )
3868 node->h_next->h_prev = node->h_prev;
3870 if( node->h_prev )
3871 node->h_prev->h_next = node->h_next;
3874 CvTreeNode* parent = node->v_prev;
3880 assert( parent->v_next == node );
3881 parent->v_next = node->h_next;
3903 treeIterator->node = (void*)first;
3920 CvTreeNode* node;
3926 prevNode = node = (CvTreeNode*)treeIterator->node;
3929 if( node )
3931 if( node->v_next && level+1 < treeIterator->max_level )
3933 node = node->v_next;
3938 while( node->h_next == 0 )
3940 node = node->v_prev;
3943 node = 0;
3947 node = node && treeIterator->max_level != 0 ? node->h_next : 0;
3951 treeIterator->node = node;
3969 CvTreeNode* node;
3975 prevNode = node = (CvTreeNode*)treeIterator->node;
3978 if( node )
3980 if( !node->h_prev )
3982 node = node->v_prev;
3984 node = 0;
3988 node = node->h_prev;
3990 while( node->v_next && level < treeIterator->max_level )
3992 node = node->v_next;
3995 while( node->h_next )
3996 node = node->h_next;
4001 treeIterator->node = node;
