HomeSort by relevance Sort by last modified time
    Searched full:nodeidx (Results 1 - 4 of 4) sorted by null

  /external/llvm/include/llvm/ADT/
SparseMultiSet.h 419 unsigned NodeIdx = addValue(Val, SMSNode::INVALID, SMSNode::INVALID);
423 Sparse[Idx] = NodeIdx;
424 Dense[NodeIdx].Prev = NodeIdx;
425 return iterator(this, NodeIdx, Idx);
431 Dense[TailIdx].Next = NodeIdx;
432 Dense[HeadIdx].Prev = NodeIdx;
433 Dense[NodeIdx].Prev = TailIdx;
435 return iterator(this, NodeIdx, Idx);
  /external/opencv3/modules/ml/src/
kdtree.cpp 84 SubTree() : first(0), last(0), nodeIdx(0), depth(0) {}
86 : first(_first), last(_last), nodeIdx(_nodeIdx), depth(_depth) {}
89 int nodeIdx;
211 int depth = stack[top].depth, nidx = stack[top].nodeIdx;
  /external/opencv/cxcore/src/
cxarray.cpp 826 int* nodeidx = CV_NODE_IDX(mat,node); local
828 if( idx[i] != nodeidx[i] )
923 int* nodeidx = CV_NODE_IDX(mat,node); local
925 if( idx[i] != nodeidx[i] )
    [all...]
  /external/opencv3/modules/core/src/
array.cpp 684 int* nodeidx = CV_NODE_IDX(mat,node); local
686 if( idx[i] != nodeidx[i] )
776 int* nodeidx = CV_NODE_IDX(mat,node); local
778 if( idx[i] != nodeidx[i] )
    [all...]

Completed in 165 milliseconds