Home
last modified time | relevance | path

Searched refs:children (Results 1 - 25 of 484) sorted by relevance

12345678910>>...20

/third_party/typescript/tests/baselines/reference/
H A DconditionalTypeDiscriminatingLargeUnionRegularTypeFetchingSpeedReasonable.js5 children: BigUnion[];
9 children: BigUnion[];
13 children: BigUnion[];
17 children: BigUnion[];
21 children: BigUnion[];
25 children: BigUnion[];
29 children: BigUnion[];
33 children: BigUnion[];
37 children: BigUnion[];
41 children
[all...]
H A DjsxChildrenGenericContextualTypes.js5 export interface ElementChildrenAttribute { children: {}; }
9 const Elem = <T,U=never>(p: { prop: T, children: (t: T) => T }) => <div></div>;
10 Elem({prop: {a: "x"}, children: i => ({a: "z"})});
11 const q = <Elem prop={{a: "x"}} children={i => ({a: "z"})} />
14 interface LitProps<T> { prop: T, children: (x: this) => T }
16 ElemLit({prop: "x", children: () => "x"});
17 const j = <ElemLit prop="x" children={() => "x"} />
21 const arg = <ElemLit prop="x" children={p => "y"} />
28 Elem({ prop: { a: "x" }, children: function (i) { return ({ a: "z" }); } });
29 var q = <Elem prop={{ a: "x" }} children
[all...]
H A DlambdaPropSelf.js5 children: string[];
7 constructor (public name: string, children: string[]) {
8 this.children = ko.observableArray(children);
11 addChild = () => this.children.push("New child");
28 function Person(name, children) {
31 this.addChild = function () { return _this.children.push("New child"); };
32 this.children = ko.observableArray(children);
H A DinlineJsxFactoryDeclarationsLocalTypes.js12 children?: Element[];
19 interface ElementChildrenAttribute { children: any; }
32 children?: Element[];
39 interface ElementChildrenAttribute { children: any; }
47 export const MySFC = (props: {x: number, y: number, children?: predom.JSX.Element[]}) => <p>{props.x} + {props.y} = {props.x + props.y}{...this.props.children}</p>;
51 constructor(public props: {x: number, y: number, children?: predom.JSX.Element[]}) {}
55 {...this.props.children}
70 const DOMSFC = (props: {x: number, y: number, children?: dom.JSX.Element[]}) => <p>{props.x} + {props.y} = {props.x + props.y}{props.children}</
[all...]
H A DjsxEmptyExpressionNotCountedAsChild(jsx=react-jsx).js6 children: React.ReactElement<any>
10 return <div>{props.children}</div>
25 return (0, jsx_runtime_1.jsx)("div", { children: props.children });
27 var element = ((0, jsx_runtime_1.jsx)(Wrapper, { children: (0, jsx_runtime_1.jsx)("div", { children: "Hello" }) }));
H A DjsxEmptyExpressionNotCountedAsChild(jsx=react-jsxdev).js6 children: React.ReactElement<any>
10 return <div>{props.children}</div>
26 return (0, jsx_dev_runtime_1.jsxDEV)("div", { children: props.children }, void 0, false, { fileName: _jsxFileName, lineNumber: 9, columnNumber: 11 }, this);
28 var element = ((0, jsx_dev_runtime_1.jsxDEV)(Wrapper, { children: (0, jsx_dev_runtime_1.jsxDEV)("div", { children: "Hello" }, void 0, false, { fileName: _jsxFileName, lineNumber: 15, columnNumber: 6 }, this) }, void 0, false, { fileName: _jsxFileName, lineNumber: 12, columnNumber: 18 }, this));
/third_party/python/Lib/lib2to3/fixes/
H A Dfix_metaclass.py32 for node in parent.children:
35 elif node.type == syms.simple_stmt and node.children:
36 expr_node = node.children[0]
37 if expr_node.type == syms.expr_stmt and expr_node.children:
38 left_side = expr_node.children[0]
49 for node in cls_node.children:
55 for i, node in enumerate(cls_node.children):
63 while cls_node.children[i+1:]:
64 move_node = cls_node.children[i+1]
76 for semi_ind, node in enumerate(stmt_node.children)
[all...]
H A Dfix_itertools_imports.py16 if imports.type == syms.import_as_name or not imports.children:
17 children = [imports]
19 children = imports.children
20 for child in children[::2]:
29 name_node = child.children[0]
40 children = imports.children[:] or [imports]
42 for child in children:
48 while children an
[all...]
/third_party/python/Lib/lib2to3/
H A Dbtm_utils.py24 self.children = []
42 if len(node.alternatives) == len(node.children):
56 if len(node.group) == len(node.children):
98 for child in self.children:
100 if not self.children:
115 node = node.children[0]
119 if len(node.children) <= 2:
121 new_node = reduce_tree(node.children[0], parent)
125 #skip odd children('|' tokens)
126 for child in node.children
[all...]
H A Dfixer_util.py123 children = [Leaf(token.NAME, "from"),
127 imp = Node(syms.import_from, children)
160 if isinstance(node, Node) and node.children == [LParen(), RParen()]:
163 and len(node.children) == 3
164 and isinstance(node.children[0], Leaf)
165 and isinstance(node.children[1], Node)
166 and isinstance(node.children[2], Leaf)
167 and node.children[0].value == "("
168 and node.children[2].value == ")")
173 and len(node.children) >
[all...]
H A Dpytree.py45 children = () # Tuple of subnodes variable in Base
109 for ch in self.parent.children:
111 assert not found, (self.parent.children, self, new)
117 assert found, (self.children, self, new)
119 self.parent.children = l_children
128 if not node.children:
130 node = node.children[0]
141 parent's children before it was removed.
144 for i, node in enumerate(self.parent.children):
147 del self.parent.children[
[all...]
H A Dpatcomp.py75 node = node.children[0] # Avoid unneeded recursion
78 # Skip the odd children since they are just '|' tokens
79 alts = [self.compile_node(ch) for ch in node.children[::2]]
86 units = [self.compile_node(ch) for ch in node.children]
93 pattern = self.compile_basic(node.children[1:])
100 nodes = node.children
114 children = repeat.children
115 child = children[0]
123 assert children[
[all...]
/third_party/skia/third_party/externals/freetype/src/tools/
H A Dglnames.py5020 # which creates a large trie where each node has only one children.
5040 # - The letter is followed by a children count and the value of the
5044 # 127 children.
5049 # num_children 7 Number of children. Can be 0 only if
5054 # children, which must be sorted in increasing order of their first
5065 self.children = {}
5078 if self.children.has_key( letter ):
5079 child = self.children[letter]
5082 self.children[letter] = child
5087 # optimize all children firs
[all...]
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Doptimize.c102 cond->children[0] = prev_branch->cond; in optimize_branches()
104 gpir_node_add_dep(&cond->node, cond->children[0], GPIR_DEP_INPUT); in optimize_branches()
127 if (alu->children[0]->op == gpir_op_not) { in optimize_not()
129 gpir_alu_node *child = gpir_node_to_alu(alu->children[0]); in optimize_not()
130 replace = child->children[0]; in optimize_not()
131 } else if (alu->children[0]->op == gpir_op_ge || in optimize_not()
132 alu->children[0]->op == gpir_op_lt) { in optimize_not()
136 gpir_alu_node *child = gpir_node_to_alu(alu->children[0]); in optimize_not()
137 gpir_op op = alu->children[0]->op == gpir_op_ge ? in optimize_not()
140 new->children[ in optimize_not()
[all...]
H A Dlower.c127 gpir_node *child = neg->children[0]; in gpir_lower_neg()
152 if (alu->children[i] == node) { in gpir_lower_neg()
155 alu->children[i] = child; in gpir_lower_neg()
175 gpir_node *child = alu->children[0]; in gpir_lower_complex()
182 preexp2->children[0] = child; in gpir_lower_complex()
194 complex2->children[0] = child; in gpir_lower_complex()
221 impl->children[0] = child; in gpir_lower_complex()
227 complex1->children[0] = &impl->node; in gpir_lower_complex()
228 complex1->children[1] = &complex2->node; in gpir_lower_complex()
229 complex1->children[ in gpir_lower_complex()
[all...]
/third_party/node/deps/npm/node_modules/path-scurry/dist/cjs/
H A Dindex.js138 // thousands of Path entries when walking extremely large trees, the "children"
140 // LRUCache, indexed by the parent. At any time, Path.children() may return an
141 // empty array, indicating that it doesn't know about any of its children, and
147 //need to pass a reference to the children array that we started with.
156 // parent + children
292 #children;
311 constructor(name, type = UNKNOWN, root, roots, nocase, children, opts) {
318 this.#children = children;
346 return this.#children;
[all...]
/third_party/node/deps/npm/node_modules/path-scurry/dist/mjs/
H A Dindex.js111 // thousands of Path entries when walking extremely large trees, the "children"
113 // LRUCache, indexed by the parent. At any time, Path.children() may return an
114 // empty array, indicating that it doesn't know about any of its children, and
120 //need to pass a reference to the children array that we started with.
129 // parent + children
264 #children;
283 constructor(name, type = UNKNOWN, root, roots, nocase, children, opts) {
290 this.#children = children;
318 return this.#children;
[all...]
/third_party/ltp/testcases/open_posix_testsuite/conformance/interfaces/pthread_cond_broadcast/
H A D2-3.c48 for (_nch = 0; _nch < children.nb; _nch++) \
49 kill(children.ch[_nch].p, SIGKILL); \
56 for (_nch = 0; _nch < children.nb; _nch++) \
57 kill(children.ch[_nch].p, SIGKILL); \
158 } children; variable
430 /* Create all the children */ in main()
431 for (children.nb = 0; children.nb < NCHILDREN; children.nb++) { in main()
435 (children in main()
[all...]
/third_party/node/deps/v8/tools/cppgc/
H A Dgen_cmake.py107 for stmt in tree.children:
110 target_type = stmt.children[0]
113 target = stmt.children[1].children[0].strip('\"')
117 self._Target(target_type, target, stmt.children[2].children)
132 return self.STATEMENTS[stmt.data](self, *stmt.children)
140 self.current_target, [str(token) for token in right.children])
145 self.current_target, [str(token) for token in right.children])
150 self.current_target, [str(token) for token in right.children])
[all...]
/third_party/protobuf/java/util/src/main/java/com/google/protobuf/util/
H A DFieldMaskTree.java70 final SortedMap<String, Node> children = new TreeMap<>(); field in FieldMaskTree.Node
112 if (!createNewBranch && node != root && node.children.isEmpty()) { in addFieldPath()
116 if (node.children.containsKey(part)) { in addFieldPath()
117 node = node.children.get(part); in addFieldPath()
121 node.children.put(part, tmp); in addFieldPath()
126 node.children.clear(); in addFieldPath()
155 if (!node.children.containsKey(key)) { in removeFieldPath()
161 node.children.remove(key); in removeFieldPath()
164 node = node.children.get(key); in removeFieldPath()
182 if (root.children in toFieldMask()
[all...]
/third_party/skia/third_party/externals/oboe/docs/reference/
H A Dmenudata.js24 var menudata={children:[
27 {text:"Namespaces",url:"namespaces.html",children:[
29 {text:"Namespace Members",url:"namespacemembers.html",children:[
30 {text:"All",url:"namespacemembers.html",children:[
49 {text:"Classes",url:"annotated.html",children:[
53 {text:"Class Members",url:"functions.html",children:[
54 {text:"All",url:"functions.html",children:[
72 {text:"Functions",url:"functions_func.html",children:[
89 {text:"Files",url:"files.html",children:[
/third_party/protobuf/src/google/protobuf/util/
H A Dfield_mask_util.cc197 // children removed because the path matches all the node's children.
216 if (root_.children.empty()) { in MergeMessage()
228 if (root_.children.empty()) { in AddRequiredFieldPath()
238 if (root_.children.empty()) { in TrimMessage()
251 for (std::map<std::string, Node*>::iterator it = children.begin(); in ClearChildren()
252 it != children.end(); ++it) { in ClearChildren()
255 children.clear(); in ClearChildren()
258 std::map<std::string, Node*> children; member
309 if (node->children in MergeToFieldMask()
[all...]
/third_party/node/src/permission/
H A Dfs_permission.h24 std::unordered_map<char, Node*> children; member
35 Node* child = children[label]; in CreateChild()
37 children[label] = new Node(prefix); in CreateChild()
38 return children[label]; in CreateChild()
51 split_child->children[child_prefix[0]] = child; in CreateChild()
52 children[parent_prefix[0]] = split_child; in CreateChild()
73 auto it = children.find(path[idx]); in NextNode()
74 if (it == children.end()) { in NextNode()
100 // A node can be a *end* node and have children
112 if (children in IsEndNode()
[all...]
/third_party/python/Tools/peg_generator/pegen/
H A Dgrammar_visualizer.py15 def children(self, node: Rule) -> Iterator[Any]: member in ASTGrammarPrinter
23 if not list(self.children(node)):
33 children = list(self.children(node))
39 if not children:
42 *children, last = children
43 for child in children:
/third_party/vk-gl-cts/external/vulkancts/framework/vulkan/
H A DvkBinaryRegistry.cpp223 std::vector<SparseIndexNode*> children; member
237 for (size_t ndx = 0; ndx < children.size(); ndx++) in ~SparseIndexNode()
238 delete children[ndx]; in ~SparseIndexNode()
256 for (size_t childNdx = 0; childNdx < group->children.size(); childNdx++) in addToSparseIndex()
258 if (group->children[childNdx]->word == curWord) in addToSparseIndex()
260 child = group->children[childNdx]; in addToSparseIndex()
269 group->children.reserve(group->children.size()+1); in addToSparseIndex()
270 group->children.push_back(new SparseIndexNode(curWord, numWords == 1 ? index : 0)); in addToSparseIndex()
272 child = group->children in addToSparseIndex()
[all...]

Completed in 11 milliseconds

12345678910>>...20