Quantcast
Channel: Hacker News 50
Viewing all articles
Browse latest Browse all 9433

swannodette/mori · GitHub

$
0
0

Comments:"swannodette/mori · GitHub"

URL:https://github.com/swannodette/mori


mori

A simple bridge to ClojureScript's persistent data structures and supporting APIs for vanilla JavaScript. Pull requests welcome.

Getting it

You can install the latest release via npm:

npm install mori

The installed package contains a single optimized JavaScript file mori.js.

Load mori in your Node.js programs as you would any other module:

varmori=require("mori");

In a browser, you can load mori with a script tag, as you would any other JavaScript library:

<script src="mori.js"type="text/javascript"></script>

You can also load it as an AMD module, e.g. with RequireJS.

Build

Prerequisites

You will first need to install the Java SDK, if it's not already installed on your system.

On Windows, you will need to manually install Leiningen. On UNIX-like systems, Leiningen will be installed within the project automatically if the lein executable is not found on your path or if your lein version predates 2.0.0.

Clone the repo

git clone https://github.com/swannodette/mori.git
cd mori

On a UNIX-like system build with

./scripts/build.sh

Alternatively using npm

npm run-script build

On Windows

./scripts/build.ps1

The build process will generate an optimized JavaScript file mori.js, which is suitable for use with Node.js, or in a Web browser or other JavaScript environments. You can also load it as an AMD module.

Usage

You can use it from your projects like so:

varinc=function(n){returnn+1;};mori.into_array(mori.map(inc,mori.vector(1,2,3,4,5)));// => [2,3,4,5,6]

Efficient non-destructive updates!

varv1=mori.vector(1,2,3);varv2=mori.conj(v1,4);v1.toString();// => '[1 2 3]'v2.toString();// => '[1 2 3 4]'
varsum=function(a,b){returna+b;};mori.reduce(sum,mori.vector(1,2,3,4));// => 10

Lazy sequences!

var_=mori;_.into_array(_.interpose("foo",_.vector(1,2,3,4)));// => [1, "foo", 2, "foo", 3, "foo", 4]

Or if it's more your speed, use it from CoffeeScript!

inc = (x) ->x+1r = mori.mapinc,mori.vector(1,2,3,4,5)mori.into_arrayr

Documentation

You can find extensive documentation and examples here.

More Examples

Reducers

Mori includes the new Clojure reducers framework. Zero allocation collection operations FTW:

varm=mori;vara=[];for(vari=0;i<1000000;i++){a.push(i);}// make it immutablevarv=m.into(m.vector(),a);varmul3=function(n){returnn*3;}functiontime(f){vars=newDate();f();console.log(((newDate())-s)+"ms");}// 250ms on 1.7ghz Macbook Airtime(function(){m.reduce(m.sum,0,m.rmap(m.inc,m.rmap(m.inc,m.rmap(m.inc,v))));});// 630mstime(function(){a.map(mul3).map(m.inc).map(m.inc).map(m.inc)})

Pipelines

mori.pipeline(mori.vector(1,2,3),function(v){returnmori.conj(v,4)},function(v){returnmori.drop(2,v)});// => [3 4]

Currying

mori.pipeline(mori.vector(1,2,3),mori.curry(mori.conj,4),mori.curry(mori.conj,5));// => [1 2 3 4 5]

Partial Application

mori.pipeline(mori.vector(1,2,3),mori.curry(mori.conj,4),mori.partial(mori.drop,2));// => (3 4)

Function Composition

varsecond=mori.comp(mori.first,mori.rest);second(mori.vector(1,2,3));// => 2

Juxtaposition

varpos_and_neg=mori.juxt(mori.identity,function(v){return-v;});pos_and_neg(1);// => [1 -1]mori.knit(mori.inc,mori.dec)(pos_and_neg(1));// => [2 -2]

Copyright (C) 2013 David Nolen and contributors

Distributed under the Eclipse Public License, the same as Clojure.


Viewing all articles
Browse latest Browse all 9433

Trending Articles