docs/libs/typescript.js
function tryClassifyNode(node) {
                if (ts.isJSDocTag(node)) {
                    return true;
                }
                if (ts.nodeIsMissing(node)) {
                    return true;
                }
                var classifiedElementName = tryClassifyJsxElementName(node);
                if (!ts.isToken(node) && node.kind !== 244 /* JsxText */ && classifiedElementName === undefined) {
                    return false;
                }
                var tokenStart = node.kind === 244 /* JsxText */ ? node.pos : classifyLeadingTriviaAndGetTokenStart(node);
                var tokenWidth = node.end - tokenStart;
                ts.Debug.assert(tokenWidth >= 0);
                if (tokenWidth > 0) {
                    var type = classifiedElementName || classifyTokenType(node.kind, node);
                    if (type) {
                        pushClassification(tokenStart, tokenWidth, type);
                    }
                }
                return true;
            }
function tryClassifyNode(node) {
                if (ts.isJSDocTag(node)) {
                    return true;
                }
                if (ts.nodeIsMissing(node)) {
                    return true;
                }
                var classifiedElementName = tryClassifyJsxElementName(node);
                if (!ts.isToken(node) && node.kind !== 244 /* JsxText */ && classifiedElementName === undefined) {
                    return false;
                }
                var tokenStart = node.kind === 244 /* JsxText */ ? node.pos : classifyLeadingTriviaAndGetTokenStart(node);
                var tokenWidth = node.end - tokenStart;
                ts.Debug.assert(tokenWidth >= 0);
                if (tokenWidth > 0) {
                    var type = classifiedElementName || classifyTokenType(node.kind, node);
                    if (type) {
                        pushClassification(tokenStart, tokenWidth, type);
                    }
                }
                return true;
            }
function tryClassifyNode ( node ) { if ( ts . isJSDocTag ( node ) ) { return true ; } if ( ts . nodeIsMissing ( node ) ) { return true ; } var classifiedElementName = tryClassifyJsxElementName ( node ) ; if ( ! ts . isToken ( node ) && node . kind !== 244 /* JsxText */ && classifiedElementName === undefined ) { return false ; } var tokenStart = node . kind === 244 /* JsxText */ ? node . pos : classifyLeadingTriviaAndGetTokenStart ( node ) ; var tokenWidth = node . end - tokenStart ; ts . Debug . assert ( tokenWidth >= 0 ) ; if ( tokenWidth > 0 ) { var type = classifiedElementName || classifyTokenType ( node . kind , node ) ; if ( type ) { pushClassification ( tokenStart , tokenWidth , type ) ; } } return true ; }
Returns true if node should be treated as classified and no further processing is required.
False will mean that node is not classified and traverse routine should recurse into node contents.
Returns true if node should be treated as classified and no further processing is required . False will mean that node is not classified and traverse routine should recurse into node contents .