Vihren Atlas

filters.ts ×6

Code frontier

unlabeled · c_e8c3e8dfb0e7

46 tests · 5600 LOC · 29 files · introduces 0 tests · 18 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
6 ranges18 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
793 ranges5600 lines · 29 files · Browse complete extent
All tests (intent)
46 testsBrowse complete intent

Neighbourhood graph

The orange circle is the focus. Violet and green circles are every ancestor and descendant, broader and narrower, at any distance; blue squares and pink diamonds are the introduced files and exact introduced tests of every visible concept, not only the focus's. Arrows point from broader to narrower concepts and bridge only concepts omitted from this view. Undirected links show source or test introduction. Concept and file size follows LOC; exact test nodes use test-count units.

Introduced files, introduced tests, and structurally relevant concept specialization

In the embedded map, ordinary wheel input scrolls the page; use the visible controls to zoom and drag to pan. Open the full-screen map for canvas navigation: wheel pans, Ctrl/Command plus wheel zooms, and arrow keys pan when this region is focused. On touch screens, open the full-screen map to pan or pinch. If JavaScript or WebGL is unavailable, use the native relationship evidence on this page.

Graph controls are ready.

Interactive rendering requires JavaScript and WebGL. Use the native relationship evidence on this page while the interactive map is unavailable.

Native relationship evidence

Every exact file and test below is linked only from the concept that introduces it.

Introduced tests

Every collected test enters the hierarchy at exactly one concept.

No tests are introduced at this concept. Its intent tests are introduced by other concepts.

Introduced code

Every collected source range enters the hierarchy at exactly one concept.

1 file ranked by introduced lines: 18 introduced LOC across 6 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/filters.ts 18 introduced LOC · 6 ranges

Open complete file

630
631 export function isPatternInWord(patternLow: string, patternPos: number, patternLen: number, wordLow: string, wordPos: number, wordLen: number, fillMinWordPosArr = false): boolean {
632 > while (patternPos < patternLen && wordPos < wordLen) { filters.ts
633 > if (patternLow[patternPos] === wordLow[wordPos]) {
634 if (fillMinWordPosArr) {
635 // Remember the min word position for each pattern position
638 patternPos += 1;
639 }
640 > wordPos += 1; filters.ts
641 > }
642 > return patternPos === patternLen; // pattern must be exhausted
643 > }
644
645 const enum Arrow { Diag = 1, Left = 2, LeftLeft = 3 }
682
683 export function fuzzyScore(pattern: string, patternLow: string, patternStart: number, word: string, wordLow: string, wordStart: number, options: FuzzyScoreOptions = FuzzyScoreOptions.default): FuzzyScore | undefined {
684 > filters.ts
685 > const patternLen = pattern.length > _maxLen ? _maxLen : pattern.length;
686 > const wordLen = word.length > _maxLen ? _maxLen : word.length;
687 >
688 > if (patternStart >= patternLen || wordStart >= wordLen || (patternLen - patternStart) > (wordLen - wordStart)) {
689 return undefined;
690 }
691 > filters.ts
692 > // Run a simple check if the characters of pattern occur
693 > // (in order) at all in word. If that isn't the case we
694 > // stop because no match will be possible
695 > if (!isPatternInWord(patternLow, patternStart, patternLen, wordLow, wordStart, wordLen, true)) {
696 return undefined;
697 }
766 }
767
768 > if (!hasStrongFirstMatch[0] && !options.firstMatchCanBeWeak) { filters.ts
769 return undefined;
770 }
820 }
821
822 > if (wordLen - wordStart === patternLen && options.boostFullMatch) { filters.ts
823 // the word matches the pattern with all characters!
824 // giving the score a total match boost (to come up ahead other words)

Direct hierarchy

Parents

Children