Home
last modified time | relevance | path

Searched refs:Tree (Results 1 - 25 of 31) sorted by relevance

12

/third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/
H A Dbtree_container.h36 template <typename Tree>
38 using params_type = typename Tree::params_type;
47 typename KeyArg<IsTransparent<typename Tree::key_compare>::value>::
48 template type<K, typename Tree::key_type>;
51 using key_type = typename Tree::key_type;
52 using value_type = typename Tree::value_type;
53 using size_type = typename Tree::size_type;
54 using difference_type = typename Tree::difference_type;
55 using key_compare = typename Tree::original_key_compare;
56 using value_compare = typename Tree
[all...]
/third_party/typescript/tests/baselines/reference/
H A DjsDeclarationsReactComponents.js83 function Tree({ allowDropOnRoot }) { function
87 Tree.propTypes = {
91 Tree.defaultProps = {
96 export default Tree;
173 function Tree(_a) {
177 Tree.propTypes = {
180 Tree.defaultProps = {
184 exports.default = Tree;
232 export default Tree;
233 declare function Tree({ allowDropOnRoo
[all...]
H A DtypeParameterExplicitlyExtendsAny.js23 // Generic Tree structure
24 type Tree<T> = T & {
25 children?: Tree<T>[];
29 public static displayTree1<T extends Tree<any>>(tree: T) {
H A DrecursiveTypeReferences1.js100 type Tree = [HTMLHeadingElement, Tree][];
102 function parse(node: Tree, index: number[] = []): HTMLUListElement {
112 function cons(hs: HTMLHeadingElement[]): Tree {
120 .reduce<Tree>((node, hs) =>
123 : concat<Tree[number]>(node, [[hs.shift()!, cons(hs)]])
268 type Tree = [HTMLHeadingElement, Tree][];
269 declare function parse(node: Tree, index?: number[]): HTMLUListElement;
270 declare function cons(hs: HTMLHeadingElement[]): Tree;
[all...]
H A DgenericTypeAliases.js2 type Tree<T> = T | { left: Tree<T>, right: Tree<T> };
4 var tree: Tree<number> = {
/third_party/node/deps/icu-small/source/tools/genrb/
H A Dfilterrb.h145 struct Tree { struct in SimpleRuleBasedPathFilter
147 Tree() = default;
150 Tree(const Tree& other);
160 std::map<std::string, Tree> fChildren;
161 std::unique_ptr<Tree> fWildcard;
174 Tree fRoot;
H A Dfilterrb.cpp98 const Tree* node = &fRoot; in match()
149 SimpleRuleBasedPathFilter::Tree::Tree(const Tree& other) in Tree() function in SimpleRuleBasedPathFilter::Tree
153 fWildcard.reset(new Tree(*other.fWildcard)); in Tree()
157 bool SimpleRuleBasedPathFilter::Tree::isLeaf() const { in isLeaf()
161 void SimpleRuleBasedPathFilter::Tree::applyRule( in applyRule()
184 fWildcard.reset(new Tree()); in applyRule()
200 search = fChildren.emplace(key, Tree(*fWildcard)).first; in applyRule()
202 search = fChildren.emplace(key, Tree()) in applyRule()
[all...]
/third_party/icu/icu4c/source/tools/genrb/
H A Dfilterrb.h145 struct Tree { struct in SimpleRuleBasedPathFilter
147 Tree() = default;
150 Tree(const Tree& other);
160 std::map<std::string, Tree> fChildren;
161 std::unique_ptr<Tree> fWildcard;
174 Tree fRoot;
H A Dfilterrb.cpp98 const Tree* node = &fRoot; in match()
149 SimpleRuleBasedPathFilter::Tree::Tree(const Tree& other) in Tree() function in SimpleRuleBasedPathFilter::Tree
153 fWildcard.reset(new Tree(*other.fWildcard)); in Tree()
157 bool SimpleRuleBasedPathFilter::Tree::isLeaf() const { in isLeaf()
161 void SimpleRuleBasedPathFilter::Tree::applyRule( in applyRule()
184 fWildcard.reset(new Tree()); in applyRule()
200 search = fChildren.emplace(key, Tree(*fWildcard)).first; in applyRule()
202 search = fChildren.emplace(key, Tree()) in applyRule()
[all...]
/third_party/skia/third_party/externals/icu/source/tools/genrb/
H A Dfilterrb.h145 struct Tree { struct in SimpleRuleBasedPathFilter
147 Tree() = default;
150 Tree(const Tree& other);
160 std::map<std::string, Tree> fChildren;
161 std::unique_ptr<Tree> fWildcard;
174 Tree fRoot;
H A Dfilterrb.cpp98 const Tree* node = &fRoot; in match()
149 SimpleRuleBasedPathFilter::Tree::Tree(const Tree& other) in Tree() function in SimpleRuleBasedPathFilter::Tree
153 fWildcard.reset(new Tree(*other.fWildcard)); in Tree()
157 bool SimpleRuleBasedPathFilter::Tree::isLeaf() const { in isLeaf()
161 void SimpleRuleBasedPathFilter::Tree::applyRule( in applyRule()
184 fWildcard.reset(new Tree()); in applyRule()
200 search = fChildren.emplace(key, Tree(*fWildcard)).first; in applyRule()
202 search = fChildren.emplace(key, Tree()) in applyRule()
[all...]
/third_party/skia/third_party/externals/swiftshader/tests/regres/cov/
H A Dserialization.go28 // ReadJSON parses the JSON Tree from r.
29 func ReadJSON(r io.Reader) (*Tree, string, error) {
35 func (t *Tree) Encode(revision string, w io.Writer) error {
49 func (t *Tree) JSON(revision string) string {
89 func (t *Tree) writeTestJSON(test *Test, sb *strings.Builder) {
109 func (t *Tree) writeSpansJSON(sb *strings.Builder) {
133 func (t *Tree) writeSpanJSON(span Span, sb *strings.Builder) {
139 func (t *Tree) writeFilesJSON(spansByID map[SpanID]Span, sb *strings.Builder) {
181 func (t *Tree) writeSpanGroupsJSON(spangroups map[SpanGroupID]SpanGroup, sb *strings.Builder) {
202 func (t *Tree) writeSpanGroupJSO
[all...]
H A Dtree.go36 // Tree represents source code coverage across a tree of different processes.
38 type Tree struct { type
46 func (t *Tree) init() {
57 func (t *Tree) Spans() SpanList {
66 func (t *Tree) FileSpanGroups(path string) map[SpanGroupID]SpanGroup {
71 func (t *Tree) FileCoverage(path string) TestCoverageMap {
76 func (t *Tree) Tests() *Test { return &t.testRoot }
79 func (t *Tree) Strings() Strings { return t.strings }
81 func (t *Tree) index(path Path) []indexedTest {
91 func (t *Tree) addSpan
[all...]
H A Dcoverage_test.go49 tree := &cov.Tree{}
235 tree := &cov.Tree{}
271 tree := &cov.Tree{}
313 func checkTests(t *testing.T, tree *cov.Tree, expect string) {
320 func checkCoverage(t *testing.T, tree *cov.Tree, file string, expect string) {
353 orig := &cov.Tree{}
H A Doptimization.go23 // Optimize optimizes the Tree by de-duplicating common spans into a tree of
25 func (t *Tree) Optimize() {
/third_party/protobuf/src/google/protobuf/
H A Dmap.h377 // 5. The trees' payload type is pointer to linked-list node. Tree-converting
386 // 10. InnerMap uses KeyForTree<Key> when using the Tree representation, which
426 using Tree = std::map<internal::KeyForTree<Key>, void*,
429 using TreeIterator = typename Tree::iterator;
484 Tree* tree = static_cast<Tree*>(m_->table_[bucket_index_]); in SearchFrom()
510 Tree* tree = static_cast<Tree*>(m_->table_[bucket_index_]); in operator ++()
583 Tree* tree = static_cast<Tree*>(table in clear()
[all...]
/third_party/skia/third_party/externals/abseil-cpp/absl/container/
H A Dnode_hash_map_test.cc116 struct Tree { in TEST() struct
118 absl::node_hash_map<int, Tree> children; in TEST()
120 Tree root; in TEST()
121 const Tree& child = root.children.emplace().first->second; in TEST()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DImmutableMap.h213 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
373 explicit iterator(TreeTy *Tree) : iterator::ImutAVLValueIterator(Tree) {} in iterator() argument
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp547 void addChild(MRT *Tree) { Children.insert(Tree); }
572 MRT *Tree = Children.back();
573 return (Tree->isRegion()) ? Tree->getRegionMRT()->getEntry()
574 : Tree->getMBBMRT()->getMBB();
578 MRT *Tree = Children.front();
579 return (Tree->isRegion()) ? Tree->getRegionMRT()->getExit()
580 : Tree
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp1047 SmallVector<RepeatedValue, 8> Tree; in RemoveFactorFromExpression()
1048 MadeChange |= LinearizeExprTree(BO, Tree); in RemoveFactorFromExpression()
1050 Factors.reserve(Tree.size()); in RemoveFactorFromExpression()
1051 for (unsigned i = 0, e = Tree.size(); i != e; ++i) { in RemoveFactorFromExpression()
1052 RepeatedValue E = Tree[i]; in RemoveFactorFromExpression()
2202 SmallVector<RepeatedValue, 8> Tree;
2203 MadeChange |= LinearizeExprTree(I, Tree);
2205 Ops.reserve(Tree.size());
2206 for (unsigned i = 0, e = Tree.size(); i != e; ++i) {
2207 RepeatedValue E = Tree[
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonLoopIdiomRecognition.cpp232 Value *find(Value *Tree, Value *Sub) const;
233 Value *subst(Value *Tree, Value *OldV, Value *NewV);
380 Value *Simplifier::Context::subst(Value *Tree, Value *OldV, Value *NewV) { in subst() argument
381 if (Tree == OldV) in subst()
384 return Tree; in subst()
387 Q.push_back(Tree); in subst()
403 return Tree; in subst()
478 Value *Simplifier::Context::find(Value *Tree, Value *Sub) const { in find() argument
481 Q.push_back(Tree); in find()
H A DHexagonConstExtenders.cpp1332 RangeTree Tree; in assignInits() local
1334 Tree.add(R); in assignInits()
1336 Tree.order(Nodes); in assignInits()
1358 auto P0 = MaxAlign(Tree.nodesWith(R.Min, false), R.Align, R.Offset); in assignInits()
1362 auto P1 = MaxAlign(Tree.nodesWith(R.Max, false), R.Align, R.Offset); in assignInits()
1377 auto &&V = Tree.nodesWith(*It); in assignInits()
1397 for (RangeTree::Node *N : Tree.nodesWith(Best)) { in assignInits()
1400 Tree.erase(N); in assignInits()
/third_party/skia/third_party/externals/swiftshader/tests/regres/deqp/
H A Ddeqp.go80 Coverage *cov.Tree
231 out.Coverage = &cov.Tree{}
/third_party/ffmpeg/libavcodec/
H A Dbink.c94 typedef struct Tree { struct
97 } Tree; typedef
107 Tree tree; ///< Huffman tree-related data
129 Tree col_high[16]; ///< trees for decoding high nibble in "colours" data type
248 static int read_tree(GetBitContext *gb, Tree *tree) in read_tree()
/third_party/ninja/src/
H A Ddisk_interface_test.cc330 TEST_F(StatTest, Tree) { in TEST_F()

Completed in 24 milliseconds

12