0.1.1: Apply derequire.

adamhooper · Aug 12, 2015 · 459e752 · 459e752
1 parent d82cbb1
commit 459e752
Show file tree

Hide file tree

Showing 4 changed files with 21 additions and 18 deletions.
diff --git a/gulpfile.coffee b/gulpfile.coffee
@@ -1,5 +1,6 @@
 browserify = require('browserify')
 coffeeify = require('coffeeify')
+derequire = require('gulp-derequire')
 gulp = require('gulp')
 gutil = require('gulp-util')
 karma = require('karma').server
@@ -23,6 +24,7 @@ gulp.task 'browserify', [ 'clean' ], ->
   b.bundle()
     .on('error', (e) -> gutil.log('Browserify error', e))
     .pipe(source('sorted-set.js'))
+    .pipe(derequire())
     .pipe(gulp.dest('.'))
 
 gulp.task 'minify', [ 'browserify' ], ->

diff --git a/package.json b/package.json
@@ -1,6 +1,6 @@
 {
   "name": "js-sorted-set",
-  "version": "0.1.0",
+  "version": "0.1.1",
   "description": "Sorted set data structures",
   "main": "sorted-set.js",
   "scripts": {},
@@ -28,8 +28,9 @@
     "browserify": "~5.10.0",
     "chai": "~1.9.1",
     "coffeeify": "~0.7.0",
-    "gulp": "~3.8.7",
+    "gulp": "^3.9.0",
     "gulp-coffee": "~2.1.1",
+    "gulp-derequire": "^2.1.0",
     "gulp-mocha": "~1.0.0",
     "gulp-rename": "~1.2.0",
     "gulp-rimraf": "~0.1.0",
@@ -41,8 +42,8 @@
     "karma-mocha": "~0.1.7",
     "karma-phantomjs-launcher": "~0.1.4",
     "mocha": "~1.21.4",
-    "vinyl-source-stream": "~0.1.1",
     "sinon": "~1.10.3",
-    "sinon-chai": "~2.5.0"
+    "sinon-chai": "~2.5.0",
+    "vinyl-source-stream": "~0.1.1"
   }
 }
diff --git a/sorted-set.js b/sorted-set.js
@@ -1,15 +1,15 @@
-!function(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.SortedSet=e()}}(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(e){if("object"==typeof exports&&"undefined"!=typeof module)module.exports=e();else if("function"==typeof define&&define.amd)define([],e);else{var f;"undefined"!=typeof window?f=window:"undefined"!=typeof global?f=global:"undefined"!=typeof self&&(f=self),f.SortedSet=e()}}(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 AbstractSortedSet, ArrayStrategy, BinaryTreeStrategy, RedBlackTreeStrategy, SortedSet,
   __hasProp = {}.hasOwnProperty,
   __extends = 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; };
 
-AbstractSortedSet = require('./SortedSet/AbstractSortedSet');
+AbstractSortedSet = _dereq_('./SortedSet/AbstractSortedSet');
 
-ArrayStrategy = require('./SortedSet/ArrayStrategy');
+ArrayStrategy = _dereq_('./SortedSet/ArrayStrategy');
 
-BinaryTreeStrategy = require('./SortedSet/BinaryTreeStrategy');
+BinaryTreeStrategy = _dereq_('./SortedSet/BinaryTreeStrategy');
 
-RedBlackTreeStrategy = require('./SortedSet/RedBlackTreeStrategy');
+RedBlackTreeStrategy = _dereq_('./SortedSet/RedBlackTreeStrategy');
 
 SortedSet = (function(_super) {
   __extends(SortedSet, _super);
@@ -37,10 +37,10 @@ module.exports = SortedSet;
 
 
 
-},{"./SortedSet/AbstractSortedSet":3,"./SortedSet/ArrayStrategy":4,"./SortedSet/BinaryTreeStrategy":6,"./SortedSet/RedBlackTreeStrategy":7}],2:[function(require,module,exports){
+},{"./SortedSet/AbstractSortedSet":3,"./SortedSet/ArrayStrategy":4,"./SortedSet/BinaryTreeStrategy":6,"./SortedSet/RedBlackTreeStrategy":7}],2:[function(_dereq_,module,exports){
 var AbstractBinaryTree, BinaryTreeIterator, binaryTreeTraverse;
 
-BinaryTreeIterator = require('./BinaryTreeIterator');
+BinaryTreeIterator = _dereq_('./BinaryTreeIterator');
 
 binaryTreeTraverse = function(node, callback) {
   if (node !== null) {
@@ -110,7 +110,7 @@ module.exports = AbstractBinaryTree;
 
 
 
-},{"./BinaryTreeIterator":5}],3:[function(require,module,exports){
+},{"./BinaryTreeIterator":5}],3:[function(_dereq_,module,exports){
 var AbstractSortedSet;
 
 module.exports = AbstractSortedSet = (function() {
@@ -210,7 +210,7 @@ module.exports = AbstractSortedSet = (function() {
 
 
 
-},{}],4:[function(require,module,exports){
+},{}],4:[function(_dereq_,module,exports){
 var ArrayStrategy, Iterator, binarySearchForIndex;
 
 Iterator = (function() {
@@ -348,7 +348,7 @@ module.exports = ArrayStrategy;
 
 
 
-},{}],5:[function(require,module,exports){
+},{}],5:[function(_dereq_,module,exports){
 var BinaryTreeIterator, descendAllTheWay, moveCursor;
 
 descendAllTheWay = function(leftOrRight, node) {
@@ -495,12 +495,12 @@ module.exports = BinaryTreeIterator;
 
 
 
-},{}],6:[function(require,module,exports){
+},{}],6:[function(_dereq_,module,exports){
 var AbstractBinaryTreeStrategy, BinaryTreeStrategy, Node, binaryTreeDelete, nodeAllTheWay,
   __hasProp = {}.hasOwnProperty,
   __extends = 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; };
 
-AbstractBinaryTreeStrategy = require('./AbstractBinaryTreeStrategy');
+AbstractBinaryTreeStrategy = _dereq_('./AbstractBinaryTreeStrategy');
 
 Node = (function() {
   function Node(value) {
@@ -589,12 +589,12 @@ module.exports = BinaryTreeStrategy;
 
 
 
-},{"./AbstractBinaryTreeStrategy":2}],7:[function(require,module,exports){
+},{"./AbstractBinaryTreeStrategy":2}],7:[function(_dereq_,module,exports){
 var AbstractBinaryTreeStrategy, Node, RedBlackTreeStrategy, colorFlip, findMinNode, fixUp, insertInNode, moveRedLeft, moveRedRight, removeFromNode, removeMinNode, rotateLeft, rotateRight,
   __hasProp = {}.hasOwnProperty,
   __extends = 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; };
 
-AbstractBinaryTreeStrategy = require('./AbstractBinaryTreeStrategy');
+AbstractBinaryTreeStrategy = _dereq_('./AbstractBinaryTreeStrategy');
 
 Node = (function() {
   function Node(value) {

diff --git a/sorted-set.min.js b/sorted-set.min.js