| /third_party/curl/tests/data/ |
| D | test1309 | 76 Tree look:
128 Tree look:
179 Tree look:
229 Tree look:
278 Tree look:
326 Tree look:
373 Tree look:
419 Tree look:
464 Tree look:
508 Tree look:
[all …]
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/container/internal/ |
| D | btree_container.h | 36 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::value_compare;
[all …]
|
| /third_party/typescript/tests/baselines/reference/ |
| D | arrayLiteralInference.types | 47 Tree,
48 >Tree : AppStyle.Tree
65 …Tree, AppStyle.TreeEntity]], [AppType.AdvancedList, [AppStyle.Standard, AppStyle.MiniApp]]]) : …
67 …Tree, AppStyle.TreeEntity]], [AppType.AdvancedList, [AppStyle.Standard, AppStyle.MiniApp]]] : (…
82 [AppType.Relationship, [AppStyle.Standard, AppStyle.Tree, AppStyle.TreeEntity]],
83 …Relationship, [AppStyle.Standard, AppStyle.Tree, AppStyle.TreeEntity]] : [AppType.Relationship, (A…
87 >[AppStyle.Standard, AppStyle.Tree, AppStyle.TreeEntity] : (AppStyle.Tree | AppStyle.TreeEntity | A…
91 >AppStyle.Tree : AppStyle.Tree
93 >Tree : AppStyle.Tree
|
| D | jsDeclarationsReactComponents.js | 83 function Tree({ allowDropOnRoot }) { class
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({ allowDropOnRoot }: {
[all …]
|
| D | jsDeclarationsReactComponents.symbols | 163 function Tree({ allowDropOnRoot }) {
164 >Tree : Symbol(Tree, Decl(jsDeclarationsReactComponents5.jsx, 1, 35), Decl(jsDeclarationsReactCompo…
171 Tree.propTypes = {
172 >Tree.propTypes : Symbol(Tree.propTypes, Decl(jsDeclarationsReactComponents5.jsx, 5, 1))
173 >Tree : Symbol(Tree, Decl(jsDeclarationsReactComponents5.jsx, 1, 35), Decl(jsDeclarationsReactCompo…
174 >propTypes : Symbol(Tree.propTypes, Decl(jsDeclarationsReactComponents5.jsx, 5, 1))
184 Tree.defaultProps = {
185 >Tree.defaultProps : Symbol(Tree.defaultProps, Decl(jsDeclarationsReactComponents5.jsx, 9, 2))
186 >Tree : Symbol(Tree, Decl(jsDeclarationsReactComponents5.jsx, 1, 35), Decl(jsDeclarationsReactCompo…
187 >defaultProps : Symbol(Tree.defaultProps, Decl(jsDeclarationsReactComponents5.jsx, 9, 2))
[all …]
|
| D | jsDeclarationsReactComponents.types | 192 function Tree({ allowDropOnRoot }) {
193 >Tree : typeof Tree
201 Tree.propTypes = {
202 >Tree.propTypes = { classes: PropTypes.object,} : { classes: PropTypes.Requireable<object>; }
203 >Tree.propTypes : { classes: PropTypes.Requireable<object>; }
204 >Tree : typeof Tree
216 Tree.defaultProps = {
217 >Tree.defaultProps = { classes: {}, parentSource: 'parent_id',} : { classes: {}; parentSource…
218 >Tree.defaultProps : { classes: {}; parentSource: string; }
219 >Tree : typeof Tree
[all …]
|
| D | typeParameterExplicitlyExtendsAny.symbols | 59 // Generic Tree structure
60 type Tree<T> = T & {
61 >Tree : Symbol(Tree, Decl(typeParameterExplicitlyExtendsAny.ts, 18, 1))
65 children?: Tree<T>[];
67 >Tree : Symbol(Tree, Decl(typeParameterExplicitlyExtendsAny.ts, 18, 1))
74 public static displayTree1<T extends Tree<any>>(tree: T) {
77 >Tree : Symbol(Tree, Decl(typeParameterExplicitlyExtendsAny.ts, 18, 1))
|
| D | recursiveTypeReferences1.types | 405 type Tree = [HTMLHeadingElement, Tree][];
406 >Tree : [HTMLHeadingElement, Tree][]
408 function parse(node: Tree, index: number[] = []): HTMLUListElement {
409 >parse : (node: Tree, index?: number[]) => HTMLUListElement
410 >node : Tree
419 …p : <U>(callbackfn: (value: [HTMLHeadingElement, Tree], index: number, array: [HTMLHeadingElement,…
420 >node : Tree
421 …p : <U>(callbackfn: (value: [HTMLHeadingElement, Tree], index: number, array: [HTMLHeadingElement,…
422 …(children, idx) : frag() ]); } : ([el, children]: [HTMLHeadingElement, Tree], i: number) => any
424 >children : Tree
[all …]
|
| D | typeParameterExplicitlyExtendsAny.types | 65 // Generic Tree structure
66 type Tree<T> = T & {
67 >Tree : Tree<T>
69 children?: Tree<T>[];
70 >children : Tree<T>[]
76 public static displayTree1<T extends Tree<any>>(tree: T) {
|
| D | genericTypeAliases.types | 2 type Tree<T> = T | { left: Tree<T>, right: Tree<T> };
3 >Tree : Tree<T>
4 >left : Tree<T>
5 >right : Tree<T>
7 var tree: Tree<number> = {
8 >tree : Tree<number>
|
| D | recursiveTypeReferences1.js | 100 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;
|
| D | genericTypeAliases.symbols | 2 type Tree<T> = T | { left: Tree<T>, right: Tree<T> };
3 >Tree : Symbol(Tree, Decl(genericTypeAliases.ts, 0, 0))
7 >Tree : Symbol(Tree, Decl(genericTypeAliases.ts, 0, 0))
10 >Tree : Symbol(Tree, Decl(genericTypeAliases.ts, 0, 0))
13 var tree: Tree<number> = {
15 >Tree : Symbol(Tree, Decl(genericTypeAliases.ts, 0, 0))
|
| D | arrayLiteralInference.symbols | 38 Tree,
39 >Tree : Symbol(AppStyle.Tree, Decl(arrayLiteralInference.ts, 14, 22))
73 [AppType.Relationship, [AppStyle.Standard, AppStyle.Tree, AppStyle.TreeEntity]],
80 >AppStyle.Tree : Symbol(AppStyle.Tree, Decl(arrayLiteralInference.ts, 14, 22))
82 >Tree : Symbol(AppStyle.Tree, Decl(arrayLiteralInference.ts, 14, 22))
|
| /third_party/node/deps/icu-small/source/tools/genrb/ |
| D | filterrb.h | 145 struct Tree { struct
147 Tree() = default;
150 Tree(const Tree& other);
160 std::map<std::string, Tree> fChildren; argument
161 std::unique_ptr<Tree> fWildcard; argument
174 Tree fRoot;
|
| D | filterrb.cpp | 98 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()).first; in applyRule()
211 void SimpleRuleBasedPathFilter::Tree::print(std::ostream& out, int32_t indent) const { in print()
|
| /third_party/skia/third_party/externals/icu/source/tools/genrb/ |
| D | filterrb.h | 145 struct Tree { struct
147 Tree() = default;
150 Tree(const Tree& other);
160 std::map<std::string, Tree> fChildren; argument
161 std::unique_ptr<Tree> fWildcard; argument
174 Tree fRoot;
|
| D | filterrb.cpp | 98 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()).first; in applyRule()
211 void SimpleRuleBasedPathFilter::Tree::print(std::ostream& out, int32_t indent) const { in print()
|
| /third_party/icu/icu4c/source/tools/genrb/ |
| D | filterrb.h | 145 struct Tree { struct
147 Tree() = default;
150 Tree(const Tree& other);
160 std::map<std::string, Tree> fChildren; argument
161 std::unique_ptr<Tree> fWildcard; argument
174 Tree fRoot;
|
| D | filterrb.cpp | 98 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()).first; in applyRule()
211 void SimpleRuleBasedPathFilter::Tree::print(std::ostream& out, int32_t indent) const { in print()
|
| /third_party/skia/third_party/externals/swiftshader/tests/regres/cov/ |
| D | serialization.go | 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) writeSpanGroupJSON(group SpanGroup, sb *strings.Builder) {
219 func (t *Tree) writeUncoveredJSON(tf *treeFile, uncovered SpanList, sb *strings.Builder) {
[all …]
|
| D | tree.go | 38 type Tree struct { struct
46 func (t *Tree) init() { argument
57 func (t *Tree) Spans() SpanList { argument
66 func (t *Tree) FileSpanGroups(path string) map[SpanGroupID]SpanGroup { argument
71 func (t *Tree) FileCoverage(path string) TestCoverageMap { argument
76 func (t *Tree) Tests() *Test { return &t.testRoot } argument
79 func (t *Tree) Strings() Strings { return t.strings } argument
81 func (t *Tree) index(path Path) []indexedTest { argument
91 func (t *Tree) addSpans(spans SpanList) SpanSet { argument
105 func (t *Tree) Add(path Path, cov *Coverage) { argument
[all …]
|
| /third_party/typescript/tests/cases/conformance/jsdoc/declarations/ |
| D | jsDeclarationsReactComponents.ts | 90 function Tree({ allowDropOnRoot }) { function
94 Tree.propTypes = {
98 Tree.defaultProps = {
103 export default Tree;
|
| /third_party/typescript/tests/cases/conformance/types/typeRelationships/recursiveTypes/ |
| D | recursiveTypeReferences1.ts | 102 type Tree = [HTMLHeadingElement, Tree][];
104 function parse(node: Tree, index: number[] = []): HTMLUListElement {
114 function cons(hs: HTMLHeadingElement[]): Tree {
122 .reduce<Tree>((node, hs) =>
125 : concat<Tree[number]>(node, [[hs.shift()!, cons(hs)]])
|
| /third_party/protobuf/src/google/protobuf/ |
| D | map.h | 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_]);
510 Tree* tree = static_cast<Tree*>(m_->table_[bucket_index_]);
583 Tree* tree = static_cast<Tree*>(table_[b]);
586 typename Tree::iterator tree_it = tree->begin();
589 typename Tree::iterator next = tree_it;
647 typename Tree::iterator tree_it;
658 Tree* tree = static_cast<Tree*>(table_[b]);
702 Tree* tree = static_cast<Tree*>(table_[b]);
[all …]
|
| /third_party/typescript/tests/cases/conformance/types/typeAliases/ |
| D | genericTypeAliases.ts | 1 type Tree<T> = T | { left: Tree<T>, right: Tree<T> }; alias
3 var tree: Tree<number> = {
|