A simple bridge to ClojureScript's persistent data structures and supporting APIs for vanilla JavaScript. Pull requests welcome.
You can install the latest release via npm:
npm install moriThe installed package contains a single optimized JavaScript file mori.js.
Load mori in your Node.js programs as you would any other module:
var mori = 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.
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.
git clone https://github.com/swannodette/mori.git
cd mori./scripts/build.shnpm run-script build./scripts/build.ps1The 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.
You can use it from your projects like so:
var inc = function(n) {
return n+1;
};
mori.into_array(mori.map(inc, mori.vector(1,2,3,4,5)));
// => [2,3,4,5,6]Efficient non-destructive updates!
var v1 = mori.vector(1,2,3);
var v2 = mori.conj(v1, 4);
v1.toString(); // => '[1 2 3]'
v2.toString(); // => '[1 2 3 4]'var sum = function(a, b) {
return a + b;
};
mori.reduce(sum, mori.vector(1, 2, 3, 4)); // => 10Lazy 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+1
r = mori.map inc, mori.vector(1,2,3,4,5)
mori.into_array rYou can find extensive documentation and examples here.
For vectors and maps we provide an efficient thaw and freeze operations:
var m = mori;
// ~330ms with v8 3.22.11 MBA 1.7ghz
for(var j = 0; j < 10; j++) {
var s = new Date();
var arr = [];
for(var i = 0; i < 10000000; i++) {
arr.push(i);
}
print("Array push " + arr.length + " items " + ((new Date())-s));
gc();
}
// ~360ms
for(var j = 0; j < 10; j++) {
s = new Date();
var mv = m.mutable.thaw(m.vector());
for(var i = 0; i < 10000000; i++) {
mv = m.mutable.conj1(mv, i);
}
var v = m.mutable.freeze(mv);
print("Mutable vector conj " + m.count(v) + " items " + ((new Date())-s));
gc();
}Mori includes the new Clojure reducers framework. Zero allocation collection operations FTW:
var m = mori;
var a = [];
for(var i = 0; i < 1000000; i++) {
a.push(i);
}
// make it immutable
var v = m.into(m.vector(), a);
var mul3 = function(n) {
return n*3;
}
function time(f) {
var s = new Date();
f();
console.log(((new Date())-s)+"ms");
}
// 250ms on 1.7ghz Macbook Air
time(function() {
m.reduce(m.sum, 0, m.rmap(m.inc, m.rmap(m.inc, m.rmap(m.inc, v))));
});
// 630ms
time(function() {
a.map(mul3).map(m.inc).map(m.inc).map(m.inc)
})mori.pipeline(mori.vector(1,2,3),
function(v) { return mori.conj(v,4) },
function(v) { return mori.drop(2, v) });
// => [3 4]mori.pipeline(mori.vector(1,2,3),
mori.curry(mori.conj, 4),
mori.curry(mori.conj, 5));
// => [1 2 3 4 5]mori.pipeline(mori.vector(1,2,3),
mori.curry(mori.conj, 4),
mori.partial(mori.drop, 2));
// => (3 4)var second = mori.comp(mori.first, mori.rest);
second(mori.vector(1,2,3));
// => 2var pos_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.