Home
last modified time | relevance | path

Searched refs:nodes (Results 351 - 375 of 484) sorted by relevance

1...<<11121314151617181920

/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/common/include/
H A Ddb_common.h114 static std::list<std::string> GenerateNodesByNodeWeight(const std::vector<std::string> &nodes,
/foundation/distributeddatamgr/datamgr_service/services/distributeddataservice/framework/include/store/
H A Dgeneral_value.h153 virtual void SetQueryNodes(const std::string& tableName, QueryNodes&& nodes) {}; in SetQueryNodes()
/third_party/PyYAML/lib/yaml/
H A Dresolver.py5 from .nodes import *
46 # any _value_ of sequence and mapping nodes. `True` matches against
/third_party/ninja/src/
H A Dmissing_deps.cc30 /// ImplicitDepLoader variant that stores dep nodes into the given output
96 ProcessNodeDeps(node, deps->nodes, deps->node_count); in ProcessNode()
155 std::cout << "Processed " << seen_.size() << " nodes.\n"; in PrintStats()
/third_party/node/deps/cares/src/tools/
H A Dahost.c248 for (node = result->nodes; node != NULL; node = node->ai_next) { in ai_callback()
/third_party/mesa3d/src/intel/dev/
H A Dintel_dev_info.c106 const char *path = devices[i]->nodes[DRM_NODE_RENDER]; in main()
/third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/
H A DTrailingPathOptimizer.java66 // This is just a way to find a node from which we can start generating new nodes. in optimize()
67 Node lastAddedNode = out.nodes().stream().max(naturalOrder()).get(); in optimize()
121 * node at which the AnyPath value starts from. Edges and nodes are removed from the graph,
123 * set of nodes that need to be reconnected).
184 /** Adds the given "AnyPath" into the graph, generating new nodes and edges as necessary. */
/third_party/mbedtls/tests/data_files/
H A DMakefile91 $(OPENSSL) req -x509 -new -nodes -key $(test_ca_key_file_rsa) -passin "pass:$(test_ca_pwd_rsa)" -set_serial 3 -config $(test_ca_config_file) -sha1 -days 3653 -utf8 -subj "/C=NL/O=PolarSSL/CN=PolarSSL Test CA" -out $@
95 $(OPENSSL) req -x509 -new -nodes -key $(test_ca_key_file_rsa) -passin "pass:$(test_ca_pwd_rsa)" -set_serial 3 -config $(test_ca_config_file) -sha1 -days 3653 -subj "/C=NL/O=PolarSSL/CN=PolarSSL Test CA" -out $@
99 $(OPENSSL) req -x509 -new -nodes -key $(test_ca_key_file_rsa) -passin "pass:$(test_ca_pwd_rsa)" -set_serial 3 -config $(test_ca_config_file) -sha1 -days 3653 -subj "/C=NL/O=PolarSSL/CN=PolarSSL Test CA" -out $@
462 -sha256 -days 3650 -nodes \
532 $(OPENSSL) req -x509 -outform der -nodes -days 7300 -newkey rsa:2048 -key $< -out $@ -addext "subjectAltName = URI:urn:example.com:5ff40f78-9210-494f-8206-c2c082f0609c" -extensions 'v3_req' -subj "/C=UK/O=Mbed TLS/CN=Mbed TLS URI SAN"
535 $(OPENSSL) req -x509 -outform der -nodes -days 7300 -newkey rsa:2048 -key $< -out $@ -addext "subjectAltName = URI:urn:example.com:5ff40f78-9210-494f-8206-c2c082f0609c, URI:urn:example.com:5ff40f78-9210-494f-8206-abcde1234567" -extensions 'v3_req' -subj "/C=UK/O=Mbed TLS/CN=Mbed TLS URI SAN"
658 $(OPENSSL) req -x509 -nodes -days 7300 -key server2.key -outform DER -out $@ -config authorityKeyId_subjectKeyId.conf -extensions 'v3_req' -set_serial 593828494303792449134898749208168108403991951034
661 $(OPENSSL) req -x509 -nodes -days 7300 -key server2.key -outform DER -out $@ -config authorityKeyId_subjectKeyId.conf -extensions 'v3_req_authorityKeyId_no_keyid' -set_serial 593828494303792449134898749208168108403991951034
664 $(OPENSSL) req -x509 -nodes -days 7300 -key server2.key -outform DER -out $@ -config authorityKeyId_subjectKeyId.conf -extensions 'v3_req_authorityKeyId_no_issuer'
667 $(OPENSSL) req -x509 -nodes
[all...]
/foundation/arkui/ace_engine/frameworks/bridge/common/dom/
H A Ddom_list.cpp896 auto nodes = accessibilityNode->GetChildList(); in UpdateAccessibilityOrder() local
901 nodes.begin(), nodes.end(), [nodeId = item->GetNodeId()](const RefPtr<AccessibilityNode>& node) { in UpdateAccessibilityOrder()
904 if (it != nodes.end()) { in UpdateAccessibilityOrder()
/third_party/node/deps/npm/node_modules/@npmcli/arborist/lib/arborist/
H A Dbuild-ideal-tree.js115 // don't hold onto references for nodes that are garbage collected.
191 // from there, we start adding nodes to it to satisfy the deps requested
421 // update.names request by queueing nodes dependent on those named.
429 const nodes = this.workspaceNodes(tree, this.options.workspaces)
431 nodes.push(tree)
433 const appliedRequests = nodes.map(
445 // named nodes to the buildIdealTree queue.
450 // global updates only update the globalTop nodes, but we need to know
575 for (const node of vuln.nodes) {
602 // XXX: how to handle top nodes tha
[all...]
/foundation/distributeddatamgr/kv_store/frameworks/libs/distributeddb/test/unittest/common/storage/
H A Ddistributeddb_storage_query_sync_test.cpp1277 std::list<QueryObjNode> nodes; in HWTEST_F() local
1279 nodes.push_back(node); in HWTEST_F()
1282 QueryObject queryObj(nodes, key, keys); in HWTEST_F()
1299 std::list<QueryObjNode> nodes; in HWTEST_F() local
1301 nodes.push_back(node); in HWTEST_F()
1304 QuerySyncObject querySyncObj1(nodes, key, keys); in HWTEST_F()
/third_party/googletest/googlemock/test/
H A Dgmock-matchers-misc_test.cc489 // The single int param is the # of nodes on each of the left and right sides.
494 size_t nodes = GetParam(); in TEST_P() local
495 MatchMatrix graph(nodes, nodes); in TEST_P()
570 int nodes = GetParam().first; in TEST_P() local
572 MatchMatrix graph(static_cast<size_t>(nodes), static_cast<size_t>(nodes)); in TEST_P()
591 // Test argument is a std::pair<int, int> representing (nodes, iters).
/third_party/node/deps/brotli/c/enc/
H A Dencode.c1278 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, block_size + 1); in BrotliCompressBufferQuality10() local
1281 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) goto oom; in BrotliCompressBufferQuality10()
1282 BrotliInitZopfliNodes(nodes, block_size + 1); in BrotliCompressBufferQuality10()
1287 nodes); in BrotliCompressBufferQuality10()
1309 BrotliZopfliCreateCommands(block_size, block_start, &nodes[0], dist_cache, in BrotliCompressBufferQuality10()
1314 BROTLI_FREE(m, nodes); in BrotliCompressBufferQuality10()
/third_party/skia/third_party/externals/brotli/c/enc/
H A Dencode.c1278 ZopfliNode* nodes = BROTLI_ALLOC(m, ZopfliNode, block_size + 1); in BrotliCompressBufferQuality10() local
1281 if (BROTLI_IS_OOM(m) || BROTLI_IS_NULL(nodes)) goto oom; in BrotliCompressBufferQuality10()
1282 BrotliInitZopfliNodes(nodes, block_size + 1); in BrotliCompressBufferQuality10()
1287 nodes); in BrotliCompressBufferQuality10()
1309 BrotliZopfliCreateCommands(block_size, block_start, &nodes[0], dist_cache, in BrotliCompressBufferQuality10()
1314 BROTLI_FREE(m, nodes); in BrotliCompressBufferQuality10()
/third_party/node/deps/v8/src/regexp/
H A Dregexp-ast.h210 explicit RegExpAlternative(ZoneList<RegExpTree*>* nodes);
219 ZoneList<RegExpTree*>* nodes() const { return nodes_; } in nodes() function in v8::internal::final
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H A Dnir.c124 return block->comp->vector_ssa[i].nodes[channel]; in gpir_node_find()
244 block->comp->vector_ssa[index].nodes[i] = node; in gpir_create_vector_load()
/third_party/node/deps/v8/src/wasm/
H A Dgraph-builder-interface.cc834 NodeVector nodes(inputs.size()); in SimdLaneOp()
835 GetNodes(nodes.begin(), inputs); in SimdLaneOp()
836 result->node = builder_->SimdLaneOp(opcode, imm.lane, nodes.begin()); in SimdLaneOp()
920 // and IfFailure nodes. in Delegate()
1344 // LoopExitEffect, and LoopExit nodes whenever a control resp. effect resp.
1347 // - At some nodes which connect to the graph's end. We do not always need to
1348 // emit loop exits for such nodes, since the wasm loop analysis algorithm
1350 // However, we need to emit them anyway for nodes that may be rewired to
1351 // different nodes during inlining. These are Return and TailCall nodes
[all...]
/foundation/graphic/graphic_3d/lume/Lume_3D/src/gltf/
H A Dgltf2_importer.cpp1802 // Look up node index nodes array. in RecursivelyCreateEntities()
1803 if (size_t const nodeIndex = FindIndex(data.nodes, &node); nodeIndex != GLTF2::GLTF_INVALID_INDEX) { in RecursivelyCreateEntities()
1831 if (const size_t parentIndex = FindIndex(data.nodes, node.parent); parentIndex != GLTF2::GLTF_INVALID_INDEX) { in CreateNode()
1943 size_t const nodeIndex = FindIndex(data.nodes, &node); in RecursivelyCreateComponents()
2009 size_t const jointNodeIndex = FindIndex(data.nodes, jointNode); in AddSkinJointsComponents()
2021 for (auto const& node : data.nodes) { in CreateSkinComponents()
2028 size_t const nodeIndex = FindIndex(data.nodes, node.get()); in CreateSkinComponents()
2037 size_t const skeletonIndex = FindIndex(data.nodes, node->skin->skeleton); in CreateSkinComponents()
2049 size_t const jointNodeIndex = FindIndex(data.nodes, jointNode); in CreateSkinComponents()
2061 for (auto const& node : data.nodes) { in CreateMorphComponents()
[all...]
/third_party/mesa3d/src/imgui/
H A Dimstb_truetype.h689 void *nodes; member
3757 static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes)
3764 STBTT__NOTUSED(nodes);
3801 stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context);
3803 if (context == NULL || nodes == NULL) {
3805 if (nodes != NULL) STBTT_free(nodes , alloc_context);
3814 spc->nodes = nodes;
[all...]
/third_party/skia/third_party/externals/imgui/
H A Dimstb_truetype.h689 void *nodes; member
3757 static void stbrp_init_target(stbrp_context *con, int pw, int ph, stbrp_node *nodes, int num_nodes)
3764 STBTT__NOTUSED(nodes);
3801 stbrp_node *nodes = (stbrp_node *) STBTT_malloc(sizeof(*nodes ) * num_nodes,alloc_context);
3803 if (context == NULL || nodes == NULL) {
3805 if (nodes != NULL) STBTT_free(nodes , alloc_context);
3814 spc->nodes = nodes;
[all...]
/third_party/alsa-utils/topology/nhlt/intel/ssp/
H A Dssp-internal.h56 struct ssp_aux_config_node nodes[SSP_MAX_DAIS]; member
/third_party/icu/icu4c/source/i18n/
H A Dcollationbuilder.h64 * node=nodes[index].
91 * Skips over nodes of weaker strength to maintain collation order
108 * Skips weaker nodes and tailored nodes if the current node is stronger
156 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
158 * The nodes array can then be used only as a source of tailored CEs.
162 * Counts the tailored nodes of the given strength up to the next node
226 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
229 * Node bit 6 is set on a primary node if there are nodes
234 * Node bit 5 is set on a primary or secondary node if there are nodes
405 UVector64 nodes; global() member in CollationBuilder
[all...]
/third_party/icu/icu4c/source/common/unicode/
H A Dstringtriebuilder.h176 * registerNode() and registerFinalValue() take ownership of their input nodes,
177 * and only return owned nodes.
190 // Hash set of nodes, maps from nodes to integer 1.
192 UHashtable *nodes; member in StringTrieBuilder
213 * Branch nodes in this trie data structure are not symmetric.
214 * Most branch edges "jump" to other nodes but the rightmost branch edges
222 * offset field which gets positive values when nodes are written.
229 * After root.markRightEdgesFirst(-1) the offsets of all nodes are negative
232 * @param edgeNumber The first edge number for this node and its sub-nodes
[all...]
/third_party/mesa3d/src/egl/drivers/dri2/
H A Dplatform_surfaceless.c253 dri2_dpy->fd = loader_open_device(device->nodes[node_type]); in surfaceless_probe_device()
/third_party/node/deps/icu-small/source/i18n/
H A Dcollationbuilder.h64 * node=nodes[index].
91 * Skips over nodes of weaker strength to maintain collation order
108 * Skips weaker nodes and tailored nodes if the current node is stronger
156 * Walks the tailoring graph and overwrites tailored nodes with new CEs.
158 * The nodes array can then be used only as a source of tailored CEs.
162 * Counts the tailored nodes of the given strength up to the next node
226 /** At most 1M nodes, limited by the 20 bits in node bit fields. */
229 * Node bit 6 is set on a primary node if there are nodes
234 * Node bit 5 is set on a primary or secondary node if there are nodes
405 UVector64 nodes; global() member in CollationBuilder
[all...]

Completed in 44 milliseconds

1...<<11121314151617181920