rambda 9.4.2 → 10.0.0-alpha.0

package/src/applySpec.js

@@ -1,132 +0,0 @@
-import { isArray } from './_internals/isArray.js'
-
-// recursively traverse the given spec object to find the highest arity function
-export function __findHighestArity(spec, max = 0){
-  for (const key in spec){
-    if (spec.hasOwnProperty(key) === false || key === 'constructor') continue
-
-    if (typeof spec[ key ] === 'object'){
-      max = Math.max(max, __findHighestArity(spec[ key ]))
-    }
-
-    if (typeof spec[ key ] === 'function'){
-      max = Math.max(max, spec[ key ].length)
-    }
-  }
-
-  return max
-}
-
-function __filterUndefined(){
-  const defined = []
-  let i = 0
-  const l = arguments.length
-  while (i < l){
-    if (typeof arguments[ i ] === 'undefined') break
-    defined[ i ] = arguments[ i ]
-    i++
-  }
-
-  return defined
-}
-
-function __applySpecWithArity(
-  spec, arity, cache
-){
-  const remaining = arity - cache.length
-
-  if (remaining === 1)
-    return x =>
-      __applySpecWithArity(
-        spec, arity, __filterUndefined(...cache, x)
-      )
-  if (remaining === 2)
-    return (x, y) =>
-      __applySpecWithArity(
-        spec, arity, __filterUndefined(
-          ...cache, x, y
-        )
-      )
-  if (remaining === 3)
-    return (
-      x, y, z
-    ) =>
-      __applySpecWithArity(
-        spec, arity, __filterUndefined(
-          ...cache, x, y, z
-        )
-      )
-  if (remaining === 4)
-    return (
-      x, y, z, a
-    ) =>
-      __applySpecWithArity(
-        spec,
-        arity,
-        __filterUndefined(
-          ...cache, x, y, z, a
-        )
-      )
-  if (remaining > 4)
-    return (...args) =>
-      __applySpecWithArity(
-        spec, arity, __filterUndefined(...cache, ...args)
-      )
-
-  // handle spec as Array
-  if (isArray(spec)){
-    const ret = []
-    let i = 0
-    const l = spec.length
-    for (; i < l; i++){
-      // handle recursive spec inside array
-      if (typeof spec[ i ] === 'object' || isArray(spec[ i ])){
-        ret[ i ] = __applySpecWithArity(
-          spec[ i ], arity, cache
-        )
-      }
-      // apply spec to the key
-      if (typeof spec[ i ] === 'function'){
-        ret[ i ] = spec[ i ](...cache)
-      }
-    }
-
-    return ret
-  }
-
-  // handle spec as Object
-  const ret = {}
-  // apply callbacks to each property in the spec object
-  for (const key in spec){
-    if (spec.hasOwnProperty(key) === false || key === 'constructor') continue
-
-    // apply the spec recursively
-    if (typeof spec[ key ] === 'object'){
-      ret[ key ] = __applySpecWithArity(
-        spec[ key ], arity, cache
-      )
-      continue
-    }
-
-    // apply spec to the key
-    if (typeof spec[ key ] === 'function'){
-      ret[ key ] = spec[ key ](...cache)
-    }
-  }
-
-  return ret
-}
-
-export function applySpec(spec, ...args){
-  // get the highest arity spec function, cache the result and pass to __applySpecWithArity
-  const arity = __findHighestArity(spec)
-
-  if (arity === 0){
-    return () => ({})
-  }
-  const toReturn = __applySpecWithArity(
-    spec, arity, args
-  )
-
-  return toReturn
-}

package/src/applyTo.js

@@ -1,7 +0,0 @@
-export function applyTo(input, fn){
-  if (arguments.length === 1){
-    return _fn => applyTo(input, _fn)
-  }
-
-  return fn(input)
-}

package/src/ascend.js

@@ -1,23 +0,0 @@
-export function createCompareFunction(
-  a, b, winner, loser
-){
-  if (a === b) return 0
-
-  return a < b ? winner : loser
-}
-
-export function ascend(
-  getFunction, a, b
-){
-  if (arguments.length === 1){
-    return (_a, _b) => ascend(
-      getFunction, _a, _b
-    )
-  }
-  const aValue = getFunction(a)
-  const bValue = getFunction(b)
-
-  return createCompareFunction(
-    aValue, bValue, -1, 1
-  )
-}

package/src/assoc.js

@@ -1,11 +0,0 @@
-import { curry } from './curry.js'
-
-export function assocFn(
-  prop, newValue, obj
-){
-  return Object.assign(
-    {}, obj, { [ prop ] : newValue }
-  )
-}
-
-export const assoc = curry(assocFn)

package/src/assocPath.js

