@types/ramda

// Type definitions for ramda 0.26 // Project: https://github.com/donnut/typescript-ramda, https://ramdajs.com // Definitions by: Erwin Poeze <https://github.com/donnut> // Tycho Grouwstra <https://github.com/tycho01> // Matt DeKrey <https://github.com/mdekrey> // Matt Dziuban <https://github.com/mrdziuban> // Stephen King <https://github.com/sbking> // Alejandro Fernandez Haro <https://github.com/afharo> // Vítor Castro <https://github.com/teves-castro> // Jordan Quagliatini <https://github.com/1M0reBug> // Simon Højberg <https://github.com/hojberg> // Samson Keung <https://github.com/samsonkeung> // Angelo Ocana <https://github.com/angeloocana> // Rayner Pupo <https://github.com/raynerd> // Miika Hänninen <https://github.com/googol> // Nikita Moshensky <https://github.com/moshensky> // Ethan Resnick <https://github.com/ethanresnick> // Jack Leigh <https://github.com/leighman> // Keagan McClelland <https://github.com/CaptJakk> // Tomas Szabo <https://github.com/deftomat> // Bonggyun Lee <https://github.com/deptno> // Maciek Blim <https://github.com/blimusiek> // Marcin Biernat <https://github.com/biern> // Rayhaneh Banyassady <https://github.com/rayhaneh> // Ryan McCuaig <https://github.com/rgm> // Drew Wyatt <https://github.com/drewwyatt> // John Ottenlips <https://github.com/jottenlips> // Nitesh Phadatare <https://github.com/minitesh> // Krantisinh Deshmukh <https://github.com/krantisinh> // Pierre-Antoine Mills <https://github.com/pirix-gh> // Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped // TypeScript Version: 3.3 /// <reference path="./es/add.d.ts" /> /// <reference path="./es/addIndex.d.ts" /> /// <reference path="./es/adjust.d.ts" /> /// <reference path="./es/all.d.ts" /> /// <reference path="./es/allPass.d.ts" /> /// <reference path="./es/always.d.ts" /> /// <reference path="./es/and.d.ts" /> /// <reference path="./es/any.d.ts" /> /// <reference path="./es/anyPass.d.ts" /> /// <reference path="./es/ap.d.ts" /> /// <reference path="./es/aperture.d.ts" /> /// <reference path="./es/append.d.ts" /> /// <reference path="./es/apply.d.ts" /> /// <reference path="./es/applySpec.d.ts" /> /// <reference path="./es/applyTo.d.ts" /> /// <reference path="./es/ascend.d.ts" /> /// <reference path="./es/assoc.d.ts" /> /// <reference path="./es/assocPath.d.ts" /> /// <reference path="./es/binary.d.ts" /> /// <reference path="./es/bind.d.ts" /> /// <reference path="./es/both.d.ts" /> /// <reference path="./es/call.d.ts" /> /// <reference path="./es/chain.d.ts" /> /// <reference path="./es/clamp.d.ts" /> /// <reference path="./es/clone.d.ts" /> /// <reference path="./es/comparator.d.ts" /> /// <reference path="./es/complement.d.ts" /> /// <reference path="./es/compose.d.ts" /> /// <reference path="./es/composeK.d.ts" /> /// <reference path="./es/composeP.d.ts" /> /// <reference path="./es/composeWith.d.ts" /> /// <reference path="./es/concat.d.ts" /> /// <reference path="./es/cond.d.ts" /> /// <reference path="./es/construct.d.ts" /> /// <reference path="./es/constructN.d.ts" /> /// <reference path="./es/contains.d.ts" /> /// <reference path="./es/converge.d.ts" /> /// <reference path="./es/countBy.d.ts" /> /// <reference path="./es/curry.d.ts" /> /// <reference path="./es/curryN.d.ts" /> /// <reference path="./es/dec.d.ts" /> /// <reference path="./es/defaultTo.d.ts" /> /// <reference path="./es/descend.d.ts" /> /// <reference path="./es/difference.d.ts" /> /// <reference path="./es/differenceWith.d.ts" /> /// <reference path="./es/dissoc.d.ts" /> /// <reference path="./es/dissocPath.d.ts" /> /// <reference path="./es/divide.d.ts" /> /// <reference path="./es/drop.d.ts" /> /// <reference path="./es/dropLast.d.ts" /> /// <reference path="./es/dropLastWhile.d.ts" /> /// <reference path="./es/dropRepeats.d.ts" /> /// <reference path="./es/dropRepeatsWith.d.ts" /> /// <reference path="./es/either.d.ts" /> /// <reference path="./es/empty.d.ts" /> /// <reference path="./es/endsWith.d.ts" /> /// <reference path="./es/eqBy.d.ts" /> /// <reference path="./es/eqProps.d.ts" /> /// <reference path="./es/equals.d.ts" /> /// <reference path="./es/evolve.d.ts" /> /// <reference path="./es/F.d.ts" /> /// <reference path="./es/filter.d.ts" /> /// <reference path="./es/find.d.ts" /> /// <reference path="./es/findIndex.d.ts" /> /// <reference path="./es/findLast.d.ts" /> /// <reference path="./es/findLastIndex.d.ts" /> /// <reference path="./es/flatten.d.ts" /> /// <reference path="./es/flip.d.ts" /> /// <reference path="./es/forEach.d.ts" /> /// <reference path="./es/forEachObjIndexed.d.ts" /> /// <reference path="./es/fromPairs.d.ts" /> /// <reference path="./es/groupBy.d.ts" /> /// <reference path="./es/groupWith.d.ts" /> /// <reference path="./es/gt.d.ts" /> /// <reference path="./es/gte.d.ts" /> /// <reference path="./es/has.d.ts" /> /// <reference path="./es/hasIn.d.ts" /> /// <reference path="./es/hasPath.d.ts" /> /// <reference path="./es/head.d.ts" /> /// <reference path="./es/identical.d.ts" /> /// <reference path="./es/identity.d.ts" /> /// <reference path="./es/ifElse.d.ts" /> /// <reference path="./es/inc.d.ts" /> /// <reference path="./es/indexBy.d.ts" /> /// <reference path="./es/indexOf.d.ts" /> /// <reference path="./es/init.d.ts" /> /// <reference path="./es/innerJoin.d.ts" /> /// <reference path="./es/insertAll.d.ts" /> /// <reference path="./es/insert.d.ts" /> /// <reference path="./es/intersection.d.ts" /> /// <reference path="./es/intersectionWith.d.ts" /> /// <reference path="./es/intersperse.d.ts" /> /// <reference path="./es/into.d.ts" /> /// <reference path="./es/invert.d.ts" /> /// <reference path="./es/invertObj.d.ts" /> /// <reference path="./es/invoker.d.ts" /> /// <reference path="./es/isArrayLike.d.ts" /> /// <reference path="./es/is.d.ts" /> /// <reference path="./es/isEmpty.d.ts" /> /// <reference path="./es/isNaN.d.ts" /> /// <reference path="./es/isNil.d.ts" /> /// <reference path="./es/join.d.ts" /> /// <reference path="./es/juxt.d.ts" /> /// <reference path="./es/keys.d.ts" /> /// <reference path="./es/keysIn.d.ts" /> /// <reference path="./es/last.d.ts" /> /// <reference path="./es/lastIndexOf.d.ts" /> /// <reference path="./es/length.d.ts" /> /// <reference path="./es/lens.d.ts" /> /// <reference path="./es/lensIndex.d.ts" /> /// <reference path="./es/lensPath.d.ts" /> /// <reference path="./es/lensProp.d.ts" /> /// <reference path="./es/lift.d.ts" /> /// <reference path="./es/lt.d.ts" /> /// <reference path="./es/lte.d.ts" /> /// <reference path="./es/mapAccum.d.ts" /> /// <reference path="./es/mapAccumRight.d.ts" /> /// <reference path="./es/map.d.ts" /> /// <reference path="./es/mapObjIndexed.d.ts" /> /// <reference path="./es/match.d.ts" /> /// <reference path="./es/mathMod.d.ts" /> /// <reference path="./es/maxBy.d.ts" /> /// <reference path="./es/max.d.ts" /> /// <reference path="./es/mean.d.ts" /> /// <reference path="./es/median.d.ts" /> /// <reference path="./es/memoizeWith.d.ts" /> /// <reference path="./es/mergeAll.d.ts" /> /// <reference path="./es/mergeDeepLeft.d.ts" /> /// <reference path="./es/mergeDeepRight.d.ts" /> /// <reference path="./es/mergeDeepWith.d.ts" /> /// <reference path="./es/mergeDeepWithKey.d.ts" /> /// <reference path="./es/mergeLeft.d.ts" /> /// <reference path="./es/mergeRight.d.ts" /> /// <reference path="./es/merge.d.ts" /> /// <reference path="./es/mergeWith.d.ts" /> /// <reference path="./es/mergeWithKey.d.ts" /> /// <reference path="./es/minBy.d.ts" /> /// <reference path="./es/min.d.ts" /> /// <reference path="./es/modulo.d.ts" /> /// <reference path="./es/move.d.ts" /> /// <reference path="./es/multiply.d.ts" /> /// <reference path="./es/nAry.d.ts" /> /// <reference path="./es/negate.d.ts" /> /// <reference path="./es/none.d.ts" /> /// <reference path="./es/not.d.ts" /> /// <reference path="./es/nthArg.d.ts" /> /// <reference path="./es/nth.d.ts" /> /// <reference path="./es/objOf.d.ts" /> /// <reference path="./es/of.d.ts" /> /// <reference path="./es/omit.d.ts" /> /// <reference path="./es/once.d.ts" /> /// <reference path="./es/or.d.ts" /> /// <reference path="./es/over.d.ts" /> /// <reference path="./es/otherwise.d.ts" /> /// <reference path="./es/pair.d.ts" /> /// <reference path="./es/partial.d.ts" /> /// <reference path="./es/partialRight.d.ts" /> /// <reference path="./es/partition.d.ts" /> /// <reference path="./es/path.d.ts" /> /// <reference path="./es/pathEq.d.ts" /> /// <reference path="./es/pathOr.d.ts" /> /// <reference path="./es/pathSatisfies.d.ts" /> /// <reference path="./es/pickAll.d.ts" /> /// <reference path="./es/pickBy.d.ts" /> /// <reference path="./es/pick.d.ts" /> /// <reference path="./es/pipe.d.ts" /> /// <reference path="./es/pipeK.d.ts" /> /// <reference path="./es/pipeP.d.ts" /> /// <reference path="./es/pipeWith.d.ts" /> /// <reference path="./es/pluck.d.ts" /> /// <reference path="./es/prepend.d.ts" /> /// <reference path="./es/product.d.ts" /> /// <reference path="./es/project.d.ts" /> /// <reference path="./es/prop.d.ts" /> /// <reference path="./es/propEq.d.ts" /> /// <reference path="./es/propIs.d.ts" /> /// <reference path="./es/propOr.d.ts" /> /// <reference path="./es/propSatisfies.d.ts" /> /// <reference path="./es/props.d.ts" /> /// <reference path="./es/range.d.ts" /> /// <reference path="./es/reduceBy.d.ts" /> /// <reference path="./es/reduced.d.ts" /> /// <reference path="./es/reduce.d.ts" /> /// <reference path="./es/reduceRight.d.ts" /> /// <reference path="./es/reduceWhile.d.ts" /> /// <reference path="./es/reject.d.ts" /> /// <reference path="./es/remove.d.ts" /> /// <reference path="./es/repeat.d.ts" /> /// <reference path="./es/replace.d.ts" /> /// <reference path="./es/reverse.d.ts" /> /// <reference path="./es/scan.d.ts" /> /// <reference path="./es/set.d.ts" /> /// <reference path="./es/slice.d.ts" /> /// <reference path="./es/sortBy.d.ts" /> /// <reference path="./es/sort.d.ts" /> /// <reference path="./es/sortWith.d.ts" /> /// <reference path="./es/splitAt.d.ts" /> /// <reference path="./es/split.d.ts" /> /// <reference path="./es/splitEvery.d.ts" /> /// <reference path="./es/splitWhen.d.ts" /> /// <reference path="./es/startsWith.d.ts" /> /// <reference path="./es/subtract.d.ts" /> /// <reference path="./es/sum.d.ts" /> /// <reference path="./es/symmetricDifference.d.ts" /> /// <reference path="./es/symmetricDifferenceWith.d.ts" /> /// <reference path="./es/tail.d.ts" /> /// <reference path="./es/take.d.ts" /> /// <reference path="./es/takeLast.d.ts" /> /// <reference path="./es/takeLastWhile.d.ts" /> /// <reference path="./es/takeWhile.d.ts" /> /// <reference path="./es/tap.d.ts" /> /// <reference path="./es/T.d.ts" /> /// <reference path="./es/test.d.ts" /> /// <reference path="./es/then.d.ts" /> /// <reference path="./es/thunkify.d.ts" /> /// <reference path="./es/times.d.ts" /> /// <reference path="./es/toLower.d.ts" /> /// <reference path="./es/toPairs.d.ts" /> /// <reference path="./es/toPairsIn.d.ts" /> /// <reference path="./es/toString.d.ts" /> /// <reference path="./es/toUpper.d.ts" /> /// <reference path="./es/transduce.d.ts" /> /// <reference path="./es/transpose.d.ts" /> /// <reference path="./es/traverse.d.ts" /> /// <reference path="./es/trim.d.ts" /> /// <reference path="./es/tryCatch.d.ts" /> /// <reference path="./es/type.d.ts" /> /// <reference path="./es/unapply.d.ts" /> /// <reference path="./es/unary.d.ts" /> /// <reference path="./es/uncurryN.d.ts" /> /// <reference path="./es/unfold.d.ts" /> /// <reference path="./es/union.d.ts" /> /// <reference path="./es/unionWith.d.ts" /> /// <reference path="./es/uniqBy.d.ts" /> /// <reference path="./es/uniq.d.ts" /> /// <reference path="./es/uniqWith.d.ts" /> /// <reference path="./es/unless.d.ts" /> /// <reference path="./es/unnest.d.ts" /> /// <reference path="./es/until.d.ts" /> /// <reference path="./es/update.d.ts" /> /// <reference path="./es/useWith.d.ts" /> /// <reference path="./es/values.d.ts" /> /// <reference path="./es/valuesIn.d.ts" /> /// <reference path="./es/view.d.ts" /> /// <reference path="./es/when.d.ts" /> /// <reference path="./es/where.d.ts" /> /// <reference path="./es/whereEq.d.ts" /> /// <reference path="./es/without.d.ts" /> /// <reference path="./es/wrap.d.ts" /> /// <reference path="./es/xprod.d.ts" /> /// <reference path="./es/zip.d.ts" /> /// <reference path="./es/zipObj.d.ts" /> /// <reference path="./es/zipWith.d.ts" /> /// <reference path="./es/includes.d.ts" /> /// <reference path="./tools.d.ts" /> /// <reference path="./src/add.d.ts" /> /// <reference path="./src/addIndex.d.ts" /> /// <reference path="./src/adjust.d.ts" /> /// <reference path="./src/all.d.ts" /> /// <reference path="./src/allPass.d.ts" /> /// <reference path="./src/always.d.ts" /> /// <reference path="./src/and.d.ts" /> /// <reference path="./src/any.d.ts" /> /// <reference path="./src/anyPass.d.ts" /> /// <reference path="./src/ap.d.ts" /> /// <reference path="./src/aperture.d.ts" /> /// <reference path="./src/append.d.ts" /> /// <reference path="./src/apply.d.ts" /> /// <reference path="./src/applySpec.d.ts" /> /// <reference path="./src/applyTo.d.ts" /> /// <reference path="./src/ascend.d.ts" /> /// <reference path="./src/assoc.d.ts" /> /// <reference path="./src/assocPath.d.ts" /> /// <reference path="./src/binary.d.ts" /> /// <reference path="./src/bind.d.ts" /> /// <reference path="./src/both.d.ts" /> /// <reference path="./src/call.d.ts" /> /// <reference path="./src/chain.d.ts" /> /// <reference path="./src/clamp.d.ts" /> /// <reference path="./src/clone.d.ts" /> /// <reference path="./src/comparator.d.ts" /> /// <reference path="./src/complement.d.ts" /> /// <reference path="./src/compose.d.ts" /> /// <reference path="./src/composeK.d.ts" /> /// <reference path="./src/composeP.d.ts" /> /// <reference path="./src/composeWith.d.ts" /> /// <reference path="./src/concat.d.ts" /> /// <reference path="./src/cond.d.ts" /> /// <reference path="./src/construct.d.ts" /> /// <reference path="./src/constructN.d.ts" /> /// <reference path="./src/contains.d.ts" /> /// <reference path="./src/converge.d.ts" /> /// <reference path="./src/countBy.d.ts" /> /// <reference path="./src/curry.d.ts" /> /// <reference path="./src/curryN.d.ts" /> /// <reference path="./src/dec.d.ts" /> /// <reference path="./src/defaultTo.d.ts" /> /// <reference path="./src/descend.d.ts" /> /// <reference path="./src/difference.d.ts" /> /// <reference path="./src/differenceWith.d.ts" /> /// <reference path="./src/dissoc.d.ts" /> /// <reference path="./src/dissocPath.d.ts" /> /// <reference path="./src/divide.d.ts" /> /// <reference path="./src/drop.d.ts" /> /// <reference path="./src/dropLast.d.ts" /> /// <reference path="./src/dropLastWhile.d.ts" /> /// <reference path="./src/dropRepeats.d.ts" /> /// <reference path="./src/dropRepeatsWith.d.ts" /> /// <reference path="./src/either.d.ts" /> /// <reference path="./src/empty.d.ts" /> /// <reference path="./src/endsWith.d.ts" /> /// <reference path="./src/eqBy.d.ts" /> /// <reference path="./src/eqProps.d.ts" /> /// <reference path="./src/equals.d.ts" /> /// <reference path="./src/evolve.d.ts" /> /// <reference path="./src/F.d.ts" /> /// <reference path="./src/filter.d.ts" /> /// <reference path="./src/find.d.ts" /> /// <reference path="./src/findIndex.d.ts" /> /// <reference path="./src/findLast.d.ts" /> /// <reference path="./src/findLastIndex.d.ts" /> /// <reference path="./src/flatten.d.ts" /> /// <reference path="./src/flip.d.ts" /> /// <reference path="./src/forEach.d.ts" /> /// <reference path="./src/forEachObjIndexed.d.ts" /> /// <reference path="./src/fromPairs.d.ts" /> /// <reference path="./src/groupBy.d.ts" /> /// <reference path="./src/groupWith.d.ts" /> /// <reference path="./src/gt.d.ts" /> /// <reference path="./src/gte.d.ts" /> /// <reference path="./src/has.d.ts" /> /// <reference path="./src/hasIn.d.ts" /> /// <reference path="./src/hasPath.d.ts" /> /// <reference path="./src/head.d.ts" /> /// <reference path="./src/identical.d.ts" /> /// <reference path="./src/identity.d.ts" /> /// <reference path="./src/ifElse.d.ts" /> /// <reference path="./src/inc.d.ts" /> /// <reference path="./src/indexBy.d.ts" /> /// <reference path="./src/indexOf.d.ts" /> /// <reference path="./src/init.d.ts" /> /// <reference path="./src/innerJoin.d.ts" /> /// <reference path="./src/insertAll.d.ts" /> /// <reference path="./src/insert.d.ts" /> /// <reference path="./src/intersection.d.ts" /> /// <reference path="./src/intersectionWith.d.ts" /> /// <reference path="./src/intersperse.d.ts" /> /// <reference path="./src/into.d.ts" /> /// <reference path="./src/invert.d.ts" /> /// <reference path="./src/invertObj.d.ts" /> /// <reference path="./src/invoker.d.ts" /> /// <reference path="./src/isArrayLike.d.ts" /> /// <reference path="./src/is.d.ts" /> /// <reference path="./src/isEmpty.d.ts" /> /// <reference path="./src/isNaN.d.ts" /> /// <reference path="./src/isNil.d.ts" /> /// <reference path="./src/join.d.ts" /> /// <reference path="./src/juxt.d.ts" /> /// <reference path="./src/keys.d.ts" /> /// <reference path="./src/keysIn.d.ts" /> /// <reference path="./src/last.d.ts" /> /// <reference path="./src/lastIndexOf.d.ts" /> /// <reference path="./src/length.d.ts" /> /// <reference path="./src/lens.d.ts" /> /// <reference path="./src/lensIndex.d.ts" /> /// <reference path="./src/lensPath.d.ts" /> /// <reference path="./src/lensProp.d.ts" /> /// <reference path="./src/lift.d.ts" /> /// <reference path="./src/lt.d.ts" /> /// <reference path="./src/lte.d.ts" /> /// <reference path="./src/mapAccum.d.ts" /> /// <reference path="./src/mapAccumRight.d.ts" /> /// <reference path="./src/map.d.ts" /> /// <reference path="./src/mapObjIndexed.d.ts" /> /// <reference path="./src/match.d.ts" /> /// <reference path="./src/mathMod.d.ts" /> /// <reference path="./src/maxBy.d.ts" /> /// <reference path="./src/max.d.ts" /> /// <reference path="./src/mean.d.ts" /> /// <reference path="./src/median.d.ts" /> /// <reference path="./src/memoizeWith.d.ts" /> /// <reference path="./src/mergeAll.d.ts" /> /// <reference path="./src/mergeDeepLeft.d.ts" /> /// <reference path="./src/mergeDeepRight.d.ts" /> /// <reference path="./src/mergeDeepWith.d.ts" /> /// <reference path="./src/mergeDeepWithKey.d.ts" /> /// <reference path="./src/mergeLeft.d.ts" /> /// <reference path="./src/mergeRight.d.ts" /> /// <reference path="./src/merge.d.ts" /> /// <reference path="./src/mergeWith.d.ts" /> /// <reference path="./src/mergeWithKey.d.ts" /> /// <reference path="./src/minBy.d.ts" /> /// <reference path="./src/min.d.ts" /> /// <reference path="./src/modulo.d.ts" /> /// <reference path="./src/move.d.ts" /> /// <reference path="./src/multiply.d.ts" /> /// <reference path="./src/nAry.d.ts" /> /// <reference path="./src/negate.d.ts" /> /// <reference path="./src/none.d.ts" /> /// <reference path="./src/not.d.ts" /> /// <reference path="./src/nthArg.d.ts" /> /// <reference path="./src/nth.d.ts" /> /// <reference path="./src/objOf.d.ts" /> /// <reference path="./src/of.d.ts" /> /// <reference path="./src/omit.d.ts" /> /// <reference path="./src/once.d.ts" /> /// <reference path="./src/or.d.ts" /> /// <reference path="./src/over.d.ts" /> /// <reference path="./src/otherwise.d.ts" /> /// <reference path="./src/pair.d.ts" /> /// <reference path="./src/partial.d.ts" /> /// <reference path="./src/partialRight.d.ts" /> /// <reference path="./src/partition.d.ts" /> /// <reference path="./src/path.d.ts" /> /// <reference path="./src/pathEq.d.ts" /> /// <reference path="./src/pathOr.d.ts" /> /// <reference path="./src/pathSatisfies.d.ts" /> /// <reference path="./src/pickAll.d.ts" /> /// <reference path="./src/pickBy.d.ts" /> /// <reference path="./src/pick.d.ts" /> /// <reference path="./src/pipe.d.ts" /> /// <reference path="./src/pipeK.d.ts" /> /// <reference path="./src/pipeP.d.ts" /> /// <reference path="./src/pipeWith.d.ts" /> /// <reference path="./src/pluck.d.ts" /> /// <reference path="./src/prepend.d.ts" /> /// <reference path="./src/product.d.ts" /> /// <reference path="./src/project.d.ts" /> /// <reference path="./src/prop.d.ts" /> /// <reference path="./src/propEq.d.ts" /> /// <reference path="./src/propIs.d.ts" /> /// <reference path="./src/propOr.d.ts" /> /// <reference path="./src/propSatisfies.d.ts" /> /// <reference path="./src/props.d.ts" /> /// <reference path="./src/range.d.ts" /> /// <reference path="./src/reduceBy.d.ts" /> /// <reference path="./src/reduced.d.ts" /> /// <reference path="./src/reduce.d.ts" /> /// <reference path="./src/reduceRight.d.ts" /> /// <reference path="./src/reduceWhile.d.ts" /> /// <reference path="./src/reject.d.ts" /> /// <reference path="./src/remove.d.ts" /> /// <reference path="./src/repeat.d.ts" /> /// <reference path="./src/replace.d.ts" /> /// <reference path="./src/reverse.d.ts" /> /// <reference path="./src/scan.d.ts" /> /// <reference path="./src/set.d.ts" /> /// <reference path="./src/slice.d.ts" /> /// <reference path="./src/sortBy.d.ts" /> /// <reference path="./src/sort.d.ts" /> /// <reference path="./src/sortWith.d.ts" /> /// <reference path="./src/splitAt.d.ts" /> /// <reference path="./src/split.d.ts" /> /// <reference path="./src/splitEvery.d.ts" /> /// <reference path="./src/splitWhen.d.ts" /> /// <reference path="./src/startsWith.d.ts" /> /// <reference path="./src/subtract.d.ts" /> /// <reference path="./src/sum.d.ts" /> /// <reference path="./src/symmetricDifference.d.ts" /> /// <reference path="./src/symmetricDifferenceWith.d.ts" /> /// <reference path="./src/tail.d.ts" /> /// <reference path="./src/take.d.ts" /> /// <reference path="./src/takeLast.d.ts" /> /// <reference path="./src/takeLastWhile.d.ts" /> /// <reference path="./src/takeWhile.d.ts" /> /// <reference path="./src/tap.d.ts" /> /// <reference path="./src/T.d.ts" /> /// <reference path="./src/test.d.ts" /> /// <reference path="./src/then.d.ts" /> /// <reference path="./src/thunkify.d.ts" /> /// <reference path="./src/times.d.ts" /> /// <reference path="./src/toLower.d.ts" /> /// <reference path="./src/toPairs.d.ts" /> /// <reference path="./src/toPairsIn.d.ts" /> /// <reference path="./src/toString.d.ts" /> /// <reference path="./src/toUpper.d.ts" /> /// <reference path="./src/transduce.d.ts" /> /// <reference path="./src/transpose.d.ts" /> /// <reference path="./src/traverse.d.ts" /> /// <reference path="./src/trim.d.ts" /> /// <reference path="./src/tryCatch.d.ts" /> /// <reference path="./src/type.d.ts" /> /// <reference path="./src/unapply.d.ts" /> /// <reference path="./src/unary.d.ts" /> /// <reference path="./src/uncurryN.d.ts" /> /// <reference path="./src/unfold.d.ts" /> /// <reference path="./src/union.d.ts" /> /// <reference path="./src/unionWith.d.ts" /> /// <reference path="./src/uniqBy.d.ts" /> /// <reference path="./src/uniq.d.ts" /> /// <reference path="./src/uniqWith.d.ts" /> /// <reference path="./src/unless.d.ts" /> /// <reference path="./src/unnest.d.ts" /> /// <reference path="./src/until.d.ts" /> /// <reference path="./src/update.d.ts" /> /// <reference path="./src/useWith.d.ts" /> /// <reference path="./src/values.d.ts" /> /// <reference path="./src/valuesIn.d.ts" /> /// <reference path="./src/view.d.ts" /> /// <reference path="./src/when.d.ts" /> /// <reference path="./src/where.d.ts" /> /// <reference path="./src/whereEq.d.ts" /> /// <reference path="./src/without.d.ts" /> /// <reference path="./src/wrap.d.ts" /> /// <reference path="./src/xprod.d.ts" /> /// <reference path="./src/zip.d.ts" /> /// <reference path="./src/zipObj.d.ts" /> /// <reference path="./src/zipWith.d.ts" /> /// <reference path="./src/includes.d.ts" /> declare let R: R.Static; declare namespace R { type Omit<T, K extends string> = Pick<T, Exclude<keyof T, K>>; type CommonKeys<T1, T2> = keyof T1 & keyof T2; type PropsThatAreObjects<T, K extends keyof T> = K extends keyof T ? T[K] extends object ? K : never : never; type CommonPropsThatAreObjects<T1, T2> = PropsThatAreObjects<T1, keyof T1> & PropsThatAreObjects<T2, keyof T2>; type Ord = number | string | boolean | Date; type Path = ReadonlyArray<(number | string)>; interface Functor<T> { map(fn: (t: T) => U): Functor; } interface KeyValuePair<K, V> extends Array<K | V> { 0: K; 1: V; } interface ArrayLike { nodeType: number; } type Arity0Fn = () => any; type Arity1Fn = (a: any) => any; type Arity2Fn = (a: any, b: any) => any; interface ObjFunc { [index: string]: (...a: any[]) => any; } interface ObjFunc2 { [index: string]: (x: any, y: any) => boolean; } type Pred = (...a: any[]) => boolean; type SafePred<T> = (...a: T[]) => boolean; type ObjPred = (value: any, key: string) => boolean; interface Dictionary<T> { [index: string]: T; } interface CharList extends String { push(x: string): void; } interface Lens { <T, U>(obj: T): U; set<T, U>(str: string, obj: T): U; } interface Filter { <T>(fn: (value: T) => boolean): FilterOnceApplied<T>; <T, Kind extends 'array'>(fn: (value: T) => boolean): (list: ReadonlyArray<T>) => T[]; <T, Kind extends 'object'>(fn: (value: T) => boolean): (list: Dictionary<T>) => Dictionary<T>; <T>(fn: (value: T) => boolean, list: ReadonlyArray<T>): T[]; <T>(fn: (value: T) => boolean, obj: Dictionary<T>): Dictionary<T>; } interface FilterOnceApplied<T> { (list: ReadonlyArray<T>): T[]; (obj: Dictionary<T>): Dictionary<T>; } type Evolve<O extends Evolvable<E>, E extends Evolver> = { [P in keyof O]: P extends keyof E ? EvolveValue<O[P], E[P]> : O[P]; }; type EvolveValue<V, E> = E extends (value: V) => any ? ReturnType<E> : E extends Evolver ? EvolveNestedValue<V, E> : never; type EvolveNestedValue<V, E extends Evolver> = V extends object ? (V extends Evolvable<E> ? Evolve<V, E> : never) : never; interface Evolver { [key: string]: ((value: any) => any) | Evolver; } // Represents all objects evolvable with Evolver E type Evolvable<E extends Evolver> = { [P in keyof E]?: Evolved<E[P]>; }; type Evolved<T> = T extends (value: infer V) => any ? V : T extends Evolver ? Evolvable<T> : never; interface Placeholder { __isRamdaPlaceholder__: true; } interface Reduced<T> { '@@transducer/value': T; '@@transducer/reduced': true; } type PipeWithFns<V0, T> = [ (x0: V0) => T, ] | [ (x0: V0) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => T, ] | [ (x0: V0) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => T, ]; type ComposeWithFns<V0, T> = [ (x0: V0) => T, ] | [ (x: any) => T, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: V0) => any, ] | [ (x: any) => T, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: any) => any, (x: V0) => any, ]; type Merge<Primary, Secondary> = { [K in keyof Primary]: Primary[K] } & { [K in Exclude<keyof Secondary, CommonKeys<Primary, Secondary>>]: Secondary[K] }; type MergeDeep<Primary, Secondary> = { [K in CommonPropsThatAreObjects<Primary, Secondary>]: MergeDeep<Primary[K], Secondary[K]> } & { [K in Exclude<keyof Primary, CommonPropsThatAreObjects<Primary, Secondary>>]: Primary[K] } & { [K in Exclude<keyof Secondary, CommonKeys<Primary, Secondary>>]: Secondary[K] }; interface Static { /** * Placeholder. When used with functions like curry, or op, the second argument is applied to the second * position, and it returns a function waiting for its first argument. */ __: Placeholder; /* This is used in examples throughout the docs, but I it only seems to be directly explained here: https://ramdajs.com/0.9/docs/#op */ /** * Adds two numbers (or strings). Equivalent to a + b but curried. */ add(a: number, b: number): number; add(a: string, b: string): string; add(a: number): (b: number) => number; add(a: string): (b: string) => string; /** * Creates a new list iteration function from an existing one by adding two new parameters to its callback * function: the current index, and the entire list. */ addIndex<T, U>(fn: (f: (item: T) => U, list: T[]) => U[]): Curry.Curry<(a: (item: T, idx: number, list?: T[]) => U, b: ReadonlyArray<T>) => U[]>; /* Special case for forEach */ addIndex<T>(fn: (f: (item: T) => void, list: T[]) => T[]): Curry.Curry<(a: (item: T, idx: number, list?: T[]) => void, b: ReadonlyArray<T>) => T[]>; /* Special case for reduce */ addIndex<T, U>(fn: (f: (acc: U, item: T) => U, aci: U, list: T[]) => U): Curry.Curry<(a: (acc: U, item: T, idx: number, list?: T[]) => U, b: U, c: ReadonlyArray<T>) => U>; /** * Applies a function to the value at the given index of an array, returning a new copy of the array with the * element at the given index replaced with the result of the function application. */ adjust<T>(index: number, fn: (a: T) => T, list: ReadonlyArray<T>): T[]; adjust<T>(index: number, fn: (a: T) => T): (list: ReadonlyArray<T>) => T[]; /** * Returns true if all elements of the list match the predicate, false if there are any that don't. */ all<T>(fn: (a: T) => boolean, list: ReadonlyArray<T>): boolean; all<T>(fn: (a: T) => boolean): (list: ReadonlyArray<T>) => boolean; /** * Given a list of predicates, returns a new predicate that will be true exactly when all of them are. */ allPass(preds: ReadonlyArray<Pred>): Pred; /** * Returns a function that always returns the given value. */ always<T>(val: T): () => T; /** * A function that returns the first argument if it's falsy otherwise the second argument. Note that this is * NOT short-circuited, meaning that if expressions are passed they are both evaluated. */ and<T extends { and?: ((...a: any[]) => any); } | number | boolean | string | null>(fn1: T, val2: any): boolean; and<T extends { and?: ((...a: any[]) => any); } | number | boolean | string | null>(fn1: T): (val2: any) => boolean; /** * Returns true if at least one of elements of the list match the predicate, false otherwise. */ any<T>(fn: (a: T) => boolean, list: ReadonlyArray<T>): boolean; any<T>(fn: (a: T) => boolean): (list: ReadonlyArray<T>) => boolean; /** * Given a list of predicates returns a new predicate that will be true exactly when any one of them is. */ anyPass<T>(preds: ReadonlyArray<SafePred<T>>): SafePred<T>; /** * ap applies a list of functions to a list of values. */ ap<T, U>(fns: Array<((a: T) => U)>, vs: ReadonlyArray<T>): U[]; ap<T, U>(fns: Array<((a: T) => U)>): (vs: ReadonlyArray<T>) => U[]; /** * Returns a new list, composed of n-tuples of consecutive elements If n is greater than the length of the list, * an empty list is returned. */ aperture<T>(n: 1, list: T[]): Array<[T]>; aperture<T>(n: 2, list: T[]): Array<[T, T]>; aperture<T>(n: 3, list: T[]): Array<[T, T, T]>; aperture<T>(n: 4, list: T[]): Array<[T, T, T, T]>; aperture<T>(n: 5, list: T[]): Array<[T, T, T, T, T]>; aperture<T>(n: 6, list: T[]): Array<[T, T, T, T, T, T]>; aperture<T>(n: 7, list: T[]): Array<[T, T, T, T, T, T, T]>; aperture<T>(n: 8, list: T[]): Array<[T, T, T, T, T, T, T, T]>; aperture<T>(n: 9, list: T[]): Array<[T, T, T, T, T, T, T, T, T]>; aperture<T>(n: 10, list: T[]): Array<[T, T, T, T, T, T, T, T, T, T]>; aperture<T>(n: number, list: ReadonlyArray<T>): T[][]; aperture(n: number): <T>(list: ReadonlyArray<T>) => T[][]; /** * Returns a new list containing the contents of the given list, followed by the given element. */ append<T>(el: T, list: ReadonlyArray<T>): T[]; append<T>(el: T): <T>(list: ReadonlyArray<T>) => T[]; /** * Applies function fn to the argument list args. This is useful for creating a fixed-arity function from * a variadic function. fn should be a bound function if context is significant. */ apply<T, U, TResult>(fn: (arg0: T, ...args: T[]) => TResult, args: ReadonlyArray): TResult; apply<T, TResult>(fn: (arg0: T, ...args: T[]) => TResult): (args: ReadonlyArray) => TResult; /** * Given a spec object recursively mapping properties to functions, creates a function producing an object * of the same structure, by mapping each property to the result of calling its associated function with * the supplied arguments. */ applySpec<T>(obj: any): (...args: any[]) => T; /** * Takes a value and applies a function to it. * This function is also known as the thrush combinator. */ applyTo<T, U>(el: T, fn: (t: T) => U): U; applyTo<T>(el: T): (fn: (t: T) => U) => U; /** * Makes an ascending comparator function out of a function that returns a value that can be compared with < and >. */ ascend<T>(fn: (obj: T) => any, a: T, b: T): number; ascend<T>(fn: (obj: T) => any): (a: T, b: T) => number; /** * Makes a shallow clone of an object, setting or overriding the specified property with the given value. */ assoc<T, U>(__: Placeholder, val: T, obj: U): <K extends string>(prop: K) => Record<K, T> & U; assoc<U, K extends string>(prop: K, __: Placeholder, obj: U): <T>(val: T) => Record<K, T> & U; assoc<T, U, K extends string>(prop: K, val: T, obj: U): Record<K, T> & U; assoc<T, K extends string>(prop: K, val: T): (obj: U) => Record<K, T> & U; assoc<K extends string>(prop: K): <T, U>(val: T, obj: U) => Record<K, T> & U; /** * Makes a shallow clone of an object, setting or overriding the nodes required to create the given path, and * placing the specific value at the tail end of that path. */ assocPath<T, U>(__: Placeholder, val: T, obj: U): (path: Path) => U; assocPath<T, U>(path: Path, __: Placeholder, obj: U): (val: T) => U; assocPath<T, U>(path: Path, val: T, obj: U): U; assocPath<T, U>(path: Path, val: T): (obj: U) => U; assocPath<T, U>(path: Path): Curry.Curry<(a: T, b: U) => U>; /** * Wraps a function of any arity (including nullary) in a function that accepts exactly 2 * parameters. Any extraneous parameters will not be passed to the supplied function. */ binary(fn: (...args: any[]) => any): (...a: any[]) => any; /** * Creates a function that is bound to a context. Note: R.bind does not provide the additional argument-binding * capabilities of Function.prototype.bind. */ bind<T>(fn: (...args: any[]) => any, thisObj: T): (...args: any[]) => any; /** * A function wrapping calls to the two functions in an && operation, returning the result of the first function * if it is false-y and the result of the second function otherwise. Note that this is short-circuited, meaning * that the second function will not be invoked if the first returns a false-y value. */ both(pred1: Pred, pred2: Pred): Pred; both(pred1: Pred): (pred2: Pred) => Pred; /** * Returns the result of calling its first argument with the remaining arguments. This is occasionally useful * as a converging function for R.converge: the left branch can produce a function while the right branch * produces a value to be passed to that function as an argument. */ call(fn: (...args: any[]) => (...args: any[]) => any, ...args: any[]): any; /** * `chain` maps a function over a list and concatenates the results. * This implementation is compatible with the Fantasy-land Chain spec */ chain<T, U>(fn: (n: T) => ReadonlyArray, list: ReadonlyArray<T>): U[]; chain<T, U>(fn: (n: T) => ReadonlyArray): (list: ReadonlyArray<T>) => U[]; /** * Restricts a number to be within a range. * Also works for other ordered types such as Strings and Date */ clamp<T>(min: T, max: T, value: T): T; clamp<T>(min: T, max: T): (value: T) => T; clamp<T>(min: T): (max: T, value: T) => T; clamp<T>(min: T): (max: T) => (value: T) => T; /** * Creates a deep copy of the value which may contain (nested) Arrays and Objects, Numbers, Strings, Booleans and Dates. */ clone<T>(value: T): T; clone<T>(value: ReadonlyArray<T>): T[]; /** * Makes a comparator function out of a function that reports whether the first element is less than the second. */ // comparator(pred: (a: any, b: any) => boolean): (x: number, y: number) => number; comparator<T>(pred: (a: T, b: T) => boolean): (x: T, y: T) => number; /** * Takes a function f and returns a function g such that: * - applying g to zero or more arguments will give true if applying the same arguments to f gives * a logical false value; and * - applying g to zero or more arguments will give false if applying the same arguments to f gives * a logical true value. */ complement(pred: (...args: any[]) => boolean): (...args: any[]) => boolean; /** * Performs right-to-left function composition. The rightmost function may have any arity; the remaining * functions must be unary. */ // generic rest parameters in TS 3.0 allows writing a single variant for any number of Vx // compose<V extends any[], T1>(fn0: (...args: V) => T1): (...args: V) => T1; // compose<V extends any[], T1, T2>(fn1: (x: T1) => T2, fn0: (...args: V) => T1): (...args: V) => T2; // but requiring TS>=3.0 sounds like a breaking change, so just leaving a comment for the future compose<T1>(fn0: () => T1): () => T1; compose<V0, T1>(fn0: (x0: V0) => T1): (x0: V0) => T1; compose<V0, V1, T1>(fn0: (x0: V0, x1: V1) => T1): (x0: V0, x1: V1) => T1; compose<V0, V1, V2, T1>(fn0: (x0: V0, x1: V1, x2: V2) => T1): (x0: V0, x1: V1, x2: V2) => T1; compose<T1, T2>(fn1: (x: T1) => T2, fn0: () => T1): () => T2; compose<V0, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0) => T1): (x0: V0) => T2; compose<V0, V1, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): (x0: V0, x1: V1) => T2; compose<V0, V1, V2, T1, T2>(fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): (x0: V0, x1: V1, x2: V2) => T2; compose<T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: () => T1): () => T3; compose<V0, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x: V0) => T1): (x: V0) => T3; compose<V0, V1, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): (x0: V0, x1: V1) => T3; compose<V0, V1, V2, T1, T2, T3>(fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): (x0: V0, x1: V1, x2: V2) => T3; compose<T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: () => T1): () => T4; compose<V0, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x: V0) => T1): (x: V0) => T4; compose<V0, V1, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): (x0: V0, x1: V1) => T4; compose<V0, V1, V2, T1, T2, T3, T4>(fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): (x0: V0, x1: V1, x2: V2) => T4; compose<T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: () => T1): () => T5; compose<V0, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x: V0) => T1): (x: V0) => T5; compose<V0, V1, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): (x0: V0, x1: V1) => T5; compose<V0, V1, V2, T1, T2, T3, T4, T5>(fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): (x0: V0, x1: V1, x2: V2) => T5; compose<T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: () => T1): () => T6; compose<V0, T1, T2, T3, T4, T5, T6>(fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x: V0) => T1): (x: V0) => T6; compose<V0, V1, T1, T2, T3, T4, T5, T6>( fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1) => T1): (x0: V0, x1: V1) => T6; compose<V0, V1, V2, T1, T2, T3, T4, T5, T6>( fn5: (x: T5) => T6, fn4: (x: T4) => T5, fn3: (x: T3) => T4, fn2: (x: T2) => T3, fn1: (x: T1) => T2, fn0: (x0: V0, x1: V1, x2: V2) => T1): (x0: V0, x1: V1, x2: V2) => T6; /** * Returns the right-to-left Kleisli composition of the provided functions, each of which must return a value of a type supported by chain. * The typings only support arrays for now. * All functions must be unary. * R.composeK(h, g, f) is equivalent to R.compose(R.chain(h), R.chain(g), f). * * @deprecated since 0.26 in favor of composeWith(chain) */ composeK<V0, T1>( fn0: (x0: V0) => T1[]): (x0: V0) => T1[]; composeK<V0, T1, T2>( fn1: (x: T1) => T2[], fn0: (x0: V0) => T1[]): (x0: V0) => T2[]; composeK<V0, T1, T2, T3>( fn2: (x: T2) => T3[], fn1: (x: T1) => T2[], fn0: (x: V0) => T1[]): (x: V0) => T3[]; composeK<V0, T1, T2, T3, T4>( fn3: (x: T3) => T4[], fn2: (x: T2) => T3[], fn1: (x: T1) => T2[], fn0: (x: V0) => T1[]): (x: V0) => T4[]; composeK<V0, T1, T2, T3, T4, T5>( fn4: (x: T4) => T5[], fn3: (x: T3) => T4[], fn2: (x: T2) => T3[], fn1: (x: T1) => T2[], fn0: (x: V0) => T1[]): (x: V0) => T5[]; composeK<V0, T1, T2, T3, T4, T5, T6>( fn5: (x: T5) => T6[], fn4: (x: T4) => T5[], fn3: (x: T3) => T4[], fn2: (x: T2) => T3[], fn1: (x: T1) => T2[], fn0: (x: V0) => T1[]): (x: V0) => T6[]; /** * Performs right-to-left composition of one or more Promise-returning functions. * All functions must be unary. * * @deprecated since 0.26 in favor of composeWith(then) */ composeP<V0, T1>( fn0: (x0: V0) => Promise<T1>): (x0: V0) => Promise<T1>; composeP<V0, T1, T2>( fn1: (x: T1) => Promise<T2>, fn0: (x0: V0) => Promise<T1>): (x0: V0) => Promise<T2>; composeP<V0, T1, T2, T3>( fn2: (x: T2) => Promise<T3>, fn1: (x: T1) => Promise<T2>, fn0: (x: V0) => Promise<T1>): (x: V0) => Promise<T3>; composeP<V0, T1, T2, T3, T4>( fn3: (x: T3) => Promise<T4>, fn2: (x: T2) => Promise<T3>, fn1: (x: T1) => Promise<T2>, fn0: (x: V0) => Promise<T1>): (x: V0) => Promise<T4>; composeP<V0, T1, T2, T3, T4, T5>( fn4: (x: T4) => Promise<T5>, fn3: (x: T3) => Promise<T4>, fn2: (x: T2) => Promise<T3>, fn1: (x: T1) => Promise<T2>, fn0: (x: V0) => Promise<T1>): (x: V0) => Promise<T5>; composeP<V0, T1, T2, T3, T4, T5, T6>( fn5: (x: T5) => Promise<T6>, fn4: (x: T4) => Promise<T5>, fn3: (x: T3) => Promise<T4>, fn2: (x: T2) => Promise<T3>, fn1: (x: T1) => Promise<T2>, fn0: (x: V0) => Promise<T1>): (x: V0) => Promise<T6>; /** * Performs right-to-left function composition using transforming function. * With the current typings, all functions must be unary. */ composeWith<V0, T>(composer: (a: any) => any, fns: ComposeWithFns<V0, T>): (x0: V0) => T; composeWith(composer: (a: any) => any): <V0, T>(fns: ComposeWithFns<V0, T>) => (x: V0) => T; /** * Returns a new list consisting of the elements of the first list followed by the elements * of the second. */ concat<T>(placeholder: Placeholder): (list2: ReadonlyArray<T>, list1: ReadonlyArray<T>) => T[]; concat<T>(placeholder: Placeholder, list2: ReadonlyArray<T>): (list1: ReadonlyArray<T>) => T[]; concat<T>(list1: ReadonlyArray<T>, list2: ReadonlyArray<T>): T[]; concat<T>(list1: ReadonlyArray<T>): (list2: ReadonlyArray<T>) => T[]; concat(list1: string, list2: string): string; concat(list1: string): (list2: string) => string; /** * Returns a function, fn, which encapsulates if/else-if/else logic. R.cond takes a list of [predicate, transform] pairs. * All of the arguments to fn are applied to each of the predicates in turn until one returns a "truthy" value, at which * point fn returns the result of applying its arguments to the corresponding transformer. If none of the predicates * matches, fn returns undefined. */ cond(fns: ReadonlyArray<[Pred, (...a: any[]) => any]>): (...a: any[]) => any; cond<A, B>(fns: ReadonlyArray<[SafePred<A>, (...a: A[]) => B]>): (...a: A[]) => B; /** * Wraps a constructor function inside a curried function that can be called with the same arguments and returns the same type. */ construct(fn: (...a: any[]) => any): (...a: any[]) => any; /** * Wraps a constructor function inside a curried function that can be called with the same arguments and returns the same type. * The arity of the function returned is specified to allow using variadic constructor functions. */ constructN(n: number, fn: (...a: any[]) => any): (...a: any[]) => any; /** * Returns `true` if the specified item is somewhere in the list, `false` otherwise.