sortedUniq

arrays

This method is like uniq except that it's designed and optimized for sorted arrays.

Installation

Import

import { sortedUniq } from '@tulx/utils';

Source Code

Implementation

/**
 * This method is like uniq except that it's designed and optimized for sorted arrays.
 *
 * @param array - The array to inspect.
 * @returns The new duplicate free array.
 *
 * @example
 * ```ts
 * sortedUniq([1, 1, 2]); // [1, 2]
 * ```
 */
export function sortedUniq<T>(array: readonly T[]): T[] {
  if (array.length === 0) {
    return [];
  }

  const result: T[] = [array[0]];
  for (let i = 1; i < array.length; i++) {
    if (array[i] !== array[i - 1]) {
      result.push(array[i]);
    }
  }
  return result;
}

Example

import { sortedUniq } from '@tulx/utils';

sortedUniq([1, 1, 2]); // [1, 2]

Related Functions

chunk

Creates an array of elements split into groups the length of size. If array can't be split evenly, the final chunk will be the remaining elements.

compact

Creates an array with all falsy values removed. The values false, null, 0, "", undefined, and NaN are falsy.

concat

Creates a new array concatenating array with any additional arrays and/or values.

difference

Creates an array of array values not included in the other given arrays. The order and references of result values are determined by the first array.

differenceBy

This method is like difference except that it accepts iteratee which is invoked for each element of array and values to generate the criterion by which they're compared.

differenceWith

This method is like difference except that it accepts comparator which is invoked to compare elements of array to values.