RBTree | A red-black tree crafted for everyone , but with Vuex

For storing primitive values with an inherent order, just create a new tree. Inserted values will be compared directly for ordering purposes. If the sorting logic is more complex or if the inserted values are keys to objects stored elsewhere, pass a comparator function into the constructor. In this example, the stored values are keys for objects stored in another index. The objects are retrieved from that other index and the property on which the object keys are to be sorted is compared. New values may be inserted with the insert method. Keeping with the above example of storing keys to reference objects stored elsewhere, the value passed to insert should be the key to store. Values inserted that compare as being equal according to the comparator function are considered to be duplicates and are not inserted. Likewise, values may be removed. The tree exposes a handful of properties and methods that may be used to query its contents. The length property maintains a count of the number of elements currently in the tree. The tree may be queried to see if it contains a value with contains. The minimum and maximum values can be found with methods of the same name. Pass an integer to instead receive an array of the top or bottom values in the tree, sorted in order from most extreme to least. The values of the tree are accessible as an array via the values method. The values will be in sorted order. This is a good starting point for using array-based methods, such as filter, each, and map. To efficiently find values that fall within a range, call the range method with values that define the start and end of the desired range. These values may also be replaced with functions that will be called with only the current value and should return a negative, zero, or positive value to show if the current value is before, directly on, or after the boundary, respectively.