tck-lambdas 0.3.0 → 0.3.1

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domhandler/test/tests.js

@@ -1,60 +0,0 @@
-var fs = require("fs"),
-    path = require("path"),
-    assert = require("assert"),
-    util = require("util"),
-    Parser = require("htmlparser2").Parser,
-    Handler = require("../");
-
-var basePath = path.resolve(__dirname, "cases"),
-    inspectOpts = { showHidden: true, depth: null };
-
-fs
-.readdirSync(basePath)
-.filter(RegExp.prototype.test, /\.json$/) //only allow .json files
-.map(function(name){
-	return path.resolve(basePath, name);
-})
-.map(require)
-.forEach(function(test){
-	it(test.name, function(){
-		var expected = test.expected;
-
-		var handler = new Handler(function(err, actual){
-			assert.ifError(err);
-			try {
-				compare(expected, actual);
-			} catch(e){
-				e.expected = util.inspect(expected, inspectOpts);
-				e.actual   = util.inspect(actual,   inspectOpts);
-				throw e;
-			}
-		}, test.options);
-
-		var data = test.html;
-
-		var parser = new Parser(handler, test.options);
-
-		//first, try to run the test via chunks
-		if (test.streaming || test.streaming === undefined){
-			for(var i = 0; i < data.length; i++){
-				parser.write(data.charAt(i));
-			}
-			parser.done();
-		}
-
-		//then parse everything
-		parser.parseComplete(data);
-	});
-});
-
-function compare(expected, result){
-	assert.equal(typeof expected, typeof result, "types didn't match");
-	if(typeof expected !== "object" || expected === null){
-		assert.strictEqual(expected, result, "result doesn't equal expected");
-	} else {
-		for(var prop in expected){
-			assert.ok(prop in result, "result didn't contain property " + prop);
-			compare(expected[prop], result[prop]);
-		}
-	}
-}

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/index.js

@@ -1,14 +0,0 @@
-var DomUtils = module.exports;
-
-[
-	require("./lib/stringify"),
-	require("./lib/traversal"),
-	require("./lib/manipulation"),
-	require("./lib/querying"),
-	require("./lib/legacy"),
-	require("./lib/helpers")
-].forEach(function(ext){
-	Object.keys(ext).forEach(function(key){
-		DomUtils[key] = ext[key].bind(DomUtils);
-	});
-});

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/lib/helpers.js

