Home
last modified time | relevance | path

Searched refs:nodes (Results 426 - 450 of 484) sorted by relevance

1...<<11121314151617181920

/third_party/node/tools/inspector_protocol/jinja2/
H A Dnodes.py3 jinja2.nodes
6 This module implements additional nodes derived from the ast base node.
10 python and jinja nodes.
60 """A metaclass for nodes that handles the field and attribute
108 """Baseclass for all Jinja2 nodes. There are a number of nodes available
113 - :class:`Helper`: helper nodes
116 All nodes have fields and attributes. Fields may be other nodes, lists,
121 all nodes automaticall
[all...]
H A Druntime.py16 from jinja2.nodes import EvalContext, _context_function_types
/third_party/skia/third_party/externals/jinja2/
H A Dnodes.py2 """AST nodes generated by the parser for the compiler. Also provides
4 to normalize nodes.
45 """A metaclass for nodes that handles the field and attribute
95 """Baseclass for all Jinja nodes. There are a number of nodes available
100 - :class:`Helper`: helper nodes
103 All nodes have fields and attributes. Fields may be other nodes, lists,
108 all nodes automatically.
117 raise TypeError("abstract nodes ar
[all...]
H A Druntime.py23 from .nodes import EvalContext
/foundation/arkui/ace_engine/frameworks/core/components_ng/manager/drag_drop/
H A Ddrag_drop_manager.cpp521 void DragDropManager::NotifyDragRegisterFrameNode(std::unordered_map<int32_t, WeakPtr<FrameNode>> nodes, in NotifyDragRegisterFrameNode() argument
524 for (auto iter = nodes.begin(); iter != nodes.end(); iter++) { in NotifyDragRegisterFrameNode()
/foundation/arkui/ace_engine/frameworks/bridge/declarative_frontend/engine/
H A DjsXNode.js530 let nodes = getUINativeModule().nodeAdapter.getAllItems(this.nativePtr_);
531 if (nodes !== undefined) {
532 nodes.forEach(node => {
/third_party/ffmpeg/libavformat/
H A Ddashdec.c519 static char *get_val_from_nodes_tab(xmlNodePtr *nodes, const int n_nodes, const char *attrname) in get_val_from_nodes_tab() argument
525 if (nodes[i]) { in get_val_from_nodes_tab()
526 val = xmlGetProp(nodes[i], attrname); in get_val_from_nodes_tab()
/third_party/PyYAML/yaml/
H A D_yaml.pyx57 ScalarNode = yaml.nodes.ScalarNode
58 SequenceNode = yaml.nodes.SequenceNode
59 MappingNode = yaml.nodes.MappingNode
/third_party/mesa3d/src/broadcom/vulkan/
H A Dv3dv_device.c737 const char *path = drm_render_device->nodes[DRM_NODE_RENDER]; in physical_device_init()
753 primary_path = drm_primary_device->nodes[DRM_NODE_PRIMARY]; in physical_device_init()
757 primary_path = drm_render_device->nodes[DRM_NODE_PRIMARY]; in physical_device_init()
793 /* There is only one device with primary and render nodes. in physical_device_init()
/base/telephony/core_service/services/sim/src/
H A Desim_file.cpp2359 std::list<std::shared_ptr<Asn1Node>> nodes; in RetrieveNotificatioParseTagCtxComp0() local
2366 if (compNode->Asn1GetChildren(TAG_ESIM_SEQUENCE, nodes) != 0) { in RetrieveNotificatioParseTagCtxComp0()
2369 if (nodes.empty()) { in RetrieveNotificatioParseTagCtxComp0()
2374 std::shared_ptr<Asn1Node> firstNode = nodes.front(); in RetrieveNotificatioParseTagCtxComp0()
/third_party/selinux/libsepol/src/
H A Dmodule_to_cil.c2719 static int ocontext_selinux_node_to_cil(struct policydb *pdb, struct ocontext *nodes) in ocontext_selinux_node_to_cil() argument
2726 for (node = nodes; node != NULL; node = node->next) { in ocontext_selinux_node_to_cil()
2751 static int ocontext_selinux_node6_to_cil(struct policydb *pdb, struct ocontext *nodes) in ocontext_selinux_node6_to_cil() argument
2758 for (node = nodes; node != NULL; node = node->next) { in ocontext_selinux_node6_to_cil()
/test/xts/hats/ai/nnrt/hdi/v2_0/nnrtFunctionTest/src/
H A Dhdi_model_prepare_test.cpp252 * @tc.name : 编译模型，model中nodes为空
264 // set nodes to empty in HWTEST_F()
265 iModel->nodes = {}; in HWTEST_F()
267 // prepare model with empty nodes in HWTEST_F()
/third_party/PyYAML/lib/yaml/
H A Dconstructor.py12 from .nodes import *
/third_party/jinja2/
H A Druntime.py17 from .nodes import EvalContext
/third_party/node/deps/cares/src/lib/
H A Dares__hosts_file.c1116 ares__addrinfo_cat_nodes(&ai->nodes, ainodes); in ares__hosts_entry_to_addrinfo()
/third_party/libdrm/
H A Dxf86drm.h893 char **nodes; /* DRM_NODE_MAX sized array */ member
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Object/
H A DMachO.h121 iterator_range<node_iterator> nodes() const { in nodes() function in llvm::object::ExportEntry
/third_party/typescript/lib/
H A Dtsserverlibrary.js2653 function assertEachNode(nodes, test, message, stackCrawlMark) {
2655 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode);
4330 // Parse tree nodes
4494 // Top-level nodes
4499 // JSDoc nodes
4543 // Transformation nodes
4939 // Build symbol name using any nodes needed, instead of just components of an entity name
7276 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) {
[all...]
H A Dtsserver.js2654 function assertEachNode(nodes, test, message, stackCrawlMark) {
2656 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode);
4331 // Parse tree nodes
4495 // Top-level nodes
4500 // JSDoc nodes
4544 // Transformation nodes
4940 // Build symbol name using any nodes needed, instead of just components of an entity name
7277 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) {
[all...]
H A Dtypescript.js2644 function assertEachNode(nodes, test, message, stackCrawlMark) {
2646 assert(test === undefined || ts.every(nodes, test), message || "Unexpected node.", function () { return "Node array did not pass test '".concat(getFunctionName(test), "'."); }, stackCrawlMark || assertEachNode);
4321 // Parse tree nodes
4485 // Top-level nodes
4490 // JSDoc nodes
4534 // Transformation nodes
4930 // Build symbol name using any nodes needed, instead of just components of an entity name
7267 for (var _i = 0, _a = profile.nodes; _i < _a.length; _i++) {
[all...]
/third_party/ffmpeg/libavfilter/
H A Dvf_paletteuse.c261 struct stack_node nodes[16]; in colormap_nearest_iterative() local
262 struct stack_node *node = &nodes[0]; in colormap_nearest_iterative()
/third_party/python/Lib/
H A Dast.py201 tedious to fill in for generated nodes, so this helper adds these attributes
269 Yield all direct child nodes of *node*, that is, all fields that are nodes
270 and all items of fields that are lists of nodes.
382 Recursively yield all descendant nodes in the tree starting at *node*
384 only want to modify nodes in place and don't care about the context.
403 Per default the visitor functions for the nodes are ``'visit_'`` +
409 Don't use the `NodeVisitor` if you want to apply changes to nodes during
455 allows modification of nodes.
475 Keep in mind that if the node you're operating on has child nodes yo
[all...]
/third_party/skia/third_party/externals/libwebp/src/enc/
H A Dquant_enc.c576 #define NODE(n, l) (nodes[(n)][(l) + MIN_DELTA])
597 Node nodes[16][NUM_NODES]; in TrellisQuantizeBlock() local
686 // Dead nodes (with ss_prev[p].score >= MAX_COST) are automatically in TrellisQuantizeBlock()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DGenericDomTreeConstruction.h211 // Custom DFS implementation which can skip nodes based on a provided
229 // Visited nodes always have positive DFS numbers. in runDFS()
239 // Don't visit nodes more than once but remember to collect in runDFS()
353 // (CFG nodes with terminators and nodes in infinite loops are logically
367 // For postdominators, nodes with no forward successors are trivial roots that
369 // to CFG nodes within infinite loops.
382 // We define roots to be some non-redundant set of the CFG nodes
404 // It may happen that there are some new nodes in the CFG that are result of in FindRoots()
409 for (const NodePtr N : nodes(D in FindRoots()
[all...]
/third_party/selinux/libsepol/cil/src/
H A Dcil_verify.c586 struct cil_tree_node *node = sid->datum.nodes->head->data; in __cil_verify_initsids()
1479 struct cil_tree_node *common_node = common->datum.nodes->head->data; in __cil_verify_class()

Completed in 129 milliseconds

1...<<11121314151617181920