Searched defs:children (Results 1 - 25 of 383) sorted by path

1234567891011>>

/external/antlr/antlr-3.4/lib/
H A Dantlr-3.4-complete.jarMETA-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ...
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/
H A DFlexAntTasks.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ...
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3basetree.h46 /// actually have any user data. ANTLR v3 uses a list of children approach
48 /// an empty node whose children represent the list. An empty (as in it does not
64 /// The list of all the children that belong to this node. They are not part of the node
67 pANTLR3_VECTOR children; member in struct:ANTLR3_BASE_TREE_struct
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/
H A DBaseTree.cs41 * actually have any user data. ANTLR v3 uses a list of children approach
43 * an empty node whose children represent the list. An empty, but
49 List<ITree> children; field in class:Antlr.Runtime.Tree.BaseTree
56 * as there are no fields other than the children list, which cannot
57 * be copied as the children are not considered part of this node.
64 * Get the children internal List; note that if you directly mess with
70 return children;
145 if (children == null || i >= children.Count)
148 return children[
[all...]
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
H A DBaseTree.java34 * actually have any user data. ANTLR v3 uses a list of children approach
36 * an empty node whose children represent the list. An empty, but
40 protected List children; field in class:BaseTree
46 * as there are no fields other than the children list, which cannot
47 * be copied as the children are not considered part of this node.
53 if ( children==null || i>=children.size() ) {
56 return (Tree)children.get(i);
59 /** Get the children internal List; note that if you directly mess with
63 return children;
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Headers/
H A DANTLRBaseTree.h31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/A/Headers/
H A DANTLRBaseTree.h31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/ANTLR.framework/Versions/Current/Headers/
H A DANTLRBaseTree.h31 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
46 // is nil, add all children of t to this' children.
56 // Indicates the node is a nil node but may still have children, meaning
77 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
100 NSMutableArray *children; variable
104 @property (retain, getter=getChildren, setter=setChildren) NSMutableArray *children; variable
121 // is nil, add all children of t to this' children.
130 // Indicates the node is a nil node but may still have children, meanin
[all...]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/
H A DANTLRBaseTree.h42 - (AMutableArray *)children;
48 // is nil, add all children of t to this' children.
58 // Indicates the node is a nil node but may still have children, meaning
79 - (id) copyWithZone:(NSZone *)aZone; // the children themselves are not copied here!
98 @property (retain) AMutableArray *children; variable
105 __strong AMutableArray *children; variable
117 - (AMutableArray *)children;
125 // is nil, add all children of t to this' children
173 @property (retain) AMutableArray *children; variable
[all...]
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/test/
H A Dcore-extensions.rb212 def self.children( directory ) singleton method in class:Dir
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/
H A Dtree.rb196 source text embodied within the tree and its children.
210 than one children -- functions like an array of
213 [leaf] a node that does not have any children
231 #attr_reader :children
251 children.nil? or children.empty?
255 children and children.include?( node )
264 parent.children.reject { | c | c.equal?( self ) }
288 stack.push( cursor.children
323 def children() self end method in class:ANTLR3.BaseTree
[all...]
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/
H A DCompositeGrammarTree.java35 protected List<CompositeGrammarTree> children; field in class:CompositeGrammarTree
50 if ( children==null ) {
51 children = new ArrayList<CompositeGrammarTree>();
53 children.add(t);
62 for (int i = 0; r==null && children!=null && i < children.size(); i++) {
63 CompositeGrammarTree child = children.get(i);
93 for (int i = 0; n==null && children!=null && i < children.size(); i++) {
94 CompositeGrammarTree child = children
[all...]
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/
H A DPKIXPolicyNode.java13 protected List children; field in class:PKIXPolicyNode
36 children = _children;
48 children.add(_child);
54 return children.iterator();
84 return !children.isEmpty();
94 children.remove(_child);
119 for(int i = 0; i < children.size(); i++)
121 _buf.append(((PKIXPolicyNode)children.get(i)).toString(_indent + " "));
158 _iter = children.iterator();
/external/chromium_org/ash/display/
H A Dscreen_position_controller.cc35 // Move all transient children to |dst_root|, including the ones in
36 // the child windows and transient children of the transient children.
53 // Transient children may have transient children.
56 // Move transient children of the child windows if any.
57 aura::Window::Windows children = window->children(); local
58 for (aura::Window::Windows::iterator iter = children.begin();
59 iter != children
[all...]
/external/chromium_org/ash/wm/
H A Dmru_window_tracker.cc31 const MruWindowTracker::WindowList& children(container->children());
32 windows->insert(windows->end(), children.begin(), children.end());
40 const MruWindowTracker::WindowList& children = container->children(); local
41 for (MruWindowTracker::WindowList::const_iterator iter = children.begin();
42 iter != children.end(); ++iter) {
H A Dsession_state_animator_impl.cc516 aura::Window::Windows children = non_lock_screen_containers->children(); local
518 for (aura::Window::Windows::const_iterator it = children.begin();
519 it != children.end(); ++it) {
H A Dwindow_util.cc193 aura::Window::Windows children = parent->children(); local
194 for (aura::Window::Windows::iterator iter = children.begin();
195 iter != children.end();
/external/chromium_org/ash/wm/workspace/
H A Dworkspace_window_resizer.cc759 // Test all children from the desktop in each root window.
760 const aura::Window::Windows& children = Shell::GetContainer( local
761 root_window, kShellWindowId_DefaultContainer)->children();
762 for (aura::Window::Windows::const_reverse_iterator i = children.rbegin();
763 i != children.rend() && !matcher.AreEdgesObscured(); ++i) {
980 // Build a map from index in children to window, returning if there is a
985 const aura::Window::Windows& windows(parent->children());
/external/chromium_org/athena/content/
H A Dapp_activity_registry.cc123 const aura::Window::Windows& children = local
126 for (aura::Window::Windows::const_iterator child_iterator = children.begin();
127 child_iterator != children.end(); ++child_iterator) {
/external/chromium_org/athena/resource_manager/
H A Dresource_manager_impl.cc421 const aura::Window::Windows children = local
425 children.rbegin();
426 child_iterator != children.rend(); ++child_iterator) {
/external/chromium_org/athena/screen/
H A Dscreen_manager_impl.cc68 window->GetRootWindow()->children();
164 container_->GetRootWindow()->children();
242 aura::Window::Windows children = root_window_->children(); local
243 // Close All children:
244 for (aura::Window::Windows::iterator iter = children.begin();
245 iter != children.end();
307 const aura::Window::Windows& children = root_window_->children(); local
310 DCHECK(std::find_if(children
[all...]
H A Dscreen_manager_unittest.cc43 const aura::Window::Windows& children = parent->children(); local
44 aura::Window::Windows::const_iterator begin_iter = children.begin();
45 aura::Window::Windows::const_iterator end_iter = children.end();
59 size_t num_containers = root_window()->children().size();
64 const aura::Window::Windows& containers = root_window()->children();
/external/chromium_org/base/json/
H A Djson_value_converter_unittest.cc83 ScopedVector<SimpleMessage> children; member in struct:base::__anon2301::NestedMessage
91 converter->RegisterRepeatedMessage("children", &NestedMessage::children);
137 " \"children\": [{\n"
165 EXPECT_EQ(2, static_cast<int>(message.children.size()));
166 const SimpleMessage* first_child = message.children[0];
175 const SimpleMessage* second_child = message.children[1];
/external/chromium_org/cc/layers/
H A Dlayer.cc97 // Remove the parent reference from all children and dependents.
351 void Layer::SetChildren(const LayerList& children) { argument
353 if (children == children_)
357 for (size_t i = 0; i < children.size(); ++i)
358 AddChild(children[i]);
1030 // many children as the number of layers they own delegated quads for.
H A Dlayer.h94 void SetChildren(const LayerList& children);
97 const LayerList& children() const { return children_; } function in class:cc::Layer
513 // The number of direct children or dependent layers that need to be recursed
567 // scroll children.
571 // children.

Completed in 644 milliseconds

1234567891011>>