@@ -1,46 +0,0 @@
-import { cloneList } from './_internals/cloneList.js'
-import { createPath } from './_internals/createPath.js'
-import { isArray } from './_internals/isArray.js'
-import { isIndexInteger } from './_internals/isInteger.js'
-import { assocFn } from './assoc.js'
-import { curry } from './curry.js'
-
-export function assocPathFn(
-  path, newValue, input
-){
-  const pathArrValue = createPath(path)
-  if (pathArrValue.length === 0) return newValue
-
-  const index = pathArrValue[ 0 ]
-  if (pathArrValue.length > 1){
-    const condition =
-      typeof input !== 'object' ||
-      input === null ||
-      !input.hasOwnProperty(index)
-
-    const nextInput = condition ?
-      isIndexInteger(pathArrValue[ 1 ]) ?
-        [] :
-        {} :
-      input[ index ]
-
-    newValue = assocPathFn(
-      Array.prototype.slice.call(pathArrValue, 1),
-      newValue,
-      nextInput
-    )
-  }
-
-  if (isIndexInteger(index) && isArray(input)){
-    const arr = cloneList(input)
-    arr[ index ] = newValue
-
-    return arr
-  }
-
-  return assocFn(
-    index, newValue, input
-  )
-}
-
-export const assocPath = curry(assocPathFn)

package/src/binary.js

@@ -1,5 +0,0 @@
-export function binary(fn){
-  if (fn.length <= 2) return fn
-
-  return (a, b) => fn(a, b)
-}

package/src/bind.js

@@ -1,9 +0,0 @@
-import { curryN } from './curryN.js'
-
-export function bind(fn, thisObj){
-  if (arguments.length === 1){
-    return _thisObj => bind(fn, _thisObj)
-  }
-
-  return curryN(fn.length, (...args) => fn.apply(thisObj, args))
-}

package/src/both.js

@@ -1,5 +0,0 @@
-export function both(f, g){
-  if (arguments.length === 1) return _g => both(f, _g)
-
-  return (...input) => f(...input) && g(...input)
-}

package/src/call.js

@@ -1 +0,0 @@
-export const call = (fn, ...inputs) => fn(...inputs)

package/src/chain.js

@@ -1,7 +0,0 @@
-export function chain(fn, list){
-  if (arguments.length === 1){
-    return _list => chain(fn, _list)
-  }
-
-  return [].concat(...list.map(fn))
-}

package/src/clamp.js

@@ -1,15 +0,0 @@
-import { curry } from './curry.js'
-
-function clampFn(
-  min, max, input
-){
-  if (min > max){
-    throw new Error('min must not be greater than max in clamp(min, max, value)')
-  }
-  if (input >= min && input <= max) return input
-
-  if (input > max) return max
-  if (input < min) return min
-}
-
-export const clamp = curry(clampFn)

package/src/clone.js

@@ -1,18 +0,0 @@
-import { isArray } from './_internals/isArray.js'
-
-export function clone(input){
-  const out = isArray(input) ? Array(input.length) : {}
-  if (input && input.getTime) return new Date(input.getTime())
-
-  for (const key in input){
-    const v = input[ key ]
-    out[ key ] =
-      typeof v === 'object' && v !== null ?
-        v.getTime ?
-          new Date(v.getTime()) :
-          clone(v) :
-        v
-  }
-
-  return out
-}

package/src/collectBy.js

@@ -1,27 +0,0 @@
-import { reduce } from './reduce.js'
-
-export function collectBy(fn, list){
-  if (arguments.length === 1){
-    return _list => collectBy(fn, _list)
-  }
-
-  const group = reduce(
-    (o, x) => {
-      const tag = fn(x)
-      if (o[ tag ] === undefined){
-        o[ tag ] = []
-      }
-      o[ tag ].push(x)
-
-      return o
-    },
-    {},
-    list
-  )
-  const newList = []
-  for (const tag in group){
-    newList.push(group[ tag ])
-  }
-
-  return newList
-}

package/src/comparator.js

@@ -1,5 +0,0 @@
-export function comparator(fn){
-  return function (a, b){
-    return fn(a, b) ? -1 : fn(b, a) ? 1 : 0
-  }
-}

package/src/compose.js

@@ -1,9 +0,0 @@
-import { pipe } from './pipe.js'
-
-export function compose(){
-  if (arguments.length === 0){
-    throw new Error('compose requires at least one argument')
-  }
-
-  return pipe.apply(this, Array.prototype.slice.call(arguments, 0).reverse())
-}

package/src/composeWith.js

