js-priority-queue
Advanced tools
Comparing version 0.1.4 to 0.1.5
{ | ||
"name": "js-priority-queue", | ||
"version": "0.1.4", | ||
"version": "0.1.5", | ||
"description": "Priority queue data structures", | ||
@@ -32,2 +32,3 @@ "main": "priority-queue.js", | ||
"gulp-coffee": "^2.3.1", | ||
"gulp-derequire": "^2.1.0", | ||
"gulp-mocha": "^2.1.3", | ||
@@ -34,0 +35,0 @@ "gulp-rename": "^1.2.2", |
@@ -1,2 +0,2 @@ | ||
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.PriorityQueue = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){ | ||
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.PriorityQueue = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(_dereq_,module,exports){ | ||
var AbstractPriorityQueue, ArrayStrategy, BHeapStrategy, BinaryHeapStrategy, PriorityQueue, | ||
@@ -6,9 +6,9 @@ extend = function(child, parent) { for (var key in parent) { if (hasProp.call(parent, key)) child[key] = parent[key]; } function ctor() { this.constructor = child; } ctor.prototype = parent.prototype; child.prototype = new ctor(); child.__super__ = parent.prototype; return child; }, | ||
AbstractPriorityQueue = require('./PriorityQueue/AbstractPriorityQueue'); | ||
AbstractPriorityQueue = _dereq_('./PriorityQueue/AbstractPriorityQueue'); | ||
ArrayStrategy = require('./PriorityQueue/ArrayStrategy'); | ||
ArrayStrategy = _dereq_('./PriorityQueue/ArrayStrategy'); | ||
BinaryHeapStrategy = require('./PriorityQueue/BinaryHeapStrategy'); | ||
BinaryHeapStrategy = _dereq_('./PriorityQueue/BinaryHeapStrategy'); | ||
BHeapStrategy = require('./PriorityQueue/BHeapStrategy'); | ||
BHeapStrategy = _dereq_('./PriorityQueue/BHeapStrategy'); | ||
@@ -40,3 +40,3 @@ PriorityQueue = (function(superClass) { | ||
},{"./PriorityQueue/AbstractPriorityQueue":2,"./PriorityQueue/ArrayStrategy":3,"./PriorityQueue/BHeapStrategy":4,"./PriorityQueue/BinaryHeapStrategy":5}],2:[function(require,module,exports){ | ||
},{"./PriorityQueue/AbstractPriorityQueue":2,"./PriorityQueue/ArrayStrategy":3,"./PriorityQueue/BHeapStrategy":4,"./PriorityQueue/BinaryHeapStrategy":5}],2:[function(_dereq_,module,exports){ | ||
var AbstractPriorityQueue; | ||
@@ -88,3 +88,3 @@ | ||
},{}],3:[function(require,module,exports){ | ||
},{}],3:[function(_dereq_,module,exports){ | ||
var ArrayStrategy, binarySearchForIndexReversed; | ||
@@ -141,3 +141,3 @@ | ||
},{}],4:[function(require,module,exports){ | ||
},{}],4:[function(_dereq_,module,exports){ | ||
var BHeapStrategy; | ||
@@ -293,3 +293,3 @@ | ||
},{}],5:[function(require,module,exports){ | ||
},{}],5:[function(_dereq_,module,exports){ | ||
var BinaryHeapStrategy; | ||
@@ -296,0 +296,0 @@ |
Sorry, the diff of this file is not supported yet
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
License Policy Violation
LicenseThis package is not allowed per your license policy. Review the package's license to ensure compliance.
Found 1 instance in 1 package
40062
20