Name Description Size Coverage
binary-search.ts A binary search implementation that returns the index if a match is found. If no match is found, then the left-index (the index associated with the item that comes just before the desired index) is returned. To maintain proper sort order, a splice would happen at the next index: ```js const array = [1, 3]; const needle = 2; const index = binarySearch(array, needle, (item, needle) => item - needle); assert.equal(index, 0); array.splice(index + 1, 0, needle); assert.deepEqual(array, [1, 2, 3]); ``` 2793 -
by-source.ts 1244 -
flatten-map.ts 5417 -
resolve.ts 699 -
sort.ts 1445 -
sourcemap-segment.ts 665 -
strip-filename.ts Removes everything after the last "/", but leaves the slash. 253 -
trace-mapping.ts Typescript doesn't allow friend access to private fields, so this just casts the map into a type with public access modifiers. 15414 -
types.ts 3166 -