| /third_party/libphonenumber/metadata/src/main/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | NfaFlattener.java | 83 PathFollower subgraph = visitSubgraph(out.node()); in flatten() local
84 out = PathFollower.of(subgraph.node(), Edge.concatenation(out.edge(), subgraph.edge())); in flatten()
138 PathFollower subgraph = visitSubgraph(target); in visitSubgraph() local
140 PathFollower.of(subgraph.node(), Edge.concatenation(follower.edge(), subgraph.edge()))); in visitSubgraph()
|
| /third_party/skia/third_party/externals/harfbuzz/src/ |
| D | hb-repacker.hh | 404 hb_hashmap_t<unsigned, unsigned> subgraph; in isolate_subgraph() local
411 subgraph.set (root_idx, wide_parents (root_idx, parents)); in isolate_subgraph()
412 find_subgraph (root_idx, subgraph); in isolate_subgraph()
418 for (auto entry : subgraph.iter ()) in isolate_subgraph()
443 + subgraph.keys () in isolate_subgraph()
467 void find_subgraph (unsigned node_idx, hb_hashmap_t<unsigned, unsigned>& subgraph) in find_subgraph()
471 if (subgraph.has (link.objidx)) in find_subgraph()
473 subgraph.set (link.objidx, subgraph[link.objidx] + 1); in find_subgraph()
476 subgraph.set (link.objidx, 1); in find_subgraph()
477 find_subgraph (link.objidx, subgraph); in find_subgraph()
[all …]
|
| /third_party/libinput/doc/user/dot/ |
| D | libinput-stack-xorg.gv | 9 subgraph cluster_2 {
15 subgraph cluster_0 {
17 subgraph cluster_1 {
|
| D | libinput-stack-gnome.gv | 13 subgraph cluster0 {
22 subgraph cluster3 {
|
| D | libinput-stack-wayland.gv | 9 subgraph cluster_2 {
15 subgraph cluster_0 {
|
| /third_party/mesa3d/docs/drivers/ |
| D | anv.rst | 59 subgraph cluster_1 {
74 subgraph cluster_2 {
88 subgraph cluster_5 {
94 subgraph cluster_6 {
101 subgraph cluster_7 {
108 subgraph cluster_8 {
115 subgraph cluster_9 {
122 subgraph cluster_10 {
133 subgraph cluster_11 {
134 subgraph cluster_12 {
|
| /third_party/skia/third_party/externals/harfbuzz/docs/ |
| D | repacker.md | 134 to a subgraph which are not connected to each other. The shortest distance sort will interleave the
137 to pack the first subgraph in it's entirety and then have the second subgraph packed after with the…
138 bit offset pointing over the first subgraph. For example given the graph:
161 The ability for 32 bit offsets to point long distances is utilized to jump over the subgraph of
167 If there is a subgraph that is only reachable from one or more 32 bit offsets, then:
168 * That subgraph can be treated as an indepedent unit and all nodes of the subgraph packed in isola…
171 … subgraph can be placed anywhere after the parent nodes without overflowing the 32 bit offsets from
194 and then assign each such subgraph to a unique non-zero space. The algorithm is roughly:
223 * If the overflowing offset is inside a space other than space 0 and the subgraph space has more
224 than one 32 bit offset pointing into the subgraph then subdivide the space by moving subgraph
|
| /third_party/libphonenumber/metadata/src/test/java/com/google/i18n/phonenumbers/metadata/regex/ |
| D | RegexGeneratorTest.java | 75 RangeTree subgraph = RangeTree.from( in testSubgroupOptimization() local
81 RangeTree dfa = rest.union(subgraph); in testSubgroupOptimization()
|
| /third_party/ltp/tools/sparse/sparse-src/gvpr/ |
| D | return-paths | 8 // Find the immediate parent subgraph of this object
|
| D | subg-fwd | 9 // Find the immediate parent subgraph of this object
|
| D | subg-rev | 8 // Find the immediate parent subgraph of this object
|
| /third_party/mindspore/patches/ |
| D | 0016-bugfix-for-argminmax-swish-int8-and-vad-asan.patch | 290 auto subgraph = src_model_->graph_.sub_graphs_.at(subgraph_index);
292 - for (auto node_index : subgraph->node_indices_) {
293 + auto node_indexes = subgraph->node_indices_;
303 + node_indexes = subgraph->node_indices_;
|
| D | 0011-fix-npu-infer-memory-leak-delete-liteGraph.patch | 62 + // subgraph
|
| D | 0004-cross-compile-ndkso-fp16-nnrt-train_capi.patch | 4400 - // must have at lease one subgraph
4401 - MS_LOG(ERROR) << "must have at lease one subgraph";
4612 + MS_LOG(WARNING) << "LiteGraph contains more than one subgraph. NNRT does not support control-f…
4628 + MS_LOG(INFO) << "Found NNRT subgraph count: " << nnrt_subgraph_ranges.size();
4642 + MS_LOG(WARNING) << "Create NNRT subgraph kernel failed, fallback to CPU";
4659 + MS_LOG(ERROR) << "Lite graph must have at lease one subgraph";
4736 + MS_LOG(INFO) << "Schedule NNRT subgraph range: [" << op_range.begin_index_ << ", " << op_range…
4751 + MS_LOG(INFO) << "Start creating LiteGraph for NNRT subgraph";
4823 + // deal with subgraph's input/output indices
4824 + MS_LOG(INFO) << "Set input/output indices of each subgraph...";
[all …]
|
| D | 0005-micro-for-ohos.patch | 8909 + * The subgraph such as the following.
10217 auto &subgraph = graph->subGraph.at(subgraph_index);
10219 - if (IsContain(subgraph->inputIndices, i) || !graph->allTensors.at(i)->data.empty()) {
10220 + if (IsContain(subgraph->inputIndices, i) || !graph->allTensors.at(i)->data.empty() ||
|
| /third_party/node/deps/v8/src/compiler/ |
| D | js-call-reducer.cc | 2318 Node* subgraph) { in ReplaceWithSubgraph() argument
2326 ReplaceWithValue(gasm->node_ptr(), subgraph, gasm->effect(), gasm->control()); in ReplaceWithSubgraph()
2345 return Replace(subgraph); in ReplaceWithSubgraph()
2361 Node* subgraph = a.ReduceMathUnary(op); in ReduceMathUnary() local
2362 return ReplaceWithSubgraph(&a, subgraph); in ReduceMathUnary()
2378 Node* subgraph = a.ReduceMathBinary(op); in ReduceMathBinary() local
2379 return ReplaceWithSubgraph(&a, subgraph); in ReduceMathBinary()
3382 TNode<Object> subgraph = a.ReduceArrayPrototypeForEach( in ReduceArrayForEach() local
3384 return ReplaceWithSubgraph(&a, subgraph); in ReduceArrayForEach()
3394 TNode<Object> subgraph = a.ReduceArrayPrototypeReduce( in ReduceArrayReduce() local
[all …]
|
| D | js-call-reducer.h | 230 Reduction ReplaceWithSubgraph(JSCallReducerAssembler* gasm, Node* subgraph);
|
| /third_party/libinput/doc/user/ |
| D | t440-support.rst | 75 subgraph cluster0 {
|
| /third_party/ltp/tools/sparse/sparse-src/Documentation/release-notes/ |
| D | v0.4.rst | 110 * Improved graph generation using subgraph clusters for functions
|
| /third_party/mesa3d/docs/drivers/freedreno/ |
| D | ir3-notes.rst | 65 subgraph clusterdce198 {
|