Home
last modified time | relevance | path

Searched refs:_children (Results 1 – 24 of 24) sorted by relevance

/external/antlr/runtime/ActionScript/project/src/org/antlr/runtime/tree/
DBaseTree.as36 protected var _children:Array;
46 if ( _children==null || i>=_children.length ) {
49 return BaseTree(_children[i]);
56 return _children;
60 for (var i:int = 0; _children!=null && i < _children.length; i++) {
61 var t:Tree = Tree(_children[i]);
70 if ( _children==null ) {
73 return _children.length;
88 if ( this._children!=null && this._children == childTree._children ) {
92 if ( childTree._children!=null ) {
[all …]
/external/perfetto/ui/src/controller/
Dcontroller.ts46 private _children = new Map<string, ControllerAny>(); property in Controller
78 for (const key of this._children.keys()) {
80 const instance = this._children.get(key)!;
81 this._children.delete(key);
85 if (!this._children.has(nextChild.id)) {
87 this._children.set(nextChild.id, instance);
89 const instance = this._children.get(nextChild.id)!;
/external/icu/android_icu4j/src/main/java/android/icu/impl/
DTextTrieMap.java249 private List<Node> _children; field in TextTrieMap.Node
257 _children = children; in Node()
280 if (_children == null) { in findMatch()
291 for (Node child : _children) { in findMatch()
306 if (_children == null) { in putLeadCodePoints()
309 for (Node child : _children) { in putLeadCodePoints()
315 } else if (child._children != null) { in putLeadCodePoints()
317 for (Node grandchild : child._children) { in putLeadCodePoints()
332 if (_children == null) { in add()
333 _children = new LinkedList<Node>(); in add()
[all …]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
DTextTrieMap.java240 private List<Node> _children; field in TextTrieMap.Node
248 _children = children; in Node()
271 if (_children == null) { in findMatch()
282 for (Node child : _children) { in findMatch()
297 if (_children == null) { in putLeadCodePoints()
300 for (Node child : _children) { in putLeadCodePoints()
306 } else if (child._children != null) { in putLeadCodePoints()
308 for (Node grandchild : child._children) { in putLeadCodePoints()
323 if (_children == null) { in add()
324 _children = new LinkedList<Node>(); in add()
[all …]
/external/python/cpython3/Lib/multiprocessing/
Dprocess.py47 return list(_children)
55 for p in list(_children):
57 _children.discard(p)
117 _children.add(self)
142 _children.discard(self)
160 _children.discard(self)
177 _children.discard(self)
278 global _current_process, _process_counter, _children
284 _children = set()
365 _children = set() variable
/external/python/cpython2/Lib/multiprocessing/
Dprocess.py70 return list(_current_process._children)
78 for p in list(_current_process._children):
80 _current_process._children.discard(p)
134 _current_process._children.add(self)
150 _current_process._children.discard(self)
167 _current_process._children.discard(self)
255 self._children = set()
317 self._children = set()
/external/chromium-trace/catapult/common/py_utils/py_utils/refactor/annotated_symbol/
Dbase_symbol.py26 for i in xrange(len(self._children)):
27 if self._children[i] == child:
29 del self._children[i]
36 self._children.append(child)
Dreference.py62 self._children = self._children[:len(value_parts)]
66 self._children, value_parts):
76 self._children.append(snippet.Symbol(symbol.trailer, token_snippets))
Dimport_statement.py32 return ''.join(token_snippet.value for token_snippet in self._children)
43 self._children = self._children[:len(value_parts)*2-1]
47 self._children[::2], value_parts):
53 self._children.append(snippet.TokenSnippet.Create(token.DOT, '.'))
54 self._children.append(
/external/python/cpython3/Lib/multiprocessing/dummy/
D__init__.py39 self._children = weakref.WeakKeyDictionary()
50 self._parent._children[self] = None
66 current_process()._children = weakref.WeakKeyDictionary()
69 children = current_process()._children
/external/python/cpython2/Lib/multiprocessing/dummy/
D__init__.py66 self._children = weakref.WeakKeyDictionary()
74 self._parent._children[self] = None
97 current_process()._children = weakref.WeakKeyDictionary()
100 children = current_process()._children
/external/cldr/tools/java/org/unicode/cldr/util/
DRegexLookup.java322 List<RTNode> _children = new ArrayList<RTNode>(); field in RegexLookup.RegexTree.RTNode
343 if (_children.size() == 0) { in put()
344 _children.add(node); in put()
348 for (int i = 0; i < _children.size(); i++) { in put()
349 RTNode child = _children.get(i); in put()
392 _children.add(node); in put()
396 newParent._children.add(this._children.get(insertIndex)); in put()
397 newParent._children.add(node); in put()
398 this._children.remove(insertIndex); in put()
399 this._children.add(insertIndex, newParent); in put()
[all …]
/external/python/cpython3/Lib/xml/etree/
DElementTree.py176 self._children = []
206 return len(self._children)
214 return len(self._children) != 0 # emulate old behaviour, for now
217 return self._children[index]
225 self._children[index] = element
228 del self._children[index]
239 self._children.append(subelement)
249 self._children.extend(elements)
254 self._children.insert(index, subelement)
275 self._children.remove(subelement)
[all …]
/external/python/cpython2/Lib/xml/etree/
DElementTree.py212 self._children = []
248 return len(self._children)
256 return len(self._children) != 0 # emulate old behaviour, for now
266 return self._children[index]
281 self._children[index] = element
290 del self._children[index]
302 self._children.append(element)
313 self._children.extend(elements)
322 self._children.insert(index, element)
337 self._children.remove(element)
[all …]
/external/chromium-trace/catapult/common/py_utils/py_utils/refactor/
Dsnippet.py159 self._children = children
171 return self._children
175 self._children = value
/external/autotest/client/bin/net/
Dnet_tc.py60 self._children = []
93 if child_class not in self._children:
103 for child in self._children:
109 children_copy = list(self._children)
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
DPKIXPolicyNode.java28 List _children, in PKIXPolicyNode() argument
36 children = _children; in PKIXPolicyNode()
/external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/jce/provider/
DPKIXPolicyNode.java32 List _children, in PKIXPolicyNode() argument
40 children = _children; in PKIXPolicyNode()
/external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/
DBaseTree.cs52 private IList<ITree> _children; field in Antlr.Runtime.Tree.BaseTree
77 return _children;
82 _children = value;
/external/v8/tools/
Drun_perf.py352 self._children = []
355 self._children.append(child)
508 self._children,
515 self._children,
602 for child in node._children:
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_broadcast/
D1-2.c222 typedef struct _children { struct
227 struct _children *next; argument
/external/python/cpython3/Lib/asyncio/
Dtasks.py616 self._children = children
623 for child in self._children:
/external/python/cpython2/Modules/
D_elementtree.c238 PyObject* _children[STATIC_CHILDREN]; member
286 self->extra->children = self->extra->_children; in element_new_extra()
301 if (self->extra->children != self->extra->_children) in element_dealloc_extra()
331 self->extra->children = self->extra->_children; in element_new()
379 if (self->extra->children != self->extra->_children) { in element_resize()
/external/python/cpython3/Modules/
D_elementtree.c177 PyObject* _children[STATIC_CHILDREN]; member
230 self->extra->children = self->extra->_children; in create_extra()
248 if (extra->children != extra->_children) in dealloc_extra()
461 if (self->extra->children != self->extra->_children) { in element_resize()
901 if (self->extra->children != self->extra->_children) in _elementtree_Element___sizeof___impl()