Home
last modified time | relevance | path

Searched refs:nodes (Results 26 - 50 of 484) sorted by relevance

12345678910>>...20

/third_party/python/Lib/lib2to3/
H A Dpatcomp.py100 nodes = node.children
101 if len(nodes) >= 3 and nodes[1].type == token.EQUAL:
102 name = nodes[0].value
103 nodes = nodes[2:]
105 if len(nodes) >= 2 and nodes[-1].type == self.syms.Repeater:
106 repeat = nodes[-1]
107 nodes
[all...]
H A Dpytree.py56 Compare two nodes for equality.
68 Compare two nodes for equality.
70 This is called by __eq__ and __ne__. It is only called if the two nodes
209 """Concrete implementation for interior nodes."""
219 child nodes, and an optional context keyword argument.
254 """Compare two nodes for equality."""
319 """Concrete implementation for leaf nodes."""
363 """Compare two nodes for equality."""
427 - WildcardPattern matches a sequence of nodes of variable length.
461 updated with the nodes matchin
[all...]
/foundation/window/window_manager/wmserver/src/
H A Daccessibility_connection.cpp39 std::vector<sptr<WindowNode>> nodes; in NotifyAccessibilityWindowInfo() local
40 nodes.emplace_back(node); in NotifyAccessibilityWindowInfo()
42 NotifyAccessibilityWindowInfo(nodes, container->GetFocusWindow(), type); in NotifyAccessibilityWindowInfo()
46 const std::vector<sptr<WindowNode>>& nodes, WindowUpdateType type) in NotifyAccessibilityWindowInfo()
48 if (nodes.empty()) { in NotifyAccessibilityWindowInfo()
49 WLOGFE("nodes is empty"); in NotifyAccessibilityWindowInfo()
58 NotifyAccessibilityWindowInfo(nodes, container->GetFocusWindow(), type); in NotifyAccessibilityWindowInfo()
68 std::vector<sptr<WindowNode>> nodes; in NotifyAccessibilityWindowInfo() local
69 container->TraverseContainer(nodes); in NotifyAccessibilityWindowInfo()
71 NotifyAccessibilityWindowInfo(nodes, containe in NotifyAccessibilityWindowInfo()
45 NotifyAccessibilityWindowInfo(DisplayId displayId, const std::vector<sptr<WindowNode>>& nodes, WindowUpdateType type) NotifyAccessibilityWindowInfo() argument
74 NotifyAccessibilityWindowInfo(const std::vector<sptr<WindowNode>>& nodes, uint32_t focusedWindow, WindowUpdateType type) const NotifyAccessibilityWindowInfo() argument
86 FillAccessibilityWindowInfo(const std::vector<sptr<WindowNode>>& nodes, uint32_t focusedWindow, std::vector<sptr<AccessibilityWindowInfo>>& infos) const FillAccessibilityWindowInfo() argument
123 std::vector<sptr<WindowNode>> nodes; GetAccessibilityWindowInfo() local
[all...]
/third_party/jinja2/
H A Doptimizer.py12 from . import nodes namespace
19 def optimize(node: nodes.Node, environment: "Environment") -> nodes.Node:
23 return t.cast(nodes.Node, optimizer.visit(node))
31 self, node: nodes.Node, *args: t.Any, **kwargs: t.Any
32 ) -> nodes.Node:
35 # Do constant folding. Some other nodes besides Expr have
37 if isinstance(node, nodes.Expr):
39 return nodes.Const.from_untrusted(
44 except nodes
[all...]
H A Dext.py9 from . import nodes namespace
117 def parse(self, parser: "Parser") -> t.Union[nodes.Node, t.List[nodes.Node]]:
121 list of multiple nodes.
127 ) -> nodes.ExtensionAttribute:
135 return nodes.ExtensionAttribute(self.identifier, name, lineno=lineno)
140 args: t.Optional[t.List[nodes.Expr]] = None,
141 kwargs: t.Optional[t.List[nodes.Keyword]] = None,
142 dyn_args: t.Optional[nodes.Expr] = None,
143 dyn_kwargs: t.Optional[nodes
[all...]
H A Dcompiler.py1 """Compiles nodes from the parser into Python code."""
12 from . import nodes namespace
19 from .nodes import EvalContext
45 self: "CodeGenerator", node: nodes.Expr, frame: "Frame", **kwargs: t.Any
59 def _make_binop(op: str) -> t.Callable[["CodeGenerator", nodes.BinExpr, "Frame"], None]:
61 def visitor(self: "CodeGenerator", node: nodes.BinExpr, frame: Frame) -> None:
83 ) -> t.Callable[["CodeGenerator", nodes.UnaryExpr, "Frame"], None]:
85 def visitor(self: "CodeGenerator", node: nodes.UnaryExpr, frame: Frame) -> None:
102 node: nodes.Template,
111 if not isinstance(node, nodes
[all...]
H A Didtracking.py3 from . import nodes namespace
13 nodes: t.Iterable[nodes.Node], parent_symbols: t.Optional["Symbols"] = None
17 for node in nodes:
23 node: nodes.Node, parent_symbols: t.Optional["Symbols"] = None
46 def analyze_node(self, node: nodes.Node, **kwargs: t.Any) -> None:
178 def _simple_visit(self, node: nodes.Node, **kwargs: t.Any) -> None:
190 def visit_AssignBlock(self, node: nodes.AssignBlock, **kwargs: t.Any) -> None:
194 def visit_CallBlock(self, node: nodes.CallBlock, **kwargs: t.Any) -> None:
198 def visit_OverlayScope(self, node: nodes
[all...]
/third_party/node/test/fixtures/wpt/encoding/resources/
H A Ddecode-common.js11 nodes = iframe.querySelectorAll("span");
13 for (var i = 0; i < nodes.length; i++) {
16 nodes[i].dataset.cp +
18 String.fromCodePoint(parseInt(nodes[i].dataset.cp, 16)) +
20 decoder(nodes[i].dataset.bytes) +
22 nodes[i].dataset.bytes
29 for (var i = 0; i < nodes.length; i++) {
33 nodes[i].textContent,
34 decoder(nodes[i].dataset.bytes)
/foundation/communication/dsoftbus/core/bus_center/utils/src/
H A Dlnn_map.c65 node->next = map->nodes[idx]; in MapAddNode()
66 map->nodes[idx] = node; in MapAddNode()
72 MapNode **nodes = NULL; in MapResize() local
75 nodes = (MapNode **)SoftBusCalloc(size * sizeof(*nodes)); in MapResize()
76 if (nodes == NULL) { in MapResize()
81 tmp = map->nodes; in MapResize()
83 map->nodes = nodes; in MapResize()
153 if (map->nodeSize > 0 && map->nodes ! in LnnMapSet()
[all...]
/third_party/python/Doc/tools/extensions/
H A Dpyspecific.py21 from docutils import nodes, utils namespace
32 from sphinx.util.nodes import split_explicit_title
70 refnode = nodes.reference(text, text, refuri=ISSUE_URI % issue)
86 refnode = nodes.reference(text, text, refuri=GH_ISSUE_URI % issue)
96 refnode = nodes.reference(title, title, refuri=SOURCE_URI % target)
112 pnode = nodes.compound(classes=['impl-detail'])
115 add_text = nodes.strong(label, label)
117 content = nodes.inline(pnode[0].rawsource, translatable=True)
121 pnode[0].replace_self(nodes.paragraph(
122 '', '', add_text, nodes
[all...]
/third_party/node/deps/v8/third_party/jinja2/
H A Dmeta.py5 from . import nodes namespace
69 (nodes.Extends, nodes.FromImport, nodes.Import, nodes.Include)
71 if not isinstance(node.template, nodes.Const):
73 if isinstance(node.template, (nodes.Tuple, nodes.List)):
77 if isinstance(template_name, nodes.Const):
93 elif isinstance(node, nodes
[all...]
H A Dparser.py2 """Parse tokens from the lexer into nodes for the compiler."""
3 from . import nodes namespace
29 "add": nodes.Add,
30 "sub": nodes.Sub,
31 "mul": nodes.Mul,
32 "div": nodes.Div,
33 "floordiv": nodes.FloorDiv,
34 "mod": nodes.Mod,
126 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
128 rv = object.__new__(nodes
[all...]
/third_party/node/tools/inspector_protocol/jinja2/
H A Dmeta.py12 from jinja2 import nodes namespace
75 for node in ast.find_all((nodes.Extends, nodes.FromImport, nodes.Import,
76 nodes.Include)):
77 if not isinstance(node.template, nodes.Const):
79 if isinstance(node.template, (nodes.Tuple, nodes.List)):
83 if isinstance(template_name, nodes.Const):
99 elif isinstance(node, nodes
[all...]
H A Dparser.py11 from jinja2 import nodes namespace
23 'add': nodes.Add,
24 'sub': nodes.Sub,
25 'mul': nodes.Mul,
26 'div': nodes.Div,
27 'floordiv': nodes.FloorDiv,
28 'mod': nodes.Mod,
115 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
117 rv = object.__new__(nodes.InternalName)
118 nodes
[all...]
/third_party/ltp/testcases/kernel/syscalls/mbind/
H A Dmbind02.c29 static struct tst_nodemap *nodes; variable
35 nodes = tst_get_nodemap(TST_NUMA_MEM, 2 * page_size / 1024); in setup()
36 if (nodes->cnt <= 1) in setup()
37 tst_brk(TCONF, "Test requires at least two NUMA memory nodes"); in setup()
42 tst_nodemap_free(nodes); in cleanup()
54 tst_nodemap_reset_counters(nodes); in verify_policy()
56 tst_nodemap_count_pages(nodes, ptr, size); in verify_policy()
57 tst_nodemap_print_counters(nodes); in verify_policy()
59 for (i = 0; i < nodes->cnt; i++) { in verify_policy()
60 if (!nodes in verify_policy()
[all...]
/third_party/skia/third_party/externals/jinja2/
H A Dmeta.py5 from . import nodes namespace
69 (nodes.Extends, nodes.FromImport, nodes.Import, nodes.Include)
71 if not isinstance(node.template, nodes.Const):
73 if isinstance(node.template, (nodes.Tuple, nodes.List)):
77 if isinstance(template_name, nodes.Const):
93 elif isinstance(node, nodes
[all...]
H A Dparser.py2 """Parse tokens from the lexer into nodes for the compiler."""
3 from . import nodes namespace
29 "add": nodes.Add,
30 "sub": nodes.Sub,
31 "mul": nodes.Mul,
32 "div": nodes.Div,
33 "floordiv": nodes.FloorDiv,
34 "mod": nodes.Mod,
126 """Return a new free identifier as :class:`~jinja2.nodes.InternalName`."""
128 rv = object.__new__(nodes
[all...]
/third_party/node/deps/v8/tools/clusterfuzz/js_fuzzer/mutators/
H A Dfunction_call_mutator.js18 function _liftExpressionsToStatements(path, nodes) {
20 // lift the replacement nodes into statements too.
22 return nodes;
25 return nodes.map(n => babelTypes.expressionStatement(n));
67 const nodes = [
82 nodes.push(path.node);
84 path, babelTypes.sequenceExpression(nodes));
87 path, _liftExpressionsToStatements(path, nodes));
93 const nodes = [
100 nodes[
[all...]
/third_party/ltp/testcases/kernel/lib/
H A Dnuma_helper.c78 * set of nodes anyway. in filter_nodemask_mem()
140 * get_allowed_nodes_arr - get number and array of available nodes
141 * @num_nodes: pointer where number of available nodes will be stored
142 * @nodes: array of available node ids, this is MPOL_F_MEMS_ALLOWED
152 int get_allowed_nodes_arr(int flag, int *num_nodes, int **nodes) in get_allowed_nodes_arr() argument
160 if (nodes) in get_allowed_nodes_arr()
161 *nodes = NULL; in get_allowed_nodes_arr()
173 if (nodes) in get_allowed_nodes_arr()
174 *nodes = malloc(sizeof(int) * max_node); in get_allowed_nodes_arr()
177 if (nodemask == NULL || (nodes in get_allowed_nodes_arr()
221 int *nodes = NULL; get_allowed_nodes() local
[all...]
/third_party/node/deps/npm/test/lib/utils/
H A Dsbom-cyclonedx.js75 const res = cyclonedxOutput({ npm, nodes: [root], packageType: 'application' })
81 const res = cyclonedxOutput({ npm, nodes: [root], packageLockOnly: true })
88 const res = cyclonedxOutput({ npm, nodes: [node] })
96 const res = cyclonedxOutput({ npm, nodes: [node] })
104 const res = cyclonedxOutput({ npm, nodes: [node] })
112 const res = cyclonedxOutput({ npm, nodes: [node] })
119 const res = cyclonedxOutput({ npm, nodes: [node] })
126 const res = cyclonedxOutput({ npm, nodes: [node] })
133 const res = cyclonedxOutput({ npm, nodes: [node] })
141 const res = cyclonedxOutput({ npm, nodes
[all...]
/third_party/typescript/tests/baselines/reference/
H A DexpressionTypeNodeShouldError.js17 const nodes = document.getElementsByTagName("li");
18 type ItemType = "".typeof(nodes.item(0));
32 type ItemType2 = 4..typeof(nodes.item(0));
46 type ItemType3 = true.typeof(nodes.item(0));
60 var nodes = document.getElementsByTagName("li"); variable
61 typeof (nodes.item(0));
73 typeof (nodes.item(0));
85 typeof (nodes.item(0));
/third_party/node/deps/brotli/c/enc/
H A Dbackward_references_hq.c246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
248 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos, in UpdateZopfliNode() argument
251 ZopfliNode* next = &nodes[pos + len]; in UpdateZopfliNode()
303 const ZopfliNode* nodes, in ComputeMinimumCopyLength()
311 while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) { in ComputeMinimumCopyLength()
327 /* REQUIRES: nodes[pos].cost < kInfinity
328 REQUIRES: nodes[0..pos] satisfies that "ZopfliNode array invariant". */
333 const ZopfliNode* nodes) { in ComputeDistanceShortcut()
334 const size_t clen = ZopfliNodeCopyLength(&nodes[pos]); in ComputeDistanceShortcut()
335 const size_t ilen = nodes[po in ComputeDistanceShortcut()
302 ComputeMinimumCopyLength(const float start_cost, const ZopfliNode* nodes, const size_t num_bytes, const size_t pos) ComputeMinimumCopyLength() argument
329 ComputeDistanceShortcut(const size_t block_start, const size_t pos, const size_t max_backward_limit, const size_t gap, const ZopfliNode* nodes) ComputeDistanceShortcut() argument
360 ComputeDistanceCache(const size_t pos, const int* starting_dist_cache, const ZopfliNode* nodes, int* dist_cache) ComputeDistanceCache() argument
381 EvaluateNode( const size_t block_start, const size_t pos, const size_t max_backward_limit, const size_t gap, const int* starting_dist_cache, const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) EvaluateNode() argument
402 UpdateNodes( const size_t num_bytes, const size_t block_start, const size_t pos, const uint8_t* ringbuffer, const size_t ringbuffer_mask, const BrotliEncoderParams* params, const size_t max_backward_limit, const int* starting_dist_cache, const size_t num_matches, const BackwardMatch* matches, const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) UpdateNodes() argument
554 ComputeShortestPathFromNodes(size_t num_bytes, ZopfliNode* nodes) ComputeShortestPathFromNodes() argument
571 BrotliZopfliCreateCommands(const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes, int* dist_cache, size_t* last_insert_len, const BrotliEncoderParams* params, Command* commands, size_t* num_literals) BrotliZopfliCreateCommands() argument
616 ZopfliIterate(size_t num_bytes, size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask, const BrotliEncoderParams* params, const size_t gap, const int* dist_cache, const ZopfliCostModel* model, const uint32_t* num_matches, const BackwardMatch* matches, ZopfliNode* nodes) ZopfliIterate() argument
657 BrotliZopfliComputeShortestPath(MemoryManager* m, size_t num_bytes, size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask, ContextLut literal_context_lut, const BrotliEncoderParams* params, const int* dist_cache, Hasher* hasher, ZopfliNode* nodes) BrotliZopfliComputeShortestPath() argument
727 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1); BrotliCreateZopfliBackwardReferences() local
757 ZopfliNode* nodes; BrotliCreateHqZopfliBackwardReferences() local
[all...]
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dbackward_references_hq.c246 /* REQUIRES: cost < kInfinity, nodes[start_pos].cost < kInfinity */
248 static BROTLI_INLINE void UpdateZopfliNode(ZopfliNode* nodes, size_t pos, in UpdateZopfliNode() argument
251 ZopfliNode* next = &nodes[pos + len]; in UpdateZopfliNode()
303 const ZopfliNode* nodes, in ComputeMinimumCopyLength()
311 while (pos + len <= num_bytes && nodes[pos + len].u.cost <= min_cost) { in ComputeMinimumCopyLength()
327 /* REQUIRES: nodes[pos].cost < kInfinity
328 REQUIRES: nodes[0..pos] satisfies that "ZopfliNode array invariant". */
333 const ZopfliNode* nodes) { in ComputeDistanceShortcut()
334 const size_t clen = ZopfliNodeCopyLength(&nodes[pos]); in ComputeDistanceShortcut()
335 const size_t ilen = nodes[po in ComputeDistanceShortcut()
302 ComputeMinimumCopyLength(const float start_cost, const ZopfliNode* nodes, const size_t num_bytes, const size_t pos) ComputeMinimumCopyLength() argument
329 ComputeDistanceShortcut(const size_t block_start, const size_t pos, const size_t max_backward_limit, const size_t gap, const ZopfliNode* nodes) ComputeDistanceShortcut() argument
360 ComputeDistanceCache(const size_t pos, const int* starting_dist_cache, const ZopfliNode* nodes, int* dist_cache) ComputeDistanceCache() argument
381 EvaluateNode( const size_t block_start, const size_t pos, const size_t max_backward_limit, const size_t gap, const int* starting_dist_cache, const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) EvaluateNode() argument
402 UpdateNodes( const size_t num_bytes, const size_t block_start, const size_t pos, const uint8_t* ringbuffer, const size_t ringbuffer_mask, const BrotliEncoderParams* params, const size_t max_backward_limit, const int* starting_dist_cache, const size_t num_matches, const BackwardMatch* matches, const ZopfliCostModel* model, StartPosQueue* queue, ZopfliNode* nodes) UpdateNodes() argument
554 ComputeShortestPathFromNodes(size_t num_bytes, ZopfliNode* nodes) ComputeShortestPathFromNodes() argument
571 BrotliZopfliCreateCommands(const size_t num_bytes, const size_t block_start, const ZopfliNode* nodes, int* dist_cache, size_t* last_insert_len, const BrotliEncoderParams* params, Command* commands, size_t* num_literals) BrotliZopfliCreateCommands() argument
616 ZopfliIterate(size_t num_bytes, size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask, const BrotliEncoderParams* params, const size_t gap, const int* dist_cache, const ZopfliCostModel* model, const uint32_t* num_matches, const BackwardMatch* matches, ZopfliNode* nodes) ZopfliIterate() argument
657 BrotliZopfliComputeShortestPath(MemoryManager* m, size_t num_bytes, size_t position, const uint8_t* ringbuffer, size_t ringbuffer_mask, ContextLut literal_context_lut, const BrotliEncoderParams* params, const int* dist_cache, Hasher* hasher, ZopfliNode* nodes) BrotliZopfliComputeShortestPath() argument
727 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, num_bytes + 1); BrotliCreateZopfliBackwardReferences() local
757 ZopfliNode* nodes; BrotliCreateHqZopfliBackwardReferences() local
[all...]
/third_party/nghttp2/tests/
H A Dnghttp2_pq_test.c146 node nodes[10]; in test_nghttp2_pq_update() local
153 for (i = 0; i < (int)(sizeof(nodes) / sizeof(nodes[0])); ++i) { in test_nghttp2_pq_update()
154 nodes[i].key = i; in test_nghttp2_pq_update()
155 nodes[i].val = i; in test_nghttp2_pq_update()
156 nghttp2_pq_push(&pq, &nodes[i].ent); in test_nghttp2_pq_update()
161 for (i = 0; i < (int)(sizeof(nodes) / sizeof(nodes[0])); ++i) { in test_nghttp2_pq_update()
191 node nodes[10]; in test_nghttp2_pq_remove() local
201 push_nodes(&pq, nodes, in test_nghttp2_pq_remove()
[all...]
/third_party/node/deps/npm/node_modules/archy/
H A Dindex.js17 var nodes = obj.nodes || []; variable
19 var splitter = '\n' + prefix + (nodes.length ? chr('│') : ' ') + ' ';
23 + nodes.map(function (node, ix) {
24 var last = ix === nodes.length - 1;
25 var more = node.nodes && node.nodes.length;

Completed in 12 milliseconds

12345678910>>...20