This TypeScript library provides utilities for working with sorted arrays. Here's a brief overview of the features:
- Range: Defines a range with start and end values.
- InsertType: Enumerates insertion types, whether updating at an index or inserting after an index.
- InsertPoint: Defines where and how to perform an insertion in the array.
- findInsertPoint: Finds where an element should be inserted or updated in a sorted array.
- findInsertPointReversed: Same as
findInsertPointbut for arrays sorted in reverse order. - searchRange: Finds the range of indices for insertion or update in a sorted array.
- range: returns an iterator for the given range in a sorted array.
- splitByRange: Splits an array into three parts based on a specified range: non-overlapping left, overlapping, and non-overlapping right blocks.
- merge: Merges two sorted arrays into a new sorted array, resolving duplicates and optionally filtering results.
- mergeInPlace: Merges two sorted arrays into one, modifying the first array in-place.
- extractRange: Extracts the range of the array based on a key selector function.
Each function is designed with flexibility in mind, allowing you to pass in custom comparison or key selector functions to accommodate different types of data and sorting requirements.
To install it in your project, use the following command with yarn:
yarn add @sytherax/the-sorted-arrayPlease refer to the source code for more detailed usage instructions and examples.