@@ -1,141 +0,0 @@
-// removeSubsets
-// Given an array of nodes, remove any member that is contained by another.
-exports.removeSubsets = function(nodes) {
-	var idx = nodes.length, node, ancestor, replace;
-
-	// Check if each node (or one of its ancestors) is already contained in the
-	// array.
-	while (--idx > -1) {
-		node = ancestor = nodes[idx];
-
-		// Temporarily remove the node under consideration
-		nodes[idx] = null;
-		replace = true;
-
-		while (ancestor) {
-			if (nodes.indexOf(ancestor) > -1) {
-				replace = false;
-				nodes.splice(idx, 1);
-				break;
-			}
-			ancestor = ancestor.parent;
-		}
-
-		// If the node has been found to be unique, re-insert it.
-		if (replace) {
-			nodes[idx] = node;
-		}
-	}
-
-	return nodes;
-};
-
-// Source: http://dom.spec.whatwg.org/#dom-node-comparedocumentposition
-var POSITION = {
-	DISCONNECTED: 1,
-	PRECEDING: 2,
-	FOLLOWING: 4,
-	CONTAINS: 8,
-	CONTAINED_BY: 16
-};
-
-// Compare the position of one node against another node in any other document.
-// The return value is a bitmask with the following values:
-//
-// document order:
-// > There is an ordering, document order, defined on all the nodes in the
-// > document corresponding to the order in which the first character of the
-// > XML representation of each node occurs in the XML representation of the
-// > document after expansion of general entities. Thus, the document element
-// > node will be the first node. Element nodes occur before their children.
-// > Thus, document order orders element nodes in order of the occurrence of
-// > their start-tag in the XML (after expansion of entities). The attribute
-// > nodes of an element occur after the element and before its children. The
-// > relative order of attribute nodes is implementation-dependent./
-// Source:
-// http://www.w3.org/TR/DOM-Level-3-Core/glossary.html#dt-document-order
-//
-// @argument {Node} nodaA The first node to use in the comparison
-// @argument {Node} nodeB The second node to use in the comparison
-//
-// @return {Number} A bitmask describing the input nodes' relative position.
-//         See http://dom.spec.whatwg.org/#dom-node-comparedocumentposition for
-//         a description of these values.
-var comparePos = exports.compareDocumentPosition = function(nodeA, nodeB) {
-	var aParents = [];
-	var bParents = [];
-	var current, sharedParent, siblings, aSibling, bSibling, idx;
-
-	if (nodeA === nodeB) {
-		return 0;
-	}
-
-	current = nodeA;
-	while (current) {
-		aParents.unshift(current);
-		current = current.parent;
-	}
-	current = nodeB;
-	while (current) {
-		bParents.unshift(current);
-		current = current.parent;
-	}
-
-	idx = 0;
-	while (aParents[idx] === bParents[idx]) {
-		idx++;
-	}
-
-	if (idx === 0) {
-		return POSITION.DISCONNECTED;
-	}
-
-	sharedParent = aParents[idx - 1];
-	siblings = sharedParent.children;
-	aSibling = aParents[idx];
-	bSibling = bParents[idx];
-
-	if (siblings.indexOf(aSibling) > siblings.indexOf(bSibling)) {
-		if (sharedParent === nodeB) {
-			return POSITION.FOLLOWING | POSITION.CONTAINED_BY;
-		}
-		return POSITION.FOLLOWING;
-	} else {
-		if (sharedParent === nodeA) {
-			return POSITION.PRECEDING | POSITION.CONTAINS;
-		}
-		return POSITION.PRECEDING;
-	}
-};
-
-// Sort an array of nodes based on their relative position in the document and
-// remove any duplicate nodes. If the array contains nodes that do not belong
-// to the same document, sort order is unspecified.
-//
-// @argument {Array} nodes Array of DOM nodes
-//
-// @returns {Array} collection of unique nodes, sorted in document order
-exports.uniqueSort = function(nodes) {
-	var idx = nodes.length, node, position;
-
-	nodes = nodes.slice();
-
-	while (--idx > -1) {
-		node = nodes[idx];
-		position = nodes.indexOf(node);
-		if (position > -1 && position < idx) {
-			nodes.splice(idx, 1);
-		}
-	}
-	nodes.sort(function(a, b) {
-		var relative = comparePos(a, b);
-		if (relative & POSITION.PRECEDING) {
-			return -1;
-		} else if (relative & POSITION.FOLLOWING) {
-			return 1;
-		}
-		return 0;
-	});
-
-	return nodes;
-};

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/lib/legacy.js

@@ -1,87 +0,0 @@
-var ElementType = require("domelementtype");
-var isTag = exports.isTag = ElementType.isTag;
-
-exports.testElement = function(options, element){
-	for(var key in options){
-		if(!options.hasOwnProperty(key));
-		else if(key === "tag_name"){
-			if(!isTag(element) || !options.tag_name(element.name)){
-				return false;
-			}
-		} else if(key === "tag_type"){
-			if(!options.tag_type(element.type)) return false;
-		} else if(key === "tag_contains"){
-			if(isTag(element) || !options.tag_contains(element.data)){
-				return false;
-			}
-		} else if(!element.attribs || !options[key](element.attribs[key])){
-			return false;
-		}
-	}
-	return true;
-};
-
-var Checks = {
-	tag_name: function(name){
-		if(typeof name === "function"){
-			return function(elem){ return isTag(elem) && name(elem.name); };
-		} else if(name === "*"){
-			return isTag;
-		} else {
-			return function(elem){ return isTag(elem) && elem.name === name; };
-		}
-	},
-	tag_type: function(type){
-		if(typeof type === "function"){
-			return function(elem){ return type(elem.type); };
-		} else {
-			return function(elem){ return elem.type === type; };
-		}
-	},
-	tag_contains: function(data){
-		if(typeof data === "function"){
-			return function(elem){ return !isTag(elem) && data(elem.data); };
-		} else {
-			return function(elem){ return !isTag(elem) && elem.data === data; };
-		}
-	}
-};
-
-function getAttribCheck(attrib, value){
-	if(typeof value === "function"){
-		return function(elem){ return elem.attribs && value(elem.attribs[attrib]); };
-	} else {
-		return function(elem){ return elem.attribs && elem.attribs[attrib] === value; };
-	}
-}
-
-function combineFuncs(a, b){
-	return function(elem){
-		return a(elem) || b(elem);
-	};
-}
-
-exports.getElements = function(options, element, recurse, limit){
-	var funcs = Object.keys(options).map(function(key){
-		var value = options[key];
-		return key in Checks ? Checks[key](value) : getAttribCheck(key, value);
-	});
-
-	return funcs.length === 0 ? [] : this.filter(
-		funcs.reduce(combineFuncs),
-		element, recurse, limit
-	);
-};
-
-exports.getElementById = function(id, element, recurse){
-	if(!Array.isArray(element)) element = [element];
-	return this.findOne(getAttribCheck("id", id), element, recurse !== false);
-};
-
-exports.getElementsByTagName = function(name, element, recurse, limit){
-	return this.filter(Checks.tag_name(name), element, recurse, limit);
-};
-
-exports.getElementsByTagType = function(type, element, recurse, limit){
-	return this.filter(Checks.tag_type(type), element, recurse, limit);
-};

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/lib/manipulation.js

