Skip to content

Commit

Permalink
Version 0.24.1
Browse files Browse the repository at this point in the history
  • Loading branch information
kedashoe committed Jun 2, 2017
1 parent c5ddc1f commit 7df4474
Show file tree
Hide file tree
Showing 5 changed files with 21 additions and 19 deletions.
2 changes: 1 addition & 1 deletion BOOKMARKLET.md

Large diffs are not rendered by default.

4 changes: 2 additions & 2 deletions README.md
Original file line number Diff line number Diff line change
Expand Up @@ -100,13 +100,13 @@ or the minified version:
or from a CDN, either cdnjs:

```html
<script src="//cdnjs.cloudflare.com/ajax/libs/ramda/0.24.0/ramda.min.js"></script>
<script src="//cdnjs.cloudflare.com/ajax/libs/ramda/0.24.1/ramda.min.js"></script>
```

or one of the below links from [jsDelivr](http://jsdelivr.com):

```html
<script src="//cdn.jsdelivr.net/ramda/0.24.0/ramda.min.js"></script>
<script src="//cdn.jsdelivr.net/ramda/0.24.1/ramda.min.js"></script>
<script src="//cdn.jsdelivr.net/ramda/0.24/ramda.min.js"></script>
<script src="//cdn.jsdelivr.net/ramda/latest/ramda.min.js"></script>
```
Expand Down
28 changes: 15 additions & 13 deletions dist/ramda.js
Original file line number Diff line number Diff line change
@@ -1,4 +1,4 @@
// Ramda v0.24.0
// Ramda v0.24.1
// https://github.com/ramda/ramda
// (c) 2013-2017 Scott Sauyet, Michael Hurley, and David Chambers
// Ramda may be freely distributed under the MIT license.
Expand Down Expand Up @@ -562,22 +562,19 @@
/**
* Tests whether or not an object is similar to an array.
*
* @func
* @memberOf R
* @since v0.5.0
* @private
* @category Type
* @category List
* @sig * -> Boolean
* @param {*} x The object to test.
* @return {Boolean} `true` if `x` has a numeric length property and extreme indices defined; `false` otherwise.
* @deprecated since v0.23.0
* @example
*
* R.isArrayLike([]); //=> true
* R.isArrayLike(true); //=> false
* R.isArrayLike({}); //=> false
* R.isArrayLike({length: 10}); //=> false
* R.isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true
* _isArrayLike([]); //=> true
* _isArrayLike(true); //=> false
* _isArrayLike({}); //=> false
* _isArrayLike({length: 10}); //=> false
* _isArrayLike({0: 'zero', 9: 'nine', length: 10}); //=> true
*/
var _isArrayLike = _curry1(function isArrayLike(x) {
if (_isArray(x)) {
Expand Down Expand Up @@ -6821,7 +6818,7 @@
* @memberOf R
* @since v0.12.0
* @category List
* @sig (c -> c) -> (a,b -> a) -> a -> [b] -> a
* @sig (c -> c) -> ((a, b) -> a) -> a -> [b] -> a
* @param {Function} xf The transducer function. Receives a transformer and returns a transformer.
* @param {Function} fn The iterator function. Receives two values, the accumulator and the
* current element from the array. Wrapped as transformer, if necessary, and used to
Expand All @@ -6834,8 +6831,11 @@
*
* var numbers = [1, 2, 3, 4];
* var transducer = R.compose(R.map(R.add(1)), R.take(2));
*
* R.transduce(transducer, R.flip(R.append), [], numbers); //=> [2, 3]
*
* var isOdd = (x) => x % 2 === 1;
* var firstOddTransducer = R.compose(R.filter(isOdd), R.take(1));
* R.transduce(firstOddTransducer, R.flip(R.append), [], R.range(0, 100)); //=> [1]
*/
var transduce = curryN(4, function transduce(xf, fn, acc, list) {
return _reduce(xf(typeof fn === 'function' ? _xwrap(fn) : fn), acc, list);
Expand Down Expand Up @@ -8902,7 +8902,9 @@
* factorial(5); //=> 120
* count; //=> 1
*/
var memoize = memoizeWith(toString);
var memoize = memoizeWith(function () {
return toString(arguments);
});

/**
* Splits a string into an array of strings based on the given
Expand Down
4 changes: 2 additions & 2 deletions dist/ramda.min.js

Large diffs are not rendered by default.

2 changes: 1 addition & 1 deletion package.json
Original file line number Diff line number Diff line change
Expand Up @@ -24,7 +24,7 @@
],
"name": "ramda",
"description": "A practical functional library for JavaScript programmers.",
"version": "0.24.0",
"version": "0.24.1",
"homepage": "http://ramdajs.com/",
"license": "MIT",
"repository": {
Expand Down

0 comments on commit 7df4474

Please sign in to comment.