deku 0.1.0

data/deps/node_modules/deku/node_modules/sliced/History.md

@@ -0,0 +1,30 @@
+
+0.0.5 / 2013-02-05
+==================
+
+  * optimization: remove use of arguments [jkroso](https://github.com/jkroso)
+  * add scripts to component.json [jkroso](https://github.com/jkroso)
+  * tests; remove time for travis
+
+0.0.4 / 2013-01-07
+==================
+
+  * added component.json #1 [jkroso](https://github.com/jkroso)
+  * reversed array loop #1 [jkroso](https://github.com/jkroso)
+  * remove fn params
+
+0.0.3 / 2012-09-29
+==================
+
+  * faster with negative start args
+
+0.0.2 / 2012-09-29
+==================
+
+  * support full [].slice semantics
+
+0.0.1 / 2012-09-29
+===================
+
+  * initial release
+

data/deps/node_modules/deku/node_modules/sliced/LICENSE

@@ -0,0 +1,22 @@
+(The MIT License)
+
+Copyright (c) 2012 [Aaron Heckmann](aaron.heckmann+github@gmail.com)
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+'Software'), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

data/deps/node_modules/deku/node_modules/sliced/Makefile

@@ -0,0 +1,5 @@
+
+test:
+	@./node_modules/.bin/mocha $(T) $(TESTS)
+
+.PHONY: test

data/deps/node_modules/deku/node_modules/sliced/README.md

@@ -0,0 +1,62 @@
+#sliced
+==========
+
+A faster alternative to `[].slice.call(arguments)`.
+
+[![Build Status](https://secure.travis-ci.org/aheckmann/sliced.png)](http://travis-ci.org/aheckmann/sliced)
+
+Example output from [benchmark.js](https://github.com/bestiejs/benchmark.js)
+
+    Array.prototype.slice.call x 1,320,205 ops/sec ±2.35% (92 runs sampled)
+    [].slice.call x 1,314,605 ops/sec ±1.60% (95 runs sampled)
+    cached slice.call x 10,468,380 ops/sec ±1.45% (95 runs sampled)
+    sliced x 16,608,237 ops/sec ±1.40% (92 runs sampled)
+    fastest is sliced
+
+    Array.prototype.slice.call(arguments, 1) x 1,383,584 ops/sec ±1.73% (97 runs sampled)
+    [].slice.call(arguments, 1) x 1,494,735 ops/sec ±1.33% (95 runs sampled)
+    cached slice.call(arguments, 1) x 10,085,270 ops/sec ±1.51% (97 runs sampled)
+    sliced(arguments, 1) x 16,620,480 ops/sec ±1.29% (95 runs sampled)
+    fastest is sliced(arguments, 1)
+
+    Array.prototype.slice.call(arguments, -1) x 1,303,262 ops/sec ±1.62% (94 runs sampled)
+    [].slice.call(arguments, -1) x 1,325,615 ops/sec ±1.36% (97 runs sampled)
+    cached slice.call(arguments, -1) x 9,673,603 ops/sec ±1.70% (96 runs sampled)
+    sliced(arguments, -1) x 16,384,575 ops/sec ±1.06% (91 runs sampled)
+    fastest is sliced(arguments, -1)
+
+    Array.prototype.slice.call(arguments, -2, -10) x 1,404,390 ops/sec ±1.61% (95 runs sampled)
+    [].slice.call(arguments, -2, -10) x 1,514,367 ops/sec ±1.21% (96 runs sampled)
+    cached slice.call(arguments, -2, -10) x 9,836,017 ops/sec ±1.21% (95 runs sampled)
+    sliced(arguments, -2, -10) x 18,544,882 ops/sec ±1.30% (91 runs sampled)
+    fastest is sliced(arguments, -2, -10)
+
+    Array.prototype.slice.call(arguments, -2, -1) x 1,458,604 ops/sec ±1.41% (97 runs sampled)
+    [].slice.call(arguments, -2, -1) x 1,536,547 ops/sec ±1.63% (99 runs sampled)
+    cached slice.call(arguments, -2, -1) x 10,060,633 ops/sec ±1.37% (96 runs sampled)
+    sliced(arguments, -2, -1) x 18,608,712 ops/sec ±1.08% (93 runs sampled)
+    fastest is sliced(arguments, -2, -1)
+
+_Benchmark  [source](https://github.com/aheckmann/sliced/blob/master/bench.js)._
+
+##Usage
+
+`sliced` accepts the same arguments as `Array#slice` so you can easily swap it out.
+
+```js
+function zing () {
+  var slow = [].slice.call(arguments, 1, 8);
+  var args = slice(arguments, 1, 8);
+
+  var slow = Array.prototype.slice.call(arguments);
+  var args = slice(arguments);
+  // etc
+}
+```
+
+## install
+
+    npm install sliced
+
+
+[LICENSE](https://github.com/aheckmann/sliced/blob/master/LICENSE)

data/deps/node_modules/deku/node_modules/sliced/bench.js

@@ -0,0 +1,95 @@
+
+var sliced = require('./')
+var Bench = require('benchmark');
+var s = new Bench.Suite;
+var slice = [].slice;
+
+s.add('Array.prototype.slice.call', function () {
+  Array.prototype.slice.call(arguments);
+}).add('[].slice.call', function () {
+  [].slice.call(arguments);
+}).add('cached slice.call', function () {
+  slice.call(arguments)
+}).add('sliced', function () {
+  sliced(arguments)
+}).on('cycle', function (evt) {
+  console.log(String(evt.target));
+}).on('complete', function () {
+  console.log('fastest is %s', this.filter('fastest').pluck('name'));
+})
+.run();
+
+var s = new Bench.Suite;
+s.add('Array.prototype.slice.call(arguments, 1)', function () {
+  Array.prototype.slice.call(arguments, 1);
+}).add('[].slice.call(arguments, 1)', function () {
+  [].slice.call(arguments, 1);
+}).add('cached slice.call(arguments, 1)', function () {
+  slice.call(arguments, 1)
+}).add('sliced(arguments, 1)', function () {
+  sliced(arguments, 1)
+}).on('cycle', function (evt) {
+  console.log(String(evt.target));
+}).on('complete', function () {
+  console.log('fastest is %s', this.filter('fastest').pluck('name'));
+})
+.run();
+
+var s = new Bench.Suite;
+s.add('Array.prototype.slice.call(arguments, -1)', function () {
+  Array.prototype.slice.call(arguments, -1);
+}).add('[].slice.call(arguments, -1)', function () {
+  [].slice.call(arguments, -1);
+}).add('cached slice.call(arguments, -1)', function () {
+  slice.call(arguments, -1)
+}).add('sliced(arguments, -1)', function () {
+  sliced(arguments, -1)
+}).on('cycle', function (evt) {
+  console.log(String(evt.target));
+}).on('complete', function () {
+  console.log('fastest is %s', this.filter('fastest').pluck('name'));
+})
+.run();
+
+var s = new Bench.Suite;
+s.add('Array.prototype.slice.call(arguments, -2, -10)', function () {
+  Array.prototype.slice.call(arguments, -2, -10);
+}).add('[].slice.call(arguments, -2, -10)', function () {
+  [].slice.call(arguments, -2, -10);
+}).add('cached slice.call(arguments, -2, -10)', function () {
+  slice.call(arguments, -2, -10)
+}).add('sliced(arguments, -2, -10)', function () {
+  sliced(arguments, -2, -10)
+}).on('cycle', function (evt) {
+  console.log(String(evt.target));
+}).on('complete', function () {
+  console.log('fastest is %s', this.filter('fastest').pluck('name'));
+})
+.run();
+
+var s = new Bench.Suite;
+s.add('Array.prototype.slice.call(arguments, -2, -1)', function () {
+  Array.prototype.slice.call(arguments, -2, -1);
+}).add('[].slice.call(arguments, -2, -1)', function () {
+  [].slice.call(arguments, -2, -1);
+}).add('cached slice.call(arguments, -2, -1)', function () {
+  slice.call(arguments, -2, -1)
+}).add('sliced(arguments, -2, -1)', function () {
+  sliced(arguments, -2, -1)
+}).on('cycle', function (evt) {
+  console.log(String(evt.target));
+}).on('complete', function () {
+  console.log('fastest is %s', this.filter('fastest').pluck('name'));
+})
+.run();
+
+/**
+ * Output:
+ *
+ * Array.prototype.slice.call x 1,289,592 ops/sec ±2.88% (87 runs sampled)
+ * [].slice.call x 1,345,451 ops/sec ±1.68% (97 runs sampled)
+ * cached slice.call x 10,719,886 ops/sec ±1.04% (99 runs sampled)
+ * sliced x 15,809,545 ops/sec ±1.46% (93 runs sampled)
+ * fastest is sliced
+ *
+ */

data/deps/node_modules/deku/node_modules/sliced/component.json

@@ -0,0 +1,14 @@
+{
+  "name": "sliced",
+  "version": "0.0.5",
+  "description": "A faster Node.js alternative to Array.prototype.slice.call(arguments)",
+  "repo" : "aheckmann/sliced",
+  "keywords": [
+    "arguments",
+    "slice",
+    "array"
+  ],
+  "scripts": ["lib/sliced.js", "index.js"],
+  "author": "Aaron Heckmann <aaron.heckmann+github@gmail.com>",
+  "license": "MIT"
+}

data/deps/node_modules/deku/node_modules/sliced/index.js

@@ -0,0 +1 @@
+module.exports = exports = require('./lib/sliced');

data/deps/node_modules/deku/node_modules/sliced/lib/sliced.js

@@ -0,0 +1,33 @@
+
+/**
+ * An Array.prototype.slice.call(arguments) alternative
+ *
+ * @param {Object} args something with a length
+ * @param {Number} slice
+ * @param {Number} sliceEnd
+ * @api public
+ */
+
+module.exports = function (args, slice, sliceEnd) {
+  var ret = [];
+  var len = args.length;
+
+  if (0 === len) return ret;
+
+  var start = slice < 0
+    ? Math.max(0, slice + len)
+    : slice || 0;
+
+  if (sliceEnd !== undefined) {
+    len = sliceEnd < 0
+      ? sliceEnd + len
+      : sliceEnd
+  }
+
+  while (len-- > start) {
+    ret[len - start] = args[len];
+  }
+
+  return ret;
+}
+

data/deps/node_modules/deku/node_modules/sliced/package.json

@@ -0,0 +1,52 @@
+{
+  "name": "sliced",
+  "version": "0.0.5",
+  "description": "A faster Node.js alternative to Array.prototype.slice.call(arguments)",
+  "main": "index.js",
+  "scripts": {
+    "test": "make test"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git://github.com/aheckmann/sliced"
+  },
+  "keywords": [
+    "arguments",
+    "slice",
+    "array"
+  ],
+  "author": {
+    "name": "Aaron Heckmann",
+    "email": "aaron.heckmann+github@gmail.com"
+  },
+  "license": "MIT",
+  "devDependencies": {
+    "mocha": "1.5.0",
+    "benchmark": "~1.0.0"
+  },
+  "readme": "#sliced\n==========\n\nA faster alternative to `[].slice.call(arguments)`.\n\n[![Build Status](https://secure.travis-ci.org/aheckmann/sliced.png)](http://travis-ci.org/aheckmann/sliced)\n\nExample output from [benchmark.js](https://github.com/bestiejs/benchmark.js)\n\n    Array.prototype.slice.call x 1,320,205 ops/sec ±2.35% (92 runs sampled)\n    [].slice.call x 1,314,605 ops/sec ±1.60% (95 runs sampled)\n    cached slice.call x 10,468,380 ops/sec ±1.45% (95 runs sampled)\n    sliced x 16,608,237 ops/sec ±1.40% (92 runs sampled)\n    fastest is sliced\n\n    Array.prototype.slice.call(arguments, 1) x 1,383,584 ops/sec ±1.73% (97 runs sampled)\n    [].slice.call(arguments, 1) x 1,494,735 ops/sec ±1.33% (95 runs sampled)\n    cached slice.call(arguments, 1) x 10,085,270 ops/sec ±1.51% (97 runs sampled)\n    sliced(arguments, 1) x 16,620,480 ops/sec ±1.29% (95 runs sampled)\n    fastest is sliced(arguments, 1)\n\n    Array.prototype.slice.call(arguments, -1) x 1,303,262 ops/sec ±1.62% (94 runs sampled)\n    [].slice.call(arguments, -1) x 1,325,615 ops/sec ±1.36% (97 runs sampled)\n    cached slice.call(arguments, -1) x 9,673,603 ops/sec ±1.70% (96 runs sampled)\n    sliced(arguments, -1) x 16,384,575 ops/sec ±1.06% (91 runs sampled)\n    fastest is sliced(arguments, -1)\n\n    Array.prototype.slice.call(arguments, -2, -10) x 1,404,390 ops/sec ±1.61% (95 runs sampled)\n    [].slice.call(arguments, -2, -10) x 1,514,367 ops/sec ±1.21% (96 runs sampled)\n    cached slice.call(arguments, -2, -10) x 9,836,017 ops/sec ±1.21% (95 runs sampled)\n    sliced(arguments, -2, -10) x 18,544,882 ops/sec ±1.30% (91 runs sampled)\n    fastest is sliced(arguments, -2, -10)\n\n    Array.prototype.slice.call(arguments, -2, -1) x 1,458,604 ops/sec ±1.41% (97 runs sampled)\n    [].slice.call(arguments, -2, -1) x 1,536,547 ops/sec ±1.63% (99 runs sampled)\n    cached slice.call(arguments, -2, -1) x 10,060,633 ops/sec ±1.37% (96 runs sampled)\n    sliced(arguments, -2, -1) x 18,608,712 ops/sec ±1.08% (93 runs sampled)\n    fastest is sliced(arguments, -2, -1)\n\n_Benchmark  [source](https://github.com/aheckmann/sliced/blob/master/bench.js)._\n\n##Usage\n\n`sliced` accepts the same arguments as `Array#slice` so you can easily swap it out.\n\n```js\nfunction zing () {\n  var slow = [].slice.call(arguments, 1, 8);\n  var args = slice(arguments, 1, 8);\n\n  var slow = Array.prototype.slice.call(arguments);\n  var args = slice(arguments);\n  // etc\n}\n```\n\n## install\n\n    npm install sliced\n\n\n[LICENSE](https://github.com/aheckmann/sliced/blob/master/LICENSE)\n",
+  "_id": "sliced@0.0.5",
+  "dist": {
+    "shasum": "5edc044ca4eb6f7816d50ba2fc63e25d8fe4707f",
+    "tarball": "http://registry.npmjs.org/sliced/-/sliced-0.0.5.tgz"
+  },
+  "_npmVersion": "1.1.59",
+  "_npmUser": {
+    "name": "aaron",
+    "email": "aaron.heckmann+github@gmail.com"
+  },
+  "maintainers": [
+    {
+      "name": "aaron",
+      "email": "aaron.heckmann+github@gmail.com"
+    }
+  ],
+  "directories": {},
+  "_shasum": "5edc044ca4eb6f7816d50ba2fc63e25d8fe4707f",
+  "_resolved": "https://registry.npmjs.org/sliced/-/sliced-0.0.5.tgz",
+  "_from": "sliced@0.0.5",
+  "bugs": {
+    "url": "https://github.com/aheckmann/sliced/issues"
+  },
+  "homepage": "https://github.com/aheckmann/sliced"
+}

data/deps/node_modules/deku/node_modules/sliced/test/index.js

@@ -0,0 +1,80 @@
+
+var sliced = require('../')
+var assert = require('assert')
+
+describe('sliced', function(){
+  it('exports a function', function(){
+    assert.equal('function', typeof sliced);
+  })
+  describe('with 1 arg', function(){
+    it('returns an array of the arg', function(){
+      var o = [3, "4", {}];
+      var r = sliced(o);
+      assert.equal(3, r.length);
+      assert.equal(o[0], r[0]);
+      assert.equal(o[1], r[1]);
+      assert.equal(o[1], r[1]);
+    })
+  })
+  describe('with 2 args', function(){
+    it('returns an array of the arg starting at the 2nd arg', function(){
+      var o = [3, "4", 5, null];
+      var r = sliced(o, 2);
+      assert.equal(2, r.length);
+      assert.equal(o[2], r[0]);
+      assert.equal(o[3], r[1]);
+    })
+  })
+  describe('with 3 args', function(){
+    it('returns an array of the arg from the 2nd to the 3rd arg', function(){
+      var o = [3, "4", 5, null];
+      var r = sliced(o, 1, 2);
+      assert.equal(1, r.length);
+      assert.equal(o[1], r[0]);
+    })
+  })
+  describe('with negative start and no end', function(){
+    it('begins at an offset from the end and includes all following elements', function(){
+      var o = [3, "4", 5, null];
+      var r = sliced(o, -2);
+      assert.equal(2, r.length);
+      assert.equal(o[2], r[0]);
+      assert.equal(o[3], r[1]);
+
+      var r = sliced(o, -12);
+      assert.equal(4, r.length);
+      assert.equal(o[0], r[0]);
+      assert.equal(o[1], r[1]);
+    })
+  })
+  describe('with negative start and positive end', function(){
+    it('begins at an offset from the end and includes `end` elements', function(){
+      var o = [3, "4", {x:1}, null];
+
+      var r = sliced(o, -2, 1);
+      assert.equal(0, r.length);
+
+      var r = sliced(o, -2, 2);
+      assert.equal(0, r.length);
+
+      var r = sliced(o, -2, 3);
+      assert.equal(1, r.length);
+      assert.equal(o[2], r[0]);
+    })
+  })
+  describe('with negative start and negative end', function(){
+    it('begins at `start` offset from the end and includes all elements up to `end` offset from the end', function(){
+      var o = [3, "4", {x:1}, null];
+      var r = sliced(o, -3, -1);
+      assert.equal(2, r.length);
+      assert.equal(o[1], r[0]);
+      assert.equal(o[2], r[1]);
+
+      var r = sliced(o, -3, -3);
+      assert.equal(0, r.length);
+
+      var r = sliced(o, -3, -4);
+      assert.equal(0, r.length);
+    })
+  })
+})

data/deps/node_modules/deku/package.json

@@ -0,0 +1,67 @@
+{
+  "name": "deku",
+  "version": "0.2.17",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/segmentio/deku"
+  },
+  "description": "Create view components using a virtual DOM",
+  "main": "lib/index.js",
+  "devDependencies": {
+    "babelify": "^5.0.4",
+    "benchmark": "^1.0.0",
+    "bfc": "~0.3.1",
+    "browserify": "^8.1.1",
+    "bump": "git://github.com/ianstormtaylor/bump.git#0.4.2",
+    "component-classes": "^1.2.3",
+    "duo-test": "^0.3.13",
+    "memoizee": "^0.3.8",
+    "minify": "^1.4.11",
+    "mochify": "^2.1.1",
+    "standard": "^3.6.1",
+    "trigger-event": "^1.0.0",
+    "zuul": "~1.16.4"
+  },
+  "dependencies": {
+    "array-flatten": "^1.0.2",
+    "component-emitter": "^1.1.3",
+    "component-raf": "^1.2.0",
+    "component-type": "^1.1.0",
+    "dom-pool": "^0.1.1",
+    "dom-walk": "^0.1.1",
+    "fast.js": "^0.1.1",
+    "get-uid": "^1.0.1",
+    "is-dom": "^1.0.5",
+    "object-path": "^0.8.1",
+    "per-frame": "^3.0.0",
+    "sliced": "0.0.5"
+  },
+  "gitHead": "c8e9cd6ea49b2c27ec5625f9653335d70a17cf73",
+  "bugs": {
+    "url": "https://github.com/segmentio/deku/issues"
+  },
+  "homepage": "https://github.com/segmentio/deku",
+  "_id": "deku@0.2.17",
+  "scripts": {},
+  "_shasum": "a2071d982bd0306763e4fa0303a6b59f0f4dbc42",
+  "_from": "deku@*",
+  "_npmVersion": "2.6.0",
+  "_nodeVersion": "0.12.0",
+  "_npmUser": {
+    "name": "anthonyshort",
+    "email": "antshort@gmail.com"
+  },
+  "maintainers": [
+    {
+      "name": "anthonyshort",
+      "email": "antshort@gmail.com"
+    }
+  ],
+  "dist": {
+    "shasum": "a2071d982bd0306763e4fa0303a6b59f0f4dbc42",
+    "tarball": "http://registry.npmjs.org/deku/-/deku-0.2.17.tgz"
+  },
+  "directories": {},
+  "_resolved": "https://registry.npmjs.org/deku/-/deku-0.2.17.tgz",
+  "readme": "ERROR: No README data found!"
+}