@@ -1,77 +0,0 @@
-exports.removeElement = function(elem){
-	if(elem.prev) elem.prev.next = elem.next;
-	if(elem.next) elem.next.prev = elem.prev;
-
-	if(elem.parent){
-		var childs = elem.parent.children;
-		childs.splice(childs.lastIndexOf(elem), 1);
-	}
-};
-
-exports.replaceElement = function(elem, replacement){
-	var prev = replacement.prev = elem.prev;
-	if(prev){
-		prev.next = replacement;
-	}
-
-	var next = replacement.next = elem.next;
-	if(next){
-		next.prev = replacement;
-	}
-
-	var parent = replacement.parent = elem.parent;
-	if(parent){
-		var childs = parent.children;
-		childs[childs.lastIndexOf(elem)] = replacement;
-	}
-};
-
-exports.appendChild = function(elem, child){
-	child.parent = elem;
-
-	if(elem.children.push(child) !== 1){
-		var sibling = elem.children[elem.children.length - 2];
-		sibling.next = child;
-		child.prev = sibling;
-		child.next = null;
-	}
-};
-
-exports.append = function(elem, next){
-	var parent = elem.parent,
-		currNext = elem.next;
-
-	next.next = currNext;
-	next.prev = elem;
-	elem.next = next;
-	next.parent = parent;
-
-	if(currNext){
-		currNext.prev = next;
-		if(parent){
-			var childs = parent.children;
-			childs.splice(childs.lastIndexOf(currNext), 0, next);
-		}
-	} else if(parent){
-		parent.children.push(next);
-	}
-};
-
-exports.prepend = function(elem, prev){
-	var parent = elem.parent;
-	if(parent){
-		var childs = parent.children;
-		childs.splice(childs.lastIndexOf(elem), 0, prev);
-	}
-
-	if(elem.prev){
-		elem.prev.next = prev;
-	}
-	
-	prev.parent = parent;
-	prev.prev = elem.prev;
-	prev.next = elem;
-	elem.prev = prev;
-};
-
-

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/lib/querying.js

@@ -1,94 +0,0 @@
-var isTag = require("domelementtype").isTag;
-
-module.exports = {
-	filter: filter,
-	find: find,
-	findOneChild: findOneChild,
-	findOne: findOne,
-	existsOne: existsOne,
-	findAll: findAll
-};
-
-function filter(test, element, recurse, limit){
-	if(!Array.isArray(element)) element = [element];
-
-	if(typeof limit !== "number" || !isFinite(limit)){
-		limit = Infinity;
-	}
-	return find(test, element, recurse !== false, limit);
-}
-
-function find(test, elems, recurse, limit){
-	var result = [], childs;
-
-	for(var i = 0, j = elems.length; i < j; i++){
-		if(test(elems[i])){
-			result.push(elems[i]);
-			if(--limit <= 0) break;
-		}
-
-		childs = elems[i].children;
-		if(recurse && childs && childs.length > 0){
-			childs = find(test, childs, recurse, limit);
-			result = result.concat(childs);
-			limit -= childs.length;
-			if(limit <= 0) break;
-		}
-	}
-
-	return result;
-}
-
-function findOneChild(test, elems){
-	for(var i = 0, l = elems.length; i < l; i++){
-		if(test(elems[i])) return elems[i];
-	}
-
-	return null;
-}
-
-function findOne(test, elems){
-	var elem = null;
-
-	for(var i = 0, l = elems.length; i < l && !elem; i++){
-		if(!isTag(elems[i])){
-			continue;
-		} else if(test(elems[i])){
-			elem = elems[i];
-		} else if(elems[i].children.length > 0){
-			elem = findOne(test, elems[i].children);
-		}
-	}
-
-	return elem;
-}
-
-function existsOne(test, elems){
-	for(var i = 0, l = elems.length; i < l; i++){
-		if(
-			isTag(elems[i]) && (
-				test(elems[i]) || (
-					elems[i].children.length > 0 &&
-					existsOne(test, elems[i].children)
-				)
-			)
-		){
-			return true;
-		}
-	}
-
-	return false;
-}
-
-function findAll(test, elems){
-	var result = [];
-	for(var i = 0, j = elems.length; i < j; i++){
-		if(!isTag(elems[i])) continue;
-		if(test(elems[i])) result.push(elems[i]);
-
-		if(elems[i].children.length > 0){
-			result = result.concat(findAll(test, elems[i].children));
-		}
-	}
-	return result;
-}

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/lib/stringify.js

