nodef/extra-array

File index.ts has 1502 lines of code (exceeds 250 allowed). Consider refactoring.

Open

import {mod} from "extra-math";
import {
  IDENTITY,
  COMPARE,
} from "extra-function";

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function searchMinimumValue<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): number {
  var fc = fc || COMPARE;
  var fm = fm || IDENTITY;
  var X  = x.length;
  if (X===0) return -1;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function searchMaximumValue<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): number {
  var fc = fc || COMPARE;
  var fm = fm || IDENTITY;
  var X  = x.length;
  if (X===0) return -1;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function searchUnsortedValue<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): number {
  var fc = fc || COMPARE;
  var fm = fm || IDENTITY;
  var X  = x.length;
  if (X<=1) return -1;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function searchAdjacentDuplicateValue<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): number {
  var fc = fc || COMPARE;
  var fm = fm || IDENTITY;
  var X  = x.length;
  if (X<=1) return -1;

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function maximumEntries<T, U=T>(x: T[], n: number, fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): [number, T][] {
  var is = searchMaximumValues(x, n, fc, fm);
  return is.map(i => [i, x[i]]);
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function minimumEntries<T, U=T>(x: T[], n: number, fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): [number, T][] {
  var is = searchMinimumValues(x, n, fc, fm);
  return is.map(i => [i, x[i]]);
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function maximums<T, U=T>(x: T[], n: number, fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T[] {
  var is = searchMaximumValues(x, n, fc, fm);
  return is.map(i => x[i]);
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function minimums<T, U=T>(x: T[], n: number, fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T[] {
  var is = searchMinimumValues(x, n, fc, fm);
  return is.map(i => x[i]);
}

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

export function intersection<T, U=T>(x: T[], y: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T[] {
  if (fc) return intersectionDual(x, y, fc, fm);
  else    return intersectionMap (x, y, fm);
}

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

export function union$<T, U=T>(x: T[], y: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T[] {
  if (fc) return unionDual$(x, y, fc, fm);
  else    return unionMap$ (x, y, fm);
}

• Read up
  Read up

Similar blocks of code found in 3 locations. Consider refactoring.

Open

export function difference<T, U=T>(x: T[], y: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T[] {
  if (fc) return differenceDual(x, y, fc, fm);
  else    return differenceMap (x, y, fm);
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function maximumEntry<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): [number, T] {
  var i = searchMaximumValue(x, fc, fm);
  return [i, x[i]];
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function minimumEntry<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): [number, T] {
  var i = searchMinimumValue(x, fc, fm);
  return [i, x[i]];
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function hasInfix<T, U=T>(x: T[], y: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): boolean {
  return searchInfix(x, y, fc, fm) >= 0;
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function hasSubsequence<T, U=T>(x: T[], y: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): boolean {
  return searchSubsequence(x, y, fc, fm) >= 0;
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function minimum<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T {
  var i = searchMinimumValue(x, fc, fm);
  return x[i];
}

• Read up
  Read up

Similar blocks of code found in 2 locations. Consider refactoring.

Open

export function maximum<T, U=T>(x: T[], fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null): T {
  var i = searchMaximumValue(x, fc, fm);
  return x[i];
}

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

export function rangedPartialSort$<T, U=T>(x: T[], i: number, I: number, n: number, fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null, fs: SwapFunction<T> | null=null): T[] {
  var fc = fc || COMPARE;
  var fm = fm || IDENTITY;
  var fs = fs || swapRaw$;
  var [i, I] = indexRange(x, i, I);

• Read up
  Read up

Identical blocks of code found in 2 locations. Consider refactoring.

Open

export function rangedPartialSort<T, U=T>(x: T[], i: number, I: number, n: number, fc: CompareFunction<T|U> | null=null, fm: MapFunction<T, T|U> | null=null, fs: SwapFunction<T> | null=null): T[] {
  return rangedPartialSort$(x.slice(), i, I, n, fc, fm, fs);
}

• Read up
  Read up