Investigate Wildcard Matching Performance

Recently I investigated optimizing path matching in https://github.com/microsoft/TypeScript/pull/59048 since an internal project had over 5500 path mapping entries.

@dmichon-msft brought up a similar issue they had with a project where using wildcard entries in include caused a 14 second slowdown in their builds. Some of the same optimizations might be usable in include/exclude globbing, or we could adapt a different solution with a radix tree or a similar data structure (e.g. https://github.com/microsoft/rushstack/blob/1bf90f890d59de5babaf07ccc2551b77df704b18/libraries/rush-lib/src/logic/LookupByPath.ts as pointed out at https://github.com/microsoft/TypeScript/pull/59048#discussion_r1657649883).

Esamina l’ottimizzazione della corrispondenza dei percorsi in PR 59048, quindi traccia il percorso di globbing include/exclude. Riproduci il rallentamento segnalato con circa 5.500 voci wildcard e confronta un’ottimizzazione adatta, come l’approccio radix tree referenziato. Il lavoro è completato quando si ottiene un miglioramento misurato delle prestazioni mantenendo invariato il comportamento.