Home
last modified time | relevance | path

Searched refs:nodes (Results 276 - 300 of 484) sorted by relevance

1...<<11121314151617181920

/test/testfwk/arkxtest/uitest/server/
H A Dsystem_ui_controller.cpp410 LOG_D("Start Get nodes from window by WindowId %{public}d", winInfo.id_); in GetWidgetsInWindow()
415 LOG_I("End Get nodes from window by WindowId %{public}d, node size is %{public}zu, appId: %{public}s", in GetWidgetsInWindow()
/third_party/vk-gl-cts/scripts/log/
H A Dbottleneck_report.py145 def findFirstElementByName (nodes, name) :
146 for node in nodes:
/foundation/graphic/graphic_3d/lume/Lume_3D/src/gltf/
H A Dgltf2_loader.cpp1950 name = "node_" + to_string(loadResult.data->nodes.size());
2059 // indices will be later resolved to pointers when all nodes have been parsed
2162 loadResult.data->nodes.push_back(move(node));
2170 auto& nodes = loadResult.data->nodes;
2172 for (const auto& node : nodes) {
2174 if (index < nodes.size()) {
2175 auto childNode = nodes[index].get();
2264 if (index >= loadResult.data->nodes.size()) {
2268 auto const equalsNodeToAdd = [nodeToAdd = loadResult.data->nodes[inde
[all...]
/third_party/node/deps/v8/src/profiler/
H A Dprofile-generator.cc700 value->BeginArray("nodes"); in StreamPendingTraceEvents()
775 std::vector<const v8::CpuProfileNode*>* nodes) { in FlattenNodesTree()
776 nodes->emplace_back(node); in FlattenNodesTree()
779 FlattenNodesTree(node->GetChild(i), nodes); in FlattenNodesTree()
867 std::vector<const v8::CpuProfileNode*> nodes; in SerializeNodes() local
870 &nodes); in SerializeNodes()
872 for (size_t i = 0; i < nodes.size(); i++) { in SerializeNodes()
873 SerializeNode(nodes.at(i)); in SerializeNodes()
875 if (i != (nodes.size() - 1)) writer_->AddCharacter(','); in SerializeNodes()
900 writer_->AddString("\"nodes\" in SerializeImpl()
774 FlattenNodesTree(const v8::CpuProfileNode* node, std::vector<const v8::CpuProfileNode*>* nodes) FlattenNodesTree() argument
[all...]
/third_party/node/deps/cares/src/lib/
H A Dares_parse_aaaa_reply.c97 ares__freeaddrinfo_nodes(ai.nodes); in ares_parse_aaaa_reply()
H A Dares_parse_a_reply.c96 ares__freeaddrinfo_nodes(ai.nodes); in ares_parse_a_reply()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DSpillPlacement.h49 Node *nodes = nullptr; member in llvm::SpillPlacement
69 /// List of nodes that need to be updated in ::iterate.
130 /// Return true is there are any positive nodes.
/third_party/skia/third_party/externals/swiftshader/src/Vulkan/
H A DVkDescriptorPool.hpp53 std::set<Node> nodes; member in vk::DescriptorPool
/third_party/typescript/tests/baselines/reference/
H A DneverInference.js15 nodes: Node<T>
H A DinferenceDoesNotAddUndefinedOrNull.js5 forEachChild<T>(cbNode: (node: Node) => T | undefined, cbNodeArray?: (nodes: NodeArray<Node>) => T | undefined): T | undefined;
/third_party/python/Doc/tools/extensions/
H A Dglossary_search.py12 from docutils.nodes import definition_list_item
/foundation/distributeddatamgr/data_share/test/native/unittest/mediadatashare_test/src/
H A Dslientswitch_test.cpp475 std::vector<PredicateTemplateNode> nodes; in GetTemplate() local
476 nodes.emplace_back(node1); in GetTemplate()
477 nodes.emplace_back(node2); in GetTemplate()
478 Template tpl(nodes, "select name1 as name from TBL00"); in GetTemplate()
/foundation/arkui/ace_engine/frameworks/core/components_ng/base/
H A Dinspector.h53 static void GetOffScreenTreeNodes(InspectorTreeMap& nodes);
/foundation/window/window_manager/wmserver/include/
H A Ddisplay_zoom_controller.h36 void ClearZoomTransform(std::vector<sptr<WindowNode>> nodes);
/third_party/jinja2/
H A Dvisitor.py1 """API for traversing the AST nodes. Implemented by the compiler and
6 from .nodes import Node
21 Per default the visitor functions for the nodes are ``'visit_'`` +
51 """Walks the abstract syntax tree and allows modifications of nodes.
/third_party/node/deps/v8/third_party/jinja2/
H A Dvisitor.py2 """API for traversing the AST nodes. Implemented by the compiler and
5 from .nodes import Node
13 Per default the visitor functions for the nodes are ``'visit_'`` +
42 """Walks the abstract syntax tree and allows modifications of nodes.
H A Denvironment.py13 from . import nodes namespace
48 from .nodes import EvalContext
525 tree of nodes is used by the compiler to convert the template into
680 body = [nodes.Assign(nodes.Name("result", "store"), expr, lineno=1)]
681 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/node/tools/inspector_protocol/jinja2/
H A Dvisitor.py6 This module implements a visitor for the nodes.
11 from jinja2.nodes import Node
19 Per default the visitor functions for the nodes are ``'visit_'`` +
48 """Walks the abstract syntax tree and allows modifications of nodes.
H A Denvironment.py15 from jinja2 import nodes namespace
24 from jinja2.nodes import EvalContext
482 tree of nodes is used by the compiler to convert the template into
634 body = [nodes.Assign(nodes.Name('result', 'store'), expr, lineno=1)]
635 template = self.from_string(nodes.Template(body, lineno=1))
/third_party/node/deps/v8/src/maglev/
H A Dmaglev-basic-block.h43 Node::List& nodes() { return nodes_; } in nodes() function in v8::internal::maglev::BasicBlock
/third_party/node/deps/openssl/openssl/crypto/x509/
H A Dpcy_local.h88 /* This structure represents the relationship between nodes */
95 /* Number of child nodes */
102 /* nodes at this level */
103 STACK_OF(X509_POLICY_NODE) *nodes; member
114 /* The number of nodes in the tree */
116 /* The maximum number of nodes in the tree */
123 * Extra policy data when additional nodes (not from the certificate) are
/third_party/openssl/crypto/x509/
H A Dpcy_local.h88 /* This structure represents the relationship between nodes */
95 /* Number of child nodes */
102 /* nodes at this level */
103 STACK_OF(X509_POLICY_NODE) *nodes; member
114 /* The number of nodes in the tree */
116 /* The maximum number of nodes in the tree */
123 * Extra policy data when additional nodes (not from the certificate) are
/third_party/skia/third_party/externals/jinja2/
H A Dvisitor.py2 """API for traversing the AST nodes. Implemented by the compiler and
5 from .nodes import Node
13 Per default the visitor functions for the nodes are ``'visit_'`` +
42 """Walks the abstract syntax tree and allows modifications of nodes.
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DGraphTraits.h54 // nodes_iterator/begin/end - Allow iteration over all nodes in the graph
70 // Return total number of nodes in the graph
105 // Provide iterator ranges for the graph traits nodes and children
108 nodes(const GraphType &G) { in nodes() function
/third_party/ffmpeg/libavcodec/
H A Dvp6.c256 /* nodes must ascend by count, but with descending symbol order */
266 Node nodes[2*VP6_MAX_HUFF_SIZE], *tmp = &nodes[size]; in vp6_build_huff_tree() local
274 nodes[map[2*i ]].count = a + !a; in vp6_build_huff_tree()
275 nodes[map[2*i+1]].count = b + !b; in vp6_build_huff_tree()
281 nodes, vp6_huff_cmp, in vp6_build_huff_tree()

Completed in 22 milliseconds

1...<<11121314151617181920