| /third_party/skia/src/core/ |
| D | SkRTree.cpp | 15 std::vector<Branch> branches; in insert() local
16 branches.reserve(N); in insert()
27 branches.push_back(b); in insert()
30 fCount = (int)branches.size(); in insert()
36 n->fChildren[0] = branches[0]; in insert()
38 fRoot.fBounds = branches[0].fBounds; in insert()
41 fRoot = this->bulkLoad(&branches); in insert()
57 int SkRTree::CountNodes(int branches) { in CountNodes() argument
58 if (branches == 1) { in CountNodes()
61 int numBranches = branches / kMaxChildren; in CountNodes()
[all …]
|
| /third_party/flutter/skia/src/core/ |
| D | SkRTree.cpp | 23 SkTDArray<Branch> branches; in insert() local
24 branches.setReserve(N); in insert()
32 Branch* b = branches.push(); in insert()
37 fCount = branches.count(); in insert()
43 n->fChildren[0] = branches[0]; in insert()
45 fRoot.fBounds = branches[0].fBounds; in insert()
48 fRoot = this->bulkLoad(&branches); in insert()
63 int SkRTree::CountNodes(int branches) { in CountNodes() argument
64 if (branches == 1) { in CountNodes()
67 int numBranches = branches / kMaxChildren; in CountNodes()
[all …]
|
| /third_party/parse5/scripts/generate-named-entity-data/ |
| D | array-mapped-radix-tree.js | 35 _writeNodeMarker(data, branches) { argument
46 if (branches) {
53 _writeBranches(branches) { argument
54 const kvPairs = Object.keys(branches)
56 .map(key => ({ key, branch: branches[key] }));
86 const branches = node.branches;
88 this._writeNodeMarker(data, branches);
94 if (branches) {
95 this._writeBranches(branches);
|
| D | tree-node.js | 15 this.branches = null;
19 if (!this.branches) {
20 this.branches = Object.create(null);
27 this.branches[key] = new Edge(filter, node, this, key);
33 this.branches[key] = node;
|
| /third_party/node/doc/guides/ |
| D | maintaining-V8.md | 8 to support. V8 branches in Node.js lack of an official maintenance process due
12 a workflow for maintaining the V8 branches in both Node.js LTS and current
19 there are three V8 branches that are **active**.
31 All older branches are abandoned and are not maintained by the V8 team.
35 The process for backporting bug fixes to active branches is officially
38 * V8 only supports active branches. There is no testing done on any branches
53 At any given time Node.js needs to be maintaining a few different V8 branches
55 includes the following branches<sup>1</sup>:
146 these branches for many months (Current branches) or several
147 years (LTS branches).
[all …]
|
| /third_party/flutter/skia/third_party/externals/angle2/doc/ |
| D | ChoosingANGLEBranch.md | 11 Branches are created automatically in ANGLE to correspond to branches created in
12 Chromium. These branches are named `chromium/####`, where the number is the
13 matching Chromium branch. These branches will be created from the revision which
17 (http://src.chromium.org/viewvc/chrome/branches/2013/src/DEPS?revision=272741)
23 stable Chromium release channel build, as those branches will be deployed with
26 branches will be short-lived.
33 In order to determine which branches are used by Chromium releases, please use
40 ## Updates to release branches
44 fixes for those bugs will be applied to the ANGLE branches for uptake by
|
| /third_party/skia/third_party/externals/tint/tools/src/cmd/roll-release/ |
| D | main.go | 15 // roll-release is a tool to roll changes in Tint release branches into Dawn,
16 // and create new Tint release branches.
55 type branches = map[string]plumbing.Hash talias
66 %[1]v is a tool to synchronize Dawn's release branches with Tint.
68 %[1]v will scan the release branches of both Dawn and Tint, and will:
71 * Find and create missing Tint release branches, using the git hash of Tint in
94 // To create new release branches in Tint, we use 'go-git', so we need to
103 // Using in-memory repos, find all the tint and dawn release branches
104 log.Println("Inspecting dawn and tint release branches...")
106 var tintBranches, dawnBranches branches
[all …]
|
| /third_party/skia/third_party/externals/angle2/doc/ |
| D | ChoosingANGLEBranch.md | 11 Branches are created automatically in ANGLE to correspond to branches created in
12 Chromium. These branches are named `chromium/####`, where the number is the
13 matching Chromium branch. These branches will be created from the revision which
17 (http://src.chromium.org/viewvc/chrome/branches/2013/src/DEPS?revision=272741)
23 stable Chromium release channel build, as those branches will be deployed with
26 branches will be short-lived.
33 In order to determine which branches are used by Chromium releases, please use
40 ## Updates to release branches
44 fixes for those bugs will be applied to the ANGLE branches for uptake by
|
| /third_party/mindspore/mindspore/core/abstract/ |
| D | prim_statement.cc | 87 AbstractBasePtrList branches = branches_abs->elements(); in InferImplSwitchLayer() local
89 if (branches.empty() || branches.size() > maximum_layer_num) { in InferImplSwitchLayer()
91 << branches.size() << " branches."; in InferImplSwitchLayer()
94 for (size_t i = 0; i < branches.size(); i++) { in InferImplSwitchLayer()
95 MS_EXCEPTION_IF_NULL(branches[i]); in InferImplSwitchLayer()
96 …if (!branches[i]->isa<FuncGraphAbstractClosure>() && !branches[i]->isa<PartialAbstractClosure>()) { in InferImplSwitchLayer()
98 << branches[i]->ToString() << " as the " << i << "th element."; in InferImplSwitchLayer()
102 auto b = branches[0]; in InferImplSwitchLayer()
103 // Return AbstractFuncUnion, otherwise the switch_layer will be replaced by branches[0] in InferImplSwitchLayer()
105 if (branches.size() == 1) { in InferImplSwitchLayer()
[all …]
|
| /third_party/mbedtls/ |
| D | CONTRIBUTING.md | 28 …n development branch and in LTS (Long Term Support) branches, as described in [BRANCHES.md](BRANCH…
40 Long Term Support Branches
42 …branches, which are maintained continuously for a given period. The LTS branches are provided to a…
44 When backporting to these branches please observe the following rules:
50 It would be highly appreciated if contributions are backported to LTS branches in addition to the […
52 The list of maintained branches can be found in the [Current Branches section
53 of BRANCHES.md](BRANCHES.md#current-branches).
|
| D | BRANCHES.md | 1 # Maintained branches
3 At any point in time, we have a number of maintained branches consisting of:
15 - One or more long-time support (LTS) branches:
22 ABI compatibility within LTS branches; see the next section for details.
53 ## Long-time support branches
55 For the LTS branches, additionally we try very hard to also maintain ABI
67 ## Current Branches
69 The following branches are currently maintained:
|
| D | SECURITY.md | 16 ## Maintained branches
18 Only the maintained branches, as listed in [`BRANCHES.md`](BRANCHES.md),
|
| /third_party/boost/libs/iostreams/test/detail/ |
| D | sequence.hpp | 91 "it. And six branches coming out of its sides: three menorah "
92 "branches from its one side and three menorah branches from "
95 "a knob and a flower; so for the six branches that come out of "
98 "the two branches from it, and a knob under the two branches "
99 "from it, and a knob under the two branches from it; so for the "
100 "six branches that come out of the menorah. Their knobs and "
101 "their branches shall [all] be [one piece] with it; all of it "
209 "it. And six branches coming out of its sides: three menorah " in text_sequence()
210 "branches from its one side and three menorah branches from " in text_sequence()
213 "a knob and a flower; so for the six branches that come out of " in text_sequence()
[all …]
|
| /third_party/abseil-cpp/ |
| D | LTS.md | 1 # Long Term Support (LTS) Branches
4 Long Term Support (LTS) branches. An LTS branch allows you to use a known
9 ## LTS Branches
11 The following lists LTS branches and the dates on which they have been released:
|
| /third_party/spirv-tools/test/tools/opt/ |
| D | flags.py | 62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
142 'eliminate-dead-branches',
161 'eliminate-dead-branches',
174 'eliminate-dead-branches',
182 'eliminate-dead-branches',
200 'eliminate-dead-branches',
209 'eliminate-dead-branches',
216 'eliminate-dead-branches',
248 'eliminate-dead-branches',
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/test/tools/opt/ |
| D | flags.py | 62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
142 'eliminate-dead-branches',
161 'eliminate-dead-branches',
174 'eliminate-dead-branches',
182 'eliminate-dead-branches',
200 'eliminate-dead-branches',
209 'eliminate-dead-branches',
216 'eliminate-dead-branches',
248 'eliminate-dead-branches',
[all …]
|
| /third_party/skia/third_party/externals/spirv-tools/test/tools/opt/ |
| D | flags.py | 62 '--eliminate-dead-branches',
86 'eliminate-dead-branches',
142 'eliminate-dead-branches',
161 'eliminate-dead-branches',
174 'eliminate-dead-branches',
182 'eliminate-dead-branches',
200 'eliminate-dead-branches',
209 'eliminate-dead-branches',
216 'eliminate-dead-branches',
248 'eliminate-dead-branches',
[all …]
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | distance_query.hpp | 205 // CONSIDER: using one global container/heap for active branches in operator ()()
207 // This would also change the way how branches are traversed! in operator ()()
350 branches = o.branches; in operator =()
355 active_branch_list_type branches; member
410 active_branch_list_type & branches = internal_stack.back().branches; in increment() local
413 if ( branches.size() <= current_branch ) in increment()
432 is_node_prunable(neighbors.back().first, branches[current_branch].first) ) in increment()
442 rtree::apply_visitor(*this, *(branches[current_branch - 1].second)); in increment()
465 // Put node's elements into the list of active branches if those elements meets predicates
503 … internal_stack.back().branches.push_back( std::make_pair(node_distance, it->second) ); in operator ()()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/SystemZ/ |
| D | SystemZLongBranch.cpp | 9 // This pass makes sure that all branches are in range. There are several ways
11 // branches are in range and successively replace those that turn out not
14 // branches until no more changes are needed and a fixed point is reached.
20 // An alternative approach is to assume that all branches must be
22 // branches that, even under this pessimistic assumption, turn out to be
34 // On SystemZ, long branches are only needed for functions bigger than 64k,
39 // (1) Work out the address that each block would have if no branches
40 // need relaxing. Exit the pass early if all branches are in range
43 // (2) Work out the address that each block would have if all branches
47 // and relaxing those that need to be relaxed. For backward branches,
[all …]
|
| /third_party/json/.github/workflows/ |
| D | codeql-analysis.yml | 5 branches: [develop, ]
7 # The branches below must be a subset of the branches above
8 branches: [develop]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/MCTargetDesc/ |
| D | PPCFixupKinds.h | 19 // 24-bit PC relative relocation for direct branches like 'b' and 'bl'.
22 /// 14-bit PC relative relocation for conditional branches.
25 /// 24-bit absolute relocation for direct branches like 'ba' and 'bla'.
28 /// 14-bit absolute relocation for conditional branches.
|
| /third_party/vk-gl-cts/external/vulkancts/data/vulkan/amber/graphicsfuzz/ |
| D | cov-for-loop-struct-as-iterator.amber | 26 # '--eliminate-dead-branches'
29 # '--eliminate-dead-branches'
32 # '--eliminate-dead-branches'
41 # '--eliminate-dead-branches'
44 # '--eliminate-dead-branches'
45 # '--eliminate-dead-branches'
47 # '--eliminate-dead-branches'
|
| /third_party/elfio/.github/workflows/ |
| D | codeql-analysis.yml | 5 branches: [master]
7 # The branches below must be a subset of the branches above
8 branches: [master]
|
| /third_party/mindspore/mindspore/ccsrc/pipeline/jit/static_analysis/ |
| D | auto_monad.cc | 304 std::vector<FuncGraphPtr> branches; member
389 // Add both branches, in some case, only one branch is set. in GetSwitchBranches()
390 std::vector<FuncGraphPtr> branches; in GetSwitchBranches() local
393 branches.emplace_back(true_branch); in GetSwitchBranches()
397 branches.emplace_back(false_branch); in GetSwitchBranches()
399 if (branches.empty()) { in GetSwitchBranches()
402 return branches; in GetSwitchBranches()
406 void AddMonadParameters(const std::vector<FuncGraphPtr> &branches, const std::string &name, in AddMonadParameters() argument
408 for (auto &branch : branches) { in AddMonadParameters()
415 // Find branches from switch cnode. in TraceSwitchEffectInfo()
[all …]
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/ARC/ |
| D | ARCBranchFinalize.cpp | 1 //===- ARCBranchFinalize.cpp - ARC conditional branches ---------*- C++ -*-===//
9 // This pass takes existing conditional branches and expands them into longer
10 // range conditional branches.
63 "ARC finalize branches", false, false)
66 "ARC finalize branches", false, false) in INITIALIZE_PASS_DEPENDENCY()
146 std::vector<MachineInstr *> Branches; in runOnMachineFunction() local
164 Branches.push_back(&MI); in runOnMachineFunction()
|