183 lines
6.4 KiB
TypeScript
183 lines
6.4 KiB
TypeScript
/**
|
|
* @license
|
|
* Copyright Google LLC All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by an MIT-style license that can be
|
|
* found in the LICENSE file at https://angular.io/license
|
|
*/
|
|
import * as ts from 'typescript';
|
|
|
|
import {absoluteFrom, AbsoluteFsPath, isRooted, ReadonlyFileSystem} from '../../src/ngtsc/file_system';
|
|
import {DeclarationNode, KnownDeclaration} from '../../src/ngtsc/reflection';
|
|
|
|
/**
|
|
* A list (`Array`) of partially ordered `T` items.
|
|
*
|
|
* The items in the list are partially ordered in the sense that any element has either the same or
|
|
* higher precedence than any element which appears later in the list. What "higher precedence"
|
|
* means and how it is determined is implementation-dependent.
|
|
*
|
|
* See [PartiallyOrderedSet](https://en.wikipedia.org/wiki/Partially_ordered_set) for more details.
|
|
* (Refraining from using the term "set" here, to avoid confusion with JavaScript's
|
|
* [Set](https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Set).)
|
|
*
|
|
* NOTE: A plain `Array<T>` is not assignable to a `PartiallyOrderedList<T>`, but a
|
|
* `PartiallyOrderedList<T>` is assignable to an `Array<T>`.
|
|
*/
|
|
export interface PartiallyOrderedList<T> extends Array<T> {
|
|
_partiallyOrdered: true;
|
|
|
|
map<U>(callbackfn: (value: T, index: number, array: PartiallyOrderedList<T>) => U, thisArg?: any):
|
|
PartiallyOrderedList<U>;
|
|
slice(...args: Parameters<Array<T>['slice']>): PartiallyOrderedList<T>;
|
|
}
|
|
|
|
export function getOriginalSymbol(checker: ts.TypeChecker): (symbol: ts.Symbol) => ts.Symbol {
|
|
return function(symbol: ts.Symbol) {
|
|
return ts.SymbolFlags.Alias & symbol.flags ? checker.getAliasedSymbol(symbol) : symbol;
|
|
};
|
|
}
|
|
|
|
export function isDefined<T>(value: T|undefined|null): value is T {
|
|
return (value !== undefined) && (value !== null);
|
|
}
|
|
|
|
export function getNameText(name: ts.PropertyName|ts.BindingName): string {
|
|
return ts.isIdentifier(name) || ts.isLiteralExpression(name) ? name.text : name.getText();
|
|
}
|
|
|
|
/**
|
|
* Parse down the AST and capture all the nodes that satisfy the test.
|
|
* @param node The start node.
|
|
* @param test The function that tests whether a node should be included.
|
|
* @returns a collection of nodes that satisfy the test.
|
|
*/
|
|
export function findAll<T>(node: ts.Node, test: (node: ts.Node) => node is ts.Node & T): T[] {
|
|
const nodes: T[] = [];
|
|
findAllVisitor(node);
|
|
return nodes;
|
|
|
|
function findAllVisitor(n: ts.Node) {
|
|
if (test(n)) {
|
|
nodes.push(n);
|
|
} else {
|
|
n.forEachChild(child => findAllVisitor(child));
|
|
}
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Does the given declaration have a name which is an identifier?
|
|
* @param declaration The declaration to test.
|
|
* @returns true if the declaration has an identifier for a name.
|
|
*/
|
|
export function hasNameIdentifier(declaration: ts.Node): declaration is DeclarationNode&
|
|
{name: ts.Identifier} {
|
|
const namedDeclaration: ts.Node&{name?: ts.Node} = declaration;
|
|
return namedDeclaration.name !== undefined && ts.isIdentifier(namedDeclaration.name);
|
|
}
|
|
|
|
/**
|
|
* Test whether a path is "relative".
|
|
*
|
|
* Relative paths start with `/`, `./` or `../` (or the Windows equivalents); or are simply `.` or
|
|
* `..`.
|
|
*/
|
|
export function isRelativePath(path: string): boolean {
|
|
return isRooted(path) || /^\.\.?(\/|\\|$)/.test(path);
|
|
}
|
|
|
|
/**
|
|
* A `Map`-like object that can compute and memoize a missing value for any key.
|
|
*
|
|
* The computed values are memoized, so the factory function is not called more than once per key.
|
|
* This is useful for storing values that are expensive to compute and may be used multiple times.
|
|
*/
|
|
// NOTE:
|
|
// Ideally, this class should extend `Map`, but that causes errors in ES5 transpiled code:
|
|
// `TypeError: Constructor Map requires 'new'`
|
|
export class FactoryMap<K, V> {
|
|
private internalMap: Map<K, V>;
|
|
|
|
constructor(private factory: (key: K) => V, entries?: readonly(readonly[K, V])[]|null) {
|
|
this.internalMap = new Map(entries);
|
|
}
|
|
|
|
get(key: K): V {
|
|
if (!this.internalMap.has(key)) {
|
|
this.internalMap.set(key, this.factory(key));
|
|
}
|
|
|
|
return this.internalMap.get(key)!;
|
|
}
|
|
|
|
set(key: K, value: V): void {
|
|
this.internalMap.set(key, value);
|
|
}
|
|
}
|
|
|
|
/**
|
|
* Attempt to resolve a `path` to a file by appending the provided `postFixes`
|
|
* to the `path` and checking if the file exists on disk.
|
|
* @returns An absolute path to the first matching existing file, or `null` if none exist.
|
|
*/
|
|
export function resolveFileWithPostfixes(
|
|
fs: ReadonlyFileSystem, path: AbsoluteFsPath, postFixes: string[]): AbsoluteFsPath|null {
|
|
for (const postFix of postFixes) {
|
|
const testPath = absoluteFrom(path + postFix);
|
|
if (fs.exists(testPath) && fs.stat(testPath).isFile()) {
|
|
return testPath;
|
|
}
|
|
}
|
|
return null;
|
|
}
|
|
|
|
/**
|
|
* Determine whether a function declaration corresponds with a TypeScript helper function, returning
|
|
* its kind if so or null if the declaration does not seem to correspond with such a helper.
|
|
*/
|
|
export function getTsHelperFnFromDeclaration(decl: DeclarationNode): KnownDeclaration|null {
|
|
if (!ts.isFunctionDeclaration(decl) && !ts.isVariableDeclaration(decl)) {
|
|
return null;
|
|
}
|
|
|
|
if (decl.name === undefined || !ts.isIdentifier(decl.name)) {
|
|
return null;
|
|
}
|
|
|
|
return getTsHelperFnFromIdentifier(decl.name);
|
|
}
|
|
|
|
/**
|
|
* Determine whether an identifier corresponds with a TypeScript helper function (based on its
|
|
* name), returning its kind if so or null if the identifier does not seem to correspond with such a
|
|
* helper.
|
|
*/
|
|
export function getTsHelperFnFromIdentifier(id: ts.Identifier): KnownDeclaration|null {
|
|
switch (stripDollarSuffix(id.text)) {
|
|
case '__assign':
|
|
return KnownDeclaration.TsHelperAssign;
|
|
case '__spread':
|
|
return KnownDeclaration.TsHelperSpread;
|
|
case '__spreadArrays':
|
|
return KnownDeclaration.TsHelperSpreadArrays;
|
|
default:
|
|
return null;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* An identifier may become repeated when bundling multiple source files into a single bundle, so
|
|
* bundlers have a strategy of suffixing non-unique identifiers with a suffix like $2. This function
|
|
* strips off such suffixes, so that ngcc deals with the canonical name of an identifier.
|
|
* @param value The value to strip any suffix of, if applicable.
|
|
* @returns The canonical representation of the value, without any suffix.
|
|
*/
|
|
export function stripDollarSuffix(value: string): string {
|
|
return value.replace(/\$\d+$/, '');
|
|
}
|
|
|
|
export function stripExtension(fileName: string): string {
|
|
return fileName.replace(/\..+$/, '');
|
|
}
|