@@ -1,22 +0,0 @@
-var ElementType = require("domelementtype"),
-    getOuterHTML = require("dom-serializer"),
-    isTag = ElementType.isTag;
-
-module.exports = {
-	getInnerHTML: getInnerHTML,
-	getOuterHTML: getOuterHTML,
-	getText: getText
-};
-
-function getInnerHTML(elem, opts){
-	return elem.children ? elem.children.map(function(elem){
-		return getOuterHTML(elem, opts);
-	}).join("") : "";
-}
-
-function getText(elem){
-	if(Array.isArray(elem)) return elem.map(getText).join("");
-	if(isTag(elem) || elem.type === ElementType.CDATA) return getText(elem.children);
-	if(elem.type === ElementType.Text) return elem.data;
-	return "";
-}

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/lib/traversal.js

@@ -1,24 +0,0 @@
-var getChildren = exports.getChildren = function(elem){
-	return elem.children;
-};
-
-var getParent = exports.getParent = function(elem){
-	return elem.parent;
-};
-
-exports.getSiblings = function(elem){
-	var parent = getParent(elem);
-	return parent ? getChildren(parent) : [elem];
-};
-
-exports.getAttributeValue = function(elem, name){
-	return elem.attribs && elem.attribs[name];
-};
-
-exports.hasAttrib = function(elem, name){
-	return !!elem.attribs && hasOwnProperty.call(elem.attribs, name);
-};
-
-exports.getName = function(elem){
-	return elem.name;
-};

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/package.json

@@ -1,74 +0,0 @@
-{
-  "name": "domutils",
-  "version": "1.5.1",
-  "description": "utilities for working with htmlparser2's dom",
-  "main": "index.js",
-  "directories": {
-    "test": "tests"
-  },
-  "scripts": {
-    "test": "mocha test/tests/**.js && jshint index.js test/**/*.js lib/*.js"
-  },
-  "repository": {
-    "type": "git",
-    "url": "git://github.com/FB55/domutils.git"
-  },
-  "keywords": [
-    "dom",
-    "htmlparser2"
-  ],
-  "dependencies": {
-    "dom-serializer": "0",
-    "domelementtype": "1"
-  },
-  "devDependencies": {
-    "htmlparser2": "~3.3.0",
-    "domhandler": "2",
-    "jshint": "~2.3.0",
-    "mocha": "~1.15.1"
-  },
-  "author": {
-    "name": "Felix Boehm",
-    "email": "me@feedic.com"
-  },
-  "jshintConfig": {
-    "proto": true,
-    "unused": true,
-    "eqnull": true,
-    "undef": true,
-    "quotmark": "double",
-    "eqeqeq": true,
-    "trailing": true,
-    "node": true,
-    "globals": {
-      "describe": true,
-      "it": true,
-      "beforeEach": true
-    }
-  },
-  "gitHead": "7d4bd16cd36ffce62362ef91616806ea27e30d95",
-  "bugs": {
-    "url": "https://github.com/FB55/domutils/issues"
-  },
-  "homepage": "https://github.com/FB55/domutils",
-  "_id": "domutils@1.5.1",
-  "_shasum": "dcd8488a26f563d61079e48c9f7b7e32373682cf",
-  "_from": "domutils@^1.5.1",
-  "_npmVersion": "2.3.0",
-  "_nodeVersion": "1.0.4",
-  "_npmUser": {
-    "name": "feedic",
-    "email": "me@feedic.com"
-  },
-  "maintainers": [
-    {
-      "name": "feedic",
-      "email": "me@feedic.com"
-    }
-  ],
-  "dist": {
-    "shasum": "dcd8488a26f563d61079e48c9f7b7e32373682cf",
-    "tarball": "https://registry.npmjs.org/domutils/-/domutils-1.5.1.tgz"
-  },
-  "_resolved": "https://registry.npmjs.org/domutils/-/domutils-1.5.1.tgz"
-}

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/readme.md

