lists - npm Package Compare versions

Comparing version 0.0.3 to 0.0.4

package.json

		{
		"name": "lists",
		"version": "0.0.3",
		"version": "0.0.4",
		"description": "A library of higher-order functions modeled after Haskell's Data.List module",
		@@ -5,0 +5,0 @@ "main": "lists.js",

README.md

		@@ -6,3 +6,3 @@ # [ l [ i [ s ] t ] s ] -- *pending release*

		You'll take advantage of the endless combinations of function compositions that Lists offers you. Use the unorthodox style of passing functions to functions to functions to solve complex problems. Most of the functions featured in Lists produce new arrays, to reinforce the paradigm of stateless programming, which means "retaining no information about previous events".
		You'll take advantage of the endless combinations of function compositions that Lists offers you. Use the unorthodox style of passing functions to functions to functions to solve complex problems. Most of the functions featured in Lists produce new arrays, to reinforce the paradigm of stateless programming (the exception being the temporary functional stack that comes with recursive calculation), which means "retaining no information about previous events".

		@@ -15,3 +15,5 @@ Lists is an open source project and is not meant to be paid for, ever. So now then, lets have some fun(fun(fun(fun)))

		> The beta release of this module will not implement [tail call optimization](http://en.wikipedia.org/wiki/Tail_recursion) on its functions, but the full release will.

		-----
		api(here)

New alerts