@@ -1,33 +0,0 @@
-import { _arity } from './_internals/_arity.js'
-import { head } from './head.js'
-import { identity } from './identity.js'
-import { reduce } from './reduce.js'
-import { reverse } from './reverse.js'
-import { tail } from './tail.js'
-
-export function pipeWith(xf, list){
-  if (list.length <= 0){
-    return identity
-  }
-
-  const headList = head(list)
-  const tailList = tail(list)
-
-  return _arity(headList.length, function (){
-    return reduce(
-      function (result, f){
-        return xf.call(
-          this, f, result
-        )
-      },
-      headList.apply(this, arguments),
-      tailList
-    )
-  })
-}
-
-export function composeWith(xf, list){
-  if (arguments.length === 1) return _list => composeWith(xf, _list)
-
-  return pipeWith.apply(this, [ xf, reverse(list) ])
-}

package/src/cond.js

@@ -1,14 +0,0 @@
-export function cond(conditions){
-  return (...input) => {
-    let done = false
-    let toReturn
-    conditions.forEach(([ predicate, getResult ]) => {
-      if (!done && predicate(...input)){
-        done = true
-        toReturn = getResult(...input)
-      }
-    })
-
-    return toReturn
-  }
-}

package/src/converge.js

@@ -1,18 +0,0 @@
-import { curryN } from './curryN.js'
-import { map } from './map.js'
-import { max } from './max.js'
-import { reduce } from './reduce.js'
-
-export function converge(fn, transformers){
-  if (arguments.length === 1)
-    return _transformers => converge(fn, _transformers)
-
-  const highestArity = reduce(
-    (a, b) => max(a, b.length), 0, transformers
-  )
-
-  return curryN(highestArity, function (){
-    return fn.apply(this,
-      map(g => g.apply(this, arguments), transformers))
-  })
-}

package/src/curry.js

@@ -1,7 +0,0 @@
-export function curry(fn, args = []){
-  return (..._args) =>
-    (rest => rest.length >= fn.length ? fn(...rest) : curry(fn, rest))([
-      ...args,
-      ..._args,
-    ])
-}

package/src/curryN.js

@@ -1,40 +0,0 @@
-import { _arity } from './_internals/_arity.js'
-
-function _curryN(
-  n, cache, fn
-){
-  return function (){
-    let ci = 0
-    let ai = 0
-    const cl = cache.length
-    const al = arguments.length
-    const args = new Array(cl + al)
-    while (ci < cl){
-      args[ ci ] = cache[ ci ]
-      ci++
-    }
-    while (ai < al){
-      args[ cl + ai ] = arguments[ ai ]
-      ai++
-    }
-    const remaining = n - args.length
-
-    return args.length >= n ?
-      fn.apply(this, args) :
-      _arity(remaining, _curryN(
-        n, args, fn
-      ))
-  }
-}
-
-export function curryN(n, fn){
-  if (arguments.length === 1) return _fn => curryN(n, _fn)
-
-  if (n > 10){
-    throw new Error('First argument to _arity must be a non-negative integer no greater than ten')
-  }
-
-  return _arity(n, _curryN(
-    n, [], fn
-  ))
-}

package/src/dec.js

@@ -1 +0,0 @@
-export const dec = x => x - 1

package/src/descend.js

@@ -1,17 +0,0 @@
-import { createCompareFunction } from './ascend.js'
-
-export function descend(
-  getFunction, a, b
-){
-  if (arguments.length === 1){
-    return (_a, _b) => descend(
-      getFunction, _a, _b
-    )
-  }
-  const aValue = getFunction(a)
-  const bValue = getFunction(b)
-
-  return createCompareFunction(
-    aValue, bValue, 1, -1
-  )
-}

package/src/difference.js

@@ -1,8 +0,0 @@
-import { includes } from './includes.js'
-import { uniq } from './uniq.js'
-
-export function difference(a, b){
-  if (arguments.length === 1) return _b => difference(a, _b)
-
-  return uniq(a).filter(aInstance => !includes(aInstance, b))
-}

package/src/differenceWith.js

@@ -1,20 +0,0 @@
-import { curry } from './curry.js'
-import { _indexOf } from './equals.js'
-
-export function differenceWithFn(
-  fn, a, b
-){
-  const willReturn = []
-  const [ first, second ] = a.length >= b.length ? [ a, b ] : [ b, a ]
-
-  first.forEach(item => {
-    const hasItem = second.some(secondItem => fn(item, secondItem))
-    if (!hasItem && _indexOf(item, willReturn) === -1){
-      willReturn.push(item)
-    }
-  })
-
-  return willReturn
-}
-
-export const differenceWith = curry(differenceWithFn)

package/src/dissoc.js

@@ -1,13 +0,0 @@
-export function dissoc(prop, obj){
-  if (arguments.length === 1) return _obj => dissoc(prop, _obj)
-
-  if (obj === null || obj === undefined) return {}
-
-  const willReturn = {}
-  for (const p in obj){
-    willReturn[ p ] = obj[ p ]
-  }
-  delete willReturn[ prop ]
-
-  return willReturn
-}

