Node 495 3rdparty/libwebp/enc/quant.c Node nodes[17][NUM_NODES]; Node 549 3rdparty/libwebp/enc/quant.c Node* const cur = &NODE(n, m); Node 572 3rdparty/libwebp/enc/quant.c const Node* const prev = &NODE(n - 1, p); Node 630 3rdparty/libwebp/enc/quant.c const Node* const node = &NODE(n, best_node); Node 2642 modules/core/include/opencv2/core/mat.hpp template<typename _Tp> _Tp& value(Node* n); Node 2644 modules/core/include/opencv2/core/mat.hpp template<typename _Tp> const _Tp& value(const Node* n) const; 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 1880 modules/core/include/opencv2/core/mat.inl.hpp _Tp& SparseMat::value(Node* n) Node 1886 modules/core/include/opencv2/core/mat.inl.hpp const _Tp& SparseMat::value(const Node* n) const Node 1892 modules/core/include/opencv2/core/mat.inl.hpp SparseMat::Node* SparseMat::node(size_t nidx) Node 1894 modules/core/include/opencv2/core/mat.inl.hpp return (Node*)(void*)&hdr->pool[nidx]; Node 1898 modules/core/include/opencv2/core/mat.inl.hpp const SparseMat::Node* SparseMat::node(size_t nidx) const Node 1900 modules/core/include/opencv2/core/mat.inl.hpp return (const Node*)(const void*)&hdr->pool[nidx]; Node 2646 modules/core/include/opencv2/core/mat.inl.hpp const SparseMat::Node* SparseMatConstIterator::node() const Node 2648 modules/core/include/opencv2/core/mat.inl.hpp return (ptr && m && m->hdr) ? (const SparseMat::Node*)(const void*)(ptr - m->hdr->valueOffset) : 0; Node 2714 modules/core/include/opencv2/core/mat.inl.hpp SparseMat::Node* SparseMatIterator::node() const Node 2716 modules/core/include/opencv2/core/mat.inl.hpp return (SparseMat::Node*)SparseMatConstIterator::node(); Node 208 modules/core/src/alloc.cpp Node* next; Node 253 modules/core/src/alloc.cpp Node* privateFreeList; Node 254 modules/core/src/alloc.cpp Node* publicFreeList; Node 366 modules/core/src/alloc.cpp Node *node = block->publicFreeList; Node 563 modules/core/src/alloc.cpp Node* node = block->privateFreeList; Node 610 modules/core/src/alloc.cpp Node* node = (Node*)ptr; Node 4717 modules/core/src/matrix.cpp valueOffset = (int)alignSize(sizeof(SparseMat::Node) - MAX_DIM*sizeof(int) + 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 4928 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 4950 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 4972 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 4996 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 5019 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 5038 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 5059 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 5093 modules/core/src/matrix.cpp Node* elem = (Node*)(pool + nidx); Node 5124 modules/core/src/matrix.cpp ((Node*)(pool + i))->next = i + nsz; Node 5125 modules/core/src/matrix.cpp ((Node*)(pool + i))->next = 0; Node 5128 modules/core/src/matrix.cpp Node* elem = (Node*)&hdr->pool[nidx]; Node 5153 modules/core/src/matrix.cpp Node* n = node(nidx); Node 5156 modules/core/src/matrix.cpp Node* prev = node(previdx); Node 5192 modules/core/src/matrix.cpp size_t next = ((const SparseMat::Node*)(ptr - hdr.valueOffset))->next; Node 5428 modules/core/src/matrix.cpp const cv::SparseMat::Node* n = from.node(); Node 477 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h root[i] = pool.allocate<Node>(); Node 596 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h Node** childs; Node 606 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h typedef Node* NodePtr; Node 634 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node = pool.allocate<Node>(); Node 723 modules/flann/include/opencv2/flann/hierarchical_clustering_index.h node->childs[i] = pool.allocate<Node>(); Node 234 modules/flann/include/opencv2/flann/kdtree_index.h Node* child1, * child2; Node 236 modules/flann/include/opencv2/flann/kdtree_index.h typedef Node* NodePtr; Node 256 modules/flann/include/opencv2/flann/kdtree_index.h tree = pool_.allocate<Node>(); Node 278 modules/flann/include/opencv2/flann/kdtree_index.h NodePtr node = pool_.allocate<Node>(); // allocate memory Node 271 modules/flann/include/opencv2/flann/kdtree_single_index.h Node* child1, * child2; Node 273 modules/flann/include/opencv2/flann/kdtree_single_index.h typedef Node* NodePtr; Node 303 modules/flann/include/opencv2/flann/kdtree_single_index.h tree = pool_.allocate<Node>(); Node 341 modules/flann/include/opencv2/flann/kdtree_single_index.h NodePtr node = pool_.allocate<Node>(); // allocate memory Node 2499 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); Node 2514 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); Node 2541 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); Node 2554 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); Node 2573 modules/imgproc/src/histogram.cpp const SparseMat::Node* node = it.node(); Node 1026 modules/ml/include/opencv2/ml.hpp Node(); Node 1073 modules/ml/include/opencv2/ml.hpp virtual const std::vector<Node>& getNodes() const = 0; Node 145 modules/ml/src/boost.cpp Node *node = 0; Node 496 modules/ml/src/boost.cpp const vector<Node>& getNodes() const { return impl.getNodes(); } Node 168 modules/ml/src/kdtree.cpp std::vector<KDTree::Node>().swap(nodes); Node 203 modules/ml/src/kdtree.cpp nodes.push_back(Node()); Node 246 modules/ml/src/kdtree.cpp nodes.push_back(Node()); Node 247 modules/ml/src/kdtree.cpp nodes.push_back(Node()); Node 337 modules/ml/src/kdtree.cpp const Node& n = nodes[nidx]; Node 446 modules/ml/src/kdtree.cpp const Node& n = nodes[nidx]; Node 43 modules/ml/src/kdtree.hpp Node() : idx(-1), left(-1), right(-1), boundary(0.f) {} Node 44 modules/ml/src/kdtree.hpp Node(int _idx, int _left, int _right, float _boundary) Node 87 modules/ml/src/kdtree.hpp std::vector<Node> nodes; //!< all the tree nodes Node 343 modules/ml/src/precomp.hpp virtual const std::vector<Node>& getNodes() const { return nodes; } Node 355 modules/ml/src/precomp.hpp vector<Node> nodes; Node 407 modules/ml/src/rtrees.cpp const vector<Node>& getNodes() const { return impl.getNodes(); } Node 81 modules/ml/src/tree.cpp DTrees::Node::Node() Node 268 modules/ml/src/tree.cpp Node node; Node 1409 modules/ml/src/tree.cpp const Node& node = nodes[nidx]; Node 1628 modules/ml/src/tree.cpp const Node& node = nodes[nidx]; Node 1654 modules/ml/src/tree.cpp const Node *node = 0; Node 1866 modules/ml/src/tree.cpp Node node; Node 1904 modules/ml/src/tree.cpp Node& node = nodes[nidx]; Node 1910 modules/ml/src/tree.cpp Node& parent = nodes[pidx]; Node 1909 modules/videoio/src/cap_msmf.hpp Node *prev; Node 1910 modules/videoio/src/cap_msmf.hpp Node *next; Node 1913 modules/videoio/src/cap_msmf.hpp Node() : prev(nullptr), next(nullptr) Node 1917 modules/videoio/src/cap_msmf.hpp Node(T item) : prev(nullptr), next(nullptr) Node 1948 modules/videoio/src/cap_msmf.hpp const Node *pNode; Node 1950 modules/videoio/src/cap_msmf.hpp POSITION(Node *p) : pNode(p) Node 1956 modules/videoio/src/cap_msmf.hpp Node m_anchor; // Anchor node for the linked list. Node 1959 modules/videoio/src/cap_msmf.hpp Node* Front() const Node 1964 modules/videoio/src/cap_msmf.hpp Node* Back() const Node 1969 modules/videoio/src/cap_msmf.hpp virtual HRESULT InsertAfter(T item, Node *pBefore) Node 1976 modules/videoio/src/cap_msmf.hpp Node *pNode = new Node(item); Node 1982 modules/videoio/src/cap_msmf.hpp Node *pAfter = pBefore->next; Node 1995 modules/videoio/src/cap_msmf.hpp virtual HRESULT GetItem(const Node *pNode, T* ppItem) Node 2009 modules/videoio/src/cap_msmf.hpp virtual HRESULT RemoveItem(Node *pNode, T *ppItem) Node 2149 modules/videoio/src/cap_msmf.hpp Node *n = m_anchor.next; Node 2156 modules/videoio/src/cap_msmf.hpp Node *tmp = n->next; Node 2227 modules/videoio/src/cap_msmf.hpp Node *pNode = const_cast<Node*>(pos.pNode); Node 2309 modules/videoio/src/cap_msmf.hpp HRESULT InsertAfter(Ptr item, Node *pBefore) Node 2330 modules/videoio/src/cap_msmf.hpp HRESULT GetItem(const Node *pNode, Ptr* ppItem) Node 2349 modules/videoio/src/cap_msmf.hpp HRESULT RemoveItem(Node *pNode, Ptr *ppItem) Node 52 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *prev; Node 53 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *next; Node 56 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node() : prev(nullptr), next(nullptr) Node 60 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node(T item) : prev(nullptr), next(nullptr) Node 91 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h const Node *pNode; Node 93 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h POSITION(Node *p) : pNode(p) Node 99 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node m_anchor; // Anchor node for the linked list. Node 102 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node* Front() const Node 107 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node* Back() const Node 112 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h virtual HRESULT InsertAfter(T item, Node *pBefore) Node 119 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *pNode = new Node(item); Node 125 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *pAfter = pBefore->next; Node 138 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h virtual HRESULT GetItem(const Node *pNode, T* ppItem) Node 152 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h virtual HRESULT RemoveItem(Node *pNode, T *ppItem) Node 292 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *n = m_anchor.next; Node 299 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *tmp = n->next; Node 370 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h Node *pNode = const_cast<Node*>(pos.pNode); Node 447 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h HRESULT InsertAfter(Ptr item, Node *pBefore) Node 468 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h HRESULT GetItem(const Node *pNode, Ptr* ppItem) Node 487 samples/winrt/ImageManipulations/MediaExtensions/Common/LinkList.h HRESULT RemoveItem(Node *pNode, Ptr *ppItem)