@@ -1 +0,0 @@
-utilities for working with htmlparser2's dom

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/test/fixture.js

@@ -1,6 +0,0 @@
-var makeDom = require("./utils").makeDom;
-var markup = Array(21).join(
-	"<?xml><tag1 id='asdf'> <script>text</script> <!-- comment --> <tag2> text </tag1>"
-);
-
-module.exports = makeDom(markup);

data/lib/tck/lambdas/chistacojs/node_modules/cheerio/node_modules/htmlparser2/node_modules/domutils/test/tests/helpers.js

@@ -1,89 +0,0 @@
-var makeDom = require("../utils").makeDom;
-var helpers = require("../..");
-var assert = require("assert");
-
-describe("helpers", function() {
-	describe("removeSubsets", function() {
-		var removeSubsets = helpers.removeSubsets;
-		var dom = makeDom("<div><p><span></span></p><p></p></div>")[0];
-
-		it("removes identical trees", function() {
-			var matches = removeSubsets([dom, dom]);
-			assert.equal(matches.length, 1);
-		});
-
-		it("Removes subsets found first", function() {
-			var matches = removeSubsets([dom, dom.children[0].children[0]]);
-			assert.equal(matches.length, 1);
-		});
-
-		it("Removes subsets found last", function() {
-			var matches = removeSubsets([dom.children[0], dom]);
-			assert.equal(matches.length, 1);
-		});
-
-		it("Does not remove unique trees", function() {
-			var matches = removeSubsets([dom.children[0], dom.children[1]]);
-			assert.equal(matches.length, 2);
-		});
-	});
-
-	describe("compareDocumentPosition", function() {
-		var compareDocumentPosition = helpers.compareDocumentPosition;
-		var markup = "<div><p><span></span></p><a></a></div>";
-		var dom = makeDom(markup)[0];
-		var p = dom.children[0];
-		var span = p.children[0];
-		var a = dom.children[1];
-
-		it("reports when the first node occurs before the second indirectly", function() {
-			assert.equal(compareDocumentPosition(span, a), 2);
-		});
-
-		it("reports when the first node contains the second", function() {
-			assert.equal(compareDocumentPosition(p, span), 10);
-		});
-
-		it("reports when the first node occurs after the second indirectly", function() {
-			assert.equal(compareDocumentPosition(a, span), 4);
-		});
-
-		it("reports when the first node is contained by the second", function() {
-			assert.equal(compareDocumentPosition(span, p), 20);
-		});
-
-		it("reports when the nodes belong to separate documents", function() {
-			var other = makeDom(markup)[0].children[0].children[0];
-
-			assert.equal(compareDocumentPosition(span, other), 1);
-		});
-
-		it("reports when the nodes are identical", function() {
-			assert.equal(compareDocumentPosition(span, span), 0);
-		});
-	});
-
-	describe("uniqueSort", function() {
-		var uniqueSort = helpers.uniqueSort;
-		var dom, p, span, a;
-
-		beforeEach(function() {
-			dom = makeDom("<div><p><span></span></p><a></a></div>")[0];
-			p = dom.children[0];
-			span = p.children[0];
-			a = dom.children[1];
-		});
-
-		it("leaves unique elements untouched", function() {
-			assert.deepEqual(uniqueSort([p, a]), [p, a]);
-		});
-
-		it("removes duplicate elements", function() {
-			assert.deepEqual(uniqueSort([p, a, p]), [p, a]);
-		});
-
-		it("sorts nodes in document order", function() {
-			assert.deepEqual(uniqueSort([a, dom, span, p]), [dom, p, span, a]);
-		});
-	});
-});