package/src/dissocPath.js

@@ -1,47 +0,0 @@
-import { createPath } from '../src/_internals/createPath.js'
-import { isArray } from './_internals/isArray.js'
-import { isIndexInteger } from './_internals/isInteger.js'
-import { omit } from './omit.js'
-import { path } from './path.js'
-import { removeIndex } from './removeIndex.js'
-import { update } from './update.js'
-
-export function dissocPath(pathInput, input){
-  if (arguments.length === 1) return _obj => dissocPath(pathInput, _obj)
-
-  const pathArrValue = createPath(pathInput)
-  // this {...input} spread could be done to satisfy ramda specs, but this is done on so many places
-  // TODO: add warning that Rambda simply returns input if path is empty
-  if (pathArrValue.length === 0) return input
-
-  const pathResult = path(pathArrValue, input)
-  if (pathResult === undefined) return input
-
-  const index = pathArrValue[ 0 ]
-  const condition =
-    typeof input !== 'object' ||
-    input === null ||
-    !input.hasOwnProperty(index)
-  if (pathArrValue.length > 1){
-    const nextInput = condition ?
-      isIndexInteger(pathArrValue[ 1 ]) ?
-        [] :
-        {} :
-      input[ index ]
-    const nextPathInput = Array.prototype.slice.call(pathArrValue, 1)
-    const intermediateResult = dissocPath(
-      nextPathInput, nextInput, input
-    )
-    if (isArray(input)) return update(
-      index, intermediateResult, input
-    )
-
-    return {
-      ...input,
-      [ index ] : intermediateResult,
-    }
-  }
-  if (isArray(input)) return removeIndex(index, input)
-
-  return omit([ index ], input)
-}

package/src/divide.js

@@ -1,5 +0,0 @@
-export function divide(a, b){
-  if (arguments.length === 1) return _b => divide(a, _b)
-
-  return a / b
-}

package/src/dropRepeats.js

@@ -1,20 +0,0 @@
-import { isArray } from './_internals/isArray.js'
-import { equals } from './equals.js'
-
-export function dropRepeats(list){
-  if (!isArray(list)){
-    throw new Error(`${ list } is not a list`)
-  }
-
-  const toReturn = []
-
-  list.reduce((prev, current) => {
-    if (!equals(prev, current)){
-      toReturn.push(current)
-    }
-
-    return current
-  }, undefined)
-
-  return toReturn
-}

package/src/dropRepeatsBy.js

@@ -1,21 +0,0 @@
-import { equals } from './equals.js'
-
-export function dropRepeatsBy(fn, list){
-  if (arguments.length === 1) return _list => dropRepeatsBy(fn, _list)
-
-  let lastEvaluated = null
-
-  return list.slice().filter(item => {
-    if (lastEvaluated === null){
-      lastEvaluated = fn(item)
-
-      return true
-    }
-    const evaluatedResult = fn(item)
-    if (equals(lastEvaluated, evaluatedResult)) return false
-
-    lastEvaluated = evaluatedResult
-
-    return true
-  })
-}

package/src/dropRepeatsWith.js

@@ -1,28 +0,0 @@
-import { isArray } from './_internals/isArray.js'
-
-export function dropRepeatsWith(predicate, list){
-  if (arguments.length === 1){
-    return _iterable => dropRepeatsWith(predicate, _iterable)
-  }
-
-  if (!isArray(list)){
-    throw new Error(`${ list } is not a list`)
-  }
-
-  const toReturn = []
-
-  list.reduce((prev, current) => {
-    if (prev === undefined){
-      toReturn.push(current)
-
-      return current
-    }
-    if (!predicate(prev, current)){
-      toReturn.push(current)
-    }
-
-    return current
-  }, undefined)
-
-  return toReturn
-}

package/src/either.js

@@ -1,8 +0,0 @@
-export function either(firstPredicate, secondPredicate){
-  if (arguments.length === 1){
-    return _secondPredicate => either(firstPredicate, _secondPredicate)
-  }
-
-  return (...input) =>
-    Boolean(firstPredicate(...input) || secondPredicate(...input))
-}

package/src/empty.js

@@ -1,15 +0,0 @@
-import { type } from './type.js'
-
-export function empty(list){
-  if (typeof list === 'string') return ''
-
-  if (Array.isArray(list)){
-    const { name } = list.constructor
-    if (name === 'Uint8Array') return Uint8Array.from('')
-
-    if (name === 'Float32Array') return new Float32Array([])
-
-    return []
-  }
-  if (type(list) === 'Object') return {}
-}