| /third_party/typescript/src/compiler/factory/ |
| D | nodeTests.ts | 4 export function isNumericLiteral(node: Node): node is NumericLiteral {
5 return node.kind === SyntaxKind.NumericLiteral;
8 export function isBigIntLiteral(node: Node): node is BigIntLiteral {
9 return node.kind === SyntaxKind.BigIntLiteral;
12 export function isStringLiteral(node: Node): node is StringLiteral {
13 return node.kind === SyntaxKind.StringLiteral;
16 export function isJsxText(node: Node): node is JsxText {
17 return node.kind === SyntaxKind.JsxText;
20 export function isRegularExpressionLiteral(node: Node): node is RegularExpressionLiteral {
21 return node.kind === SyntaxKind.RegularExpressionLiteral;
[all …]
|
| D | nodeFactory.ts | 9 // Disables the node converters for the factory.
13 // Do not set an `original` pointer when updating a node. enumerator
20 * @param baseFactory A `BaseNodeFactory` used to create the base `Node` objects.
26 … // Lazily load the parenthesizer, node converters, and some factory methods until they are used.
36 …Node | undefined; }>(kind: T["kind"]) => (node: T, type: T["type"]) => updateJSDocUnaryTypeWorker<…
38 …Tag>(kind: T["kind"]) => (node: T, tagName: Identifier | undefined, comment?: string) => updateJSD…
40 …) => (node: T, tagName: Identifier | undefined, typeExpression?: JSDocTypeExpression, comment?: st…
515 …function createNodeArray<T extends Node>(elements?: readonly T[], hasTrailingComma?: boolean): Nod…
528 … // Since the element list of a node array is typically created by starting with an empty array and
540 function createBaseNode<T extends Node>(kind: T["kind"]) {
[all …]
|
| D | emitNode.ts | 3 * Associates a node with the current transformation, initializing
7 export function getOrCreateEmitNode(node: Node): EmitNode {
8 if (!node.emitNode) {
9 if (isParseTreeNode(node)) {
11 // parse tree node we are annotating. This allows us to clean them up after
13 if (node.kind === SyntaxKind.SourceFile) {
14 return node.emitNode = { annotatedNodes: [node] } as EmitNode;
17 …const sourceFile = getSourceFileOfNode(getParseTreeNode(getSourceFileOfNode(node))) ?? Debug.fail(…
18 getOrCreateEmitNode(sourceFile).annotatedNodes!.push(node);
21 node.emitNode = {} as EmitNode;
[all …]
|
| /third_party/flutter/skia/third_party/externals/spirv-tools/source/util/ |
| D | move_to_front.h | 47 // node: handle used internally to access node data.
48 // size: size of the subtree of a node (including the node).
49 // height: distance from a node to the farthest leaf.
56 // Create NIL node.
57 nodes_.emplace_back(Node());
97 // with DeprecateValue(). But handles are recycled when a node is repositioned.
99 // Internal tree data structure node.
100 struct Node { struct
104 // The size of the node's subtree, including the node.
105 // SizeOf(LeftOf(node)) + SizeOf(RightOf(node)) + 1.
[all …]
|
| /third_party/typescript/src/compiler/ |
| D | visitorPublic.ts | 5 * Visits a Node using the supplied visitor, possibly returning a new Node in its place.
7 * @param node The Node to visit.
8 * @param visitor The callback used to visit the Node.
9 * @param test A callback to execute to verify the Node is valid.
10 * @param lift An optional callback to execute to lift a NodeArray into a valid Node.
12 …ion visitNode<T extends Node>(node: T, visitor: Visitor | undefined, test?: (node: Node) => boolea…
15 * Visits a Node using the supplied visitor, possibly returning a new Node in its place.
17 * @param node The Node to visit.
18 * @param visitor The callback used to visit the Node.
19 * @param test A callback to execute to verify the Node is valid.
[all …]
|
| D | utilitiesPublic.ts | 248 for (let current: Node = d; current; current = current.parent) {
257 …export function isParameterPropertyDeclaration(node: Node, parent: Node): node is ParameterPropert…
258 …return hasSyntacticModifier(node, ModifierFlags.ParameterPropertyModifier) && parent.kind === Synt…
261 export function isEmptyBindingPattern(node: BindingName): node is BindingPattern {
262 if (isBindingPattern(node)) {
263 return every(node.elements, isEmptyBindingElement);
268 export function isEmptyBindingElement(node: BindingElement): boolean {
269 if (isOmittedExpression(node)) {
272 return isEmptyBindingPattern(node.name);
276 let node = binding.parent;
[all …]
|
| D | emitter.ts | 518 function collectLinkedAliases(node: Node) {
519 if (isExportAssignment(node)) {
520 if (node.expression.kind === SyntaxKind.Identifier) {
521 … resolver.collectLinkedAliases(node.expression as Identifier, /*setVisibility*/ true);
525 else if (isExportSpecifier(node)) {
526 … resolver.collectLinkedAliases(node.propertyName || node.name, /*setVisibility*/ true);
529 forEachChild(node, collectLinkedAliases);
927 let lastNode: Node | undefined;
928 let lastSubstitution: Node | undefined;
947 function printNode(hint: EmitHint, node: Node, sourceFile: SourceFile): string {
[all …]
|
| D | binder.ts | 18 …export function getModuleInstanceState(node: ModuleDeclaration, visited?: ESMap<number, ModuleInst…
19 if (node.body && !node.body.parent) {
21 setParent(node.body, node);
22 setParentRecursive(node.body, /*incremental*/ false);
24 …return node.body ? getModuleInstanceStateCached(node.body, visited) : ModuleInstanceState.Instanti…
27 …function getModuleInstanceStateCached(node: Node, visited = new Map<number, ModuleInstanceState | …
28 const nodeId = getNodeId(node);
33 const result = getModuleInstanceStateWorker(node, visited);
38 …function getModuleInstanceStateWorker(node: Node, visited: ESMap<number, ModuleInstanceState | und…
40 switch (node.kind) {
[all …]
|
| /third_party/node/deps/acorn/acorn-walk/dist/ |
| D | walk.mjs | 8 // Expression: function(node) { ... }
11 // to do something with all expressions. All Parser API node types
12 // can be used to identify node types, as well as Expression and
19 function simple(node, visitors, baseVisitor, state, override) { argument
21 ; }(function c(node, st, override) { argument
22 var type = override || node.type, found = visitors[type];
23 baseVisitor[type](node, st, c);
24 if (found) { found(node, st); }
25 })(node, state, override);
29 // current node) and passes them to the callback as third parameter
[all …]
|
| D | walk.js | 14 // Expression: function(node) { ... }
17 // to do something with all expressions. All Parser API node types
18 // can be used to identify node types, as well as Expression and
25 function simple(node, visitors, baseVisitor, state, override) { argument
27 ; }(function c(node, st, override) { argument
28 var type = override || node.type, found = visitors[type];
29 baseVisitor[type](node, st, c);
30 if (found) { found(node, st); }
31 })(node, state, override);
35 // current node) and passes them to the callback as third parameter
[all …]
|
| /third_party/python/Lib/ |
| D | ast.py | 36 Parse the source into an AST node.
56 Safely evaluate an expression node or a string containing a Python
57 expression. The string or node provided may only consist of the following
65 def _raise_malformed_node(node): argument
66 msg = "malformed node or string"
67 if lno := getattr(node, 'lineno', None):
69 raise ValueError(msg + f': {node!r}')
70 def _convert_num(node): argument
71 if not isinstance(node, Constant) or type(node.value) not in (int, float, complex):
72 _raise_malformed_node(node)
[all …]
|
| /third_party/typescript/src/services/ |
| D | callHierarchy.ts | 8 /** Indictates whether a node is named function or class expression. */
9 function isNamedExpression(node: Node): node is NamedExpression {
10 return (isFunctionExpression(node) || isClassExpression(node)) && isNamedDeclaration(node);
19 …/** Indicates whether a node is a function, arrow, or class expression assigned to a constant vari…
20 function isConstNamedExpression(node: Node): node is ConstNamedExpression {
21 return (isFunctionExpression(node) || isArrowFunction(node) || isClassExpression(node))
22 && isVariableDeclaration(node.parent)
23 && node === node.parent.initializer
24 && isIdentifier(node.parent.name)
25 && !!(getCombinedNodeFlags(node.parent) & NodeFlags.Const);
[all …]
|
| D | breakpoints.ts | 34 // Get the span in the node based on its syntax
37 function textSpan(startNode: Node, endNode?: Node) {
44 …function textSpanEndingAtNextToken(startNode: Node, previousTokenToFindNextEndToken: Node): TextSp…
48 …function spanInNodeIfStartsOnSameLine(node: Node | undefined, otherwiseOnNode?: Node): TextSpan | …
49 …if (node && lineOfPosition === sourceFile.getLineAndCharacterOfPosition(node.getStart(sourceFile))…
50 return spanInNode(node);
55 function spanInNodeArray<T extends Node>(nodeArray: NodeArray<T>) {
59 function spanInPreviousNode(node: Node): TextSpan | undefined {
60 return spanInNode(findPrecedingToken(node.pos, sourceFile));
63 function spanInNextNode(node: Node): TextSpan | undefined {
[all …]
|
| /third_party/cef/tools/yapf/yapf/yapflib/ |
| D | split_penalty.py | 53 tree: the top-level pytree node to annotate with penalties.
64 def Visit_import_as_names(self, node): # pyline: disable=invalid-name argument
66 self.DefaultNodeVisit(node)
68 for child in node.children:
74 def Visit_classdef(self, node): # pylint: disable=invalid-name argument
78 _SetUnbreakable(node.children[1])
79 if len(node.children) > 4:
81 _SetUnbreakable(node.children[2])
83 _SetUnbreakable(node.children[-2])
84 self.DefaultNodeVisit(node)
[all …]
|
| /third_party/typescript/src/compiler/transformers/ |
| D | es2018.ts | 72 /** A set of node IDs for generated super accessors. */
82 …* Sets the `HierarchyFacts` for this node prior to visiting this node's subtree, returning the fac…
93 * Restores the `HierarchyFacts` for this node's ancestor after visiting this node's
107 function transformSourceFile(node: SourceFile) {
108 if (node.isDeclarationFile) {
109 return node;
112 currentSourceFile = node;
113 const visited = visitSourceFile(node);
121 function visitor(node: Node): VisitResult<Node> {
122 return visitorWorker(node, /*expressionResultIsUnused*/ false);
[all …]
|
| D | ts.ts | 68 let currentScopeFirstDeclarationsOfName: UnderscoreEscapedMap<Node> | undefined;
91 function transformSourceFileOrBundle(node: SourceFile | Bundle) {
92 if (node.kind === SyntaxKind.Bundle) {
93 return transformBundle(node);
95 return transformSourceFile(node);
98 function transformBundle(node: Bundle) {
99 …return factory.createBundle(node.sourceFiles.map(transformSourceFile), mapDefined(node.prepends, p…
110 * @param node A SourceFile node.
112 function transformSourceFile(node: SourceFile) {
113 if (node.isDeclarationFile) {
[all …]
|
| D | es2017.ts | 48 /** A set of node IDs for generated super accessors (variable statements). */
63 function transformSourceFile(node: SourceFile) {
64 if (node.isDeclarationFile) {
65 return node;
69 …setContextFlag(ContextFlags.HasLexicalThis, !isEffectiveStrictModeSourceFile(node, compilerOptions…
70 const visited = visitEachChild(node, visitor, context);
102 function visitDefault(node: Node): VisitResult<Node> {
103 return visitEachChild(node, visitor, context);
106 function visitor(node: Node): VisitResult<Node> {
107 if ((node.transformFlags & TransformFlags.ContainsES2017) === 0) {
[all …]
|
| /third_party/parse5/packages/parse5/lib/tree-adapters/ |
| D | interface.ts | 5 Node = unknown,
16 node: Node; property
45 * Appends a child node to the given parent node.
47 * @param parentNode - Parent node.
48 * @param newNode - Child node.
53 * Creates a comment node.
60 * Creates a document node.
65 * Creates a document fragment node.
70 * Creates an element node.
79 * Removes a node from its parent.
[all …]
|
| /third_party/nghttp2/src/ |
| D | shrpx_router.cc | 44 RNode *find_next_node(const RNode *node, char c) { in find_next_node() argument
45 auto itr = std::lower_bound(std::begin(node->next), std::end(node->next), c, in find_next_node()
48 if (itr == std::end(node->next) || (*itr)->s[0] != c) { in find_next_node()
57 void add_next_node(RNode *node, std::unique_ptr<RNode> new_node) { in add_next_node() argument
58 auto itr = std::lower_bound(std::begin(node->next), std::end(node->next), in add_next_node()
62 node->next.insert(itr, std::move(new_node)); in add_next_node()
66 void Router::add_node(RNode *node, const char *pattern, size_t patlen, in add_node() argument
71 add_next_node(node, std::move(new_node)); in add_node()
82 auto node = &root_; in add_route() local
86 auto next_node = find_next_node(node, pattern[i]); in add_route()
[all …]
|
| /third_party/typescript/src/compiler/transformers/module/ |
| D | system.ts | 42 let enclosingBlockScopedContainer: Node;
50 * @param node The SourceFile node.
52 function transformSourceFile(node: SourceFile) {
53 …if (node.isDeclarationFile || !(isEffectiveExternalModule(node, compilerOptions) || node.transform…
54 return node;
57 const id = getOriginalNodeId(node);
58 currentSourceFile = node;
59 enclosingBlockScopedContainer = node;
75 …moduleInfo = moduleInfoMap[id] = collectExternalModuleInfo(context, node, resolver, compilerOption…
85 const moduleBodyBlock = createSystemModuleBody(node, dependencyGroups);
[all …]
|
| /third_party/libxml2/result/pattern/ |
| D | multiple | 1 Node /c/b[1]/a[1] matches pattern a
2 Node /c/b[1]/a[2] matches pattern a
3 Node /c/c/b/a[1] matches pattern a
4 Node /c/c/b/a[2] matches pattern a
5 Node /c/b[2]/a[1] matches pattern a
6 Node /c/b[2]/a[2] matches pattern a
7 Node /c/b[1] matches pattern b
8 Node /c/c/b matches pattern b
9 Node /c/b[2] matches pattern b
10 Node /c matches pattern c
[all …]
|
| /third_party/selinux/libsepol/cil/src/ |
| D | cil_tree.c | 44 struct cil_tree_node *cil_tree_get_next_path(struct cil_tree_node *node, char **info_kind, uint32_t… in cil_tree_get_next_path() argument
48 if (!node) { in cil_tree_get_next_path()
52 node = node->parent; in cil_tree_get_next_path()
54 while (node) { in cil_tree_get_next_path()
55 if (node->flavor == CIL_NODE && node->data == NULL) { in cil_tree_get_next_path()
56 if (node->cl_head && node->cl_head->data == CIL_KEY_SRC_INFO) { in cil_tree_get_next_path()
57 if (!node->cl_head->next || !node->cl_head->next->next || !node->cl_head->next->next->next) { in cil_tree_get_next_path()
61 *info_kind = node->cl_head->next->data; in cil_tree_get_next_path()
62 rc = cil_string_to_uint32(node->cl_head->next->next->data, hll_line, 10); in cil_tree_get_next_path()
66 *path = node->cl_head->next->next->next->data; in cil_tree_get_next_path()
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/ |
| D | AsNode.h | 28 static ANGLE_INLINE TIntermNode *exec(TIntermNode *node) { return node; }
34 static ANGLE_INLINE TIntermTyped *exec(TIntermNode *node)
36 return node ? node->getAsTyped() : nullptr;
43 static ANGLE_INLINE TIntermSymbol *exec(TIntermNode *node)
45 return node ? node->getAsSymbolNode() : nullptr;
52 static ANGLE_INLINE TIntermConstantUnion *exec(TIntermNode *node)
54 return node ? node->getAsConstantUnion() : nullptr;
61 static ANGLE_INLINE TIntermFunctionPrototype *exec(TIntermNode *node)
63 return node ? node->getAsFunctionPrototypeNode() : nullptr;
70 static ANGLE_INLINE TIntermPreprocessorDirective *exec(TIntermNode *node)
[all …]
|
| D | IntermRebuild.h | 24 // - The node is visited before children are traversed.
25 // - The returned value is used to replace the visited node. The returned value may be the same
26 // as the original node.
30 // - If any new children are returned, the node is automatically rebuilt with the new children
32 // - Depending on the type of the node, null children may be discarded.
33 // - Ill-typed children cause rebuild errors. Ill-typed means the node to automatically rebuild
38 // - The node is visited after any children are traversed.
67 // Allow visit of returned node's children.
70 // Allow post visit of returned node.
73 // If (Children) bit, only visit if the returned node is the same as the original node.
[all …]
|
| /third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/ |
| D | IntermRebuild.h | 24 // - The node is visited before children are traversed.
25 // - The returned value is used to replace the visited node. The returned value may be the same
26 // as the original node.
30 // - If any new children are returned, the node is automatically rebuilt with the new children
32 // - Depending on the type of the node, null children may be discarded.
33 // - Ill-typed children cause rebuild errors. Ill-typed means the node to automatically rebuild
38 // - The node is visited after any children are traversed.
67 // Allow visit of returned node's children.
70 // Allow post visit of returned node.
73 // If (Children) bit, only visit if the returned node is the same as the original node.
[all …]
|