/frameworks/base/include/utils/ |
List.h | 48 class _Node { 50 explicit _Node(const T& val) : mVal(val) {} 51 ~_Node() {} 54 inline _Node* getPrev() const { return mpPrev; } 55 inline _Node* getNext() const { return mpNext; } 57 inline void setPrev(_Node* ptr) { mpPrev = ptr; } 58 inline void setNext(_Node* ptr) { mpNext = ptr; } 63 _Node* mpPrev; 64 _Node* mpNext; 73 typedef _Node const * NodePtr [all...] |
/external/stlport/stlport/stl/ |
_slist.c | 48 _Node* __tmp = __STATIC_CAST(_Node*, __cur); 76 __STATIC_CAST(_Node*, __n1)->_M_data = __STATIC_CAST(const _Node*, __n2)->_M_data; 95 __STATIC_CAST(_Node*, __node)->_M_data = __val; 122 if (__STATIC_CAST(_Node*, __cur->_M_next)->_M_data == __val) 135 typedef _Slist_node<_Tp> _Node; 139 if (__pred(*__ite, __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) 150 typedef _Slist_node<_Tp> _Node; 155 if (__comp(__x.front(), __STATIC_CAST(_Node*, __ite._M_node->_M_next)->_M_data)) [all...] |
_slist.h | 95 typedef _Slist_node<value_type> _Node; 102 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; } 150 typedef _Slist_node<_Tp> _Node; 151 typedef typename _Alloc_traits<_Node,_Alloc>::allocator_type _M_node_allocator_type; 155 typedef _STLP_alloc_proxy<_Slist_node_base, _Node, _M_node_allocator_type> _AllocProxy; 161 _M_head(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Slist_node_base() ) 174 _Node* __next = __STATIC_CAST(_Node*, __pos->_M_next); 246 typedef _STLP_PRIV _Slist_node<_Tp> _Node; 250 _Node* _M_create_node(const value_type& __x = _Tp()) [all...] |
_list.c | 67 _Node* __cur = __STATIC_CAST(_Node*, _M_node._M_data._M_next); 73 _Node* __tmp = __cur; 74 __cur = __STATIC_CAST(_Node*, __cur->_M_next);
|
_list.h | 109 typedef _List_node<_Tp> _Node; 118 reference operator*() const { return __STATIC_CAST(_Node*, this->_M_node)->_M_data; } 178 typedef _List_node<_Tp> _Node; 180 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _Node_allocator_type; 182 typedef _STLP_alloc_proxy<_Node_base, _Node, _Node_allocator_type> _AllocProxy; 188 _List_base(const allocator_type& __a) : _M_node(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base()) 260 typedef _STLP_PRIV _List_node<_Tp> _Node; 285 _Node* __p = this->_M_node.allocate(1); 295 _Node* __p = this->_M_node.allocate(1); 521 _Node* __n = __STATIC_CAST(_Node*, __pos._M_node) [all...] |
_tree.h | 235 typedef _Rb_tree_node<_Tp> _Node; 240 typedef typename _Alloc_traits<_Node, _Alloc>::allocator_type _M_node_allocator_type; 241 typedef _STLP_alloc_proxy<_Node_base, _Node, _M_node_allocator_type> _AllocProxy; 250 _M_header(_STLP_CONVERT_ALLOCATOR(__a, _Node), _Node_base() ) { 297 typedef _Rb_tree_node<_Value> _Node; 298 typedef _Node* _Link_type;
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/jce/provider/ |
PKIXPolicyNode.java | 150 PKIXPolicyNode _node = new PKIXPolicyNode(new ArrayList(), local 162 _child.setParent(_node); 163 _node.addChild(_child); 166 return _node;
|
CertPathValidatorUtilities.java | 667 PKIXPolicyNode _node) 669 PKIXPolicyNode _parent = (PKIXPolicyNode)_node.getParent(); 687 _parent.removeChild(_node); 688 removePolicyNodeRecurse(policyNodes, _node); 696 PKIXPolicyNode _node) 698 policyNodes[_node.getDepth()].remove(_node); 700 if (_node.hasChildren()) 702 Iterator _iter = _node.getChildren(); 757 PKIXPolicyNode _node = (PKIXPolicyNode)policyNodeVec.get(j) local [all...] |
PKIXCertPathValidatorSpi.java | 505 PKIXPolicyNode _node = (PKIXPolicyNode)_nodes.get(k); local 507 Iterator _policySetIter = _node.getExpectedPolicies().iterator(); 527 Iterator _childrenIter = _node.getChildren(); 547 _node, 551 _node.addChild(_newChild); 1180 PKIXPolicyNode _node = (PKIXPolicyNode)_nodeDepth.get(k); local 1196 PKIXPolicyNode _node = (PKIXPolicyNode)_vpnsIter.next(); local 1245 PKIXPolicyNode _node = (PKIXPolicyNode)_nodeDepth.get(k); local 1268 PKIXPolicyNode _node = (PKIXPolicyNode)_vpnsIter.next(); local [all...] |
/external/bison/src/ |
system.h | 208 Type *_node, *_next; \ 209 for (_node = List; _node; _node = _next) \ 211 _next = _node->next; \ 212 free (_node); \
|
/dalvik/libcore/security/src/main/java/org/bouncycastle/x509/ |
PKIXCertPathReviewer.java | 1212 PKIXPolicyNode _node = (PKIXPolicyNode) _nodes.get(k); local 1611 PKIXPolicyNode _node = (PKIXPolicyNode)_nodeDepth.get(k); local 1627 PKIXPolicyNode _node = (PKIXPolicyNode)_vpnsIter.next(); local 1676 PKIXPolicyNode _node = (PKIXPolicyNode)_nodeDepth.get(k); local 1699 PKIXPolicyNode _node = (PKIXPolicyNode)_vpnsIter.next(); local [all...] |
/external/stlport/stlport/stl/pointers/ |
_set.h | 40 typedef _Rb_tree_node<void*> _Node; 41 _STLP_EXPORT_TEMPLATE_CLASS _STLP_alloc_proxy<_Rb_tree_node_base, _Node, allocator<_Node> >;
|
/external/tinyxml/docs/ |
classTiXmlHandle-members.html | 20 <tr class="memlist"><td><a class="el" href="classTiXmlHandle.html#a0">TiXmlHandle</a>(TiXmlNode *_node)</td><td><a class="el" href="classTiXmlHandle.html">TiXmlHandle</a></td><td><code> [inline]</code></td></tr>
|
classTiXmlHandle.html | 16 <tr><td class="memItemLeft" nowrap align="right" valign="top"><a class="anchor" name="a0"></a><!-- doxytag: member="TiXmlHandle::TiXmlHandle" ref="a0" args="(TiXmlNode *_node)" --> 17 </td><td class="memItemRight" valign="bottom"><a class="el" href="classTiXmlHandle.html#a0">TiXmlHandle</a> (<a class="el" href="classTiXmlNode.html">TiXmlNode</a> *_node)</td></tr>
|
tinyxml_8h-source.html | [all...] |
/external/webkit/WebCore/inspector/front-end/ |
DOMAgent.js | 207 "_node": this 206 "_node": this property
|
/external/tinyxml/ |
tinyxml.h | [all...] |
/external/webkit/WebKit/win/ |
DOMCoreClasses.cpp | 386 if (![self _node]->isEventTargetNode()) [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ |
DTM.java | 540 * @return int Node type, as per the DOM's Node._NODE constants. [all...] |
/dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
DTMDefaultBase.java | [all...] |
DTMDocumentImpl.java | [all...] |
/external/stlport/etc/ |
ChangeLog-5.1 | [all...] |