Vihren Atlas

filters.ts ×8

Code frontier

unlabeled · c_080bc108245d

35 tests · 5785 LOC · 29 files · introduces 0 tests · 47 LOC · 1 file

Introduces — evidence that enters the hierarchy at this concept

Code
8 ranges47 lines · 1 files
Tests
0 tests

Contains — complete concept membership

All code (extent)
825 ranges5785 lines · 29 files · Browse complete extent
All tests (intent)
35 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: 47 introduced LOC across 8 ranges. Expand a file to inspect source; the > gutter marks introduced lines.

src/vs/base/common/filters.ts 47 introduced LOC · 8 ranges

Open complete file

769 return undefined;
770 }
771 > filters.ts
772 > row--;
773 > column--;
774 >
775 > const result: FuzzyScore = [_table[row][column], wordStart];
776 >
777 > let backwardsDiagLength = 0;
778 > let maxMatchColumn = 0;
779 >
780 > while (row >= 1) {
781 > // Find the column where we go diagonally up
782 > let diagColumn = column;
783 > do {
784 > const arrow = _arrows[row][diagColumn];
785 > if (arrow === Arrow.LeftLeft) {
786 diagColumn = diagColumn - 2;
787 > } else if (arrow === Arrow.Left) { filters.ts
788 diagColumn = diagColumn - 1;
789 > } else { filters.ts
790 > // found the diagonal
791 > break;
792 > }
793 > } while (diagColumn >= 1);
794 >
795 > // Overturn the "forwards" decision if keeping the "backwards" diagonal would give a better match
796 > if (
797 > backwardsDiagLength > 1 // only if we would have a contiguous match of 3 characters
798 && patternLow[patternStart + row - 1] === wordLow[wordStart + column - 1] // only if we can do a contiguous match diagonally
799 && !isUpperCaseAtPos(diagColumn + wordStart - 1, word, wordLow) // only if the forwards chose diagonal is not an uppercase
800 && backwardsDiagLength + 1 > _diag[row][diagColumn] // only if our contiguous match would be longer than the "forwards" contiguous match
801 > ) { filters.ts
802 diagColumn = column;
803 }
804 > filters.ts
805 > if (diagColumn === column) {
806 // this is a contiguous match
807 backwardsDiagLength++;
808 > } else { filters.ts
809 backwardsDiagLength = 1;
810 }
811 > filters.ts
812 > if (!maxMatchColumn) {
813 > // remember the last matched column
814 > maxMatchColumn = diagColumn;
815 > }
816 >
817 > row--;
818 > column = diagColumn - 1;
819 > result.push(column);
820 > }
821 >
822 if (wordLen - wordStart === patternLen && options.boostFullMatch) {
823 // the word matches the pattern with all characters!
825 result[0] += 2;
826 }
827 > filters.ts
828 > // Add 1 penalty for each skipped character in the word
829 > const skippedCharsCount = maxMatchColumn - patternLen;
830 > result[0] -= skippedCharsCount;
831 >
832 > return result;
833 > }
834
835 function _fillInMaxWordMatchPos(patternLen: number, wordLen: number, patternStart: number, wordStart: number, patternLow: string, wordLow: string) {

Direct hierarchy

Parents

Children