Fixed admin bug

30 files changed, 0 insertions, 13515 deletions

diff --git a/node_modules/bson/HISTORY.md b/node_modules/bson/HISTORY.md
deleted file mode 100644
index c4da7d1..0000000
--- a/node_modules/bson/HISTORY.md
+++ /dev/null
@@ -1,158 +0,0 @@
-0.5.2 2016-07-11
------------------
-- All values encoded big-endian style for ObjectId.
-
-0.5.1 2016-07-11
------------------
-- Fixed encoding/decoding issue in ObjectId timestamp generation.
-- Removed BinaryParser dependency from the serializer/deserializer.
-
-0.5.0 2016-07-05
------------------
-- Added Decimal128 type and extended test suite to include entire bson corpus.
-
-0.4.23 2016-04-08
------------------
-- Allow for proper detection of ObjectId or objects that look like ObjectId, improving compatibility across third party libraries.
-- Remove one package from dependency due to having been pulled from NPM.
-
-0.4.22 2016-03-04
------------------
-- Fix "TypeError: data.copy is not a function" in Electron (Issue #170, https://github.com/kangas).
-- Fixed issue with undefined type on deserializing.
-
-0.4.21 2016-01-12
------------------
-- Minor optimizations to avoid non needed object creation.
-
-0.4.20 2015-10-15
------------------
-- Added bower file to repository.
-- Fixed browser pid sometimes set greater than 0xFFFF on browsers (Issue #155, https://github.com/rahatarmanahmed)
-
-0.4.19 2015-10-15
------------------
-- Remove all support for bson-ext.
-
-0.4.18 2015-10-15
------------------
-- ObjectID equality check should return boolean instead of throwing exception for invalid oid string #139
-- add option for deserializing binary into Buffer object #116
-
-0.4.17 2015-10-15
------------------
-- Validate regexp string for null bytes and throw if there is one.
-
-0.4.16 2015-10-07
------------------
-- Fixed issue with return statement in Map.js.
-
-0.4.15 2015-10-06
------------------
-- Exposed Map correctly via index.js file.
-
-0.4.14 2015-10-06
------------------
-- Exposed Map correctly via bson.js file.
-
-0.4.13 2015-10-06
------------------
-- Added ES6 Map type serialization as well as a polyfill for ES5.
-
-0.4.12 2015-09-18
------------------
-- Made ignore undefined an optional parameter.
-
-0.4.11 2015-08-06
------------------
-- Minor fix for invalid key checking.
-
-0.4.10 2015-08-06
------------------
-- NODE-38 Added new BSONRegExp type to allow direct serialization to MongoDB type.
-- Some performance improvements by in lining code.
-
-0.4.9 2015-08-06
-----------------
-- Undefined fields are omitted from serialization in objects.
-
-0.4.8 2015-07-14
-----------------
-- Fixed size validation to ensure we can deserialize from dumped files.
-
-0.4.7 2015-06-26
-----------------
-- Added ability to instruct deserializer to return raw BSON buffers for named array fields.
-- Minor deserialization optimization by moving inlined function out.
-
-0.4.6 2015-06-17
-----------------
-- Fixed serializeWithBufferAndIndex bug.
-
-0.4.5 2015-06-17
-----------------
-- Removed any references to the shared buffer to avoid non GC collectible bson instances.
-
-0.4.4 2015-06-17
-----------------
-- Fixed rethrowing of error when not RangeError.
-
-0.4.3 2015-06-17
-----------------
-- Start buffer at 64K and double as needed, meaning we keep a low memory profile until needed.
-
-0.4.2 2015-06-16
-----------------
-- More fixes for corrupt Bson
-
-0.4.1 2015-06-16
-----------------
-- More fixes for corrupt Bson
-
-0.4.0 2015-06-16
-----------------
-- New JS serializer serializing into a single buffer then copying out the new buffer. Performance is similar to current C++ parser.
-- Removed bson-ext extension dependency for now.
-
-0.3.2 2015-03-27
-----------------
-- Removed node-gyp from install script in package.json.
-
-0.3.1 2015-03-27
-----------------
-- Return pure js version on native() call if failed to initialize.
-
-0.3.0 2015-03-26
-----------------
-- Pulled out all C++ code into bson-ext and made it an optional dependency.
-
-0.2.21 2015-03-21
------------------
-- Updated Nan to 1.7.0 to support io.js and node 0.12.0
-
-0.2.19 2015-02-16
------------------
-- Updated Nan to 1.6.2 to support io.js and node 0.12.0
-
-0.2.18 2015-01-20
------------------
-- Updated Nan to 1.5.1 to support io.js
-
-0.2.16 2014-12-17
------------------
-- Made pid cycle on 0xffff to avoid weird overflows on creation of ObjectID's
-
-0.2.12 2014-08-24
------------------
-- Fixes for fortify review of c++ extension
-- toBSON correctly allows returns of non objects
-
-0.2.3 2013-10-01
-----------------
-- Drying of ObjectId code for generation of id (Issue #54, https://github.com/moredip)
-- Fixed issue where corrupt CString's could cause endless loop
-- Support for Node 0.11.X > (Issue #49, https://github.com/kkoopa)
-
-0.1.4 2012-09-25
-----------------
-- Added precompiled c++ native extensions for win32 ia32 and x64
diff --git a/node_modules/bson/LICENSE.md b/node_modules/bson/LICENSE.md
deleted file mode 100644
index 261eeb9..0000000
--- a/node_modules/bson/LICENSE.md
+++ /dev/null
@@ -1,201 +0,0 @@
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright [yyyy] [name of copyright owner]
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/node_modules/bson/README.md b/node_modules/bson/README.md
deleted file mode 100644
index 749275d..0000000
--- a/node_modules/bson/README.md
+++ /dev/null
@@ -1,95 +0,0 @@
-# BSON parser
-
-If you don't yet know what BSON actually is, read [the spec](http://bsonspec.org).
-
-This package can be used to serialize JSON documents into the BSON format or the other way around. If you want to use it within the browser, give [browserify](https://github.com/substack/node-browserify) a try (it will help you add this package to your bundle). The current build is located in the `browser_build/bson.js` file.
-
-A simple example of how to use BSON in the browser:
-
-```html
-<script src="./browser_build/bson.js"></script>
-
-<script>
-  function start() {
-    var BSON = bson().BSON
-    var Long = bson().Long
-
-    var doc = { long: Long.fromNumber(100) }
-
-    // Serialize a document
-    var data = BSON.serialize(doc, false, true, false)
-    // De serialize it again
-    var doc_2 = BSON.deserialize(data)
-  }
-</script>
-```
-
-A simple example of how to use BSON in `node.js`:
-
-```js
-var bson = require('bson')
-var BSON = new bson.BSONPure.BSON()
-var Long = bson.BSONPure.Long
-
-var doc = { long: Long.fromNumber(100) }
-
-// Serialize a document
-var data = BSON.serialize(doc, false, true, false)
-console.log('data:', data)
-
-// Deserialize the resulting Buffer
-var doc_2 = BSON.deserialize(data)
-console.log('doc_2:', doc_2)
-```
-
-## API
-
-The API consists of two simple methods to serialize/deserialize objects to/from BSON format:
-=======
-## Installation
-
-`npm install bson`
-
-## API
-
-### BSON serialization and deserialiation
-
-**`new bson.BSONPure.BSON()`** - Creates a new BSON seralizer/deserializer you can use to serialize and deserialize BSON.
-
-  * BSON.serialize(object, checkKeys, asBuffer, serializeFunctions)
-     * @param {Object} object the Javascript object to serialize.
-     * @param {Boolean} checkKeys the serializer will check if keys are valid.
-     * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
-     * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**
-     * @return {TypedArray/Array} returns a TypedArray or Array depending on what your browser supports
-
-  * BSON.deserialize(buffer, options, isArray)
-     * Options
-       * **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
-       * **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
-       * **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
-       * **promoteBuffers** {Boolean, default:false}, deserialize Binary data directly into node.js Buffer object.
-     * @param {TypedArray/Array} a TypedArray/Array containing the BSON data
-     * @param {Object} [options] additional options used for the deserialization.
-     * @param {Boolean} [isArray] ignore used for recursive parsing.
-     * @return {Object} returns the deserialized Javascript Object.
-
-### ObjectId
-
-**`bson.ObjectId.isValid(id)`** - Returns true if `id` is a valid number or hexadecimal string representing an ObjectId.
-**`bson.ObjectId.createFromHexString(hexString)`** - Returns the ObjectId the `hexString` represents.
-**`bson.ObjectId.createFromTime(time)`** - Returns an ObjectId containing the passed time.
-* `time` - A Unix timestamp (number of seconds since the epoch).
-
-**`var objectId = new bson.ObjectId(id)`** - Creates a new `ObjectId`.
-* `id` - Must either be a 24-character hex string or a 12 byte binary string.
-
-**`objectId.toJSON()`**
-**`objectId.toString()`**
-**`objectId.toHexString()`** - Returns a hexadecimal string representation of the ObjectId.
-
-**`objectId.equals(otherObjectId)`** - Returns true if the ObjectIds are the same, false otherwise.
-
-**`objectId.getTimestamp()`** - Returns a `Date` object containing the time the objectId was created for.
-
-**`objectId.getTimestamp()`** - Returns a `Date` object containing the time the objectId contains.
diff --git a/node_modules/bson/alternate_parsers/bson.js b/node_modules/bson/alternate_parsers/bson.js
deleted file mode 100644
index 555aa79..0000000
--- a/node_modules/bson/alternate_parsers/bson.js
+++ /dev/null
@@ -1,1574 +0,0 @@
-var Long = require('../lib/bson/long').Long
-  , Double = require('../lib/bson/double').Double
-  , Timestamp = require('../lib/bson/timestamp').Timestamp
-  , ObjectID = require('../lib/bson/objectid').ObjectID
-  , Symbol = require('../lib/bson/symbol').Symbol
-  , Code = require('../lib/bson/code').Code
-  , MinKey = require('../lib/bson/min_key').MinKey
-  , MaxKey = require('../lib/bson/max_key').MaxKey
-  , DBRef = require('../lib/bson/db_ref').DBRef
-  , Binary = require('../lib/bson/binary').Binary
-  , BinaryParser = require('../lib/bson/binary_parser').BinaryParser
-  , writeIEEE754 = require('../lib/bson/float_parser').writeIEEE754
-  , readIEEE754 = require('../lib/bson/float_parser').readIEEE754
-
-// To ensure that 0.4 of node works correctly
-var isDate = function isDate(d) {
-  return typeof d === 'object' && Object.prototype.toString.call(d) === '[object Date]';
-}
-
-/**
- * Create a new BSON instance
- *
- * @class
- * @return {BSON} instance of BSON Parser.
- */
-function BSON () {};
-
-/**
- * @ignore
- * @api private
- */
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
-BSON.BSON_INT64_MIN = -Math.pow(2, 63);
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-// Internal long versions
-var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
-var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
-
-/**
- * Number BSON Type
- *
- * @classconstant BSON_DATA_NUMBER
- **/
-BSON.BSON_DATA_NUMBER = 1;
-/**
- * String BSON Type
- *
- * @classconstant BSON_DATA_STRING
- **/
-BSON.BSON_DATA_STRING = 2;
-/**
- * Object BSON Type
- *
- * @classconstant BSON_DATA_OBJECT
- **/
-BSON.BSON_DATA_OBJECT = 3;
-/**
- * Array BSON Type
- *
- * @classconstant BSON_DATA_ARRAY
- **/
-BSON.BSON_DATA_ARRAY = 4;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_BINARY
- **/
-BSON.BSON_DATA_BINARY = 5;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_UNDEFINED
- **/
-BSON.BSON_DATA_UNDEFINED = 6;
-/**
- * ObjectID BSON Type
- *
- * @classconstant BSON_DATA_OID
- **/
-BSON.BSON_DATA_OID = 7;
-/**
- * Boolean BSON Type
- *
- * @classconstant BSON_DATA_BOOLEAN
- **/
-BSON.BSON_DATA_BOOLEAN = 8;
-/**
- * Date BSON Type
- *
- * @classconstant BSON_DATA_DATE
- **/
-BSON.BSON_DATA_DATE = 9;
-/**
- * null BSON Type
- *
- * @classconstant BSON_DATA_NULL
- **/
-BSON.BSON_DATA_NULL = 10;
-/**
- * RegExp BSON Type
- *
- * @classconstant BSON_DATA_REGEXP
- **/
-BSON.BSON_DATA_REGEXP = 11;
-/**
- * Code BSON Type
- *
- * @classconstant BSON_DATA_CODE
- **/
-BSON.BSON_DATA_CODE = 13;
-/**
- * Symbol BSON Type
- *
- * @classconstant BSON_DATA_SYMBOL
- **/
-BSON.BSON_DATA_SYMBOL = 14;
-/**
- * Code with Scope BSON Type
- *
- * @classconstant BSON_DATA_CODE_W_SCOPE
- **/
-BSON.BSON_DATA_CODE_W_SCOPE = 15;
-/**
- * 32 bit Integer BSON Type
- *
- * @classconstant BSON_DATA_INT
- **/
-BSON.BSON_DATA_INT = 16;
-/**
- * Timestamp BSON Type
- *
- * @classconstant BSON_DATA_TIMESTAMP
- **/
-BSON.BSON_DATA_TIMESTAMP = 17;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_LONG
- **/
-BSON.BSON_DATA_LONG = 18;
-/**
- * MinKey BSON Type
- *
- * @classconstant BSON_DATA_MIN_KEY
- **/
-BSON.BSON_DATA_MIN_KEY = 0xff;
-/**
- * MaxKey BSON Type
- *
- * @classconstant BSON_DATA_MAX_KEY
- **/
-BSON.BSON_DATA_MAX_KEY = 0x7f;
-
-/**
- * Binary Default Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
- **/
-BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
-/**
- * Binary Function Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
- **/
-BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
-/**
- * Binary Byte Array Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
- **/
-BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
-/**
- * Binary UUID Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_UUID
- **/
-BSON.BSON_BINARY_SUBTYPE_UUID = 3;
-/**
- * Binary MD5 Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_MD5
- **/
-BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
-/**
- * Binary User Defined Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
- **/
-BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
-
-/**
- * Calculate the bson size for a passed in Javascript object.
- *
- * @param {Object} object the Javascript object to calculate the BSON byte size for.
- * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
- * @return {Number} returns the number of bytes the BSON object will take up.
- * @api public
- */
-BSON.calculateObjectSize = function calculateObjectSize(object, serializeFunctions) {
-  var totalLength = (4 + 1);
-
-  if(Array.isArray(object)) {
-    for(var i = 0; i < object.length; i++) {
-      totalLength += calculateElement(i.toString(), object[i], serializeFunctions)
-    }
-  } else {
-		// If we have toBSON defined, override the current object
-		if(object.toBSON) {
-			object = object.toBSON();
-		}
-
-		// Calculate size
-    for(var key in object) {
-      totalLength += calculateElement(key, object[key], serializeFunctions)
-    }
-  }
-
-  return totalLength;
-}
-
-/**
- * @ignore
- * @api private
- */
-function calculateElement(name, value, serializeFunctions) {
-  var isBuffer = typeof Buffer !== 'undefined';
-
-  // If we have toBSON defined, override the current object
-  if(value && value.toBSON){
-    value = value.toBSON();
-  }
-
-  switch(typeof value) {
-    case 'string':
-      return 1 + (!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1 + 4 + (!isBuffer ? numberOfBytes(value) : Buffer.byteLength(value, 'utf8')) + 1;
-    case 'number':
-      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) { // 32 bit
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (4 + 1);
-        } else {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-        }
-      } else {  // 64 bit
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-      }
-    case 'undefined':
-      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
-    case 'boolean':
-      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 1);
-    case 'object':
-      if(value == null || value instanceof MinKey || value instanceof MaxKey || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
-      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (12 + 1);
-      } else if(value instanceof Date || isDate(value)) {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 4 + 1) + value.length;
-      } else if(value instanceof Long || value instanceof Double || value instanceof Timestamp
-          || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Double' || value['_bsontype'] == 'Timestamp') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
-        // Calculate size depending on the availability of a scope
-        if(value.scope != null && Object.keys(value.scope).length > 0) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
-        } else {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1;
-        }
-      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
-        // Check what kind of subtype we have
-        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1 + 4);
-        } else {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1);
-        }
-      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + ((!isBuffer ? numberOfBytes(value.value) : Buffer.byteLength(value.value, 'utf8')) + 4 + 1 + 1);
-      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
-        // Set up correct object for serialization
-        var ordered_values = {
-            '$ref': value.namespace
-          , '$id' : value.oid
-        };
-
-        // Add db reference if it exists
-        if(null != value.db) {
-          ordered_values['$db'] = value.db;
-        }
-
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + BSON.calculateObjectSize(ordered_values, serializeFunctions);
-      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
-            + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
-      } else {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + BSON.calculateObjectSize(value, serializeFunctions) + 1;
-      }
-    case 'function':
-      // WTF for 0.4.X where typeof /someregexp/ === 'function'
-      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
-          + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
-      } else {
-        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
-        } else if(serializeFunctions) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1;
-        }
-      }
-  }
-
-  return 0;
-}
-
-/**
- * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
- * @param {Number} index the index in the buffer where we wish to start serializing into.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Number} returns the new write index in the Buffer.
- * @api public
- */
-BSON.serializeWithBufferAndIndex = function serializeWithBufferAndIndex(object, checkKeys, buffer, index, serializeFunctions) {
-  // Default setting false
-  serializeFunctions = serializeFunctions == null ? false : serializeFunctions;
-  // Write end information (length of the object)
-  var size = buffer.length;
-  // Write the size of the object
-  buffer[index++] = size & 0xff;
-  buffer[index++] = (size >> 8) & 0xff;
-  buffer[index++] = (size >> 16) & 0xff;
-  buffer[index++] = (size >> 24) & 0xff;
-  return serializeObject(object, checkKeys, buffer, index, serializeFunctions) - 1;
-}
-
-/**
- * @ignore
- * @api private
- */
-var serializeObject = function(object, checkKeys, buffer, index, serializeFunctions) {
-  if(object.toBSON) {
-    if(typeof object.toBSON != 'function') throw new Error("toBSON is not a function");
-    object = object.toBSON();
-    if(object != null && typeof object != 'object') throw new Error("toBSON function did not return an object");
-  }
-
-  // Process the object
-  if(Array.isArray(object)) {
-    for(var i = 0; i < object.length; i++) {
-      index = packElement(i.toString(), object[i], checkKeys, buffer, index, serializeFunctions);
-    }
-  } else {
-		// If we have toBSON defined, override the current object
-		if(object.toBSON) {
-			object = object.toBSON();
-		}
-
-		// Serialize the object
-    for(var key in object) {
-      // Check the key and throw error if it's illegal
-      if (key != '$db' && key != '$ref' && key != '$id') {
-        // dollars and dots ok
-        BSON.checkKey(key, !checkKeys);
-      }
-
-      // Pack the element
-      index = packElement(key, object[key], checkKeys, buffer, index, serializeFunctions);
-    }
-  }
-
-  // Write zero
-  buffer[index++] = 0;
-  return index;
-}
-
-var stringToBytes = function(str) {
-  var ch, st, re = [];
-  for (var i = 0; i < str.length; i++ ) {
-    ch = str.charCodeAt(i);  // get char
-    st = [];                 // set up "stack"
-    do {
-      st.push( ch & 0xFF );  // push byte to stack
-      ch = ch >> 8;          // shift value down by 1 byte
-    }
-    while ( ch );
-    // add stack contents to result
-    // done because chars have "wrong" endianness
-    re = re.concat( st.reverse() );
-  }
-  // return an array of bytes
-  return re;
-}
-
-var numberOfBytes = function(str) {
-  var ch, st, re = 0;
-  for (var i = 0; i < str.length; i++ ) {
-    ch = str.charCodeAt(i);  // get char
-    st = [];                 // set up "stack"
-    do {
-      st.push( ch & 0xFF );  // push byte to stack
-      ch = ch >> 8;          // shift value down by 1 byte
-    }
-    while ( ch );
-    // add stack contents to result
-    // done because chars have "wrong" endianness
-    re = re + st.length;
-  }
-  // return an array of bytes
-  return re;
-}
-
-/**
- * @ignore
- * @api private
- */
-var writeToTypedArray = function(buffer, string, index) {
-  var bytes = stringToBytes(string);
-  for(var i = 0; i < bytes.length; i++) {
-    buffer[index + i] = bytes[i];
-  }
-  return bytes.length;
-}
-
-/**
- * @ignore
- * @api private
- */
-var supportsBuffer = typeof Buffer != 'undefined';
-
-/**
- * @ignore
- * @api private
- */
-var packElement = function(name, value, checkKeys, buffer, index, serializeFunctions) {
-
-  // If we have toBSON defined, override the current object
-  if(value && value.toBSON){
-        value = value.toBSON();
-  }
-
-  var startIndex = index;
-
-  switch(typeof value) {
-    case 'string':
-      // console.log("+++++++++++ index string:: " + index)
-      // Encode String type
-      buffer[index++] = BSON.BSON_DATA_STRING;
-      // Number of written bytes
-      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-      // Encode the name
-      index = index + numberOfWrittenBytes + 1;
-      buffer[index - 1] = 0;
-
-      // Calculate size
-      var size = supportsBuffer ? Buffer.byteLength(value) + 1 : numberOfBytes(value) + 1;
-      // console.log("====== key :: " + name + " size ::" + size)
-      // Write the size of the string to buffer
-      buffer[index + 3] = (size >> 24) & 0xff;
-      buffer[index + 2] = (size >> 16) & 0xff;
-      buffer[index + 1] = (size >> 8) & 0xff;
-      buffer[index] = size & 0xff;
-      // Ajust the index
-      index = index + 4;
-      // Write the string
-      supportsBuffer ? buffer.write(value, index, 'utf8') : writeToTypedArray(buffer, value, index);
-      // Update index
-      index = index + size - 1;
-      // Write zero
-      buffer[index++] = 0;
-      // Return index
-      return index;
-    case 'number':
-      // We have an integer value
-      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-        // If the value fits in 32 bits encode as int, if it fits in a double
-        // encode it as a double, otherwise long
-        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) {
-          // Set int type 32 bits or less
-          buffer[index++] = BSON.BSON_DATA_INT;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Write the int value
-          buffer[index++] = value & 0xff;
-          buffer[index++] = (value >> 8) & 0xff;
-          buffer[index++] = (value >> 16) & 0xff;
-          buffer[index++] = (value >> 24) & 0xff;
-        } else if(value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-          // Encode as double
-          buffer[index++] = BSON.BSON_DATA_NUMBER;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Write float
-          writeIEEE754(buffer, value, index, 'little', 52, 8);
-          // Ajust index
-          index = index + 8;
-        } else {
-          // Set long type
-          buffer[index++] = BSON.BSON_DATA_LONG;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          var longVal = Long.fromNumber(value);
-          var lowBits = longVal.getLowBits();
-          var highBits = longVal.getHighBits();
-          // Encode low bits
-          buffer[index++] = lowBits & 0xff;
-          buffer[index++] = (lowBits >> 8) & 0xff;
-          buffer[index++] = (lowBits >> 16) & 0xff;
-          buffer[index++] = (lowBits >> 24) & 0xff;
-          // Encode high bits
-          buffer[index++] = highBits & 0xff;
-          buffer[index++] = (highBits >> 8) & 0xff;
-          buffer[index++] = (highBits >> 16) & 0xff;
-          buffer[index++] = (highBits >> 24) & 0xff;
-        }
-      } else {
-        // Encode as double
-        buffer[index++] = BSON.BSON_DATA_NUMBER;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Write float
-        writeIEEE754(buffer, value, index, 'little', 52, 8);
-        // Ajust index
-        index = index + 8;
-      }
-
-      return index;
-    case 'undefined':
-      // Set long type
-      buffer[index++] = BSON.BSON_DATA_NULL;
-      // Number of written bytes
-      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-      // Encode the name
-      index = index + numberOfWrittenBytes + 1;
-      buffer[index - 1] = 0;
-      return index;
-    case 'boolean':
-      // Write the type
-      buffer[index++] = BSON.BSON_DATA_BOOLEAN;
-      // Number of written bytes
-      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-      // Encode the name
-      index = index + numberOfWrittenBytes + 1;
-      buffer[index - 1] = 0;
-      // Encode the boolean value
-      buffer[index++] = value ? 1 : 0;
-      return index;
-    case 'object':
-      if(value === null || value instanceof MinKey || value instanceof MaxKey
-          || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        // Write the type of either min or max key
-        if(value === null) {
-          buffer[index++] = BSON.BSON_DATA_NULL;
-        } else if(value instanceof MinKey) {
-          buffer[index++] = BSON.BSON_DATA_MIN_KEY;
-        } else {
-          buffer[index++] = BSON.BSON_DATA_MAX_KEY;
-        }
-
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        return index;
-      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
-        // console.log("+++++++++++ index OBJECTID:: " + index)
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_OID;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write objectid
-        supportsBuffer ? buffer.write(value.id, index, 'binary') : writeToTypedArray(buffer, value.id, index);
-        // Ajust index
-        index = index + 12;
-        return index;
-      } else if(value instanceof Date || isDate(value)) {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_DATE;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write the date
-        var dateInMilis = Long.fromNumber(value.getTime());
-        var lowBits = dateInMilis.getLowBits();
-        var highBits = dateInMilis.getHighBits();
-        // Encode low bits
-        buffer[index++] = lowBits & 0xff;
-        buffer[index++] = (lowBits >> 8) & 0xff;
-        buffer[index++] = (lowBits >> 16) & 0xff;
-        buffer[index++] = (lowBits >> 24) & 0xff;
-        // Encode high bits
-        buffer[index++] = highBits & 0xff;
-        buffer[index++] = (highBits >> 8) & 0xff;
-        buffer[index++] = (highBits >> 16) & 0xff;
-        buffer[index++] = (highBits >> 24) & 0xff;
-        return index;
-      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_BINARY;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Get size of the buffer (current write point)
-        var size = value.length;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write the default subtype
-        buffer[index++] = BSON.BSON_BINARY_SUBTYPE_DEFAULT;
-        // Copy the content form the binary field to the buffer
-        value.copy(buffer, index, 0, size);
-        // Adjust the index
-        index = index + size;
-        return index;
-      } else if(value instanceof Long || value instanceof Timestamp || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
-        // Write the type
-        buffer[index++] = value instanceof Long || value['_bsontype'] == 'Long' ? BSON.BSON_DATA_LONG : BSON.BSON_DATA_TIMESTAMP;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Write the date
-        var lowBits = value.getLowBits();
-        var highBits = value.getHighBits();
-        // Encode low bits
-        buffer[index++] = lowBits & 0xff;
-        buffer[index++] = (lowBits >> 8) & 0xff;
-        buffer[index++] = (lowBits >> 16) & 0xff;
-        buffer[index++] = (lowBits >> 24) & 0xff;
-        // Encode high bits
-        buffer[index++] = highBits & 0xff;
-        buffer[index++] = (highBits >> 8) & 0xff;
-        buffer[index++] = (highBits >> 16) & 0xff;
-        buffer[index++] = (highBits >> 24) & 0xff;
-        return index;
-      } else if(value instanceof Double || value['_bsontype'] == 'Double') {
-        // Encode as double
-        buffer[index++] = BSON.BSON_DATA_NUMBER;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Write float
-        writeIEEE754(buffer, value, index, 'little', 52, 8);
-        // Ajust index
-        index = index + 8;
-        return index;
-      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
-        if(value.scope != null && Object.keys(value.scope).length > 0) {
-          // Write the type
-          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Calculate the scope size
-          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
-          // Function string
-          var functionString = value.code.toString();
-          // Function Size
-          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-
-          // Calculate full size of the object
-          var totalSize = 4 + codeSize + scopeSize + 4;
-
-          // Write the total size of the object
-          buffer[index++] = totalSize & 0xff;
-          buffer[index++] = (totalSize >> 8) & 0xff;
-          buffer[index++] = (totalSize >> 16) & 0xff;
-          buffer[index++] = (totalSize >> 24) & 0xff;
-
-          // Write the size of the string to buffer
-          buffer[index++] = codeSize & 0xff;
-          buffer[index++] = (codeSize >> 8) & 0xff;
-          buffer[index++] = (codeSize >> 16) & 0xff;
-          buffer[index++] = (codeSize >> 24) & 0xff;
-
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + codeSize - 1;
-          // Write zero
-          buffer[index++] = 0;
-          // Serialize the scope object
-          var scopeObjectBuffer = supportsBuffer ? new Buffer(scopeSize) : new Uint8Array(new ArrayBuffer(scopeSize));
-          // Execute the serialization into a seperate buffer
-          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
-
-          // Adjusted scope Size (removing the header)
-          var scopeDocSize = scopeSize;
-          // Write scope object size
-          buffer[index++] = scopeDocSize & 0xff;
-          buffer[index++] = (scopeDocSize >> 8) & 0xff;
-          buffer[index++] = (scopeDocSize >> 16) & 0xff;
-          buffer[index++] = (scopeDocSize >> 24) & 0xff;
-
-          // Write the scopeObject into the buffer
-          supportsBuffer ? scopeObjectBuffer.copy(buffer, index, 0, scopeSize) : buffer.set(scopeObjectBuffer, index);
-          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
-          index = index + scopeDocSize - 5;
-          // Write trailing zero
-          buffer[index++] = 0;
-          return index
-        } else {
-          buffer[index++] = BSON.BSON_DATA_CODE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Function string
-          var functionString = value.code.toString();
-          // Function Size
-          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-          // Write the size of the string to buffer
-          buffer[index++] = size & 0xff;
-          buffer[index++] = (size >> 8) & 0xff;
-          buffer[index++] = (size >> 16) & 0xff;
-          buffer[index++] = (size >> 24) & 0xff;
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + size - 1;
-          // Write zero
-          buffer[index++] = 0;
-          return index;
-        }
-      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_BINARY;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Extract the buffer
-        var data = value.value(true);
-        // Calculate size
-        var size = value.position;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write the subtype to the buffer
-        buffer[index++] = value.sub_type;
-
-        // If we have binary type 2 the 4 first bytes are the size
-        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
-          buffer[index++] = size & 0xff;
-          buffer[index++] = (size >> 8) & 0xff;
-          buffer[index++] = (size >> 16) & 0xff;
-          buffer[index++] = (size >> 24) & 0xff;
-        }
-
-        // Write the data to the object
-        supportsBuffer ? data.copy(buffer, index, 0, value.position) : buffer.set(data, index);
-        // Ajust index
-        index = index + value.position;
-        return index;
-      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_SYMBOL;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Calculate size
-        var size = supportsBuffer ? Buffer.byteLength(value.value) + 1 : numberOfBytes(value.value) + 1;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write the string
-        buffer.write(value.value, index, 'utf8');
-        // Update index
-        index = index + size - 1;
-        // Write zero
-        buffer[index++] = 0x00;
-        return index;
-      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_OBJECT;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Set up correct object for serialization
-        var ordered_values = {
-            '$ref': value.namespace
-          , '$id' : value.oid
-        };
-
-        // Add db reference if it exists
-        if(null != value.db) {
-          ordered_values['$db'] = value.db;
-        }
-
-        // Message size
-        var size = BSON.calculateObjectSize(ordered_values, serializeFunctions);
-        // Serialize the object
-        var endIndex = BSON.serializeWithBufferAndIndex(ordered_values, checkKeys, buffer, index, serializeFunctions);
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write zero for object
-        buffer[endIndex++] = 0x00;
-        // Return the end index
-        return endIndex;
-      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_REGEXP;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write the regular expression string
-        supportsBuffer ? buffer.write(value.source, index, 'utf8') : writeToTypedArray(buffer, value.source, index);
-        // Adjust the index
-        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
-        // Write zero
-        buffer[index++] = 0x00;
-        // Write the parameters
-        if(value.global) buffer[index++] = 0x73; // s
-        if(value.ignoreCase) buffer[index++] = 0x69; // i
-        if(value.multiline) buffer[index++] = 0x6d; // m
-        // Add ending zero
-        buffer[index++] = 0x00;
-        return index;
-      } else {
-        // Write the type
-        buffer[index++] = Array.isArray(value) ? BSON.BSON_DATA_ARRAY : BSON.BSON_DATA_OBJECT;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Adjust the index
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-	      var endIndex = serializeObject(value, checkKeys, buffer, index + 4, serializeFunctions);
-        // Write size
-        var size = endIndex - index;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        return endIndex;
-      }
-    case 'function':
-      // WTF for 0.4.X where typeof /someregexp/ === 'function'
-      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_REGEXP;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write the regular expression string
-        buffer.write(value.source, index, 'utf8');
-        // Adjust the index
-        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
-        // Write zero
-        buffer[index++] = 0x00;
-        // Write the parameters
-        if(value.global) buffer[index++] = 0x73; // s
-        if(value.ignoreCase) buffer[index++] = 0x69; // i
-        if(value.multiline) buffer[index++] = 0x6d; // m
-        // Add ending zero
-        buffer[index++] = 0x00;
-        return index;
-      } else {
-        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
-          // Write the type
-          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Calculate the scope size
-          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
-          // Function string
-          var functionString = value.toString();
-          // Function Size
-          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-
-          // Calculate full size of the object
-          var totalSize = 4 + codeSize + scopeSize;
-
-          // Write the total size of the object
-          buffer[index++] = totalSize & 0xff;
-          buffer[index++] = (totalSize >> 8) & 0xff;
-          buffer[index++] = (totalSize >> 16) & 0xff;
-          buffer[index++] = (totalSize >> 24) & 0xff;
-
-          // Write the size of the string to buffer
-          buffer[index++] = codeSize & 0xff;
-          buffer[index++] = (codeSize >> 8) & 0xff;
-          buffer[index++] = (codeSize >> 16) & 0xff;
-          buffer[index++] = (codeSize >> 24) & 0xff;
-
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + codeSize - 1;
-          // Write zero
-          buffer[index++] = 0;
-          // Serialize the scope object
-          var scopeObjectBuffer = new Buffer(scopeSize);
-          // Execute the serialization into a seperate buffer
-          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
-
-          // Adjusted scope Size (removing the header)
-          var scopeDocSize = scopeSize - 4;
-          // Write scope object size
-          buffer[index++] = scopeDocSize & 0xff;
-          buffer[index++] = (scopeDocSize >> 8) & 0xff;
-          buffer[index++] = (scopeDocSize >> 16) & 0xff;
-          buffer[index++] = (scopeDocSize >> 24) & 0xff;
-
-          // Write the scopeObject into the buffer
-          scopeObjectBuffer.copy(buffer, index, 0, scopeSize);
-
-          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
-          index = index + scopeDocSize - 5;
-          // Write trailing zero
-          buffer[index++] = 0;
-          return index
-        } else if(serializeFunctions) {
-          buffer[index++] = BSON.BSON_DATA_CODE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Function string
-          var functionString = value.toString();
-          // Function Size
-          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-          // Write the size of the string to buffer
-          buffer[index++] = size & 0xff;
-          buffer[index++] = (size >> 8) & 0xff;
-          buffer[index++] = (size >> 16) & 0xff;
-          buffer[index++] = (size >> 24) & 0xff;
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + size - 1;
-          // Write zero
-          buffer[index++] = 0;
-          return index;
-        }
-      }
-  }
-
-  // If no value to serialize
-  return index;
-}
-
-/**
- * Serialize a Javascript object.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Buffer} returns the Buffer object containing the serialized object.
- * @api public
- */
-BSON.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
-  // Throw error if we are trying serialize an illegal type
-  if(object == null || typeof object != 'object' || Array.isArray(object))
-    throw new Error("Only javascript objects supported");
-
-  // Emoty target buffer
-  var buffer = null;
-  // Calculate the size of the object
-  var size = BSON.calculateObjectSize(object, serializeFunctions);
-  // Fetch the best available type for storing the binary data
-  if(buffer = typeof Buffer != 'undefined') {
-    buffer = new Buffer(size);
-    asBuffer = true;
-  } else if(typeof Uint8Array != 'undefined') {
-    buffer = new Uint8Array(new ArrayBuffer(size));
-  } else {
-    buffer = new Array(size);
-  }
-
-  // If asBuffer is false use typed arrays
-  BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, 0, serializeFunctions);
-  // console.log("++++++++++++++++++++++++++++++++++++ OLDJS :: " + buffer.length)
-  // console.log(buffer.toString('hex'))
-  // console.log(buffer.toString('ascii'))
-  return buffer;
-}
-
-/**
- * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
- *
- * @ignore
- * @api private
- */
-var functionCache = BSON.functionCache = {};
-
-/**
- * Crc state variables shared by function
- *
- * @ignore
- * @api private
- */
-var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
-
-/**
- * CRC32 hash method, Fast and enough versitility for our usage
- *
- * @ignore
- * @api private
- */
-var crc32 =  function(string, start, end) {
-  var crc = 0
-  var x = 0;
-  var y = 0;
-  crc = crc ^ (-1);
-
-  for(var i = start, iTop = end; i < iTop;i++) {
-  	y = (crc ^ string[i]) & 0xFF;
-    x = table[y];
-  	crc = (crc >>> 8) ^ x;
-  }
-
-  return crc ^ (-1);
-}
-
-/**
- * Deserialize stream data as BSON documents.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *  - **promoteLongs** {Boolean, default:true}, when deserializing a Long will fit it into a Number if it's smaller than 53 bits
- *
- * @param {Buffer} data the buffer containing the serialized set of BSON documents.
- * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
- * @param {Number} numberOfDocuments number of documents to deserialize.
- * @param {Array} documents an array where to store the deserialized documents.
- * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
- * @api public
- */
-BSON.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
-  // if(numberOfDocuments !== documents.length) throw new Error("Number of expected results back is less than the number of documents");
-  options = options != null ? options : {};
-  var index = startIndex;
-  // Loop over all documents
-  for(var i = 0; i < numberOfDocuments; i++) {
-    // Find size of the document
-    var size = data[index] | data[index + 1] << 8 | data[index + 2] << 16 | data[index + 3] << 24;
-    // Update options with index
-    options['index'] = index;
-    // Parse the document at this point
-    documents[docStartIndex + i] = BSON.deserialize(data, options);
-    // Adjust index by the document size
-    index = index + size;
-  }
-
-  // Return object containing end index of parsing and list of documents
-  return index;
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEvalWithHash = function(functionCache, hash, functionString, object) {
-  // Contains the value we are going to set
-  var value = null;
-
-  // Check for cache hit, eval if missing and return cached function
-  if(functionCache[hash] == null) {
-    eval("value = " + functionString);
-    functionCache[hash] = value;
-  }
-  // Set the object
-  return functionCache[hash].bind(object);
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEval = function(functionString) {
-  // Contains the value we are going to set
-  var value = null;
-  // Eval the function
-  eval("value = " + functionString);
-  return value;
-}
-
-/**
- * Convert Uint8Array to String
- *
- * @ignore
- * @api private
- */
-var convertUint8ArrayToUtf8String = function(byteArray, startIndex, endIndex) {
-  return BinaryParser.decode_utf8(convertArraytoUtf8BinaryString(byteArray, startIndex, endIndex));
-}
-
-var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
-  var result = "";
-  for(var i = startIndex; i < endIndex; i++) {
-    result = result + String.fromCharCode(byteArray[i]);
-  }
-
-  return result;
-};
-
-/**
- * Deserialize data as BSON.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *  - **promoteLongs** {Boolean, default:true}, when deserializing a Long will fit it into a Number if it's smaller than 53 bits
- *
- * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @param {Boolean} [isArray] ignore used for recursive parsing.
- * @return {Object} returns the deserialized Javascript Object.
- * @api public
- */
-BSON.deserialize = function(buffer, options, isArray) {
-  // Options
-  options = options == null ? {} : options;
-  var evalFunctions = options['evalFunctions'] == null ? false : options['evalFunctions'];
-  var cacheFunctions = options['cacheFunctions'] == null ? false : options['cacheFunctions'];
-  var cacheFunctionsCrc32 = options['cacheFunctionsCrc32'] == null ? false : options['cacheFunctionsCrc32'];
-  var promoteLongs = options['promoteLongs'] == null ? true : options['promoteLongs'];
-
-  // Validate that we have at least 4 bytes of buffer
-  if(buffer.length < 5) throw new Error("corrupt bson message < 5 bytes long");
-
-  // Set up index
-  var index = typeof options['index'] == 'number' ? options['index'] : 0;
-  // Reads in a C style string
-  var readCStyleString = function() {
-    // Get the start search index
-    var i = index;
-    // Locate the end of the c string
-    while(buffer[i] !== 0x00 && i < buffer.length) {
-      i++
-    }
-    // If are at the end of the buffer there is a problem with the document
-    if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-    // Grab utf8 encoded string
-    var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, i) : convertUint8ArrayToUtf8String(buffer, index, i);
-    // Update index position
-    index = i + 1;
-    // Return string
-    return string;
-  }
-
-  // Create holding object
-  var object = isArray ? [] : {};
-
-  // Read the document size
-  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-  // Ensure buffer is valid size
-  if(size < 5 || size > buffer.length) throw new Error("corrupt bson message");
-
-  // While we have more left data left keep parsing
-  while(true) {
-    // Read the type
-    var elementType = buffer[index++];
-    // If we get a zero it's the last byte, exit
-    if(elementType == 0) break;
-    // Read the name of the field
-    var name = readCStyleString();
-    // Switch on the type
-    switch(elementType) {
-      case BSON.BSON_DATA_OID:
-        var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('binary', index, index + 12) : convertArraytoUtf8BinaryString(buffer, index, index + 12);
-        // Decode the oid
-        object[name] = new ObjectID(string);
-        // Update index
-        index = index + 12;
-        break;
-      case BSON.BSON_DATA_STRING:
-        // Read the content of the field
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Add string to object
-        object[name] = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
-        // Update parse index position
-        index = index + stringSize;
-        break;
-      case BSON.BSON_DATA_INT:
-        // Decode the 32bit value
-        object[name] = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        break;
-      case BSON.BSON_DATA_NUMBER:
-        // Decode the double value
-        object[name] = readIEEE754(buffer, index, 'little', 52, 8);
-        // Update the index
-        index = index + 8;
-        break;
-      case BSON.BSON_DATA_DATE:
-        // Unpack the low and high bits
-        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Set date object
-        object[name] = new Date(new Long(lowBits, highBits).toNumber());
-        break;
-      case BSON.BSON_DATA_BOOLEAN:
-        // Parse the boolean value
-        object[name] = buffer[index++] == 1;
-        break;
-      case BSON.BSON_DATA_UNDEFINED:
-      case BSON.BSON_DATA_NULL:
-        // Parse the boolean value
-        object[name] = null;
-        break;
-      case BSON.BSON_DATA_BINARY:
-        // Decode the size of the binary blob
-        var binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Decode the subtype
-        var subType = buffer[index++];
-        // Decode as raw Buffer object if options specifies it
-        if(buffer['slice'] != null) {
-          // If we have subtype 2 skip the 4 bytes for the size
-          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
-            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-          }
-          // Slice the data
-          object[name] = new Binary(buffer.slice(index, index + binarySize), subType);
-        } else {
-          var _buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(binarySize)) : new Array(binarySize);
-          // If we have subtype 2 skip the 4 bytes for the size
-          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
-            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-          }
-          // Copy the data
-          for(var i = 0; i < binarySize; i++) {
-            _buffer[i] = buffer[index + i];
-          }
-          // Create the binary object
-          object[name] = new Binary(_buffer, subType);
-        }
-        // Update the index
-        index = index + binarySize;
-        break;
-      case BSON.BSON_DATA_ARRAY:
-        options['index'] = index;
-        // Decode the size of the array document
-        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-        // Set the array to the object
-        object[name] = BSON.deserialize(buffer, options, true);
-        // Adjust the index
-        index = index + objectSize;
-        break;
-      case BSON.BSON_DATA_OBJECT:
-        options['index'] = index;
-        // Decode the size of the object document
-        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-        // Set the array to the object
-        object[name] = BSON.deserialize(buffer, options, false);
-        // Adjust the index
-        index = index + objectSize;
-        break;
-      case BSON.BSON_DATA_REGEXP:
-        // Create the regexp
-        var source = readCStyleString();
-        var regExpOptions = readCStyleString();
-        // For each option add the corresponding one for javascript
-        var optionsArray = new Array(regExpOptions.length);
-
-        // Parse options
-        for(var i = 0; i < regExpOptions.length; i++) {
-          switch(regExpOptions[i]) {
-            case 'm':
-              optionsArray[i] = 'm';
-              break;
-            case 's':
-              optionsArray[i] = 'g';
-              break;
-            case 'i':
-              optionsArray[i] = 'i';
-              break;
-          }
-        }
-
-        object[name] = new RegExp(source, optionsArray.join(''));
-        break;
-      case BSON.BSON_DATA_LONG:
-        // Unpack the low and high bits
-        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Create long object
-        var long = new Long(lowBits, highBits);
-        // Promote the long if possible
-        if(promoteLongs) {
-          object[name] = long.lessThanOrEqual(JS_INT_MAX_LONG) && long.greaterThanOrEqual(JS_INT_MIN_LONG) ? long.toNumber() : long;
-        } else {
-          object[name] = long;
-        }
-        break;
-      case BSON.BSON_DATA_SYMBOL:
-        // Read the content of the field
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Add string to object
-        object[name] = new Symbol(buffer.toString('utf8', index, index + stringSize - 1));
-        // Update parse index position
-        index = index + stringSize;
-        break;
-      case BSON.BSON_DATA_TIMESTAMP:
-        // Unpack the low and high bits
-        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Set the object
-        object[name] = new Timestamp(lowBits, highBits);
-        break;
-      case BSON.BSON_DATA_MIN_KEY:
-        // Parse the object
-        object[name] = new MinKey();
-        break;
-      case BSON.BSON_DATA_MAX_KEY:
-        // Parse the object
-        object[name] = new MaxKey();
-        break;
-      case BSON.BSON_DATA_CODE:
-        // Read the content of the field
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Function string
-        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
-
-        // If we are evaluating the functions
-        if(evalFunctions) {
-          // Contains the value we are going to set
-          var value = null;
-          // If we have cache enabled let's look for the md5 of the function in the cache
-          if(cacheFunctions) {
-            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
-            // Got to do this to avoid V8 deoptimizing the call due to finding eval
-            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
-          } else {
-            // Set directly
-            object[name] = isolateEval(functionString);
-          }
-        } else {
-          object[name]  = new Code(functionString, {});
-        }
-
-        // Update parse index position
-        index = index + stringSize;
-        break;
-      case BSON.BSON_DATA_CODE_W_SCOPE:
-        // Read the content of the field
-        var totalSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Javascript function
-        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
-        // Update parse index position
-        index = index + stringSize;
-        // Parse the element
-        options['index'] = index;
-        // Decode the size of the object document
-        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-        // Decode the scope object
-        var scopeObject = BSON.deserialize(buffer, options, false);
-        // Adjust the index
-        index = index + objectSize;
-
-        // If we are evaluating the functions
-        if(evalFunctions) {
-          // Contains the value we are going to set
-          var value = null;
-          // If we have cache enabled let's look for the md5 of the function in the cache
-          if(cacheFunctions) {
-            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
-            // Got to do this to avoid V8 deoptimizing the call due to finding eval
-            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
-          } else {
-            // Set directly
-            object[name] = isolateEval(functionString);
-          }
-
-          // Set the scope on the object
-          object[name].scope = scopeObject;
-        } else {
-          object[name]  = new Code(functionString, scopeObject);
-        }
-
-        // Add string to object
-        break;
-    }
-  }
-
-  // Check if we have a db ref object
-  if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
-
-  // Return the final objects
-  return object;
-}
-
-/**
- * Check if key name is valid.
- *
- * @ignore
- * @api private
- */
-BSON.checkKey = function checkKey (key, dollarsAndDotsOk) {
-  if (!key.length) return;
-  // Check if we have a legal key for the object
-  if (!!~key.indexOf("\x00")) {
-    // The BSON spec doesn't allow keys with null bytes because keys are
-    // null-terminated.
-    throw Error("key " + key + " must not contain null bytes");
-  }
-  if (!dollarsAndDotsOk) {
-    if('$' == key[0]) {
-      throw Error("key " + key + " must not start with '$'");
-    } else if (!!~key.indexOf('.')) {
-      throw Error("key " + key + " must not contain '.'");
-    }
-  }
-};
-
-/**
- * Deserialize data as BSON.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *
- * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @param {Boolean} [isArray] ignore used for recursive parsing.
- * @return {Object} returns the deserialized Javascript Object.
- * @api public
- */
-BSON.prototype.deserialize = function(data, options) {
-  return BSON.deserialize(data, options);
-}
-
-/**
- * Deserialize stream data as BSON documents.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *
- * @param {Buffer} data the buffer containing the serialized set of BSON documents.
- * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
- * @param {Number} numberOfDocuments number of documents to deserialize.
- * @param {Array} documents an array where to store the deserialized documents.
- * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
- * @api public
- */
-BSON.prototype.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
-  return BSON.deserializeStream(data, startIndex, numberOfDocuments, documents, docStartIndex, options);
-}
-
-/**
- * Serialize a Javascript object.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Buffer} returns the Buffer object containing the serialized object.
- * @api public
- */
-BSON.prototype.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
-  return BSON.serialize(object, checkKeys, asBuffer, serializeFunctions);
-}
-
-/**
- * Calculate the bson size for a passed in Javascript object.
- *
- * @param {Object} object the Javascript object to calculate the BSON byte size for.
- * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
- * @return {Number} returns the number of bytes the BSON object will take up.
- * @api public
- */
-BSON.prototype.calculateObjectSize = function(object, serializeFunctions) {
-  return BSON.calculateObjectSize(object, serializeFunctions);
-}
-
-/**
- * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
- * @param {Number} index the index in the buffer where we wish to start serializing into.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Number} returns the new write index in the Buffer.
- * @api public
- */
-BSON.prototype.serializeWithBufferAndIndex = function(object, checkKeys, buffer, startIndex, serializeFunctions) {
-  return BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, startIndex, serializeFunctions);
-}
-
-/**
- * @ignore
- * @api private
- */
-module.exports = BSON;
-module.exports.Code = Code;
-module.exports.Symbol = Symbol;
-module.exports.BSON = BSON;
-module.exports.DBRef = DBRef;
-module.exports.Binary = Binary;
-module.exports.ObjectID = ObjectID;
-module.exports.Long = Long;
-module.exports.Timestamp = Timestamp;
-module.exports.Double = Double;
-module.exports.MinKey = MinKey;
-module.exports.MaxKey = MaxKey;
diff --git a/node_modules/bson/alternate_parsers/faster_bson.js b/node_modules/bson/alternate_parsers/faster_bson.js
deleted file mode 100644
index f19e44f..0000000
--- a/node_modules/bson/alternate_parsers/faster_bson.js
+++ /dev/null
@@ -1,429 +0,0 @@
-/// reduced to ~ 410 LOCs (parser only 300 vs. 1400+) with (some, needed) BSON classes "inlined".
-/// Compare ~ 4,300 (22KB vs. 157KB) in browser build at: https://github.com/mongodb/js-bson/blob/master/browser_build/bson.js
-
-module.exports.calculateObjectSize = calculateObjectSize;
-
-function calculateObjectSize(object) {
-    var totalLength = (4 + 1);      /// handles the obj.length prefix + terminating '0' ?!
-    for(var key in object) {        /// looks like it handles arrays under the same for...in loop!?
-      totalLength += calculateElement(key, object[key])
-    }
-    return totalLength;
-}
-
-function calculateElement(name, value) {
-    var len = 1;                                /// always starting with 1 for the data type byte!
-    if (name) len += Buffer.byteLength(name, 'utf8') + 1;   /// cstring: name + '0' termination
-
-    if (value === undefined || value === null) return len;  /// just the type byte plus name cstring
-    switch( value.constructor ) {      /// removed all checks 'isBuffer' if Node.js Buffer class is present!?
-
-        case ObjectID:          /// we want these sorted from most common case to least common/deprecated;
-            return len + 12;
-        case String:
-            return len + 4 + Buffer.byteLength(value, 'utf8') +1; ///
-        case Number:
-            if (Math.floor(value) === value) {  /// case: integer; pos.# more common, '&&' stops if 1st fails!
-                if ( value <= 2147483647 && value >= -2147483647 ) // 32 bit
-                    return len + 4;
-                else return len + 8;    /// covers Long-ish JS integers as Longs!
-            } else return len + 8;      /// 8+1 --- covers Double & std. float
-        case Boolean:
-            return len + 1;
-
-        case Array:
-        case Object:
-            return len + calculateObjectSize(value);
-
-        case Buffer:   ///  replaces the entire Binary class!
-            return len + 4 + value.length + 1;
-
-        case Regex:  /// these are handled as strings by serializeFast() later, hence 'gim' opts = 3 + 1 chars
-            return len + Buffer.byteLength(value.source, 'utf8') + 1
-                + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) +1;
-        case Date:
-        case Long:
-        case Timestamp:
-        case Double:
-            return len + 8;
-
-        case MinKey:
-        case MaxKey:
-            return len;     /// these two return the type byte and name cstring only!
-    }
-    return 0;
-}
-
-module.exports.serializeFast = serializeFast;
-module.exports.serialize = function(object, checkKeys, asBuffer, serializeFunctions, index) {
-  var buffer = new Buffer(calculateObjectSize(object));
-  return serializeFast(object, checkKeys, buffer, 0);
-}
-
-function serializeFast(object, checkKeys, buffer, i) {   /// set checkKeys = false in query(..., options object to save performance IFF you're certain your keys are safe/system-set!
-    var size = buffer.length;
-    buffer[i++] = size & 0xff; buffer[i++] = (size >> 8) & 0xff;   /// these get overwritten later!
-    buffer[i++] = (size >> 16) & 0xff; buffer[i++] = (size >> 24) & 0xff;
-
-    if (object.constructor === Array) {     /// any need to checkKeys here?!? since we're doing for rather than for...in, should be safe from extra (non-numeric) keys added to the array?!
-        for(var j = 0; j < object.length; j++) {
-            i = packElement(j.toString(), object[j], checkKeys, buffer, i);
-        }
-    } else {   /// checkKeys is needed if any suspicion of end-user key tampering/"injection" (a la SQL)
-        for(var key in object) {    /// mostly there should never be direct access to them!?
-            if (checkKeys && (key.indexOf('\x00') >= 0 || key === '$where') ) {  /// = "no script"?!; could add back key.indexOf('$') or maybe check for 'eval'?!
-/// took out: || key.indexOf('.') >= 0...  Don't we allow dot notation queries?!
-                console.log('checkKeys error: ');
-                return new Error('Illegal object key!');
-            }
-            i = packElement(key, object[key], checkKeys, buffer, i);  /// checkKeys pass needed for recursion!
-        }
-    }
-    buffer[i++] = 0;   /// write terminating zero; !we do NOT -1 the index increase here as original does!
-    return i;
-}
-
-function packElement(name, value, checkKeys, buffer, i) {    /// serializeFunctions removed! checkKeys needed for Array & Object cases pass through (calling serializeFast recursively!)
-    if (value === undefined || value === null){
-        buffer[i++] = 10;                                       /// = BSON.BSON_DATA_NULL;
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;    /// buffer.write(...) returns bytesWritten!
-        return i;
-    }
-    switch(value.constructor) {
-
-    case ObjectID:
-        buffer[i++] = 7;   /// = BSON.BSON_DATA_OID;
-        i += buffer.write(name, i, 'utf8');     buffer[i++] = 0;
-///     i += buffer.write(value.id, i, 'binary');  ///  OLD: writes a String to a Buffer; 'binary' deprecated!!
-        value.id.copy(buffer, i);  /// NEW ObjectID version has this.id = Buffer at the ready!
-        return i += 12;
-
-    case String:
-        buffer[i++] = 2;    ///  = BSON.BSON_DATA_STRING;
-        i += buffer.write(name, i, 'utf8');     buffer[i++] = 0;
-
-        var size = Buffer.byteLength(value) + 1;  /// includes the terminating '0'!?
-        buffer[i++] = size & 0xff; buffer[i++] = (size >> 8) & 0xff;
-        buffer[i++] = (size >> 16) & 0xff; buffer[i++] = (size >> 24) & 0xff;
-
-        i += buffer.write(value, i, 'utf8');    buffer[i++] = 0;
-        return i;
-
-    case Number:
-        if ( ~~(value) === value) {     /// double-Tilde is equiv. to Math.floor(value)
-            if ( value <= 2147483647 && value >= -2147483647){ /// = BSON.BSON_INT32_MAX / MIN asf.
-                buffer[i++] = 16;   /// = BSON.BSON_DATA_INT;
-                i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-                buffer[i++] = value & 0xff; buffer[i++] = (value >> 8) & 0xff;
-                buffer[i++] = (value >> 16) & 0xff; buffer[i++] = (value >> 24) & 0xff;
-
-// Else large-ish JS int!? to Long!?
-            } else {  /// if (value <= BSON.JS_INT_MAX && value >= BSON.JS_INT_MIN){ /// 9007199254740992 asf.
-                buffer[i++] = 18;   /// = BSON.BSON_DATA_LONG;
-                i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-                var lowBits = ( value % 4294967296 ) | 0, highBits = ( value / 4294967296 ) | 0;
-
-                buffer[i++] = lowBits & 0xff;           buffer[i++] = (lowBits >> 8) & 0xff;
-                buffer[i++] = (lowBits >> 16) & 0xff;   buffer[i++] = (lowBits >> 24) & 0xff;
-                buffer[i++] = highBits & 0xff;          buffer[i++] = (highBits >> 8) & 0xff;
-                buffer[i++] = (highBits >> 16) & 0xff;  buffer[i++] = (highBits >> 24) & 0xff;
-            }
-        } else {    /// we have a float / Double
-            buffer[i++] = 1;    /// = BSON.BSON_DATA_NUMBER;
-            i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-/// OLD:    writeIEEE754(buffer, value, i, 'little', 52, 8);
-            buffer.writeDoubleLE(value, i);     i += 8;
-        }
-        return i;
-
-    case Boolean:
-        buffer[i++] = 8;    /// = BSON.BSON_DATA_BOOLEAN;
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-        buffer[i++] = value ? 1 : 0;
-        return i;
-
-    case Array:
-    case Object:
-        buffer[i++] = value.constructor === Array ? 4 : 3; /// = BSON.BSON_DATA_ARRAY / _OBJECT;
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-
-	    var endIndex = serializeFast(value, checkKeys, buffer, i); /// + 4); no longer needed b/c serializeFast writes a temp 4 bytes for length
-        var size = endIndex - i;
-        buffer[i++] = size & 0xff;          buffer[i++] = (size >> 8) & 0xff;
-        buffer[i++] = (size >> 16) & 0xff;  buffer[i++] = (size >> 24) & 0xff;
-        return endIndex;
-
-    /// case Binary:        /// is basically identical unless special/deprecated options!
-    case Buffer:            /// solves ALL of our Binary needs without the BSON.Binary class!?
-        buffer[i++] = 5;    /// = BSON.BSON_DATA_BINARY;
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-        var size = value.length;
-        buffer[i++] = size & 0xff;          buffer[i++] = (size >> 8) & 0xff;
-        buffer[i++] = (size >> 16) & 0xff;  buffer[i++] = (size >> 24) & 0xff;
-
-        buffer[i++] = 0;        /// write BSON.BSON_BINARY_SUBTYPE_DEFAULT;
-        value.copy(buffer, i);  ///, 0, size); << defaults to sourceStart=0, sourceEnd=sourceBuffer.length);
-        i += size;
-        return i;
-
-    case RegExp:
-        buffer[i++] = 11;   /// = BSON.BSON_DATA_REGEXP;
-        i += buffer.write(name, i, 'utf8');         buffer[i++] = 0;
-        i += buffer.write(value.source, i, 'utf8'); buffer[i++] = 0x00;
-
-        if (value.global) buffer[i++] = 0x73;        // s = 'g' for JS Regex!
-        if (value.ignoreCase) buffer[i++] = 0x69;    // i
-        if (value.multiline) buffer[i++] = 0x6d;     // m
-        buffer[i++] = 0x00;
-        return i;
-
-    case Date:
-        buffer[i++] = 9;    /// = BSON.BSON_DATA_DATE;
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-        var millis = value.getTime();
-        var lowBits = ( millis % 4294967296 ) | 0, highBits = ( millis / 4294967296 ) | 0;
-
-        buffer[i++] = lowBits & 0xff;           buffer[i++] = (lowBits >> 8) & 0xff;
-        buffer[i++] = (lowBits >> 16) & 0xff;   buffer[i++] = (lowBits >> 24) & 0xff;
-        buffer[i++] = highBits & 0xff;          buffer[i++] = (highBits >> 8) & 0xff;
-        buffer[i++] = (highBits >> 16) & 0xff;  buffer[i++] = (highBits >> 24) & 0xff;
-        return i;
-
-    case Long:
-    case Timestamp:
-        buffer[i++] = value.constructor === Long ? 18 : 17; /// = BSON.BSON_DATA_LONG / _TIMESTAMP
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-        var lowBits = value.getLowBits(), highBits = value.getHighBits();
-
-        buffer[i++] = lowBits & 0xff;           buffer[i++] = (lowBits >> 8) & 0xff;
-        buffer[i++] = (lowBits >> 16) & 0xff;   buffer[i++] = (lowBits >> 24) & 0xff;
-        buffer[i++] = highBits & 0xff;          buffer[i++] = (highBits >> 8) & 0xff;
-        buffer[i++] = (highBits >> 16) & 0xff;  buffer[i++] = (highBits >> 24) & 0xff;
-        return i;
-
-    case Double:
-        buffer[i++] = 1;    /// = BSON.BSON_DATA_NUMBER;
-        i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-/// OLD: writeIEEE754(buffer, value, i, 'little', 52, 8);    i += 8;
-        buffer.writeDoubleLE(value, i);     i += 8;
-        return i
-
-    case MinKey:    /// = BSON.BSON_DATA_MINKEY;
-        buffer[i++] = 127; i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-        return i;
-    case MaxKey:    /// = BSON.BSON_DATA_MAXKEY;
-        buffer[i++] = 255; i += buffer.write(name, i, 'utf8'); buffer[i++] = 0;
-        return i;
-
-    } /// end of switch
-    return i;   /// ?! If no value to serialize
-}
-
-
-module.exports.deserializeFast = deserializeFast;
-
-function deserializeFast(buffer, i, isArray){   //// , options, isArray) {       //// no more options!
-    if (buffer.length < 5) return new Error('Corrupt bson message < 5 bytes long'); /// from 'throw'
-    var elementType, tempindex = 0, name;
-    var string, low, high;              /// = lowBits / highBits
-                                        /// using 'i' as the index to keep the lines shorter:
-    i || ( i = 0 );  /// for parseResponse it's 0; set to running index in deserialize(object/array) recursion
-    var object = isArray ? [] : {};         /// needed for type ARRAY recursion later!
-    var size = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-    if(size < 5 || size > buffer.length) return new Error('Corrupt BSON message');
-/// 'size' var was not used by anything after this, so we can reuse it
-
-    while(true) {                           // While we have more left data left keep parsing
-        elementType = buffer[i++];          // Read the type
-        if (elementType === 0) break;       // If we get a zero it's the last byte, exit
-
-        tempindex = i;  /// inlined readCStyleString & removed extra i<buffer.length check slowing EACH loop!
-        while( buffer[tempindex] !== 0x00 ) tempindex++;  /// read ahead w/out changing main 'i' index
-        if (tempindex >= buffer.length) return new Error('Corrupt BSON document: illegal CString')
-        name = buffer.toString('utf8', i, tempindex);
-        i = tempindex + 1;               /// Update index position to after the string + '0' termination
-
-        switch(elementType) {
-
-        case 7:     /// = BSON.BSON_DATA_OID:
-            var buf = new Buffer(12);
-            buffer.copy(buf, 0, i, i += 12 );   /// copy 12 bytes from the current 'i' offset into fresh Buffer
-            object[name] = new ObjectID(buf);   ///... & attach to the new ObjectID instance
-            break;
-
-        case 2:     /// = BSON.BSON_DATA_STRING:
-            size = buffer[i++] | buffer[i++] <<8 | buffer[i++] <<16 | buffer[i++] <<24;
-            object[name] = buffer.toString('utf8', i, i += size -1 );
-            i++;        break;          /// need to get the '0' index "tick-forward" back!
-
-        case 16:    /// = BSON.BSON_DATA_INT:        // Decode the 32bit value
-            object[name] = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;    break;
-
-        case 1:     /// = BSON.BSON_DATA_NUMBER:     // Decode the double value
-            object[name] = buffer.readDoubleLE(i);   /// slightly faster depending on dec.points; a LOT cleaner
-            /// OLD: object[name] = readIEEE754(buffer, i, 'little', 52, 8);
-            i += 8;     break;
-
-        case 8:     /// = BSON.BSON_DATA_BOOLEAN:
-            object[name] = buffer[i++] == 1;    break;
-
-        case 6:     /// = BSON.BSON_DATA_UNDEFINED:     /// deprecated
-        case 10:    /// = BSON.BSON_DATA_NULL:
-            object[name] = null;     break;
-
-        case 4:     /// = BSON.BSON_DATA_ARRAY
-            size = buffer[i] | buffer[i+1] <<8 | buffer[i+2] <<16 | buffer[i+3] <<24;  /// NO 'i' increment since the size bytes are reread during the recursion!
-            object[name] = deserializeFast(buffer, i, true );  /// pass current index & set isArray = true
-            i += size;      break;
-        case 3:     /// = BSON.BSON_DATA_OBJECT:
-            size = buffer[i] | buffer[i+1] <<8 | buffer[i+2] <<16 | buffer[i+3] <<24;
-            object[name] = deserializeFast(buffer, i, false );          /// isArray = false => Object
-            i += size;      break;
-
-        case 5:     /// = BSON.BSON_DATA_BINARY:             // Decode the size of the binary blob
-            size = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-            buffer[i++];             /// Skip, as we assume always default subtype, i.e. 0!
-            object[name] = buffer.slice(i, i += size);  /// creates a new Buffer "slice" view of the same memory!
-            break;
-
-        case 9:     /// = BSON.BSON_DATA_DATE:      /// SEE notes below on the Date type vs. other options...
-            low  = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-            high = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-            object[name] = new Date( high * 4294967296 + (low < 0 ? low + 4294967296 : low) );  break;
-
-        case 18:    /// = BSON.BSON_DATA_LONG:  /// usage should be somewhat rare beyond parseResponse() -> cursorId, where it is handled inline, NOT as part of deserializeFast(returnedObjects); get lowBits, highBits:
-            low  = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-            high = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-
-            size = high * 4294967296 + (low < 0 ? low + 4294967296 : low);      /// from long.toNumber()
-            if (size < JS_INT_MAX && size > JS_INT_MIN) object[name] = size;    /// positive # more likely!
-            else object[name] = new Long(low, high);    break;
-
-        case 127:   /// = BSON.BSON_DATA_MIN_KEY:   /// do we EVER actually get these BACK from MongoDB server?!
-            object[name] = new MinKey();     break;
-        case 255:   /// = BSON.BSON_DATA_MAX_KEY:
-            object[name] = new MaxKey();     break;
-
-        case 17:    /// = BSON.BSON_DATA_TIMESTAMP:   /// somewhat obscure internal BSON type; MongoDB uses it for (pseudo) high-res time timestamp (past millisecs precision is just a counter!) in the Oplog ts: field, etc.
-            low  = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-            high = buffer[i++] | buffer[i++] << 8 | buffer[i++] << 16 | buffer[i++] << 24;
-            object[name] = new Timestamp(low, high);     break;
-
-///        case 11:    /// = RegExp is skipped; we should NEVER be getting any from the MongoDB server!?
-        }   /// end of switch(elementType)
-    }   /// end of while(1)
-    return object;  // Return the finalized object
-}
-
-
-function MinKey() { this._bsontype = 'MinKey'; }  /// these are merely placeholders/stubs to signify the type!?
-
-function MaxKey() { this._bsontype = 'MaxKey'; }
-
-function Long(low, high) {
-    this._bsontype = 'Long';
-    this.low_ = low | 0;    this.high_ = high | 0;          /// force into 32 signed bits.
-}
-Long.prototype.getLowBits = function(){ return this.low_; }
-Long.prototype.getHighBits = function(){ return this.high_; }
-
-Long.prototype.toNumber = function(){
-    return this.high_ * 4294967296 + (this.low_ < 0 ? this.low_ + 4294967296 : this.low_);
-}
-Long.fromNumber = function(num){
-    return new Long(num % 4294967296, num / 4294967296);    /// |0 is forced in the constructor!
-}
-function Double(value) {
-    this._bsontype = 'Double';
-    this.value = value;
-}
-function Timestamp(low, high) {
-    this._bsontype = 'Timestamp';
-    this.low_ = low | 0;    this.high_ = high | 0;          /// force into 32 signed bits.
-}
-Timestamp.prototype.getLowBits = function(){ return this.low_; }
-Timestamp.prototype.getHighBits = function(){ return this.high_; }
-
-///////////////////////////////  ObjectID /////////////////////////////////
-/// machine & proc IDs stored as 1 string, b/c Buffer shouldn't be held for long periods (could use SlowBuffer?!)
-
-var MACHINE = parseInt(Math.random() * 0xFFFFFF, 10);
-var PROCESS = process.pid % 0xFFFF;
-var MACHINE_AND_PROC = encodeIntBE(MACHINE, 3) + encodeIntBE(PROCESS, 2); /// keep as ONE string, ready to go.
-
-function encodeIntBE(data, bytes){  /// encode the bytes to a string
-    var result = '';
-    if (bytes >= 4){ result += String.fromCharCode(Math.floor(data / 0x1000000)); data %= 0x1000000; }
-    if (bytes >= 3){ result += String.fromCharCode(Math.floor(data / 0x10000)); data %= 0x10000; }
-    if (bytes >= 2){ result += String.fromCharCode(Math.floor(data / 0x100)); data %= 0x100; }
-    result += String.fromCharCode(Math.floor(data));
-    return result;
-}
-var _counter = ~~(Math.random() * 0xFFFFFF);    /// double-tilde is equivalent to Math.floor()
-var checkForHex = new RegExp('^[0-9a-fA-F]{24}$');
-
-function ObjectID(id) {
-    this._bsontype = 'ObjectID';
-    if (!id){  this.id = createFromScratch();     /// base case, DONE.
-    } else {
-        if (id.constructor === Buffer){
-            this.id = id;  /// case of
-        } else if (id.constructor === String) {
-            if ( id.length === 24 && checkForHex.test(id) ) {
-                this.id = new Buffer(id, 'hex');
-            } else {
-                this.id = new Error('Illegal/faulty Hexadecimal string supplied!');     /// changed from 'throw'
-            }
-        } else if (id.constructor === Number) {
-            this.id = createFromTime(id);    /// this is what should be the only interface for this!?
-        }
-    }
-}
-function createFromScratch() {
-    var buf = new Buffer(12), i = 0;
-    var ts = ~~(Date.now()/1000);    /// 4 bytes timestamp in seconds, BigEndian notation!
-    buf[i++] = (ts >> 24) & 0xFF;    buf[i++] = (ts >> 16) & 0xFF;
-    buf[i++] = (ts >> 8) & 0xFF;     buf[i++] = (ts) & 0xFF;
-
-    buf.write(MACHINE_AND_PROC, i, 5, 'utf8');  i += 5;  /// write 3 bytes + 2 bytes MACHINE_ID and PROCESS_ID
-    _counter = ++_counter % 0xFFFFFF;       /// 3 bytes internal _counter for subsecond resolution; BigEndian
-    buf[i++] = (_counter >> 16) & 0xFF;
-    buf[i++] = (_counter >> 8) & 0xFF;
-    buf[i++] = (_counter) & 0xFF;
-    return buf;
-}
-function createFromTime(ts) {
-    ts || ( ts = ~~(Date.now()/1000) );     /// 4 bytes timestamp in seconds only
-    var buf = new Buffer(12), i = 0;
-    buf[i++] = (ts >> 24) & 0xFF;    buf[i++] = (ts >> 16) & 0xFF;
-    buf[i++] = (ts >> 8) & 0xFF;     buf[i++] = (ts) & 0xFF;
-
-    for (;i < 12; ++i) buf[i] = 0x00;       /// indeces 4 through 11 (8 bytes) get filled up with nulls
-    return buf;
-}
-ObjectID.prototype.toHexString = function toHexString() {
-    return this.id.toString('hex');
-}
-ObjectID.prototype.getTimestamp = function getTimestamp() {
-    return this.id.readUIntBE(0, 4);
-}
-ObjectID.prototype.getTimestampDate = function getTimestampDate() {
-    var ts = new Date();
-    ts.setTime(this.id.readUIntBE(0, 4) * 1000);
-    return ts;
-}
-ObjectID.createPk = function createPk () {  ///?override if a PrivateKey factory w/ unique factors is warranted?!
-  return new ObjectID();
-}
-ObjectID.prototype.toJSON = function toJSON() {
-    return "ObjectID('" +this.id.toString('hex')+ "')";
-}
-
-/// module.exports.BSON = BSON;         /// not needed anymore!? exports.Binary = Binary;
-module.exports.ObjectID = ObjectID;
-module.exports.MinKey = MinKey;
-module.exports.MaxKey = MaxKey;
-module.exports.Long = Long;    /// ?! we really don't want to do the complicated Long math anywhere for now!?
-
-//module.exports.Double = Double;
-//module.exports.Timestamp = Timestamp;
diff --git a/node_modules/bson/bower.json b/node_modules/bson/bower.json
deleted file mode 100644
index b32140e..0000000
--- a/node_modules/bson/bower.json
+++ /dev/null
@@ -1,25 +0,0 @@
-{
-  "name": "bson",
-  "description": "A bson parser for node.js and the browser",
-  "keywords": [
-    "mongodb",
-    "bson",
-    "parser"
-  ],
-  "author": "Christian Amor Kvalheim <christkv@gmail.com>",
-  "main": "./browser_build/bson.js",
-  "license": "Apache-2.0",
-  "moduleType": [
-    "globals",
-    "node"
-  ],
-  "ignore": [
-    "**/.*",
-    "alternate_parsers",
-    "benchmarks",
-    "bower_components",
-    "node_modules",
-    "test",
-    "tools"
-  ]
-}
diff --git a/node_modules/bson/browser_build/bson.js b/node_modules/bson/browser_build/bson.js
deleted file mode 100644
index 8e942dd..0000000
--- a/node_modules/bson/browser_build/bson.js
+++ /dev/null
@@ -1,4843 +0,0 @@
-var bson = (function(){
-
-  var pkgmap        = {},
-      global        = {},
-      nativeRequire = typeof require != 'undefined' && require,
-      lib, ties, main, async;
-
-  function exports(){ return main(); };
-
-  exports.main     = exports;
-  exports.module   = module;
-  exports.packages = pkgmap;
-  exports.pkg      = pkg;
-  exports.require  = function require(uri){
-    return pkgmap.main.index.require(uri);
-  };
-
-
-  ties             = {};
-
-  aliases          = {};
-
-
-  return exports;
-
-function join() {
-  return normalize(Array.prototype.join.call(arguments, "/"));
-};
-
-function normalize(path) {
-  var ret = [], parts = path.split('/'), cur, prev;
-
-  var i = 0, l = parts.length-1;
-  for (; i <= l; i++) {
-    cur = parts[i];
-
-    if (cur === "." && prev !== undefined) continue;
-
-    if (cur === ".." && ret.length && prev !== ".." && prev !== "." && prev !== undefined) {
-      ret.pop();
-      prev = ret.slice(-1)[0];
-    } else {
-      if (prev === ".") ret.pop();
-      ret.push(cur);
-      prev = cur;
-    }
-  }
-
-  return ret.join("/");
-};
-
-function dirname(path) {
-  return path && path.substr(0, path.lastIndexOf("/")) || ".";
-};
-
-function findModule(workingModule, uri){
-  var moduleId      = join(dirname(workingModule.id), /\.\/$/.test(uri) ? (uri + 'index') : uri ).replace(/\.js$/, ''),
-      moduleIndexId = join(moduleId, 'index'),
-      pkg           = workingModule.pkg,
-      module;
-
-  var i = pkg.modules.length,
-      id;
-
-  while(i-->0){
-    id = pkg.modules[i].id;
-
-    if(id==moduleId || id == moduleIndexId){
-      module = pkg.modules[i];
-      break;
-    }
-  }
-
-  return module;
-}
-
-function newRequire(callingModule){
-  function require(uri){
-    var module, pkg;
-
-    if(/^\./.test(uri)){
-      module = findModule(callingModule, uri);
-    } else if ( ties && ties.hasOwnProperty( uri ) ) {
-      return ties[uri];
-    } else if ( aliases && aliases.hasOwnProperty( uri ) ) {
-      return require(aliases[uri]);
-    } else {
-      pkg = pkgmap[uri];
-
-      if(!pkg && nativeRequire){
-        try {
-          pkg = nativeRequire(uri);
-        } catch (nativeRequireError) {}
-
-        if(pkg) return pkg;
-      }
-
-      if(!pkg){
-        throw new Error('Cannot find module "'+uri+'" @[module: '+callingModule.id+' package: '+callingModule.pkg.name+']');
-      }
-
-      module = pkg.index;
-    }
-
-    if(!module){
-      throw new Error('Cannot find module "'+uri+'" @[module: '+callingModule.id+' package: '+callingModule.pkg.name+']');
-    }
-
-    module.parent = callingModule;
-    return module.call();
-  };
-
-
-  return require;
-}
-
-
-function module(parent, id, wrapper){
-  var mod    = { pkg: parent, id: id, wrapper: wrapper },
-      cached = false;
-
-  mod.exports = {};
-  mod.require = newRequire(mod);
-
-  mod.call = function(){
-    if(cached) {
-      return mod.exports;
-    }
-
-    cached = true;
-
-    global.require = mod.require;
-
-    mod.wrapper(mod, mod.exports, global, global.require);
-    return mod.exports;
-  };
-
-  if(parent.mainModuleId == mod.id){
-    parent.index = mod;
-    parent.parents.length === 0 && ( main = mod.call );
-  }
-
-  parent.modules.push(mod);
-}
-
-function pkg(/* [ parentId ...], wrapper */){
-  var wrapper = arguments[ arguments.length - 1 ],
-      parents = Array.prototype.slice.call(arguments, 0, arguments.length - 1),
-      ctx     = wrapper(parents);
-
-
-  pkgmap[ctx.name] = ctx;
-
-  arguments.length == 1 && ( pkgmap.main = ctx );
-
-  return function(modules){
-    var id;
-    for(id in modules){
-      module(ctx, id, modules[id]);
-    }
-  };
-}
-
-
-}(this));
-
-bson.pkg(function(parents){
-
-  return {
-    'name'         : 'bson',
-    'mainModuleId' : 'bson',
-    'modules'      : [],
-    'parents'      : parents
-  };
-
-})({ 'binary': function(module, exports, global, require, undefined){
-  /**
- * Module dependencies.
- */
-if(typeof window === 'undefined') { 
-  var Buffer = require('buffer').Buffer; // TODO just use global Buffer
-}
-
-// Binary default subtype
-var BSON_BINARY_SUBTYPE_DEFAULT = 0;
-
-/**
- * @ignore
- * @api private
- */
-var writeStringToArray = function(data) {
-  // Create a buffer
-  var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(data.length)) : new Array(data.length);
-  // Write the content to the buffer
-  for(var i = 0; i < data.length; i++) {
-    buffer[i] = data.charCodeAt(i);
-  }  
-  // Write the string to the buffer
-  return buffer;
-}
-
-/**
- * Convert Array ot Uint8Array to Binary String
- *
- * @ignore
- * @api private
- */
-var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
-  var result = "";
-  for(var i = startIndex; i < endIndex; i++) {
-   result = result + String.fromCharCode(byteArray[i]);
-  }
-  return result;  
-};
-
-/**
- * A class representation of the BSON Binary type.
- * 
- * Sub types
- *  - **BSON.BSON_BINARY_SUBTYPE_DEFAULT**, default BSON type.
- *  - **BSON.BSON_BINARY_SUBTYPE_FUNCTION**, BSON function type.
- *  - **BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY**, BSON byte array type.
- *  - **BSON.BSON_BINARY_SUBTYPE_UUID**, BSON uuid type.
- *  - **BSON.BSON_BINARY_SUBTYPE_MD5**, BSON md5 type.
- *  - **BSON.BSON_BINARY_SUBTYPE_USER_DEFINED**, BSON user defined type.
- *
- * @class Represents the Binary BSON type.
- * @param {Buffer} buffer a buffer object containing the binary data.
- * @param {Number} [subType] the option binary type.
- * @return {Grid}
- */
-function Binary(buffer, subType) {
-  if(!(this instanceof Binary)) return new Binary(buffer, subType);
-  
-  this._bsontype = 'Binary';
-
-  if(buffer instanceof Number) {
-    this.sub_type = buffer;
-    this.position = 0;
-  } else {    
-    this.sub_type = subType == null ? BSON_BINARY_SUBTYPE_DEFAULT : subType;
-    this.position = 0;
-  }
-
-  if(buffer != null && !(buffer instanceof Number)) {
-    // Only accept Buffer, Uint8Array or Arrays
-    if(typeof buffer == 'string') {
-      // Different ways of writing the length of the string for the different types
-      if(typeof Buffer != 'undefined') {
-        this.buffer = new Buffer(buffer);
-      } else if(typeof Uint8Array != 'undefined' || (Object.prototype.toString.call(buffer) == '[object Array]')) {
-        this.buffer = writeStringToArray(buffer);
-      } else {
-        throw new Error("only String, Buffer, Uint8Array or Array accepted");
-      }
-    } else {
-      this.buffer = buffer;      
-    }
-    this.position = buffer.length;
-  } else {
-    if(typeof Buffer != 'undefined') {
-      this.buffer =  new Buffer(Binary.BUFFER_SIZE);      
-    } else if(typeof Uint8Array != 'undefined'){
-      this.buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE));
-    } else {
-      this.buffer = new Array(Binary.BUFFER_SIZE);
-    }
-    // Set position to start of buffer
-    this.position = 0;
-  }
-};
-
-/**
- * Updates this binary with byte_value.
- *
- * @param {Character} byte_value a single byte we wish to write.
- * @api public
- */
-Binary.prototype.put = function put(byte_value) {
-  // If it's a string and a has more than one character throw an error
-  if(byte_value['length'] != null && typeof byte_value != 'number' && byte_value.length != 1) throw new Error("only accepts single character String, Uint8Array or Array");
-  if(typeof byte_value != 'number' && byte_value < 0 || byte_value > 255) throw new Error("only accepts number in a valid unsigned byte range 0-255");
-  
-  // Decode the byte value once
-  var decoded_byte = null;
-  if(typeof byte_value == 'string') {
-    decoded_byte = byte_value.charCodeAt(0);      
-  } else if(byte_value['length'] != null) {
-    decoded_byte = byte_value[0];
-  } else {
-    decoded_byte = byte_value;
-  }
-  
-  if(this.buffer.length > this.position) {
-    this.buffer[this.position++] = decoded_byte;
-  } else {
-    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {    
-      // Create additional overflow buffer
-      var buffer = new Buffer(Binary.BUFFER_SIZE + this.buffer.length);
-      // Combine the two buffers together
-      this.buffer.copy(buffer, 0, 0, this.buffer.length);
-      this.buffer = buffer;
-      this.buffer[this.position++] = decoded_byte;
-    } else {
-      var buffer = null;
-      // Create a new buffer (typed or normal array)
-      if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
-        buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE + this.buffer.length));
-      } else {
-        buffer = new Array(Binary.BUFFER_SIZE + this.buffer.length);
-      }      
-      
-      // We need to copy all the content to the new array
-      for(var i = 0; i < this.buffer.length; i++) {
-        buffer[i] = this.buffer[i];
-      }
-      
-      // Reassign the buffer
-      this.buffer = buffer;
-      // Write the byte
-      this.buffer[this.position++] = decoded_byte;
-    }
-  }
-};
-
-/**
- * Writes a buffer or string to the binary.
- *
- * @param {Buffer|String} string a string or buffer to be written to the Binary BSON object.
- * @param {Number} offset specify the binary of where to write the content.
- * @api public
- */
-Binary.prototype.write = function write(string, offset) {
-  offset = typeof offset == 'number' ? offset : this.position;
-
-  // If the buffer is to small let's extend the buffer
-  if(this.buffer.length < offset + string.length) {
-    var buffer = null;
-    // If we are in node.js
-    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {      
-      buffer = new Buffer(this.buffer.length + string.length);
-      this.buffer.copy(buffer, 0, 0, this.buffer.length);      
-    } else if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
-      // Create a new buffer
-      buffer = new Uint8Array(new ArrayBuffer(this.buffer.length + string.length))
-      // Copy the content
-      for(var i = 0; i < this.position; i++) {
-        buffer[i] = this.buffer[i];
-      }
-    }
-    
-    // Assign the new buffer
-    this.buffer = buffer;
-  }
-
-  if(typeof Buffer != 'undefined' && Buffer.isBuffer(string) && Buffer.isBuffer(this.buffer)) {
-    string.copy(this.buffer, offset, 0, string.length);
-    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
-    // offset = string.length
-  } else if(typeof Buffer != 'undefined' && typeof string == 'string' && Buffer.isBuffer(this.buffer)) {
-    this.buffer.write(string, 'binary', offset);
-    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
-    // offset = string.length;
-  } else if(Object.prototype.toString.call(string) == '[object Uint8Array]' 
-    || Object.prototype.toString.call(string) == '[object Array]' && typeof string != 'string') {      
-    for(var i = 0; i < string.length; i++) {
-      this.buffer[offset++] = string[i];
-    }    
-
-    this.position = offset > this.position ? offset : this.position;
-  } else if(typeof string == 'string') {
-    for(var i = 0; i < string.length; i++) {
-      this.buffer[offset++] = string.charCodeAt(i);
-    }
-
-    this.position = offset > this.position ? offset : this.position;
-  }
-};
-
-/**
- * Reads **length** bytes starting at **position**.
- *
- * @param {Number} position read from the given position in the Binary.
- * @param {Number} length the number of bytes to read.
- * @return {Buffer}
- * @api public
- */
-Binary.prototype.read = function read(position, length) {
-  length = length && length > 0
-    ? length
-    : this.position;
-  
-  // Let's return the data based on the type we have
-  if(this.buffer['slice']) {
-    return this.buffer.slice(position, position + length);
-  } else {
-    // Create a buffer to keep the result
-    var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(length)) : new Array(length);
-    for(var i = 0; i < length; i++) {
-      buffer[i] = this.buffer[position++];
-    }
-  }
-  // Return the buffer
-  return buffer;
-};
-
-/**
- * Returns the value of this binary as a string.
- *
- * @return {String}
- * @api public
- */
-Binary.prototype.value = function value(asRaw) {
-  asRaw = asRaw == null ? false : asRaw;  
-  
-  // If it's a node.js buffer object
-  if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {
-    return asRaw ? this.buffer.slice(0, this.position) : this.buffer.toString('binary', 0, this.position);
-  } else {
-    if(asRaw) {
-      // we support the slice command use it
-      if(this.buffer['slice'] != null) {
-        return this.buffer.slice(0, this.position);
-      } else {
-        // Create a new buffer to copy content to
-        var newBuffer = Object.prototype.toString.call(this.buffer) == '[object Uint8Array]' ? new Uint8Array(new ArrayBuffer(this.position)) : new Array(this.position);
-        // Copy content
-        for(var i = 0; i < this.position; i++) {
-          newBuffer[i] = this.buffer[i];
-        }
-        // Return the buffer
-        return newBuffer;
-      }
-    } else {
-      return convertArraytoUtf8BinaryString(this.buffer, 0, this.position);
-    }
-  }
-};
-
-/**
- * Length.
- *
- * @return {Number} the length of the binary.
- * @api public
- */
-Binary.prototype.length = function length() {
-  return this.position;
-};
-
-/**
- * @ignore
- * @api private
- */
-Binary.prototype.toJSON = function() {
-  return this.buffer != null ? this.buffer.toString('base64') : '';
-}
-
-/**
- * @ignore
- * @api private
- */
-Binary.prototype.toString = function(format) {
-  return this.buffer != null ? this.buffer.slice(0, this.position).toString(format) : '';
-}
-
-Binary.BUFFER_SIZE = 256;
-
-/**
- * Default BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_DEFAULT = 0;
-/**
- * Function BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_FUNCTION = 1;
-/**
- * Byte Array BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_BYTE_ARRAY = 2;
-/**
- * OLD UUID BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_UUID_OLD = 3;
-/**
- * UUID BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_UUID = 4;
-/**
- * MD5 BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_MD5 = 5;
-/**
- * User BSON type
- *  
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_USER_DEFINED = 128;
-
-/**
- * Expose.
- */
-exports.Binary = Binary;
-
-
-}, 
-
-
-
-'binary_parser': function(module, exports, global, require, undefined){
-  /**
- * Binary Parser.
- * Jonas Raoni Soares Silva
- * http://jsfromhell.com/classes/binary-parser [v1.0]
- */
-var chr = String.fromCharCode;
-
-var maxBits = [];
-for (var i = 0; i < 64; i++) {
-	maxBits[i] = Math.pow(2, i);
-}
-
-function BinaryParser (bigEndian, allowExceptions) {
-  if(!(this instanceof BinaryParser)) return new BinaryParser(bigEndian, allowExceptions);
-  
-	this.bigEndian = bigEndian;
-	this.allowExceptions = allowExceptions;
-};
-
-BinaryParser.warn = function warn (msg) {
-	if (this.allowExceptions) {
-		throw new Error(msg);
-  }
-
-	return 1;
-};
-
-BinaryParser.decodeFloat = function decodeFloat (data, precisionBits, exponentBits) {
-	var b = new this.Buffer(this.bigEndian, data);
-
-	b.checkBuffer(precisionBits + exponentBits + 1);
-
-	var bias = maxBits[exponentBits - 1] - 1
-    , signal = b.readBits(precisionBits + exponentBits, 1)
-    , exponent = b.readBits(precisionBits, exponentBits)
-    , significand = 0
-    , divisor = 2
-    , curByte = b.buffer.length + (-precisionBits >> 3) - 1;
-
-	do {
-		for (var byteValue = b.buffer[ ++curByte ], startBit = precisionBits % 8 || 8, mask = 1 << startBit; mask >>= 1; ( byteValue & mask ) && ( significand += 1 / divisor ), divisor *= 2 );
-	} while (precisionBits -= startBit);
-
-	return exponent == ( bias << 1 ) + 1 ? significand ? NaN : signal ? -Infinity : +Infinity : ( 1 + signal * -2 ) * ( exponent || significand ? !exponent ? Math.pow( 2, -bias + 1 ) * significand : Math.pow( 2, exponent - bias ) * ( 1 + significand ) : 0 );
-};
-
-BinaryParser.decodeInt = function decodeInt (data, bits, signed, forceBigEndian) {
-  var b = new this.Buffer(this.bigEndian || forceBigEndian, data)
-      , x = b.readBits(0, bits)
-      , max = maxBits[bits]; //max = Math.pow( 2, bits );
-  
-  return signed && x >= max / 2
-      ? x - max
-      : x;
-};
-
-BinaryParser.encodeFloat = function encodeFloat (data, precisionBits, exponentBits) {
-	var bias = maxBits[exponentBits - 1] - 1
-    , minExp = -bias + 1
-    , maxExp = bias
-    , minUnnormExp = minExp - precisionBits
-    , n = parseFloat(data)
-    , status = isNaN(n) || n == -Infinity || n == +Infinity ? n : 0
-    ,	exp = 0
-    , len = 2 * bias + 1 + precisionBits + 3
-    , bin = new Array(len)
-    , signal = (n = status !== 0 ? 0 : n) < 0
-    , intPart = Math.floor(n = Math.abs(n))
-    , floatPart = n - intPart
-    , lastBit
-    , rounded
-    , result
-    , i
-    , j;
-
-	for (i = len; i; bin[--i] = 0);
-
-	for (i = bias + 2; intPart && i; bin[--i] = intPart % 2, intPart = Math.floor(intPart / 2));
-
-	for (i = bias + 1; floatPart > 0 && i; (bin[++i] = ((floatPart *= 2) >= 1) - 0 ) && --floatPart);
-
-	for (i = -1; ++i < len && !bin[i];);
-
-	if (bin[(lastBit = precisionBits - 1 + (i = (exp = bias + 1 - i) >= minExp && exp <= maxExp ? i + 1 : bias + 1 - (exp = minExp - 1))) + 1]) {
-		if (!(rounded = bin[lastBit])) {
-			for (j = lastBit + 2; !rounded && j < len; rounded = bin[j++]);
-		}
-
-		for (j = lastBit + 1; rounded && --j >= 0; (bin[j] = !bin[j] - 0) && (rounded = 0));
-	}
-
-	for (i = i - 2 < 0 ? -1 : i - 3; ++i < len && !bin[i];);
-
-	if ((exp = bias + 1 - i) >= minExp && exp <= maxExp) {
-		++i;
-  } else if (exp < minExp) {
-		exp != bias + 1 - len && exp < minUnnormExp && this.warn("encodeFloat::float underflow");
-		i = bias + 1 - (exp = minExp - 1);
-	}
-
-	if (intPart || status !== 0) {
-		this.warn(intPart ? "encodeFloat::float overflow" : "encodeFloat::" + status);
-		exp = maxExp + 1;
-		i = bias + 2;
-
-		if (status == -Infinity) {
-			signal = 1;
-    } else if (isNaN(status)) {
-			bin[i] = 1;
-    }
-	}
-
-	for (n = Math.abs(exp + bias), j = exponentBits + 1, result = ""; --j; result = (n % 2) + result, n = n >>= 1);
-
-	for (n = 0, j = 0, i = (result = (signal ? "1" : "0") + result + bin.slice(i, i + precisionBits).join("")).length, r = []; i; j = (j + 1) % 8) {
-		n += (1 << j) * result.charAt(--i);
-		if (j == 7) {
-			r[r.length] = String.fromCharCode(n);
-			n = 0;
-		}
-	}
-
-	r[r.length] = n
-    ? String.fromCharCode(n)
-    : "";
-
-	return (this.bigEndian ? r.reverse() : r).join("");
-};
-
-BinaryParser.encodeInt = function encodeInt (data, bits, signed, forceBigEndian) {
-	var max = maxBits[bits];
-
-  if (data >= max || data < -(max / 2)) {
-    this.warn("encodeInt::overflow");
-    data = 0;
-  }
-
-	if (data < 0) {
-    data += max;
-  }
-
-	for (var r = []; data; r[r.length] = String.fromCharCode(data % 256), data = Math.floor(data / 256));
-
-	for (bits = -(-bits >> 3) - r.length; bits--; r[r.length] = "\0");
-
-  return ((this.bigEndian || forceBigEndian) ? r.reverse() : r).join("");
-};
-
-BinaryParser.toSmall    = function( data ){ return this.decodeInt( data,  8, true  ); };
-BinaryParser.fromSmall  = function( data ){ return this.encodeInt( data,  8, true  ); };
-BinaryParser.toByte     = function( data ){ return this.decodeInt( data,  8, false ); };
-BinaryParser.fromByte   = function( data ){ return this.encodeInt( data,  8, false ); };
-BinaryParser.toShort    = function( data ){ return this.decodeInt( data, 16, true  ); };
-BinaryParser.fromShort  = function( data ){ return this.encodeInt( data, 16, true  ); };
-BinaryParser.toWord     = function( data ){ return this.decodeInt( data, 16, false ); };
-BinaryParser.fromWord   = function( data ){ return this.encodeInt( data, 16, false ); };
-BinaryParser.toInt      = function( data ){ return this.decodeInt( data, 32, true  ); };
-BinaryParser.fromInt    = function( data ){ return this.encodeInt( data, 32, true  ); };
-BinaryParser.toLong     = function( data ){ return this.decodeInt( data, 64, true  ); };
-BinaryParser.fromLong   = function( data ){ return this.encodeInt( data, 64, true  ); };
-BinaryParser.toDWord    = function( data ){ return this.decodeInt( data, 32, false ); };
-BinaryParser.fromDWord  = function( data ){ return this.encodeInt( data, 32, false ); };
-BinaryParser.toQWord    = function( data ){ return this.decodeInt( data, 64, true ); };
-BinaryParser.fromQWord  = function( data ){ return this.encodeInt( data, 64, true ); };
-BinaryParser.toFloat    = function( data ){ return this.decodeFloat( data, 23, 8   ); };
-BinaryParser.fromFloat  = function( data ){ return this.encodeFloat( data, 23, 8   ); };
-BinaryParser.toDouble   = function( data ){ return this.decodeFloat( data, 52, 11  ); };
-BinaryParser.fromDouble = function( data ){ return this.encodeFloat( data, 52, 11  ); };
-
-// Factor out the encode so it can be shared by add_header and push_int32
-BinaryParser.encode_int32 = function encode_int32 (number, asArray) {
-  var a, b, c, d, unsigned;
-  unsigned = (number < 0) ? (number + 0x100000000) : number;
-  a = Math.floor(unsigned / 0xffffff);
-  unsigned &= 0xffffff;
-  b = Math.floor(unsigned / 0xffff);
-  unsigned &= 0xffff;
-  c = Math.floor(unsigned / 0xff);
-  unsigned &= 0xff;
-  d = Math.floor(unsigned);
-  return asArray ? [chr(a), chr(b), chr(c), chr(d)] : chr(a) + chr(b) + chr(c) + chr(d);
-};
-
-BinaryParser.encode_int64 = function encode_int64 (number) {
-  var a, b, c, d, e, f, g, h, unsigned;
-  unsigned = (number < 0) ? (number + 0x10000000000000000) : number;
-  a = Math.floor(unsigned / 0xffffffffffffff);
-  unsigned &= 0xffffffffffffff;
-  b = Math.floor(unsigned / 0xffffffffffff);
-  unsigned &= 0xffffffffffff;
-  c = Math.floor(unsigned / 0xffffffffff);
-  unsigned &= 0xffffffffff;
-  d = Math.floor(unsigned / 0xffffffff);
-  unsigned &= 0xffffffff;
-  e = Math.floor(unsigned / 0xffffff);
-  unsigned &= 0xffffff;
-  f = Math.floor(unsigned / 0xffff);
-  unsigned &= 0xffff;
-  g = Math.floor(unsigned / 0xff);
-  unsigned &= 0xff;
-  h = Math.floor(unsigned);
-  return chr(a) + chr(b) + chr(c) + chr(d) + chr(e) + chr(f) + chr(g) + chr(h);
-};
-
-/**
- * UTF8 methods
- */
-
-// Take a raw binary string and return a utf8 string
-BinaryParser.decode_utf8 = function decode_utf8 (binaryStr) {
-  var len = binaryStr.length
-    , decoded = ''
-    , i = 0
-    , c = 0
-    , c1 = 0
-    , c2 = 0
-    , c3;
-
-  while (i < len) {
-    c = binaryStr.charCodeAt(i);
-    if (c < 128) {
-      decoded += String.fromCharCode(c);
-      i++;
-    } else if ((c > 191) && (c < 224)) {
-	    c2 = binaryStr.charCodeAt(i+1);
-      decoded += String.fromCharCode(((c & 31) << 6) | (c2 & 63));
-      i += 2;
-    } else {
-	    c2 = binaryStr.charCodeAt(i+1);
-	    c3 = binaryStr.charCodeAt(i+2);
-      decoded += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63));
-      i += 3;
-    }
-  }
-
-  return decoded;
-};
-
-// Encode a cstring
-BinaryParser.encode_cstring = function encode_cstring (s) {
-  return unescape(encodeURIComponent(s)) + BinaryParser.fromByte(0);
-};
-
-// Take a utf8 string and return a binary string
-BinaryParser.encode_utf8 = function encode_utf8 (s) {
-  var a = ""
-    , c;
-
-  for (var n = 0, len = s.length; n < len; n++) {
-    c = s.charCodeAt(n);
-
-    if (c < 128) {
-	    a += String.fromCharCode(c);
-    } else if ((c > 127) && (c < 2048)) {
-	    a += String.fromCharCode((c>>6) | 192) ;
-	    a += String.fromCharCode((c&63) | 128);
-    } else {
-      a += String.fromCharCode((c>>12) | 224);
-      a += String.fromCharCode(((c>>6) & 63) | 128);
-      a += String.fromCharCode((c&63) | 128);
-    }
-  }
-
-  return a;
-};
-
-BinaryParser.hprint = function hprint (s) {
-  var number;
-
-  for (var i = 0, len = s.length; i < len; i++) {
-    if (s.charCodeAt(i) < 32) {
-      number = s.charCodeAt(i) <= 15
-        ? "0" + s.charCodeAt(i).toString(16)
-        : s.charCodeAt(i).toString(16);        
-      process.stdout.write(number + " ")
-    } else {
-      number = s.charCodeAt(i) <= 15
-        ? "0" + s.charCodeAt(i).toString(16)
-        : s.charCodeAt(i).toString(16);
-        process.stdout.write(number + " ")
-    }
-  }
-  
-  process.stdout.write("\n\n");
-};
-
-BinaryParser.ilprint = function hprint (s) {
-  var number;
-
-  for (var i = 0, len = s.length; i < len; i++) {
-    if (s.charCodeAt(i) < 32) {
-      number = s.charCodeAt(i) <= 15
-        ? "0" + s.charCodeAt(i).toString(10)
-        : s.charCodeAt(i).toString(10);
-
-      require('util').debug(number+' : ');
-    } else {
-      number = s.charCodeAt(i) <= 15
-        ? "0" + s.charCodeAt(i).toString(10)
-        : s.charCodeAt(i).toString(10);
-      require('util').debug(number+' : '+ s.charAt(i));
-    }
-  }
-};
-
-BinaryParser.hlprint = function hprint (s) {
-  var number;
-
-  for (var i = 0, len = s.length; i < len; i++) {
-    if (s.charCodeAt(i) < 32) {
-      number = s.charCodeAt(i) <= 15
-        ? "0" + s.charCodeAt(i).toString(16)
-        : s.charCodeAt(i).toString(16);
-      require('util').debug(number+' : ');
-    } else {
-      number = s.charCodeAt(i) <= 15
-        ? "0" + s.charCodeAt(i).toString(16)
-        : s.charCodeAt(i).toString(16);
-      require('util').debug(number+' : '+ s.charAt(i));
-    }
-  }
-};
-
-/**
- * BinaryParser buffer constructor.
- */
-function BinaryParserBuffer (bigEndian, buffer) {
-  this.bigEndian = bigEndian || 0;
-  this.buffer = [];
-  this.setBuffer(buffer);
-};
-
-BinaryParserBuffer.prototype.setBuffer = function setBuffer (data) {
-  var l, i, b;
-
-	if (data) {
-    i = l = data.length;
-    b = this.buffer = new Array(l);
-		for (; i; b[l - i] = data.charCodeAt(--i));
-		this.bigEndian && b.reverse();
-	}
-};
-
-BinaryParserBuffer.prototype.hasNeededBits = function hasNeededBits (neededBits) {
-	return this.buffer.length >= -(-neededBits >> 3);
-};
-
-BinaryParserBuffer.prototype.checkBuffer = function checkBuffer (neededBits) {
-	if (!this.hasNeededBits(neededBits)) {
-		throw new Error("checkBuffer::missing bytes");
-  }
-};
-
-BinaryParserBuffer.prototype.readBits = function readBits (start, length) {
-	//shl fix: Henri Torgemane ~1996 (compressed by Jonas Raoni)
-
-	function shl (a, b) {
-		for (; b--; a = ((a %= 0x7fffffff + 1) & 0x40000000) == 0x40000000 ? a * 2 : (a - 0x40000000) * 2 + 0x7fffffff + 1);
-		return a;
-	}
-
-	if (start < 0 || length <= 0) {
-		return 0;
-  }
-
-	this.checkBuffer(start + length);
-
-  var offsetLeft
-    , offsetRight = start % 8
-    , curByte = this.buffer.length - ( start >> 3 ) - 1
-    , lastByte = this.buffer.length + ( -( start + length ) >> 3 )
-    , diff = curByte - lastByte
-    , sum = ((this.buffer[ curByte ] >> offsetRight) & ((1 << (diff ? 8 - offsetRight : length)) - 1)) + (diff && (offsetLeft = (start + length) % 8) ? (this.buffer[lastByte++] & ((1 << offsetLeft) - 1)) << (diff-- << 3) - offsetRight : 0);
-
-	for(; diff; sum += shl(this.buffer[lastByte++], (diff-- << 3) - offsetRight));
-
-	return sum;
-};
-
-/**
- * Expose.
- */
-BinaryParser.Buffer = BinaryParserBuffer;
-
-exports.BinaryParser = BinaryParser;
-
-}, 
-
-
-
-'bson': function(module, exports, global, require, undefined){
-  var Long = require('./long').Long
-  , Double = require('./double').Double
-  , Timestamp = require('./timestamp').Timestamp
-  , ObjectID = require('./objectid').ObjectID
-  , Symbol = require('./symbol').Symbol
-  , Code = require('./code').Code
-  , MinKey = require('./min_key').MinKey
-  , MaxKey = require('./max_key').MaxKey
-  , DBRef = require('./db_ref').DBRef
-  , Binary = require('./binary').Binary
-  , BinaryParser = require('./binary_parser').BinaryParser
-  , writeIEEE754 = require('./float_parser').writeIEEE754
-  , readIEEE754 = require('./float_parser').readIEEE754
-
-// To ensure that 0.4 of node works correctly
-var isDate = function isDate(d) {
-  return typeof d === 'object' && Object.prototype.toString.call(d) === '[object Date]';
-}
-
-/**
- * Create a new BSON instance
- *
- * @class Represents the BSON Parser
- * @return {BSON} instance of BSON Parser.
- */
-function BSON () {};
-
-/**
- * @ignore
- * @api private
- */
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
-BSON.BSON_INT64_MIN = -Math.pow(2, 63);
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-// Internal long versions
-var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
-var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
-
-/**
- * Number BSON Type
- *
- * @classconstant BSON_DATA_NUMBER
- **/
-BSON.BSON_DATA_NUMBER = 1;
-/**
- * String BSON Type
- *
- * @classconstant BSON_DATA_STRING
- **/
-BSON.BSON_DATA_STRING = 2;
-/**
- * Object BSON Type
- *
- * @classconstant BSON_DATA_OBJECT
- **/
-BSON.BSON_DATA_OBJECT = 3;
-/**
- * Array BSON Type
- *
- * @classconstant BSON_DATA_ARRAY
- **/
-BSON.BSON_DATA_ARRAY = 4;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_BINARY
- **/
-BSON.BSON_DATA_BINARY = 5;
-/**
- * ObjectID BSON Type
- *
- * @classconstant BSON_DATA_OID
- **/
-BSON.BSON_DATA_OID = 7;
-/**
- * Boolean BSON Type
- *
- * @classconstant BSON_DATA_BOOLEAN
- **/
-BSON.BSON_DATA_BOOLEAN = 8;
-/**
- * Date BSON Type
- *
- * @classconstant BSON_DATA_DATE
- **/
-BSON.BSON_DATA_DATE = 9;
-/**
- * null BSON Type
- *
- * @classconstant BSON_DATA_NULL
- **/
-BSON.BSON_DATA_NULL = 10;
-/**
- * RegExp BSON Type
- *
- * @classconstant BSON_DATA_REGEXP
- **/
-BSON.BSON_DATA_REGEXP = 11;
-/**
- * Code BSON Type
- *
- * @classconstant BSON_DATA_CODE
- **/
-BSON.BSON_DATA_CODE = 13;
-/**
- * Symbol BSON Type
- *
- * @classconstant BSON_DATA_SYMBOL
- **/
-BSON.BSON_DATA_SYMBOL = 14;
-/**
- * Code with Scope BSON Type
- *
- * @classconstant BSON_DATA_CODE_W_SCOPE
- **/
-BSON.BSON_DATA_CODE_W_SCOPE = 15;
-/**
- * 32 bit Integer BSON Type
- *
- * @classconstant BSON_DATA_INT
- **/
-BSON.BSON_DATA_INT = 16;
-/**
- * Timestamp BSON Type
- *
- * @classconstant BSON_DATA_TIMESTAMP
- **/
-BSON.BSON_DATA_TIMESTAMP = 17;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_LONG
- **/
-BSON.BSON_DATA_LONG = 18;
-/**
- * MinKey BSON Type
- *
- * @classconstant BSON_DATA_MIN_KEY
- **/
-BSON.BSON_DATA_MIN_KEY = 0xff;
-/**
- * MaxKey BSON Type
- *
- * @classconstant BSON_DATA_MAX_KEY
- **/
-BSON.BSON_DATA_MAX_KEY = 0x7f;
-
-/**
- * Binary Default Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
- **/
-BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
-/**
- * Binary Function Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
- **/
-BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
-/**
- * Binary Byte Array Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
- **/
-BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
-/**
- * Binary UUID Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_UUID
- **/
-BSON.BSON_BINARY_SUBTYPE_UUID = 3;
-/**
- * Binary MD5 Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_MD5
- **/
-BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
-/**
- * Binary User Defined Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
- **/
-BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
-
-/**
- * Calculate the bson size for a passed in Javascript object.
- *
- * @param {Object} object the Javascript object to calculate the BSON byte size for.
- * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
- * @return {Number} returns the number of bytes the BSON object will take up.
- * @api public
- */
-BSON.calculateObjectSize = function calculateObjectSize(object, serializeFunctions) {
-  var totalLength = (4 + 1);
-
-  if(Array.isArray(object)) {
-    for(var i = 0; i < object.length; i++) {
-      totalLength += calculateElement(i.toString(), object[i], serializeFunctions)
-    }
-  } else {
-		// If we have toBSON defined, override the current object
-		if(object.toBSON) {
-			object = object.toBSON();
-		}
-
-		// Calculate size
-    for(var key in object) {
-      totalLength += calculateElement(key, object[key], serializeFunctions)
-    }
-  }
-
-  return totalLength;
-}
-
-/**
- * @ignore
- * @api private
- */
-function calculateElement(name, value, serializeFunctions) {
-  var isBuffer = typeof Buffer !== 'undefined';
-
-  switch(typeof value) {
-    case 'string':
-      return 1 + (!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1 + 4 + (!isBuffer ? numberOfBytes(value) : Buffer.byteLength(value, 'utf8')) + 1;
-    case 'number':
-      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) { // 32 bit
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (4 + 1);
-        } else {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-        }
-      } else {  // 64 bit
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-      }
-    case 'undefined':
-      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
-    case 'boolean':
-      return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 1);
-    case 'object':
-      if(value == null || value instanceof MinKey || value instanceof MaxKey || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1);
-      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (12 + 1);
-      } else if(value instanceof Date || isDate(value)) {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (1 + 4 + 1) + value.length;
-      } else if(value instanceof Long || value instanceof Double || value instanceof Timestamp
-          || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Double' || value['_bsontype'] == 'Timestamp') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (8 + 1);
-      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
-        // Calculate size depending on the availability of a scope
-        if(value.scope != null && Object.keys(value.scope).length > 0) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
-        } else {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.code.toString()) : Buffer.byteLength(value.code.toString(), 'utf8')) + 1;
-        }
-      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
-        // Check what kind of subtype we have
-        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1 + 4);
-        } else {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + (value.position + 1 + 4 + 1);
-        }
-      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + ((!isBuffer ? numberOfBytes(value.value) : Buffer.byteLength(value.value, 'utf8')) + 4 + 1 + 1);
-      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
-        // Set up correct object for serialization
-        var ordered_values = {
-            '$ref': value.namespace
-          , '$id' : value.oid
-        };
-
-        // Add db reference if it exists
-        if(null != value.db) {
-          ordered_values['$db'] = value.db;
-        }
-
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + BSON.calculateObjectSize(ordered_values, serializeFunctions);
-      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
-            + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
-      } else {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + BSON.calculateObjectSize(value, serializeFunctions) + 1;
-      }
-    case 'function':
-      // WTF for 0.4.X where typeof /someregexp/ === 'function'
-      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
-        return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + (!isBuffer ? numberOfBytes(value.source) : Buffer.byteLength(value.source, 'utf8')) + 1
-          + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
-      } else {
-        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1 + BSON.calculateObjectSize(value.scope, serializeFunctions);
-        } else if(serializeFunctions) {
-          return (name != null ? ((!isBuffer ? numberOfBytes(name) : Buffer.byteLength(name, 'utf8')) + 1) : 0) + 1 + 4 + (!isBuffer ? numberOfBytes(value.toString()) : Buffer.byteLength(value.toString(), 'utf8')) + 1;
-        }
-      }
-  }
-
-  return 0;
-}
-
-/**
- * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
- * @param {Number} index the index in the buffer where we wish to start serializing into.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Number} returns the new write index in the Buffer.
- * @api public
- */
-BSON.serializeWithBufferAndIndex = function serializeWithBufferAndIndex(object, checkKeys, buffer, index, serializeFunctions) {
-  // Default setting false
-  serializeFunctions = serializeFunctions == null ? false : serializeFunctions;
-  // Write end information (length of the object)
-  var size = buffer.length;
-  // Write the size of the object
-  buffer[index++] = size & 0xff;
-  buffer[index++] = (size >> 8) & 0xff;
-  buffer[index++] = (size >> 16) & 0xff;
-  buffer[index++] = (size >> 24) & 0xff;
-  return serializeObject(object, checkKeys, buffer, index, serializeFunctions) - 1;
-}
-
-/**
- * @ignore
- * @api private
- */
-var serializeObject = function(object, checkKeys, buffer, index, serializeFunctions) {
-  // Process the object
-  if(Array.isArray(object)) {
-    for(var i = 0; i < object.length; i++) {
-      index = packElement(i.toString(), object[i], checkKeys, buffer, index, serializeFunctions);
-    }
-  } else {
-		// If we have toBSON defined, override the current object
-		if(object.toBSON) {
-			object = object.toBSON();
-		}
-
-		// Serialize the object
-    for(var key in object) {
-      // Check the key and throw error if it's illegal
-      if (key != '$db' && key != '$ref' && key != '$id') {
-        // dollars and dots ok
-        BSON.checkKey(key, !checkKeys);
-      }
-
-      // Pack the element
-      index = packElement(key, object[key], checkKeys, buffer, index, serializeFunctions);
-    }
-  }
-
-  // Write zero
-  buffer[index++] = 0;
-  return index;
-}
-
-var stringToBytes = function(str) {
-  var ch, st, re = [];
-  for (var i = 0; i < str.length; i++ ) {
-    ch = str.charCodeAt(i);  // get char
-    st = [];                 // set up "stack"
-    do {
-      st.push( ch & 0xFF );  // push byte to stack
-      ch = ch >> 8;          // shift value down by 1 byte
-    }
-    while ( ch );
-    // add stack contents to result
-    // done because chars have "wrong" endianness
-    re = re.concat( st.reverse() );
-  }
-  // return an array of bytes
-  return re;
-}
-
-var numberOfBytes = function(str) {
-  var ch, st, re = 0;
-  for (var i = 0; i < str.length; i++ ) {
-    ch = str.charCodeAt(i);  // get char
-    st = [];                 // set up "stack"
-    do {
-      st.push( ch & 0xFF );  // push byte to stack
-      ch = ch >> 8;          // shift value down by 1 byte
-    }
-    while ( ch );
-    // add stack contents to result
-    // done because chars have "wrong" endianness
-    re = re + st.length;
-  }
-  // return an array of bytes
-  return re;
-}
-
-/**
- * @ignore
- * @api private
- */
-var writeToTypedArray = function(buffer, string, index) {
-  var bytes = stringToBytes(string);
-  for(var i = 0; i < bytes.length; i++) {
-    buffer[index + i] = bytes[i];
-  }
-  return bytes.length;
-}
-
-/**
- * @ignore
- * @api private
- */
-var supportsBuffer = typeof Buffer != 'undefined';
-
-/**
- * @ignore
- * @api private
- */
-var packElement = function(name, value, checkKeys, buffer, index, serializeFunctions) {
-  var startIndex = index;
-
-  switch(typeof value) {
-    case 'string':
-      // Encode String type
-      buffer[index++] = BSON.BSON_DATA_STRING;
-      // Number of written bytes
-      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-      // Encode the name
-      index = index + numberOfWrittenBytes + 1;
-      buffer[index - 1] = 0;
-
-      // Calculate size
-      var size = supportsBuffer ? Buffer.byteLength(value) + 1 : numberOfBytes(value) + 1;
-      // Write the size of the string to buffer
-      buffer[index + 3] = (size >> 24) & 0xff;
-      buffer[index + 2] = (size >> 16) & 0xff;
-      buffer[index + 1] = (size >> 8) & 0xff;
-      buffer[index] = size & 0xff;
-      // Ajust the index
-      index = index + 4;
-      // Write the string
-      supportsBuffer ? buffer.write(value, index, 'utf8') : writeToTypedArray(buffer, value, index);
-      // Update index
-      index = index + size - 1;
-      // Write zero
-      buffer[index++] = 0;
-      // Return index
-      return index;
-    case 'number':
-      // We have an integer value
-      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-        // If the value fits in 32 bits encode as int, if it fits in a double
-        // encode it as a double, otherwise long
-        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) {
-          // Set int type 32 bits or less
-          buffer[index++] = BSON.BSON_DATA_INT;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Write the int value
-          buffer[index++] = value & 0xff;
-          buffer[index++] = (value >> 8) & 0xff;
-          buffer[index++] = (value >> 16) & 0xff;
-          buffer[index++] = (value >> 24) & 0xff;
-        } else if(value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-          // Encode as double
-          buffer[index++] = BSON.BSON_DATA_NUMBER;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Write float
-          writeIEEE754(buffer, value, index, 'little', 52, 8);
-          // Ajust index
-          index = index + 8;
-        } else {
-          // Set long type
-          buffer[index++] = BSON.BSON_DATA_LONG;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          var longVal = Long.fromNumber(value);
-          var lowBits = longVal.getLowBits();
-          var highBits = longVal.getHighBits();
-          // Encode low bits
-          buffer[index++] = lowBits & 0xff;
-          buffer[index++] = (lowBits >> 8) & 0xff;
-          buffer[index++] = (lowBits >> 16) & 0xff;
-          buffer[index++] = (lowBits >> 24) & 0xff;
-          // Encode high bits
-          buffer[index++] = highBits & 0xff;
-          buffer[index++] = (highBits >> 8) & 0xff;
-          buffer[index++] = (highBits >> 16) & 0xff;
-          buffer[index++] = (highBits >> 24) & 0xff;
-        }
-      } else {
-        // Encode as double
-        buffer[index++] = BSON.BSON_DATA_NUMBER;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Write float
-        writeIEEE754(buffer, value, index, 'little', 52, 8);
-        // Ajust index
-        index = index + 8;
-      }
-
-      return index;
-    case 'undefined':
-      // Set long type
-      buffer[index++] = BSON.BSON_DATA_NULL;
-      // Number of written bytes
-      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-      // Encode the name
-      index = index + numberOfWrittenBytes + 1;
-      buffer[index - 1] = 0;
-      return index;
-    case 'boolean':
-      // Write the type
-      buffer[index++] = BSON.BSON_DATA_BOOLEAN;
-      // Number of written bytes
-      var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-      // Encode the name
-      index = index + numberOfWrittenBytes + 1;
-      buffer[index - 1] = 0;
-      // Encode the boolean value
-      buffer[index++] = value ? 1 : 0;
-      return index;
-    case 'object':
-      if(value === null || value instanceof MinKey || value instanceof MaxKey
-          || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        // Write the type of either min or max key
-        if(value === null) {
-          buffer[index++] = BSON.BSON_DATA_NULL;
-        } else if(value instanceof MinKey) {
-          buffer[index++] = BSON.BSON_DATA_MIN_KEY;
-        } else {
-          buffer[index++] = BSON.BSON_DATA_MAX_KEY;
-        }
-
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        return index;
-      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_OID;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write objectid
-        supportsBuffer ? buffer.write(value.id, index, 'binary') : writeToTypedArray(buffer, value.id, index);
-        // Ajust index
-        index = index + 12;
-        return index;
-      } else if(value instanceof Date || isDate(value)) {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_DATE;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write the date
-        var dateInMilis = Long.fromNumber(value.getTime());
-        var lowBits = dateInMilis.getLowBits();
-        var highBits = dateInMilis.getHighBits();
-        // Encode low bits
-        buffer[index++] = lowBits & 0xff;
-        buffer[index++] = (lowBits >> 8) & 0xff;
-        buffer[index++] = (lowBits >> 16) & 0xff;
-        buffer[index++] = (lowBits >> 24) & 0xff;
-        // Encode high bits
-        buffer[index++] = highBits & 0xff;
-        buffer[index++] = (highBits >> 8) & 0xff;
-        buffer[index++] = (highBits >> 16) & 0xff;
-        buffer[index++] = (highBits >> 24) & 0xff;
-        return index;
-      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_BINARY;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Get size of the buffer (current write point)
-        var size = value.length;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write the default subtype
-        buffer[index++] = BSON.BSON_BINARY_SUBTYPE_DEFAULT;
-        // Copy the content form the binary field to the buffer
-        value.copy(buffer, index, 0, size);
-        // Adjust the index
-        index = index + size;
-        return index;
-      } else if(value instanceof Long || value instanceof Timestamp || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
-        // Write the type
-        buffer[index++] = value instanceof Long ? BSON.BSON_DATA_LONG : BSON.BSON_DATA_TIMESTAMP;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Write the date
-        var lowBits = value.getLowBits();
-        var highBits = value.getHighBits();
-        // Encode low bits
-        buffer[index++] = lowBits & 0xff;
-        buffer[index++] = (lowBits >> 8) & 0xff;
-        buffer[index++] = (lowBits >> 16) & 0xff;
-        buffer[index++] = (lowBits >> 24) & 0xff;
-        // Encode high bits
-        buffer[index++] = highBits & 0xff;
-        buffer[index++] = (highBits >> 8) & 0xff;
-        buffer[index++] = (highBits >> 16) & 0xff;
-        buffer[index++] = (highBits >> 24) & 0xff;
-        return index;
-      } else if(value instanceof Double || value['_bsontype'] == 'Double') {
-        // Encode as double
-        buffer[index++] = BSON.BSON_DATA_NUMBER;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Write float
-        writeIEEE754(buffer, value, index, 'little', 52, 8);
-        // Ajust index
-        index = index + 8;
-        return index;
-      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
-        if(value.scope != null && Object.keys(value.scope).length > 0) {
-          // Write the type
-          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Calculate the scope size
-          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
-          // Function string
-          var functionString = value.code.toString();
-          // Function Size
-          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-
-          // Calculate full size of the object
-          var totalSize = 4 + codeSize + scopeSize + 4;
-
-          // Write the total size of the object
-          buffer[index++] = totalSize & 0xff;
-          buffer[index++] = (totalSize >> 8) & 0xff;
-          buffer[index++] = (totalSize >> 16) & 0xff;
-          buffer[index++] = (totalSize >> 24) & 0xff;
-
-          // Write the size of the string to buffer
-          buffer[index++] = codeSize & 0xff;
-          buffer[index++] = (codeSize >> 8) & 0xff;
-          buffer[index++] = (codeSize >> 16) & 0xff;
-          buffer[index++] = (codeSize >> 24) & 0xff;
-
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + codeSize - 1;
-          // Write zero
-          buffer[index++] = 0;
-          // Serialize the scope object
-          var scopeObjectBuffer = supportsBuffer ? new Buffer(scopeSize) : new Uint8Array(new ArrayBuffer(scopeSize));
-          // Execute the serialization into a seperate buffer
-          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
-
-          // Adjusted scope Size (removing the header)
-          var scopeDocSize = scopeSize;
-          // Write scope object size
-          buffer[index++] = scopeDocSize & 0xff;
-          buffer[index++] = (scopeDocSize >> 8) & 0xff;
-          buffer[index++] = (scopeDocSize >> 16) & 0xff;
-          buffer[index++] = (scopeDocSize >> 24) & 0xff;
-
-          // Write the scopeObject into the buffer
-          supportsBuffer ? scopeObjectBuffer.copy(buffer, index, 0, scopeSize) : buffer.set(scopeObjectBuffer, index);
-          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
-          index = index + scopeDocSize - 5;
-          // Write trailing zero
-          buffer[index++] = 0;
-          return index
-        } else {
-          buffer[index++] = BSON.BSON_DATA_CODE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Function string
-          var functionString = value.code.toString();
-          // Function Size
-          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-          // Write the size of the string to buffer
-          buffer[index++] = size & 0xff;
-          buffer[index++] = (size >> 8) & 0xff;
-          buffer[index++] = (size >> 16) & 0xff;
-          buffer[index++] = (size >> 24) & 0xff;
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + size - 1;
-          // Write zero
-          buffer[index++] = 0;
-          return index;
-        }
-      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_BINARY;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Extract the buffer
-        var data = value.value(true);
-        // Calculate size
-        var size = value.position;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write the subtype to the buffer
-        buffer[index++] = value.sub_type;
-
-        // If we have binary type 2 the 4 first bytes are the size
-        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
-          buffer[index++] = size & 0xff;
-          buffer[index++] = (size >> 8) & 0xff;
-          buffer[index++] = (size >> 16) & 0xff;
-          buffer[index++] = (size >> 24) & 0xff;
-        }
-
-        // Write the data to the object
-        supportsBuffer ? data.copy(buffer, index, 0, value.position) : buffer.set(data, index);
-        // Ajust index
-        index = index + value.position;
-        return index;
-      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_SYMBOL;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Calculate size
-        var size = supportsBuffer ? Buffer.byteLength(value.value) + 1 : numberOfBytes(value.value) + 1;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write the string
-        buffer.write(value.value, index, 'utf8');
-        // Update index
-        index = index + size - 1;
-        // Write zero
-        buffer[index++] = 0x00;
-        return index;
-      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_OBJECT;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-        // Set up correct object for serialization
-        var ordered_values = {
-            '$ref': value.namespace
-          , '$id' : value.oid
-        };
-
-        // Add db reference if it exists
-        if(null != value.db) {
-          ordered_values['$db'] = value.db;
-        }
-
-        // Message size
-        var size = BSON.calculateObjectSize(ordered_values, serializeFunctions);
-        // Serialize the object
-        var endIndex = BSON.serializeWithBufferAndIndex(ordered_values, checkKeys, buffer, index, serializeFunctions);
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        // Write zero for object
-        buffer[endIndex++] = 0x00;
-        // Return the end index
-        return endIndex;
-      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_REGEXP;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write the regular expression string
-        supportsBuffer ? buffer.write(value.source, index, 'utf8') : writeToTypedArray(buffer, value.source, index);
-        // Adjust the index
-        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
-        // Write zero
-        buffer[index++] = 0x00;
-        // Write the parameters
-        if(value.global) buffer[index++] = 0x73; // s
-        if(value.ignoreCase) buffer[index++] = 0x69; // i
-        if(value.multiline) buffer[index++] = 0x6d; // m
-        // Add ending zero
-        buffer[index++] = 0x00;
-        return index;
-      } else {
-        // Write the type
-        buffer[index++] = Array.isArray(value) ? BSON.BSON_DATA_ARRAY : BSON.BSON_DATA_OBJECT;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Adjust the index
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-	      var endIndex = serializeObject(value, checkKeys, buffer, index + 4, serializeFunctions);
-        // Write size
-        var size = endIndex - index;
-        // Write the size of the string to buffer
-        buffer[index++] = size & 0xff;
-        buffer[index++] = (size >> 8) & 0xff;
-        buffer[index++] = (size >> 16) & 0xff;
-        buffer[index++] = (size >> 24) & 0xff;
-        return endIndex;
-      }
-    case 'function':
-      // WTF for 0.4.X where typeof /someregexp/ === 'function'
-      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
-        // Write the type
-        buffer[index++] = BSON.BSON_DATA_REGEXP;
-        // Number of written bytes
-        var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-        // Encode the name
-        index = index + numberOfWrittenBytes + 1;
-        buffer[index - 1] = 0;
-
-        // Write the regular expression string
-        buffer.write(value.source, index, 'utf8');
-        // Adjust the index
-        index = index + (supportsBuffer ? Buffer.byteLength(value.source) : numberOfBytes(value.source));
-        // Write zero
-        buffer[index++] = 0x00;
-        // Write the parameters
-        if(value.global) buffer[index++] = 0x73; // s
-        if(value.ignoreCase) buffer[index++] = 0x69; // i
-        if(value.multiline) buffer[index++] = 0x6d; // m
-        // Add ending zero
-        buffer[index++] = 0x00;
-        return index;
-      } else {
-        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
-          // Write the type
-          buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Calculate the scope size
-          var scopeSize = BSON.calculateObjectSize(value.scope, serializeFunctions);
-          // Function string
-          var functionString = value.toString();
-          // Function Size
-          var codeSize = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-
-          // Calculate full size of the object
-          var totalSize = 4 + codeSize + scopeSize;
-
-          // Write the total size of the object
-          buffer[index++] = totalSize & 0xff;
-          buffer[index++] = (totalSize >> 8) & 0xff;
-          buffer[index++] = (totalSize >> 16) & 0xff;
-          buffer[index++] = (totalSize >> 24) & 0xff;
-
-          // Write the size of the string to buffer
-          buffer[index++] = codeSize & 0xff;
-          buffer[index++] = (codeSize >> 8) & 0xff;
-          buffer[index++] = (codeSize >> 16) & 0xff;
-          buffer[index++] = (codeSize >> 24) & 0xff;
-
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + codeSize - 1;
-          // Write zero
-          buffer[index++] = 0;
-          // Serialize the scope object
-          var scopeObjectBuffer = new Buffer(scopeSize);
-          // Execute the serialization into a seperate buffer
-          serializeObject(value.scope, checkKeys, scopeObjectBuffer, 0, serializeFunctions);
-
-          // Adjusted scope Size (removing the header)
-          var scopeDocSize = scopeSize - 4;
-          // Write scope object size
-          buffer[index++] = scopeDocSize & 0xff;
-          buffer[index++] = (scopeDocSize >> 8) & 0xff;
-          buffer[index++] = (scopeDocSize >> 16) & 0xff;
-          buffer[index++] = (scopeDocSize >> 24) & 0xff;
-
-          // Write the scopeObject into the buffer
-          scopeObjectBuffer.copy(buffer, index, 0, scopeSize);
-
-          // Adjust index, removing the empty size of the doc (5 bytes 0000000005)
-          index = index + scopeDocSize - 5;
-          // Write trailing zero
-          buffer[index++] = 0;
-          return index
-        } else if(serializeFunctions) {
-          buffer[index++] = BSON.BSON_DATA_CODE;
-          // Number of written bytes
-          var numberOfWrittenBytes = supportsBuffer ? buffer.write(name, index, 'utf8') : writeToTypedArray(buffer, name, index);
-          // Encode the name
-          index = index + numberOfWrittenBytes + 1;
-          buffer[index - 1] = 0;
-          // Function string
-          var functionString = value.toString();
-          // Function Size
-          var size = supportsBuffer ? Buffer.byteLength(functionString) + 1 : numberOfBytes(functionString) + 1;
-          // Write the size of the string to buffer
-          buffer[index++] = size & 0xff;
-          buffer[index++] = (size >> 8) & 0xff;
-          buffer[index++] = (size >> 16) & 0xff;
-          buffer[index++] = (size >> 24) & 0xff;
-          // Write the string
-          supportsBuffer ? buffer.write(functionString, index, 'utf8') : writeToTypedArray(buffer, functionString, index);
-          // Update index
-          index = index + size - 1;
-          // Write zero
-          buffer[index++] = 0;
-          return index;
-        }
-      }
-  }
-
-  // If no value to serialize
-  return index;
-}
-
-/**
- * Serialize a Javascript object.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Buffer} returns the Buffer object containing the serialized object.
- * @api public
- */
-BSON.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
-  // Throw error if we are trying serialize an illegal type
-  if(object == null || typeof object != 'object' || Array.isArray(object)) 
-    throw new Error("Only javascript objects supported");
-  
-  // Emoty target buffer
-  var buffer = null;
-  // Calculate the size of the object
-  var size = BSON.calculateObjectSize(object, serializeFunctions);
-  // Fetch the best available type for storing the binary data
-  if(buffer = typeof Buffer != 'undefined') {
-    buffer = new Buffer(size);
-    asBuffer = true;
-  } else if(typeof Uint8Array != 'undefined') {
-    buffer = new Uint8Array(new ArrayBuffer(size));
-  } else {
-    buffer = new Array(size);
-  }
-
-  // If asBuffer is false use typed arrays
-  BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, 0, serializeFunctions);
-  return buffer;
-}
-
-/**
- * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
- *
- * @ignore
- * @api private
- */
-var functionCache = BSON.functionCache = {};
-
-/**
- * Crc state variables shared by function
- *
- * @ignore
- * @api private
- */
-var table = [0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3, 0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91, 0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7, 0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5, 0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B, 0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59, 0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F, 0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D, 0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433, 0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01, 0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457, 0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65, 0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB, 0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9, 0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F, 0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD, 0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683, 0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1, 0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7, 0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5, 0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B, 0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79, 0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F, 0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D, 0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713, 0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21, 0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777, 0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45, 0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB, 0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9, 0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF, 0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D];
-
-/**
- * CRC32 hash method, Fast and enough versitility for our usage
- *
- * @ignore
- * @api private
- */
-var crc32 =  function(string, start, end) {
-  var crc = 0
-  var x = 0;
-  var y = 0;
-  crc = crc ^ (-1);
-
-  for(var i = start, iTop = end; i < iTop;i++) {
-  	y = (crc ^ string[i]) & 0xFF;
-    x = table[y];
-  	crc = (crc >>> 8) ^ x;
-  }
-
-  return crc ^ (-1);
-}
-
-/**
- * Deserialize stream data as BSON documents.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *  - **promoteLongs** {Boolean, default:true}, when deserializing a Long will fit it into a Number if it's smaller than 53 bits
- *
- * @param {Buffer} data the buffer containing the serialized set of BSON documents.
- * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
- * @param {Number} numberOfDocuments number of documents to deserialize.
- * @param {Array} documents an array where to store the deserialized documents.
- * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
- * @api public
- */
-BSON.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
-  // if(numberOfDocuments !== documents.length) throw new Error("Number of expected results back is less than the number of documents");
-  options = options != null ? options : {};
-  var index = startIndex;
-  // Loop over all documents
-  for(var i = 0; i < numberOfDocuments; i++) {
-    // Find size of the document
-    var size = data[index] | data[index + 1] << 8 | data[index + 2] << 16 | data[index + 3] << 24;
-    // Update options with index
-    options['index'] = index;
-    // Parse the document at this point
-    documents[docStartIndex + i] = BSON.deserialize(data, options);
-    // Adjust index by the document size
-    index = index + size;
-  }
-
-  // Return object containing end index of parsing and list of documents
-  return index;
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEvalWithHash = function(functionCache, hash, functionString, object) {
-  // Contains the value we are going to set
-  var value = null;
-
-  // Check for cache hit, eval if missing and return cached function
-  if(functionCache[hash] == null) {
-    eval("value = " + functionString);
-    functionCache[hash] = value;
-  }
-  // Set the object
-  return functionCache[hash].bind(object);
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEval = function(functionString) {
-  // Contains the value we are going to set
-  var value = null;
-  // Eval the function
-  eval("value = " + functionString);
-  return value;
-}
-
-/**
- * Convert Uint8Array to String
- *
- * @ignore
- * @api private
- */
-var convertUint8ArrayToUtf8String = function(byteArray, startIndex, endIndex) {
-  return BinaryParser.decode_utf8(convertArraytoUtf8BinaryString(byteArray, startIndex, endIndex));
-}
-
-var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
-  var result = "";
-  for(var i = startIndex; i < endIndex; i++) {
-    result = result + String.fromCharCode(byteArray[i]);
-  }
-
-  return result;
-};
-
-/**
- * Deserialize data as BSON.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *  - **promoteLongs** {Boolean, default:true}, when deserializing a Long will fit it into a Number if it's smaller than 53 bits
- *
- * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @param {Boolean} [isArray] ignore used for recursive parsing.
- * @return {Object} returns the deserialized Javascript Object.
- * @api public
- */
-BSON.deserialize = function(buffer, options, isArray) {
-  // Options
-  options = options == null ? {} : options;
-  var evalFunctions = options['evalFunctions'] == null ? false : options['evalFunctions'];
-  var cacheFunctions = options['cacheFunctions'] == null ? false : options['cacheFunctions'];
-  var cacheFunctionsCrc32 = options['cacheFunctionsCrc32'] == null ? false : options['cacheFunctionsCrc32'];
-  var promoteLongs = options['promoteLongs'] || true;
-
-  // Validate that we have at least 4 bytes of buffer
-  if(buffer.length < 5) throw new Error("corrupt bson message < 5 bytes long");
-
-  // Set up index
-  var index = typeof options['index'] == 'number' ? options['index'] : 0;
-  // Reads in a C style string
-  var readCStyleString = function() {
-    // Get the start search index
-    var i = index;
-    // Locate the end of the c string
-    while(buffer[i] !== 0x00) { i++ }
-    // Grab utf8 encoded string
-    var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, i) : convertUint8ArrayToUtf8String(buffer, index, i);
-    // Update index position
-    index = i + 1;
-    // Return string
-    return string;
-  }
-
-  // Create holding object
-  var object = isArray ? [] : {};
-
-  // Read the document size
-  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-  // Ensure buffer is valid size
-  if(size < 5 || size > buffer.length) throw new Error("corrupt bson message");
-
-  // While we have more left data left keep parsing
-  while(true) {
-    // Read the type
-    var elementType = buffer[index++];
-    // If we get a zero it's the last byte, exit
-    if(elementType == 0) break;
-    // Read the name of the field
-    var name = readCStyleString();
-    // Switch on the type
-    switch(elementType) {
-      case BSON.BSON_DATA_OID:
-        var string = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('binary', index, index + 12) : convertArraytoUtf8BinaryString(buffer, index, index + 12);
-        // Decode the oid
-        object[name] = new ObjectID(string);
-        // Update index
-        index = index + 12;
-        break;
-      case BSON.BSON_DATA_STRING:
-        // Read the content of the field
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Add string to object
-        object[name] = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
-        // Update parse index position
-        index = index + stringSize;
-        break;
-      case BSON.BSON_DATA_INT:
-        // Decode the 32bit value
-        object[name] = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        break;
-      case BSON.BSON_DATA_NUMBER:
-        // Decode the double value
-        object[name] = readIEEE754(buffer, index, 'little', 52, 8);
-        // Update the index
-        index = index + 8;
-        break;
-      case BSON.BSON_DATA_DATE:
-        // Unpack the low and high bits
-        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Set date object
-        object[name] = new Date(new Long(lowBits, highBits).toNumber());
-        break;
-      case BSON.BSON_DATA_BOOLEAN:
-        // Parse the boolean value
-        object[name] = buffer[index++] == 1;
-        break;
-      case BSON.BSON_DATA_NULL:
-        // Parse the boolean value
-        object[name] = null;
-        break;
-      case BSON.BSON_DATA_BINARY:
-        // Decode the size of the binary blob
-        var binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Decode the subtype
-        var subType = buffer[index++];
-        // Decode as raw Buffer object if options specifies it
-        if(buffer['slice'] != null) {
-          // If we have subtype 2 skip the 4 bytes for the size
-          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
-            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-          }
-          // Slice the data
-          object[name] = new Binary(buffer.slice(index, index + binarySize), subType);
-        } else {
-          var _buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(binarySize)) : new Array(binarySize);
-          // If we have subtype 2 skip the 4 bytes for the size
-          if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
-            binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-          }
-          // Copy the data
-          for(var i = 0; i < binarySize; i++) {
-            _buffer[i] = buffer[index + i];
-          }
-          // Create the binary object
-          object[name] = new Binary(_buffer, subType);
-        }
-        // Update the index
-        index = index + binarySize;
-        break;
-      case BSON.BSON_DATA_ARRAY:
-        options['index'] = index;
-        // Decode the size of the array document
-        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-        // Set the array to the object
-        object[name] = BSON.deserialize(buffer, options, true);
-        // Adjust the index
-        index = index + objectSize;
-        break;
-      case BSON.BSON_DATA_OBJECT:
-        options['index'] = index;
-        // Decode the size of the object document
-        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-        // Set the array to the object
-        object[name] = BSON.deserialize(buffer, options, false);
-        // Adjust the index
-        index = index + objectSize;
-        break;
-      case BSON.BSON_DATA_REGEXP:
-        // Create the regexp
-        var source = readCStyleString();
-        var regExpOptions = readCStyleString();
-        // For each option add the corresponding one for javascript
-        var optionsArray = new Array(regExpOptions.length);
-
-        // Parse options
-        for(var i = 0; i < regExpOptions.length; i++) {
-          switch(regExpOptions[i]) {
-            case 'm':
-              optionsArray[i] = 'm';
-              break;
-            case 's':
-              optionsArray[i] = 'g';
-              break;
-            case 'i':
-              optionsArray[i] = 'i';
-              break;
-          }
-        }
-
-        object[name] = new RegExp(source, optionsArray.join(''));
-        break;
-      case BSON.BSON_DATA_LONG:
-        // Unpack the low and high bits
-        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Create long object
-        var long = new Long(lowBits, highBits); 
-        // Promote the long if possible
-        if(promoteLongs) {
-          object[name] = long.lessThanOrEqual(JS_INT_MAX_LONG) && long.greaterThanOrEqual(JS_INT_MIN_LONG) ? long.toNumber() : long;
-        } else {
-          object[name] = long;
-        }
-        break;
-      case BSON.BSON_DATA_SYMBOL:
-        // Read the content of the field
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Add string to object
-        object[name] = new Symbol(buffer.toString('utf8', index, index + stringSize - 1));
-        // Update parse index position
-        index = index + stringSize;
-        break;
-      case BSON.BSON_DATA_TIMESTAMP:
-        // Unpack the low and high bits
-        var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Set the object
-        object[name] = new Timestamp(lowBits, highBits);
-        break;
-      case BSON.BSON_DATA_MIN_KEY:
-        // Parse the object
-        object[name] = new MinKey();
-        break;
-      case BSON.BSON_DATA_MAX_KEY:
-        // Parse the object
-        object[name] = new MaxKey();
-        break;
-      case BSON.BSON_DATA_CODE:
-        // Read the content of the field
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Function string
-        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
-
-        // If we are evaluating the functions
-        if(evalFunctions) {
-          // Contains the value we are going to set
-          var value = null;
-          // If we have cache enabled let's look for the md5 of the function in the cache
-          if(cacheFunctions) {
-            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
-            // Got to do this to avoid V8 deoptimizing the call due to finding eval
-            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
-          } else {
-            // Set directly
-            object[name] = isolateEval(functionString);
-          }
-        } else {
-          object[name]  = new Code(functionString, {});
-        }
-
-        // Update parse index position
-        index = index + stringSize;
-        break;
-      case BSON.BSON_DATA_CODE_W_SCOPE:
-        // Read the content of the field
-        var totalSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-        // Javascript function
-        var functionString = supportsBuffer && Buffer.isBuffer(buffer) ? buffer.toString('utf8', index, index + stringSize - 1) : convertUint8ArrayToUtf8String(buffer, index, index + stringSize - 1);
-        // Update parse index position
-        index = index + stringSize;
-        // Parse the element
-        options['index'] = index;
-        // Decode the size of the object document
-        var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-        // Decode the scope object
-        var scopeObject = BSON.deserialize(buffer, options, false);
-        // Adjust the index
-        index = index + objectSize;
-
-        // If we are evaluating the functions
-        if(evalFunctions) {
-          // Contains the value we are going to set
-          var value = null;
-          // If we have cache enabled let's look for the md5 of the function in the cache
-          if(cacheFunctions) {
-            var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
-            // Got to do this to avoid V8 deoptimizing the call due to finding eval
-            object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
-          } else {
-            // Set directly
-            object[name] = isolateEval(functionString);
-          }
-
-          // Set the scope on the object
-          object[name].scope = scopeObject;
-        } else {
-          object[name]  = new Code(functionString, scopeObject);
-        }
-
-        // Add string to object
-        break;
-    }
-  }
-
-  // Check if we have a db ref object
-  if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
-
-  // Return the final objects
-  return object;
-}
-
-/**
- * Check if key name is valid.
- *
- * @ignore
- * @api private
- */
-BSON.checkKey = function checkKey (key, dollarsAndDotsOk) {
-  if (!key.length) return;
-  // Check if we have a legal key for the object
-  if (!!~key.indexOf("\x00")) {
-    // The BSON spec doesn't allow keys with null bytes because keys are
-    // null-terminated.
-    throw Error("key " + key + " must not contain null bytes");
-  }
-  if (!dollarsAndDotsOk) {
-    if('$' == key[0]) {
-      throw Error("key " + key + " must not start with '$'");
-    } else if (!!~key.indexOf('.')) {
-      throw Error("key " + key + " must not contain '.'");
-    }
-  }
-};
-
-/**
- * Deserialize data as BSON.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *
- * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @param {Boolean} [isArray] ignore used for recursive parsing.
- * @return {Object} returns the deserialized Javascript Object.
- * @api public
- */
-BSON.prototype.deserialize = function(data, options) {
-  return BSON.deserialize(data, options);
-}
-
-/**
- * Deserialize stream data as BSON documents.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *
- * @param {Buffer} data the buffer containing the serialized set of BSON documents.
- * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
- * @param {Number} numberOfDocuments number of documents to deserialize.
- * @param {Array} documents an array where to store the deserialized documents.
- * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
- * @api public
- */
-BSON.prototype.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
-  return BSON.deserializeStream(data, startIndex, numberOfDocuments, documents, docStartIndex, options);
-}
-
-/**
- * Serialize a Javascript object.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Buffer} returns the Buffer object containing the serialized object.
- * @api public
- */
-BSON.prototype.serialize = function(object, checkKeys, asBuffer, serializeFunctions) {
-  return BSON.serialize(object, checkKeys, asBuffer, serializeFunctions);
-}
-
-/**
- * Calculate the bson size for a passed in Javascript object.
- *
- * @param {Object} object the Javascript object to calculate the BSON byte size for.
- * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
- * @return {Number} returns the number of bytes the BSON object will take up.
- * @api public
- */
-BSON.prototype.calculateObjectSize = function(object, serializeFunctions) {
-  return BSON.calculateObjectSize(object, serializeFunctions);
-}
-
-/**
- * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
- * @param {Number} index the index in the buffer where we wish to start serializing into.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Number} returns the new write index in the Buffer.
- * @api public
- */
-BSON.prototype.serializeWithBufferAndIndex = function(object, checkKeys, buffer, startIndex, serializeFunctions) {
-  return BSON.serializeWithBufferAndIndex(object, checkKeys, buffer, startIndex, serializeFunctions);
-}
-
-/**
- * @ignore
- * @api private
- */
-exports.Code = Code;
-exports.Symbol = Symbol;
-exports.BSON = BSON;
-exports.DBRef = DBRef;
-exports.Binary = Binary;
-exports.ObjectID = ObjectID;
-exports.Long = Long;
-exports.Timestamp = Timestamp;
-exports.Double = Double;
-exports.MinKey = MinKey;
-exports.MaxKey = MaxKey;
-
-}, 
-
-
-
-'code': function(module, exports, global, require, undefined){
-  /**
- * A class representation of the BSON Code type.
- *
- * @class Represents the BSON Code type.
- * @param {String|Function} code a string or function.
- * @param {Object} [scope] an optional scope for the function.
- * @return {Code}
- */
-function Code(code, scope) {
-  if(!(this instanceof Code)) return new Code(code, scope);
-  
-  this._bsontype = 'Code';
-  this.code = code;
-  this.scope = scope == null ? {} : scope;
-};
-
-/**
- * @ignore
- * @api private
- */
-Code.prototype.toJSON = function() {
-  return {scope:this.scope, code:this.code};
-}
-
-exports.Code = Code;
-}, 
-
-
-
-'db_ref': function(module, exports, global, require, undefined){
-  /**
- * A class representation of the BSON DBRef type.
- *
- * @class Represents the BSON DBRef type.
- * @param {String} namespace the collection name.
- * @param {ObjectID} oid the reference ObjectID.
- * @param {String} [db] optional db name, if omitted the reference is local to the current db.
- * @return {DBRef}
- */
-function DBRef(namespace, oid, db) {
-  if(!(this instanceof DBRef)) return new DBRef(namespace, oid, db);
-  
-  this._bsontype = 'DBRef';
-  this.namespace = namespace;
-  this.oid = oid;
-  this.db = db;
-};
-
-/**
- * @ignore
- * @api private
- */
-DBRef.prototype.toJSON = function() {
-  return {
-    '$ref':this.namespace,
-    '$id':this.oid,
-    '$db':this.db == null ? '' : this.db
-  };
-}
-
-exports.DBRef = DBRef;
-}, 
-
-
-
-'double': function(module, exports, global, require, undefined){
-  /**
- * A class representation of the BSON Double type.
- *
- * @class Represents the BSON Double type.
- * @param {Number} value the number we want to represent as a double.
- * @return {Double}
- */
-function Double(value) {
-  if(!(this instanceof Double)) return new Double(value);
-  
-  this._bsontype = 'Double';
-  this.value = value;
-}
-
-/**
- * Access the number value.
- *
- * @return {Number} returns the wrapped double number.
- * @api public
- */
-Double.prototype.valueOf = function() {
-  return this.value;
-};
-
-/**
- * @ignore
- * @api private
- */
-Double.prototype.toJSON = function() {
-  return this.value;
-}
-
-exports.Double = Double;
-}, 
-
-
-
-'float_parser': function(module, exports, global, require, undefined){
-  // Copyright (c) 2008, Fair Oaks Labs, Inc.
-// All rights reserved.
-// 
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are met:
-// 
-//  * Redistributions of source code must retain the above copyright notice,
-//    this list of conditions and the following disclaimer.
-// 
-//  * Redistributions in binary form must reproduce the above copyright notice,
-//    this list of conditions and the following disclaimer in the documentation
-//    and/or other materials provided with the distribution.
-// 
-//  * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
-//    may be used to endorse or promote products derived from this software
-//    without specific prior written permission.
-// 
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-// ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-// POSSIBILITY OF SUCH DAMAGE.
-//
-//
-// Modifications to writeIEEE754 to support negative zeroes made by Brian White
-
-var readIEEE754 = function(buffer, offset, endian, mLen, nBytes) {
-  var e, m,
-      bBE = (endian === 'big'),
-      eLen = nBytes * 8 - mLen - 1,
-      eMax = (1 << eLen) - 1,
-      eBias = eMax >> 1,
-      nBits = -7,
-      i = bBE ? 0 : (nBytes - 1),
-      d = bBE ? 1 : -1,
-      s = buffer[offset + i];
-
-  i += d;
-
-  e = s & ((1 << (-nBits)) - 1);
-  s >>= (-nBits);
-  nBits += eLen;
-  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8);
-
-  m = e & ((1 << (-nBits)) - 1);
-  e >>= (-nBits);
-  nBits += mLen;
-  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8);
-
-  if (e === 0) {
-    e = 1 - eBias;
-  } else if (e === eMax) {
-    return m ? NaN : ((s ? -1 : 1) * Infinity);
-  } else {
-    m = m + Math.pow(2, mLen);
-    e = e - eBias;
-  }
-  return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
-};
-
-var writeIEEE754 = function(buffer, value, offset, endian, mLen, nBytes) {
-  var e, m, c,
-      bBE = (endian === 'big'),
-      eLen = nBytes * 8 - mLen - 1,
-      eMax = (1 << eLen) - 1,
-      eBias = eMax >> 1,
-      rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0),
-      i = bBE ? (nBytes-1) : 0,
-      d = bBE ? -1 : 1,
-      s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
-
-  value = Math.abs(value);
-
-  if (isNaN(value) || value === Infinity) {
-    m = isNaN(value) ? 1 : 0;
-    e = eMax;
-  } else {
-    e = Math.floor(Math.log(value) / Math.LN2);
-    if (value * (c = Math.pow(2, -e)) < 1) {
-      e--;
-      c *= 2;
-    }
-    if (e+eBias >= 1) {
-      value += rt / c;
-    } else {
-      value += rt * Math.pow(2, 1 - eBias);
-    }
-    if (value * c >= 2) {
-      e++;
-      c /= 2;
-    }
-
-    if (e + eBias >= eMax) {
-      m = 0;
-      e = eMax;
-    } else if (e + eBias >= 1) {
-      m = (value * c - 1) * Math.pow(2, mLen);
-      e = e + eBias;
-    } else {
-      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
-      e = 0;
-    }
-  }
-
-  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8);
-
-  e = (e << mLen) | m;
-  eLen += mLen;
-  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8);
-
-  buffer[offset + i - d] |= s * 128;
-};
-
-exports.readIEEE754 = readIEEE754;
-exports.writeIEEE754 = writeIEEE754;
-}, 
-
-
-
-'index': function(module, exports, global, require, undefined){
-  try {
-  exports.BSONPure = require('./bson');
-  exports.BSONNative = require('../../ext');
-} catch(err) {
-  // do nothing
-}
-
-[ './binary_parser'
-  , './binary'
-  , './code'
-  , './db_ref'
-  , './double'
-  , './max_key'
-  , './min_key'
-  , './objectid'
-  , './symbol'
-  , './timestamp'
-  , './long'].forEach(function (path) {
-  	var module = require('./' + path);
-  	for (var i in module) {
-  		exports[i] = module[i];
-    }
-});
-
-// Exports all the classes for the NATIVE JS BSON Parser
-exports.native = function() {
-  var classes = {};
-  // Map all the classes
-  [ './binary_parser'
-    , './binary'
-    , './code'
-    , './db_ref'
-    , './double'
-    , './max_key'
-    , './min_key'
-    , './objectid'
-    , './symbol'
-    , './timestamp'
-    , './long'
-    , '../../ext'
-].forEach(function (path) {
-    	var module = require('./' + path);
-    	for (var i in module) {
-    		classes[i] = module[i];
-      }
-  });
-  // Return classes list
-  return classes;
-}
-
-// Exports all the classes for the PURE JS BSON Parser
-exports.pure = function() {
-  var classes = {};
-  // Map all the classes
-  [ './binary_parser'
-    , './binary'
-    , './code'
-    , './db_ref'
-    , './double'
-    , './max_key'
-    , './min_key'
-    , './objectid'
-    , './symbol'
-    , './timestamp'
-    , './long'
-    , '././bson'].forEach(function (path) {
-    	var module = require('./' + path);
-    	for (var i in module) {
-    		classes[i] = module[i];
-      }
-  });
-  // Return classes list
-  return classes;
-}
-
-}, 
-
-
-
-'long': function(module, exports, global, require, undefined){
-  // Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//
-// Copyright 2009 Google Inc. All Rights Reserved
-
-/**
- * Defines a Long class for representing a 64-bit two's-complement
- * integer value, which faithfully simulates the behavior of a Java "Long". This
- * implementation is derived from LongLib in GWT.
- *
- * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
- * values as *signed* integers.  See the from* functions below for more
- * convenient ways of constructing Longs.
- *
- * The internal representation of a Long is the two given signed, 32-bit values.
- * We use 32-bit pieces because these are the size of integers on which
- * Javascript performs bit-operations.  For operations like addition and
- * multiplication, we split each number into 16-bit pieces, which can easily be
- * multiplied within Javascript's floating-point representation without overflow
- * or change in sign.
- *
- * In the algorithms below, we frequently reduce the negative case to the
- * positive case by negating the input(s) and then post-processing the result.
- * Note that we must ALWAYS check specially whether those values are MIN_VALUE
- * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
- * a positive number, it overflows back into a negative).  Not handling this
- * case would often result in infinite recursion.
- *
- * @class Represents the BSON Long type.
- * @param {Number} low  the low (signed) 32 bits of the Long.
- * @param {Number} high the high (signed) 32 bits of the Long.
- */
-function Long(low, high) {
-  if(!(this instanceof Long)) return new Long(low, high);
-  
-  this._bsontype = 'Long';
-  /**
-   * @type {number}
-   * @api private
-   */
-  this.low_ = low | 0;  // force into 32 signed bits.
-
-  /**
-   * @type {number}
-   * @api private
-   */
-  this.high_ = high | 0;  // force into 32 signed bits.
-};
-
-/**
- * Return the int value.
- *
- * @return {Number} the value, assuming it is a 32-bit integer.
- * @api public
- */
-Long.prototype.toInt = function() {
-  return this.low_;
-};
-
-/**
- * Return the Number value.
- *
- * @return {Number} the closest floating-point representation to this value.
- * @api public
- */
-Long.prototype.toNumber = function() {
-  return this.high_ * Long.TWO_PWR_32_DBL_ +
-         this.getLowBitsUnsigned();
-};
-
-/**
- * Return the JSON value.
- *
- * @return {String} the JSON representation.
- * @api public
- */
-Long.prototype.toJSON = function() {
-  return this.toString();
-}
-
-/**
- * Return the String value.
- *
- * @param {Number} [opt_radix] the radix in which the text should be written.
- * @return {String} the textual representation of this value.
- * @api public
- */
-Long.prototype.toString = function(opt_radix) {
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (this.isZero()) {
-    return '0';
-  }
-
-  if (this.isNegative()) {
-    if (this.equals(Long.MIN_VALUE)) {
-      // We need to change the Long value before it can be negated, so we remove
-      // the bottom-most digit in this base and then recurse to do the rest.
-      var radixLong = Long.fromNumber(radix);
-      var div = this.div(radixLong);
-      var rem = div.multiply(radixLong).subtract(this);
-      return div.toString(radix) + rem.toInt().toString(radix);
-    } else {
-      return '-' + this.negate().toString(radix);
-    }
-  }
-
-  // Do several (6) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Long.fromNumber(Math.pow(radix, 6));
-
-  var rem = this;
-  var result = '';
-  while (true) {
-    var remDiv = rem.div(radixToPower);
-    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
-    var digits = intval.toString(radix);
-
-    rem = remDiv;
-    if (rem.isZero()) {
-      return digits + result;
-    } else {
-      while (digits.length < 6) {
-        digits = '0' + digits;
-      }
-      result = '' + digits + result;
-    }
-  }
-};
-
-/**
- * Return the high 32-bits value.
- *
- * @return {Number} the high 32-bits as a signed value.
- * @api public
- */
-Long.prototype.getHighBits = function() {
-  return this.high_;
-};
-
-/**
- * Return the low 32-bits value.
- *
- * @return {Number} the low 32-bits as a signed value.
- * @api public
- */
-Long.prototype.getLowBits = function() {
-  return this.low_;
-};
-
-/**
- * Return the low unsigned 32-bits value.
- *
- * @return {Number} the low 32-bits as an unsigned value.
- * @api public
- */
-Long.prototype.getLowBitsUnsigned = function() {
-  return (this.low_ >= 0) ?
-      this.low_ : Long.TWO_PWR_32_DBL_ + this.low_;
-};
-
-/**
- * Returns the number of bits needed to represent the absolute value of this Long.
- *
- * @return {Number} Returns the number of bits needed to represent the absolute value of this Long.
- * @api public
- */
-Long.prototype.getNumBitsAbs = function() {
-  if (this.isNegative()) {
-    if (this.equals(Long.MIN_VALUE)) {
-      return 64;
-    } else {
-      return this.negate().getNumBitsAbs();
-    }
-  } else {
-    var val = this.high_ != 0 ? this.high_ : this.low_;
-    for (var bit = 31; bit > 0; bit--) {
-      if ((val & (1 << bit)) != 0) {
-        break;
-      }
-    }
-    return this.high_ != 0 ? bit + 33 : bit + 1;
-  }
-};
-
-/**
- * Return whether this value is zero.
- *
- * @return {Boolean} whether this value is zero.
- * @api public
- */
-Long.prototype.isZero = function() {
-  return this.high_ == 0 && this.low_ == 0;
-};
-
-/**
- * Return whether this value is negative.
- *
- * @return {Boolean} whether this value is negative.
- * @api public
- */
-Long.prototype.isNegative = function() {
-  return this.high_ < 0;
-};
-
-/**
- * Return whether this value is odd.
- *
- * @return {Boolean} whether this value is odd.
- * @api public
- */
-Long.prototype.isOdd = function() {
-  return (this.low_ & 1) == 1;
-};
-
-/**
- * Return whether this Long equals the other
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} whether this Long equals the other
- * @api public
- */
-Long.prototype.equals = function(other) {
-  return (this.high_ == other.high_) && (this.low_ == other.low_);
-};
-
-/**
- * Return whether this Long does not equal the other.
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} whether this Long does not equal the other.
- * @api public
- */
-Long.prototype.notEquals = function(other) {
-  return (this.high_ != other.high_) || (this.low_ != other.low_);
-};
-
-/**
- * Return whether this Long is less than the other.
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} whether this Long is less than the other.
- * @api public
- */
-Long.prototype.lessThan = function(other) {
-  return this.compare(other) < 0;
-};
-
-/**
- * Return whether this Long is less than or equal to the other.
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} whether this Long is less than or equal to the other.
- * @api public
- */
-Long.prototype.lessThanOrEqual = function(other) {
-  return this.compare(other) <= 0;
-};
-
-/**
- * Return whether this Long is greater than the other.
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} whether this Long is greater than the other.
- * @api public
- */
-Long.prototype.greaterThan = function(other) {
-  return this.compare(other) > 0;
-};
-
-/**
- * Return whether this Long is greater than or equal to the other.
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} whether this Long is greater than or equal to the other.
- * @api public
- */
-Long.prototype.greaterThanOrEqual = function(other) {
-  return this.compare(other) >= 0;
-};
-
-/**
- * Compares this Long with the given one.
- *
- * @param {Long} other Long to compare against.
- * @return {Boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
- * @api public
- */
-Long.prototype.compare = function(other) {
-  if (this.equals(other)) {
-    return 0;
-  }
-
-  var thisNeg = this.isNegative();
-  var otherNeg = other.isNegative();
-  if (thisNeg && !otherNeg) {
-    return -1;
-  }
-  if (!thisNeg && otherNeg) {
-    return 1;
-  }
-
-  // at this point, the signs are the same, so subtraction will not overflow
-  if (this.subtract(other).isNegative()) {
-    return -1;
-  } else {
-    return 1;
-  }
-};
-
-/**
- * The negation of this value.
- *
- * @return {Long} the negation of this value.
- * @api public
- */
-Long.prototype.negate = function() {
-  if (this.equals(Long.MIN_VALUE)) {
-    return Long.MIN_VALUE;
-  } else {
-    return this.not().add(Long.ONE);
-  }
-};
-
-/**
- * Returns the sum of this and the given Long.
- *
- * @param {Long} other Long to add to this one.
- * @return {Long} the sum of this and the given Long.
- * @api public
- */
-Long.prototype.add = function(other) {
-  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 + b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 + b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 + b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 + b48;
-  c48 &= 0xFFFF;
-  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns the difference of this and the given Long.
- *
- * @param {Long} other Long to subtract from this.
- * @return {Long} the difference of this and the given Long.
- * @api public
- */
-Long.prototype.subtract = function(other) {
-  return this.add(other.negate());
-};
-
-/**
- * Returns the product of this and the given Long.
- *
- * @param {Long} other Long to multiply with this.
- * @return {Long} the product of this and the other.
- * @api public
- */
-Long.prototype.multiply = function(other) {
-  if (this.isZero()) {
-    return Long.ZERO;
-  } else if (other.isZero()) {
-    return Long.ZERO;
-  }
-
-  if (this.equals(Long.MIN_VALUE)) {
-    return other.isOdd() ? Long.MIN_VALUE : Long.ZERO;
-  } else if (other.equals(Long.MIN_VALUE)) {
-    return this.isOdd() ? Long.MIN_VALUE : Long.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().multiply(other.negate());
-    } else {
-      return this.negate().multiply(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.multiply(other.negate()).negate();
-  }
-
-  // If both Longs are small, use float multiplication
-  if (this.lessThan(Long.TWO_PWR_24_) &&
-      other.lessThan(Long.TWO_PWR_24_)) {
-    return Long.fromNumber(this.toNumber() * other.toNumber());
-  }
-
-  // Divide each Long into 4 chunks of 16 bits, and then add up 4x4 products.
-  // We can skip products that would overflow.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 * b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 * b00;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c16 += a00 * b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 * b00;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a16 * b16;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a00 * b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
-  c48 &= 0xFFFF;
-  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns this Long divided by the given one.
- *
- * @param {Long} other Long by which to divide.
- * @return {Long} this Long divided by the given one.
- * @api public
- */
-Long.prototype.div = function(other) {
-  if (other.isZero()) {
-    throw Error('division by zero');
-  } else if (this.isZero()) {
-    return Long.ZERO;
-  }
-
-  if (this.equals(Long.MIN_VALUE)) {
-    if (other.equals(Long.ONE) ||
-        other.equals(Long.NEG_ONE)) {
-      return Long.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
-    } else if (other.equals(Long.MIN_VALUE)) {
-      return Long.ONE;
-    } else {
-      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
-      var halfThis = this.shiftRight(1);
-      var approx = halfThis.div(other).shiftLeft(1);
-      if (approx.equals(Long.ZERO)) {
-        return other.isNegative() ? Long.ONE : Long.NEG_ONE;
-      } else {
-        var rem = this.subtract(other.multiply(approx));
-        var result = approx.add(rem.div(other));
-        return result;
-      }
-    }
-  } else if (other.equals(Long.MIN_VALUE)) {
-    return Long.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().div(other.negate());
-    } else {
-      return this.negate().div(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.div(other.negate()).negate();
-  }
-
-  // Repeat the following until the remainder is less than other:  find a
-  // floating-point that approximates remainder / other *from below*, add this
-  // into the result, and subtract it from the remainder.  It is critical that
-  // the approximate value is less than or equal to the real value so that the
-  // remainder never becomes negative.
-  var res = Long.ZERO;
-  var rem = this;
-  while (rem.greaterThanOrEqual(other)) {
-    // Approximate the result of division. This may be a little greater or
-    // smaller than the actual value.
-    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
-
-    // We will tweak the approximate result by changing it in the 48-th digit or
-    // the smallest non-fractional digit, whichever is larger.
-    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
-    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
-
-    // Decrease the approximation until it is smaller than the remainder.  Note
-    // that if it is too large, the product overflows and is negative.
-    var approxRes = Long.fromNumber(approx);
-    var approxRem = approxRes.multiply(other);
-    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
-      approx -= delta;
-      approxRes = Long.fromNumber(approx);
-      approxRem = approxRes.multiply(other);
-    }
-
-    // We know the answer can't be zero... and actually, zero would cause
-    // infinite recursion since we would make no progress.
-    if (approxRes.isZero()) {
-      approxRes = Long.ONE;
-    }
-
-    res = res.add(approxRes);
-    rem = rem.subtract(approxRem);
-  }
-  return res;
-};
-
-/**
- * Returns this Long modulo the given one.
- *
- * @param {Long} other Long by which to mod.
- * @return {Long} this Long modulo the given one.
- * @api public
- */
-Long.prototype.modulo = function(other) {
-  return this.subtract(this.div(other).multiply(other));
-};
-
-/**
- * The bitwise-NOT of this value.
- *
- * @return {Long} the bitwise-NOT of this value.
- * @api public
- */
-Long.prototype.not = function() {
-  return Long.fromBits(~this.low_, ~this.high_);
-};
-
-/**
- * Returns the bitwise-AND of this Long and the given one.
- *
- * @param {Long} other the Long with which to AND.
- * @return {Long} the bitwise-AND of this and the other.
- * @api public
- */
-Long.prototype.and = function(other) {
-  return Long.fromBits(this.low_ & other.low_, this.high_ & other.high_);
-};
-
-/**
- * Returns the bitwise-OR of this Long and the given one.
- *
- * @param {Long} other the Long with which to OR.
- * @return {Long} the bitwise-OR of this and the other.
- * @api public
- */
-Long.prototype.or = function(other) {
-  return Long.fromBits(this.low_ | other.low_, this.high_ | other.high_);
-};
-
-/**
- * Returns the bitwise-XOR of this Long and the given one.
- *
- * @param {Long} other the Long with which to XOR.
- * @return {Long} the bitwise-XOR of this and the other.
- * @api public
- */
-Long.prototype.xor = function(other) {
-  return Long.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
-};
-
-/**
- * Returns this Long with bits shifted to the left by the given amount.
- *
- * @param {Number} numBits the number of bits by which to shift.
- * @return {Long} this shifted to the left by the given amount.
- * @api public
- */
-Long.prototype.shiftLeft = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var low = this.low_;
-    if (numBits < 32) {
-      var high = this.high_;
-      return Long.fromBits(
-                 low << numBits,
-                 (high << numBits) | (low >>> (32 - numBits)));
-    } else {
-      return Long.fromBits(0, low << (numBits - 32));
-    }
-  }
-};
-
-/**
- * Returns this Long with bits shifted to the right by the given amount.
- *
- * @param {Number} numBits the number of bits by which to shift.
- * @return {Long} this shifted to the right by the given amount.
- * @api public
- */
-Long.prototype.shiftRight = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Long.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >> numBits);
-    } else {
-      return Long.fromBits(
-                 high >> (numBits - 32),
-                 high >= 0 ? 0 : -1);
-    }
-  }
-};
-
-/**
- * Returns this Long with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
- *
- * @param {Number} numBits the number of bits by which to shift.
- * @return {Long} this shifted to the right by the given amount, with zeros placed into the new leading bits.
- * @api public
- */
-Long.prototype.shiftRightUnsigned = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Long.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >>> numBits);
-    } else if (numBits == 32) {
-      return Long.fromBits(high, 0);
-    } else {
-      return Long.fromBits(high >>> (numBits - 32), 0);
-    }
-  }
-};
-
-/**
- * Returns a Long representing the given (32-bit) integer value.
- *
- * @param {Number} value the 32-bit integer in question.
- * @return {Long} the corresponding Long value.
- * @api public
- */
-Long.fromInt = function(value) {
-  if (-128 <= value && value < 128) {
-    var cachedObj = Long.INT_CACHE_[value];
-    if (cachedObj) {
-      return cachedObj;
-    }
-  }
-
-  var obj = new Long(value | 0, value < 0 ? -1 : 0);
-  if (-128 <= value && value < 128) {
-    Long.INT_CACHE_[value] = obj;
-  }
-  return obj;
-};
-
-/**
- * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
- *
- * @param {Number} value the number in question.
- * @return {Long} the corresponding Long value.
- * @api public
- */
-Long.fromNumber = function(value) {
-  if (isNaN(value) || !isFinite(value)) {
-    return Long.ZERO;
-  } else if (value <= -Long.TWO_PWR_63_DBL_) {
-    return Long.MIN_VALUE;
-  } else if (value + 1 >= Long.TWO_PWR_63_DBL_) {
-    return Long.MAX_VALUE;
-  } else if (value < 0) {
-    return Long.fromNumber(-value).negate();
-  } else {
-    return new Long(
-               (value % Long.TWO_PWR_32_DBL_) | 0,
-               (value / Long.TWO_PWR_32_DBL_) | 0);
-  }
-};
-
-/**
- * Returns a Long representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
- *
- * @param {Number} lowBits the low 32-bits.
- * @param {Number} highBits the high 32-bits.
- * @return {Long} the corresponding Long value.
- * @api public
- */
-Long.fromBits = function(lowBits, highBits) {
-  return new Long(lowBits, highBits);
-};
-
-/**
- * Returns a Long representation of the given string, written using the given radix.
- *
- * @param {String} str the textual representation of the Long.
- * @param {Number} opt_radix the radix in which the text is written.
- * @return {Long} the corresponding Long value.
- * @api public
- */
-Long.fromString = function(str, opt_radix) {
-  if (str.length == 0) {
-    throw Error('number format error: empty string');
-  }
-
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (str.charAt(0) == '-') {
-    return Long.fromString(str.substring(1), radix).negate();
-  } else if (str.indexOf('-') >= 0) {
-    throw Error('number format error: interior "-" character: ' + str);
-  }
-
-  // Do several (8) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Long.fromNumber(Math.pow(radix, 8));
-
-  var result = Long.ZERO;
-  for (var i = 0; i < str.length; i += 8) {
-    var size = Math.min(8, str.length - i);
-    var value = parseInt(str.substring(i, i + size), radix);
-    if (size < 8) {
-      var power = Long.fromNumber(Math.pow(radix, size));
-      result = result.multiply(power).add(Long.fromNumber(value));
-    } else {
-      result = result.multiply(radixToPower);
-      result = result.add(Long.fromNumber(value));
-    }
-  }
-  return result;
-};
-
-// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
-// from* methods on which they depend.
-
-
-/**
- * A cache of the Long representations of small integer values.
- * @type {Object}
- * @api private
- */
-Long.INT_CACHE_ = {};
-
-// NOTE: the compiler should inline these constant values below and then remove
-// these variables, so there should be no runtime penalty for these.
-
-/**
- * Number used repeated below in calculations.  This must appear before the
- * first call to any from* function below.
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_16_DBL_ = 1 << 16;
-
-/**
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_24_DBL_ = 1 << 24;
-
-/**
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_32_DBL_ = Long.TWO_PWR_16_DBL_ * Long.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_31_DBL_ = Long.TWO_PWR_32_DBL_ / 2;
-
-/**
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_48_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_64_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_32_DBL_;
-
-/**
- * @type {number}
- * @api private
- */
-Long.TWO_PWR_63_DBL_ = Long.TWO_PWR_64_DBL_ / 2;
-
-/** @type {Long} */
-Long.ZERO = Long.fromInt(0);
-
-/** @type {Long} */
-Long.ONE = Long.fromInt(1);
-
-/** @type {Long} */
-Long.NEG_ONE = Long.fromInt(-1);
-
-/** @type {Long} */
-Long.MAX_VALUE =
-    Long.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
-
-/** @type {Long} */
-Long.MIN_VALUE = Long.fromBits(0, 0x80000000 | 0);
-
-/**
- * @type {Long}
- * @api private
- */
-Long.TWO_PWR_24_ = Long.fromInt(1 << 24);
-
-/**
- * Expose.
- */
-exports.Long = Long;
-}, 
-
-
-
-'max_key': function(module, exports, global, require, undefined){
-  /**
- * A class representation of the BSON MaxKey type.
- *
- * @class Represents the BSON MaxKey type.
- * @return {MaxKey}
- */
-function MaxKey() {
-  if(!(this instanceof MaxKey)) return new MaxKey();
-  
-  this._bsontype = 'MaxKey';  
-}
-
-exports.MaxKey = MaxKey;
-}, 
-
-
-
-'min_key': function(module, exports, global, require, undefined){
-  /**
- * A class representation of the BSON MinKey type.
- *
- * @class Represents the BSON MinKey type.
- * @return {MinKey}
- */
-function MinKey() {
-  if(!(this instanceof MinKey)) return new MinKey();
-  
-  this._bsontype = 'MinKey';
-}
-
-exports.MinKey = MinKey;
-}, 
-
-
-
-'objectid': function(module, exports, global, require, undefined){
-  /**
- * Module dependencies.
- */
-var BinaryParser = require('./binary_parser').BinaryParser;
-
-/**
- * Machine id.
- *
- * Create a random 3-byte value (i.e. unique for this
- * process). Other drivers use a md5 of the machine id here, but
- * that would mean an asyc call to gethostname, so we don't bother.
- */
-var MACHINE_ID = parseInt(Math.random() * 0xFFFFFF, 10);
-
-// Regular expression that checks for hex value
-var checkForHexRegExp = new RegExp("^[0-9a-fA-F]{24}$");
-
-/**
-* Create a new ObjectID instance
-*
-* @class Represents the BSON ObjectID type
-* @param {String|Number} id Can be a 24 byte hex string, 12 byte binary string or a Number.
-* @return {Object} instance of ObjectID.
-*/
-var ObjectID = function ObjectID(id, _hex) {
-  if(!(this instanceof ObjectID)) return new ObjectID(id, _hex);
-
-  this._bsontype = 'ObjectID';
-  var __id = null;
-
-  // Throw an error if it's not a valid setup
-  if(id != null && 'number' != typeof id && (id.length != 12 && id.length != 24))
-    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
-
-  // Generate id based on the input
-  if(id == null || typeof id == 'number') {
-    // convert to 12 byte binary string
-    this.id = this.generate(id);
-  } else if(id != null && id.length === 12) {
-    // assume 12 byte string
-    this.id = id;
-  } else if(checkForHexRegExp.test(id)) {
-    return ObjectID.createFromHexString(id);
-  } else {
-    throw new Error("Value passed in is not a valid 24 character hex string");
-  }
-
-  if(ObjectID.cacheHexString) this.__id = this.toHexString();
-};
-
-// Allow usage of ObjectId as well as ObjectID
-var ObjectId = ObjectID;
-
-// Precomputed hex table enables speedy hex string conversion
-var hexTable = [];
-for (var i = 0; i < 256; i++) {
-  hexTable[i] = (i <= 15 ? '0' : '') + i.toString(16);
-}
-
-/**
-* Return the ObjectID id as a 24 byte hex string representation
-*
-* @return {String} return the 24 byte hex string representation.
-* @api public
-*/
-ObjectID.prototype.toHexString = function() {
-  if(ObjectID.cacheHexString && this.__id) return this.__id;
-
-  var hexString = '';
-
-  for (var i = 0; i < this.id.length; i++) {
-    hexString += hexTable[this.id.charCodeAt(i)];
-  }
-
-  if(ObjectID.cacheHexString) this.__id = hexString;
-  return hexString;
-};
-
-/**
-* Update the ObjectID index used in generating new ObjectID's on the driver
-*
-* @return {Number} returns next index value.
-* @api private
-*/
-ObjectID.prototype.get_inc = function() {
-  return ObjectID.index = (ObjectID.index + 1) % 0xFFFFFF;
-};
-
-/**
-* Update the ObjectID index used in generating new ObjectID's on the driver
-*
-* @return {Number} returns next index value.
-* @api private
-*/
-ObjectID.prototype.getInc = function() {
-  return this.get_inc();
-};
-
-/**
-* Generate a 12 byte id string used in ObjectID's
-*
-* @param {Number} [time] optional parameter allowing to pass in a second based timestamp.
-* @return {String} return the 12 byte id binary string.
-* @api private
-*/
-ObjectID.prototype.generate = function(time) {
-  if ('number' == typeof time) {
-    var time4Bytes = BinaryParser.encodeInt(time, 32, true, true);
-    /* for time-based ObjectID the bytes following the time will be zeroed */
-    var machine3Bytes = BinaryParser.encodeInt(MACHINE_ID, 24, false);
-    var pid2Bytes = BinaryParser.fromShort(typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid);
-    var index3Bytes = BinaryParser.encodeInt(this.get_inc(), 24, false, true);
-  } else {
-  	var unixTime = parseInt(Date.now()/1000,10);
-    var time4Bytes = BinaryParser.encodeInt(unixTime, 32, true, true);
-    var machine3Bytes = BinaryParser.encodeInt(MACHINE_ID, 24, false);
-    var pid2Bytes = BinaryParser.fromShort(typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid);
-    var index3Bytes = BinaryParser.encodeInt(this.get_inc(), 24, false, true);
-  }
-
-  return time4Bytes + machine3Bytes + pid2Bytes + index3Bytes;
-};
-
-/**
-* Converts the id into a 24 byte hex string for printing
-*
-* @return {String} return the 24 byte hex string representation.
-* @api private
-*/
-ObjectID.prototype.toString = function() {
-  return this.toHexString();
-};
-
-/**
-* Converts to a string representation of this Id.
-*
-* @return {String} return the 24 byte hex string representation.
-* @api private
-*/
-ObjectID.prototype.inspect = ObjectID.prototype.toString;
-
-/**
-* Converts to its JSON representation.
-*
-* @return {String} return the 24 byte hex string representation.
-* @api private
-*/
-ObjectID.prototype.toJSON = function() {
-  return this.toHexString();
-};
-
-/**
-* Compares the equality of this ObjectID with `otherID`.
-*
-* @param {Object} otherID ObjectID instance to compare against.
-* @return {Bool} the result of comparing two ObjectID's
-* @api public
-*/
-ObjectID.prototype.equals = function equals (otherID) {
-  var id = (otherID instanceof ObjectID || otherID.toHexString)
-    ? otherID.id
-    : ObjectID.createFromHexString(otherID).id;
-
-  return this.id === id;
-}
-
-/**
-* Returns the generation date (accurate up to the second) that this ID was generated.
-*
-* @return {Date} the generation date
-* @api public
-*/
-ObjectID.prototype.getTimestamp = function() {
-  var timestamp = new Date();
-  timestamp.setTime(Math.floor(BinaryParser.decodeInt(this.id.substring(0,4), 32, true, true)) * 1000);
-  return timestamp;
-}
-
-/**
-* @ignore
-* @api private
-*/
-ObjectID.index = parseInt(Math.random() * 0xFFFFFF, 10);
-
-ObjectID.createPk = function createPk () {
-  return new ObjectID();
-};
-
-/**
-* Creates an ObjectID from a second based number, with the rest of the ObjectID zeroed out. Used for comparisons or sorting the ObjectID.
-*
-* @param {Number} time an integer number representing a number of seconds.
-* @return {ObjectID} return the created ObjectID
-* @api public
-*/
-ObjectID.createFromTime = function createFromTime (time) {
-  var id = BinaryParser.encodeInt(time, 32, true, true) +
-           BinaryParser.encodeInt(0, 64, true, true);
-  return new ObjectID(id);
-};
-
-/**
-* Creates an ObjectID from a hex string representation of an ObjectID.
-*
-* @param {String} hexString create a ObjectID from a passed in 24 byte hexstring.
-* @return {ObjectID} return the created ObjectID
-* @api public
-*/
-ObjectID.createFromHexString = function createFromHexString (hexString) {
-  // Throw an error if it's not a valid setup
-  if(typeof hexString === 'undefined' || hexString != null && hexString.length != 24)
-    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
-
-  var len = hexString.length;
-
-  if(len > 12*2) {
-    throw new Error('Id cannot be longer than 12 bytes');
-  }
-
-  var result = ''
-    , string
-    , number;
-
-  for (var index = 0; index < len; index += 2) {
-    string = hexString.substr(index, 2);
-    number = parseInt(string, 16);
-    result += BinaryParser.fromByte(number);
-  }
-
-  return new ObjectID(result, hexString);
-};
-
-/**
-* @ignore
-*/
-Object.defineProperty(ObjectID.prototype, "generationTime", {
-   enumerable: true
- , get: function () {
-     return Math.floor(BinaryParser.decodeInt(this.id.substring(0,4), 32, true, true));
-   }
- , set: function (value) {
-     var value = BinaryParser.encodeInt(value, 32, true, true);
-     this.id = value + this.id.substr(4);
-     // delete this.__id;
-     this.toHexString();
-   }
-});
-
-/**
- * Expose.
- */
-exports.ObjectID = ObjectID;
-exports.ObjectId = ObjectID;
-
-}, 
-
-
-
-'symbol': function(module, exports, global, require, undefined){
-  /**
- * A class representation of the BSON Symbol type.
- *
- * @class Represents the BSON Symbol type.
- * @param {String} value the string representing the symbol.
- * @return {Symbol}
- */
-function Symbol(value) {
-  if(!(this instanceof Symbol)) return new Symbol(value);
-  this._bsontype = 'Symbol';
-  this.value = value;
-}
-
-/**
- * Access the wrapped string value.
- *
- * @return {String} returns the wrapped string.
- * @api public
- */
-Symbol.prototype.valueOf = function() {
-  return this.value;
-};
-
-/**
- * @ignore
- * @api private
- */
-Symbol.prototype.toString = function() {
-  return this.value;
-}
-
-/**
- * @ignore
- * @api private
- */
-Symbol.prototype.inspect = function() {
-  return this.value;
-}
-
-/**
- * @ignore
- * @api private
- */
-Symbol.prototype.toJSON = function() {
-  return this.value;
-}
-
-exports.Symbol = Symbol;
-}, 
-
-
-
-'timestamp': function(module, exports, global, require, undefined){
-  // Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//
-// Copyright 2009 Google Inc. All Rights Reserved
-
-/**
- * Defines a Timestamp class for representing a 64-bit two's-complement
- * integer value, which faithfully simulates the behavior of a Java "Timestamp". This
- * implementation is derived from TimestampLib in GWT.
- *
- * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
- * values as *signed* integers.  See the from* functions below for more
- * convenient ways of constructing Timestamps.
- *
- * The internal representation of a Timestamp is the two given signed, 32-bit values.
- * We use 32-bit pieces because these are the size of integers on which
- * Javascript performs bit-operations.  For operations like addition and
- * multiplication, we split each number into 16-bit pieces, which can easily be
- * multiplied within Javascript's floating-point representation without overflow
- * or change in sign.
- *
- * In the algorithms below, we frequently reduce the negative case to the
- * positive case by negating the input(s) and then post-processing the result.
- * Note that we must ALWAYS check specially whether those values are MIN_VALUE
- * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
- * a positive number, it overflows back into a negative).  Not handling this
- * case would often result in infinite recursion.
- *
- * @class Represents the BSON Timestamp type.
- * @param {Number} low  the low (signed) 32 bits of the Timestamp.
- * @param {Number} high the high (signed) 32 bits of the Timestamp.
- */
-function Timestamp(low, high) {
-  if(!(this instanceof Timestamp)) return new Timestamp(low, high);
-  this._bsontype = 'Timestamp';
-  /**
-   * @type {number}
-   * @api private
-   */
-  this.low_ = low | 0;  // force into 32 signed bits.
-
-  /**
-   * @type {number}
-   * @api private
-   */
-  this.high_ = high | 0;  // force into 32 signed bits.
-};
-
-/**
- * Return the int value.
- *
- * @return {Number} the value, assuming it is a 32-bit integer.
- * @api public
- */
-Timestamp.prototype.toInt = function() {
-  return this.low_;
-};
-
-/**
- * Return the Number value.
- *
- * @return {Number} the closest floating-point representation to this value.
- * @api public
- */
-Timestamp.prototype.toNumber = function() {
-  return this.high_ * Timestamp.TWO_PWR_32_DBL_ +
-         this.getLowBitsUnsigned();
-};
-
-/**
- * Return the JSON value.
- *
- * @return {String} the JSON representation.
- * @api public
- */
-Timestamp.prototype.toJSON = function() {
-  return this.toString();
-}
-
-/**
- * Return the String value.
- *
- * @param {Number} [opt_radix] the radix in which the text should be written.
- * @return {String} the textual representation of this value.
- * @api public
- */
-Timestamp.prototype.toString = function(opt_radix) {
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (this.isZero()) {
-    return '0';
-  }
-
-  if (this.isNegative()) {
-    if (this.equals(Timestamp.MIN_VALUE)) {
-      // We need to change the Timestamp value before it can be negated, so we remove
-      // the bottom-most digit in this base and then recurse to do the rest.
-      var radixTimestamp = Timestamp.fromNumber(radix);
-      var div = this.div(radixTimestamp);
-      var rem = div.multiply(radixTimestamp).subtract(this);
-      return div.toString(radix) + rem.toInt().toString(radix);
-    } else {
-      return '-' + this.negate().toString(radix);
-    }
-  }
-
-  // Do several (6) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 6));
-
-  var rem = this;
-  var result = '';
-  while (true) {
-    var remDiv = rem.div(radixToPower);
-    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
-    var digits = intval.toString(radix);
-
-    rem = remDiv;
-    if (rem.isZero()) {
-      return digits + result;
-    } else {
-      while (digits.length < 6) {
-        digits = '0' + digits;
-      }
-      result = '' + digits + result;
-    }
-  }
-};
-
-/**
- * Return the high 32-bits value.
- *
- * @return {Number} the high 32-bits as a signed value.
- * @api public
- */
-Timestamp.prototype.getHighBits = function() {
-  return this.high_;
-};
-
-/**
- * Return the low 32-bits value.
- *
- * @return {Number} the low 32-bits as a signed value.
- * @api public
- */
-Timestamp.prototype.getLowBits = function() {
-  return this.low_;
-};
-
-/**
- * Return the low unsigned 32-bits value.
- *
- * @return {Number} the low 32-bits as an unsigned value.
- * @api public
- */
-Timestamp.prototype.getLowBitsUnsigned = function() {
-  return (this.low_ >= 0) ?
-      this.low_ : Timestamp.TWO_PWR_32_DBL_ + this.low_;
-};
-
-/**
- * Returns the number of bits needed to represent the absolute value of this Timestamp.
- *
- * @return {Number} Returns the number of bits needed to represent the absolute value of this Timestamp.
- * @api public
- */
-Timestamp.prototype.getNumBitsAbs = function() {
-  if (this.isNegative()) {
-    if (this.equals(Timestamp.MIN_VALUE)) {
-      return 64;
-    } else {
-      return this.negate().getNumBitsAbs();
-    }
-  } else {
-    var val = this.high_ != 0 ? this.high_ : this.low_;
-    for (var bit = 31; bit > 0; bit--) {
-      if ((val & (1 << bit)) != 0) {
-        break;
-      }
-    }
-    return this.high_ != 0 ? bit + 33 : bit + 1;
-  }
-};
-
-/**
- * Return whether this value is zero.
- *
- * @return {Boolean} whether this value is zero.
- * @api public
- */
-Timestamp.prototype.isZero = function() {
-  return this.high_ == 0 && this.low_ == 0;
-};
-
-/**
- * Return whether this value is negative.
- *
- * @return {Boolean} whether this value is negative.
- * @api public
- */
-Timestamp.prototype.isNegative = function() {
-  return this.high_ < 0;
-};
-
-/**
- * Return whether this value is odd.
- *
- * @return {Boolean} whether this value is odd.
- * @api public
- */
-Timestamp.prototype.isOdd = function() {
-  return (this.low_ & 1) == 1;
-};
-
-/**
- * Return whether this Timestamp equals the other
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} whether this Timestamp equals the other
- * @api public
- */
-Timestamp.prototype.equals = function(other) {
-  return (this.high_ == other.high_) && (this.low_ == other.low_);
-};
-
-/**
- * Return whether this Timestamp does not equal the other.
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} whether this Timestamp does not equal the other.
- * @api public
- */
-Timestamp.prototype.notEquals = function(other) {
-  return (this.high_ != other.high_) || (this.low_ != other.low_);
-};
-
-/**
- * Return whether this Timestamp is less than the other.
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} whether this Timestamp is less than the other.
- * @api public
- */
-Timestamp.prototype.lessThan = function(other) {
-  return this.compare(other) < 0;
-};
-
-/**
- * Return whether this Timestamp is less than or equal to the other.
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} whether this Timestamp is less than or equal to the other.
- * @api public
- */
-Timestamp.prototype.lessThanOrEqual = function(other) {
-  return this.compare(other) <= 0;
-};
-
-/**
- * Return whether this Timestamp is greater than the other.
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} whether this Timestamp is greater than the other.
- * @api public
- */
-Timestamp.prototype.greaterThan = function(other) {
-  return this.compare(other) > 0;
-};
-
-/**
- * Return whether this Timestamp is greater than or equal to the other.
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} whether this Timestamp is greater than or equal to the other.
- * @api public
- */
-Timestamp.prototype.greaterThanOrEqual = function(other) {
-  return this.compare(other) >= 0;
-};
-
-/**
- * Compares this Timestamp with the given one.
- *
- * @param {Timestamp} other Timestamp to compare against.
- * @return {Boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
- * @api public
- */
-Timestamp.prototype.compare = function(other) {
-  if (this.equals(other)) {
-    return 0;
-  }
-
-  var thisNeg = this.isNegative();
-  var otherNeg = other.isNegative();
-  if (thisNeg && !otherNeg) {
-    return -1;
-  }
-  if (!thisNeg && otherNeg) {
-    return 1;
-  }
-
-  // at this point, the signs are the same, so subtraction will not overflow
-  if (this.subtract(other).isNegative()) {
-    return -1;
-  } else {
-    return 1;
-  }
-};
-
-/**
- * The negation of this value.
- *
- * @return {Timestamp} the negation of this value.
- * @api public
- */
-Timestamp.prototype.negate = function() {
-  if (this.equals(Timestamp.MIN_VALUE)) {
-    return Timestamp.MIN_VALUE;
-  } else {
-    return this.not().add(Timestamp.ONE);
-  }
-};
-
-/**
- * Returns the sum of this and the given Timestamp.
- *
- * @param {Timestamp} other Timestamp to add to this one.
- * @return {Timestamp} the sum of this and the given Timestamp.
- * @api public
- */
-Timestamp.prototype.add = function(other) {
-  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 + b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 + b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 + b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 + b48;
-  c48 &= 0xFFFF;
-  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns the difference of this and the given Timestamp.
- *
- * @param {Timestamp} other Timestamp to subtract from this.
- * @return {Timestamp} the difference of this and the given Timestamp.
- * @api public
- */
-Timestamp.prototype.subtract = function(other) {
-  return this.add(other.negate());
-};
-
-/**
- * Returns the product of this and the given Timestamp.
- *
- * @param {Timestamp} other Timestamp to multiply with this.
- * @return {Timestamp} the product of this and the other.
- * @api public
- */
-Timestamp.prototype.multiply = function(other) {
-  if (this.isZero()) {
-    return Timestamp.ZERO;
-  } else if (other.isZero()) {
-    return Timestamp.ZERO;
-  }
-
-  if (this.equals(Timestamp.MIN_VALUE)) {
-    return other.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
-  } else if (other.equals(Timestamp.MIN_VALUE)) {
-    return this.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().multiply(other.negate());
-    } else {
-      return this.negate().multiply(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.multiply(other.negate()).negate();
-  }
-
-  // If both Timestamps are small, use float multiplication
-  if (this.lessThan(Timestamp.TWO_PWR_24_) &&
-      other.lessThan(Timestamp.TWO_PWR_24_)) {
-    return Timestamp.fromNumber(this.toNumber() * other.toNumber());
-  }
-
-  // Divide each Timestamp into 4 chunks of 16 bits, and then add up 4x4 products.
-  // We can skip products that would overflow.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 * b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 * b00;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c16 += a00 * b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 * b00;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a16 * b16;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a00 * b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
-  c48 &= 0xFFFF;
-  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns this Timestamp divided by the given one.
- *
- * @param {Timestamp} other Timestamp by which to divide.
- * @return {Timestamp} this Timestamp divided by the given one.
- * @api public
- */
-Timestamp.prototype.div = function(other) {
-  if (other.isZero()) {
-    throw Error('division by zero');
-  } else if (this.isZero()) {
-    return Timestamp.ZERO;
-  }
-
-  if (this.equals(Timestamp.MIN_VALUE)) {
-    if (other.equals(Timestamp.ONE) ||
-        other.equals(Timestamp.NEG_ONE)) {
-      return Timestamp.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
-    } else if (other.equals(Timestamp.MIN_VALUE)) {
-      return Timestamp.ONE;
-    } else {
-      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
-      var halfThis = this.shiftRight(1);
-      var approx = halfThis.div(other).shiftLeft(1);
-      if (approx.equals(Timestamp.ZERO)) {
-        return other.isNegative() ? Timestamp.ONE : Timestamp.NEG_ONE;
-      } else {
-        var rem = this.subtract(other.multiply(approx));
-        var result = approx.add(rem.div(other));
-        return result;
-      }
-    }
-  } else if (other.equals(Timestamp.MIN_VALUE)) {
-    return Timestamp.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().div(other.negate());
-    } else {
-      return this.negate().div(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.div(other.negate()).negate();
-  }
-
-  // Repeat the following until the remainder is less than other:  find a
-  // floating-point that approximates remainder / other *from below*, add this
-  // into the result, and subtract it from the remainder.  It is critical that
-  // the approximate value is less than or equal to the real value so that the
-  // remainder never becomes negative.
-  var res = Timestamp.ZERO;
-  var rem = this;
-  while (rem.greaterThanOrEqual(other)) {
-    // Approximate the result of division. This may be a little greater or
-    // smaller than the actual value.
-    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
-
-    // We will tweak the approximate result by changing it in the 48-th digit or
-    // the smallest non-fractional digit, whichever is larger.
-    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
-    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
-
-    // Decrease the approximation until it is smaller than the remainder.  Note
-    // that if it is too large, the product overflows and is negative.
-    var approxRes = Timestamp.fromNumber(approx);
-    var approxRem = approxRes.multiply(other);
-    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
-      approx -= delta;
-      approxRes = Timestamp.fromNumber(approx);
-      approxRem = approxRes.multiply(other);
-    }
-
-    // We know the answer can't be zero... and actually, zero would cause
-    // infinite recursion since we would make no progress.
-    if (approxRes.isZero()) {
-      approxRes = Timestamp.ONE;
-    }
-
-    res = res.add(approxRes);
-    rem = rem.subtract(approxRem);
-  }
-  return res;
-};
-
-/**
- * Returns this Timestamp modulo the given one.
- *
- * @param {Timestamp} other Timestamp by which to mod.
- * @return {Timestamp} this Timestamp modulo the given one.
- * @api public
- */
-Timestamp.prototype.modulo = function(other) {
-  return this.subtract(this.div(other).multiply(other));
-};
-
-/**
- * The bitwise-NOT of this value.
- *
- * @return {Timestamp} the bitwise-NOT of this value.
- * @api public
- */
-Timestamp.prototype.not = function() {
-  return Timestamp.fromBits(~this.low_, ~this.high_);
-};
-
-/**
- * Returns the bitwise-AND of this Timestamp and the given one.
- *
- * @param {Timestamp} other the Timestamp with which to AND.
- * @return {Timestamp} the bitwise-AND of this and the other.
- * @api public
- */
-Timestamp.prototype.and = function(other) {
-  return Timestamp.fromBits(this.low_ & other.low_, this.high_ & other.high_);
-};
-
-/**
- * Returns the bitwise-OR of this Timestamp and the given one.
- *
- * @param {Timestamp} other the Timestamp with which to OR.
- * @return {Timestamp} the bitwise-OR of this and the other.
- * @api public
- */
-Timestamp.prototype.or = function(other) {
-  return Timestamp.fromBits(this.low_ | other.low_, this.high_ | other.high_);
-};
-
-/**
- * Returns the bitwise-XOR of this Timestamp and the given one.
- *
- * @param {Timestamp} other the Timestamp with which to XOR.
- * @return {Timestamp} the bitwise-XOR of this and the other.
- * @api public
- */
-Timestamp.prototype.xor = function(other) {
-  return Timestamp.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
-};
-
-/**
- * Returns this Timestamp with bits shifted to the left by the given amount.
- *
- * @param {Number} numBits the number of bits by which to shift.
- * @return {Timestamp} this shifted to the left by the given amount.
- * @api public
- */
-Timestamp.prototype.shiftLeft = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var low = this.low_;
-    if (numBits < 32) {
-      var high = this.high_;
-      return Timestamp.fromBits(
-                 low << numBits,
-                 (high << numBits) | (low >>> (32 - numBits)));
-    } else {
-      return Timestamp.fromBits(0, low << (numBits - 32));
-    }
-  }
-};
-
-/**
- * Returns this Timestamp with bits shifted to the right by the given amount.
- *
- * @param {Number} numBits the number of bits by which to shift.
- * @return {Timestamp} this shifted to the right by the given amount.
- * @api public
- */
-Timestamp.prototype.shiftRight = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Timestamp.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >> numBits);
-    } else {
-      return Timestamp.fromBits(
-                 high >> (numBits - 32),
-                 high >= 0 ? 0 : -1);
-    }
-  }
-};
-
-/**
- * Returns this Timestamp with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
- *
- * @param {Number} numBits the number of bits by which to shift.
- * @return {Timestamp} this shifted to the right by the given amount, with zeros placed into the new leading bits.
- * @api public
- */
-Timestamp.prototype.shiftRightUnsigned = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Timestamp.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >>> numBits);
-    } else if (numBits == 32) {
-      return Timestamp.fromBits(high, 0);
-    } else {
-      return Timestamp.fromBits(high >>> (numBits - 32), 0);
-    }
-  }
-};
-
-/**
- * Returns a Timestamp representing the given (32-bit) integer value.
- *
- * @param {Number} value the 32-bit integer in question.
- * @return {Timestamp} the corresponding Timestamp value.
- * @api public
- */
-Timestamp.fromInt = function(value) {
-  if (-128 <= value && value < 128) {
-    var cachedObj = Timestamp.INT_CACHE_[value];
-    if (cachedObj) {
-      return cachedObj;
-    }
-  }
-
-  var obj = new Timestamp(value | 0, value < 0 ? -1 : 0);
-  if (-128 <= value && value < 128) {
-    Timestamp.INT_CACHE_[value] = obj;
-  }
-  return obj;
-};
-
-/**
- * Returns a Timestamp representing the given value, provided that it is a finite number. Otherwise, zero is returned.
- *
- * @param {Number} value the number in question.
- * @return {Timestamp} the corresponding Timestamp value.
- * @api public
- */
-Timestamp.fromNumber = function(value) {
-  if (isNaN(value) || !isFinite(value)) {
-    return Timestamp.ZERO;
-  } else if (value <= -Timestamp.TWO_PWR_63_DBL_) {
-    return Timestamp.MIN_VALUE;
-  } else if (value + 1 >= Timestamp.TWO_PWR_63_DBL_) {
-    return Timestamp.MAX_VALUE;
-  } else if (value < 0) {
-    return Timestamp.fromNumber(-value).negate();
-  } else {
-    return new Timestamp(
-               (value % Timestamp.TWO_PWR_32_DBL_) | 0,
-               (value / Timestamp.TWO_PWR_32_DBL_) | 0);
-  }
-};
-
-/**
- * Returns a Timestamp representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
- *
- * @param {Number} lowBits the low 32-bits.
- * @param {Number} highBits the high 32-bits.
- * @return {Timestamp} the corresponding Timestamp value.
- * @api public
- */
-Timestamp.fromBits = function(lowBits, highBits) {
-  return new Timestamp(lowBits, highBits);
-};
-
-/**
- * Returns a Timestamp representation of the given string, written using the given radix.
- *
- * @param {String} str the textual representation of the Timestamp.
- * @param {Number} opt_radix the radix in which the text is written.
- * @return {Timestamp} the corresponding Timestamp value.
- * @api public
- */
-Timestamp.fromString = function(str, opt_radix) {
-  if (str.length == 0) {
-    throw Error('number format error: empty string');
-  }
-
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (str.charAt(0) == '-') {
-    return Timestamp.fromString(str.substring(1), radix).negate();
-  } else if (str.indexOf('-') >= 0) {
-    throw Error('number format error: interior "-" character: ' + str);
-  }
-
-  // Do several (8) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 8));
-
-  var result = Timestamp.ZERO;
-  for (var i = 0; i < str.length; i += 8) {
-    var size = Math.min(8, str.length - i);
-    var value = parseInt(str.substring(i, i + size), radix);
-    if (size < 8) {
-      var power = Timestamp.fromNumber(Math.pow(radix, size));
-      result = result.multiply(power).add(Timestamp.fromNumber(value));
-    } else {
-      result = result.multiply(radixToPower);
-      result = result.add(Timestamp.fromNumber(value));
-    }
-  }
-  return result;
-};
-
-// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
-// from* methods on which they depend.
-
-
-/**
- * A cache of the Timestamp representations of small integer values.
- * @type {Object}
- * @api private
- */
-Timestamp.INT_CACHE_ = {};
-
-// NOTE: the compiler should inline these constant values below and then remove
-// these variables, so there should be no runtime penalty for these.
-
-/**
- * Number used repeated below in calculations.  This must appear before the
- * first call to any from* function below.
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_16_DBL_ = 1 << 16;
-
-/**
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_24_DBL_ = 1 << 24;
-
-/**
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_32_DBL_ = Timestamp.TWO_PWR_16_DBL_ * Timestamp.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_31_DBL_ = Timestamp.TWO_PWR_32_DBL_ / 2;
-
-/**
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_48_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_64_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_32_DBL_;
-
-/**
- * @type {number}
- * @api private
- */
-Timestamp.TWO_PWR_63_DBL_ = Timestamp.TWO_PWR_64_DBL_ / 2;
-
-/** @type {Timestamp} */
-Timestamp.ZERO = Timestamp.fromInt(0);
-
-/** @type {Timestamp} */
-Timestamp.ONE = Timestamp.fromInt(1);
-
-/** @type {Timestamp} */
-Timestamp.NEG_ONE = Timestamp.fromInt(-1);
-
-/** @type {Timestamp} */
-Timestamp.MAX_VALUE =
-    Timestamp.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
-
-/** @type {Timestamp} */
-Timestamp.MIN_VALUE = Timestamp.fromBits(0, 0x80000000 | 0);
-
-/**
- * @type {Timestamp}
- * @api private
- */
-Timestamp.TWO_PWR_24_ = Timestamp.fromInt(1 << 24);
-
-/**
- * Expose.
- */
-exports.Timestamp = Timestamp;
-}, 
-
- });
-
-
-if(typeof module != 'undefined' && module.exports ){
-  module.exports = bson;
-
-  if( !module.parent ){
-    bson();
-  }
-}
-
-if(typeof window != 'undefined' && typeof require == 'undefined'){
-  window.require = bson.require;
-}
diff --git a/node_modules/bson/browser_build/package.json b/node_modules/bson/browser_build/package.json
deleted file mode 100644
index 3ebb587..0000000
--- a/node_modules/bson/browser_build/package.json
+++ /dev/null
@@ -1,8 +0,0 @@
-{ "name" :            "bson"
-, "description" :     "A bson parser for node.js and the browser"
-, "main":             "../lib/bson/bson"
-, "directories" :   { "lib" : "../lib/bson" }
-, "engines" :       { "node" : ">=0.6.0" }
-, "licenses" :    [ { "type" :  "Apache License, Version 2.0"
-                    , "url" :   "http://www.apache.org/licenses/LICENSE-2.0" } ]
-}
diff --git a/node_modules/bson/deserializer_bak.js b/node_modules/bson/deserializer_bak.js
deleted file mode 100644
index c879ad5..0000000
--- a/node_modules/bson/deserializer_bak.js
+++ /dev/null
@@ -1,357 +0,0 @@
-"use strict"
-
-var writeIEEE754 = require('../float_parser').writeIEEE754,
-	readIEEE754 = require('../float_parser').readIEEE754,
-	f = require('util').format,
-	Long = require('../long').Long,
-  Double = require('../double').Double,
-  Timestamp = require('../timestamp').Timestamp,
-  ObjectID = require('../objectid').ObjectID,
-  Symbol = require('../symbol').Symbol,
-  Code = require('../code').Code,
-  MinKey = require('../min_key').MinKey,
-  MaxKey = require('../max_key').MaxKey,
-  DBRef = require('../db_ref').DBRef,
-  BSONRegExp = require('../regexp').BSONRegExp,
-  Binary = require('../binary').Binary;
-
-var BSON = {};
-
-/**
- * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
- *
- * @ignore
- * @api private
- */
-var functionCache = BSON.functionCache = {};
-
-/**
- * Number BSON Type
- *
- * @classconstant BSON_DATA_NUMBER
- **/
-BSON.BSON_DATA_NUMBER = 1;
-/**
- * String BSON Type
- *
- * @classconstant BSON_DATA_STRING
- **/
-BSON.BSON_DATA_STRING = 2;
-/**
- * Object BSON Type
- *
- * @classconstant BSON_DATA_OBJECT
- **/
-BSON.BSON_DATA_OBJECT = 3;
-/**
- * Array BSON Type
- *
- * @classconstant BSON_DATA_ARRAY
- **/
-BSON.BSON_DATA_ARRAY = 4;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_BINARY
- **/
-BSON.BSON_DATA_BINARY = 5;
-/**
- * ObjectID BSON Type
- *
- * @classconstant BSON_DATA_OID
- **/
-BSON.BSON_DATA_OID = 7;
-/**
- * Boolean BSON Type
- *
- * @classconstant BSON_DATA_BOOLEAN
- **/
-BSON.BSON_DATA_BOOLEAN = 8;
-/**
- * Date BSON Type
- *
- * @classconstant BSON_DATA_DATE
- **/
-BSON.BSON_DATA_DATE = 9;
-/**
- * null BSON Type
- *
- * @classconstant BSON_DATA_NULL
- **/
-BSON.BSON_DATA_NULL = 10;
-/**
- * RegExp BSON Type
- *
- * @classconstant BSON_DATA_REGEXP
- **/
-BSON.BSON_DATA_REGEXP = 11;
-/**
- * Code BSON Type
- *
- * @classconstant BSON_DATA_CODE
- **/
-BSON.BSON_DATA_CODE = 13;
-/**
- * Symbol BSON Type
- *
- * @classconstant BSON_DATA_SYMBOL
- **/
-BSON.BSON_DATA_SYMBOL = 14;
-/**
- * Code with Scope BSON Type
- *
- * @classconstant BSON_DATA_CODE_W_SCOPE
- **/
-BSON.BSON_DATA_CODE_W_SCOPE = 15;
-/**
- * 32 bit Integer BSON Type
- *
- * @classconstant BSON_DATA_INT
- **/
-BSON.BSON_DATA_INT = 16;
-/**
- * Timestamp BSON Type
- *
- * @classconstant BSON_DATA_TIMESTAMP
- **/
-BSON.BSON_DATA_TIMESTAMP = 17;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_LONG
- **/
-BSON.BSON_DATA_LONG = 18;
-/**
- * MinKey BSON Type
- *
- * @classconstant BSON_DATA_MIN_KEY
- **/
-BSON.BSON_DATA_MIN_KEY = 0xff;
-/**
- * MaxKey BSON Type
- *
- * @classconstant BSON_DATA_MAX_KEY
- **/
-BSON.BSON_DATA_MAX_KEY = 0x7f;
-
-/**
- * Binary Default Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
- **/
-BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
-/**
- * Binary Function Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
- **/
-BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
-/**
- * Binary Byte Array Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
- **/
-BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
-/**
- * Binary UUID Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_UUID
- **/
-BSON.BSON_BINARY_SUBTYPE_UUID = 3;
-/**
- * Binary MD5 Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_MD5
- **/
-BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
-/**
- * Binary User Defined Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
- **/
-BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
-
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
-BSON.BSON_INT64_MIN = -Math.pow(2, 63);
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-// Internal long versions
-var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
-var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
-
-var deserialize = function(buffer, options, isArray) {
-	var index = 0;
-	// Read the document size
-  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-	// Ensure buffer is valid size
-  if(size < 5 || buffer.length < size) {
-		throw new Error("corrupt bson message");
-	}
-
-	// Illegal end value
-	if(buffer[size - 1] != 0) {
-		throw new Error("One object, sized correctly, with a spot for an EOO, but the EOO isn't 0x00");
-	}
-
-	// Start deserializtion
-	return deserializeObject(buffer, options, isArray);
-}
-
-// // Reads in a C style string
-// var readCStyleStringSpecial = function(buffer, index) {
-// 	// Get the start search index
-// 	var i = index;
-// 	// Locate the end of the c string
-// 	while(buffer[i] !== 0x00 && i < buffer.length) {
-// 		i++
-// 	}
-// 	// If are at the end of the buffer there is a problem with the document
-// 	if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-// 	// Grab utf8 encoded string
-// 	var string = buffer.toString('utf8', index, i);
-// 	// Update index position
-// 	index = i + 1;
-// 	// Return string
-// 	return {s: string, i: index};
-// }
-
-// Reads in a C style string
-var readCStyleStringSpecial = function(buffer, index) {
-	// Get the start search index
-	var i = index;
-	// Locate the end of the c string
-	while(buffer[i] !== 0x00 && i < buffer.length) {
-		i++
-	}
-	// If are at the end of the buffer there is a problem with the document
-	if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-	// Grab utf8 encoded string
-	return buffer.toString('utf8', index, i);
-}
-
-var DeserializationMethods = {}
-DeserializationMethods[BSON.BSON_DATA_OID] = function(name, object, buffer, index) {
-	var string = buffer.toString('binary', index, index + 12);
-	object[name] = new ObjectID(string);
-	return index + 12;
-}
-
-DeserializationMethods[BSON.BSON_DATA_NUMBER] = function(name, object, buffer, index) {
-	object[name] = buffer.readDoubleLE(index);
-  return index + 8;
-}
-
-DeserializationMethods[BSON.BSON_DATA_INT] = function(name, object, buffer, index) {
-	object[name] = buffer.readInt32LE(index);
-	return index + 4;
-}
-
-DeserializationMethods[BSON.BSON_DATA_TIMESTAMP] = function(name, object, buffer, index) {
-  var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-  var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-  object[name] = new Timestamp(lowBits, highBits);
-	return index;
-}
-
-DeserializationMethods[BSON.BSON_DATA_STRING] = function(name, object, buffer, index) {
-  var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-	if(stringSize <= 0 || stringSize > (buffer.length - index) || buffer[index + stringSize - 1] != 0) throw new Error("bad string length in bson");
-  object[name] = buffer.toString('utf8', index, index + stringSize - 1);
-  return index + stringSize;
-}
-
-DeserializationMethods[BSON.BSON_DATA_BOOLEAN] = function(name, object, buffer, index) {
-  object[name] = buffer[index++] == 1;
-	return index;
-}
-
-var deserializeObject = function(buffer, options, isArray) {
-  // Options
-  options = options == null ? {} : options;
-  var evalFunctions = options['evalFunctions'] == null ? false : options['evalFunctions'];
-  var cacheFunctions = options['cacheFunctions'] == null ? false : options['cacheFunctions'];
-  var cacheFunctionsCrc32 = options['cacheFunctionsCrc32'] == null ? false : options['cacheFunctionsCrc32'];
-  var promoteLongs = options['promoteLongs'] == null ? true : options['promoteLongs'];
-	var fieldsAsRaw = options['fieldsAsRaw'] == null ? {} : options['fieldsAsRaw'];
-  // Return BSONRegExp objects instead of native regular expressions
-  var bsonRegExp = typeof options['bsonRegExp'] == 'boolean' ? options['bsonRegExp'] : false;
-  var promoteBuffers = options['promoteBuffers'] == null ? false : options['promoteBuffers'];
-
-  // Validate that we have at least 4 bytes of buffer
-  if(buffer.length < 5) throw new Error("corrupt bson message < 5 bytes long");
-
-  // Set up index
-  var index = typeof options['index'] == 'number' ? options['index'] : 0;
-
-	// Read the document size
-  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-	// Ensure buffer is valid size
-  if(size < 5 || size > buffer.length) throw new Error("corrupt bson message");
-
-  // Create holding object
-  var object = isArray ? [] : {};
-
-  // While we have more left data left keep parsing
-  while(true) {
-    // Read the type
-    var elementType = buffer[index++];
-    // If we get a zero it's the last byte, exit
-    if(elementType == 0) break;
-    var name = readCStyleStringSpecial(buffer, index);
-		index = index + name.length + 1;
-
-		// console.log("----------- 0 " + elementType + " :: " + name)
-		index = DeserializationMethods[elementType](name, object, buffer, index);
-		// console.log('--------------- 1')
-  }
-
-  // Check if we have a db ref object
-  if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
-
-  // Return the final objects
-  return object;
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEvalWithHash = function(functionCache, hash, functionString, object) {
-  // Contains the value we are going to set
-  var value = null;
-
-  // Check for cache hit, eval if missing and return cached function
-  if(functionCache[hash] == null) {
-    eval("value = " + functionString);
-    functionCache[hash] = value;
-  }
-  // Set the object
-  return functionCache[hash].bind(object);
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEval = function(functionString) {
-  // Contains the value we are going to set
-  var value = null;
-  // Eval the function
-  eval("value = " + functionString);
-  return value;
-}
-
-module.exports = deserialize
diff --git a/node_modules/bson/lib/bson/binary.js b/node_modules/bson/lib/bson/binary.js
deleted file mode 100644
index 793b56f..0000000
--- a/node_modules/bson/lib/bson/binary.js
+++ /dev/null
@@ -1,347 +0,0 @@
-/**
- * Module dependencies.
- * @ignore
- */
-
-// Test if we're in Node via presence of "global" not absence of "window"
-// to support hybrid environments like Electron
-if(typeof global !== 'undefined') {
-  var Buffer = require('buffer').Buffer; // TODO just use global Buffer
-}
-
-/**
- * A class representation of the BSON Binary type.
- *
- * Sub types
- *  - **BSON.BSON_BINARY_SUBTYPE_DEFAULT**, default BSON type.
- *  - **BSON.BSON_BINARY_SUBTYPE_FUNCTION**, BSON function type.
- *  - **BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY**, BSON byte array type.
- *  - **BSON.BSON_BINARY_SUBTYPE_UUID**, BSON uuid type.
- *  - **BSON.BSON_BINARY_SUBTYPE_MD5**, BSON md5 type.
- *  - **BSON.BSON_BINARY_SUBTYPE_USER_DEFINED**, BSON user defined type.
- *
- * @class
- * @param {Buffer} buffer a buffer object containing the binary data.
- * @param {Number} [subType] the option binary type.
- * @return {Binary}
- */
-function Binary(buffer, subType) {
-  if(!(this instanceof Binary)) return new Binary(buffer, subType);
-
-  this._bsontype = 'Binary';
-
-  if(buffer instanceof Number) {
-    this.sub_type = buffer;
-    this.position = 0;
-  } else {
-    this.sub_type = subType == null ? BSON_BINARY_SUBTYPE_DEFAULT : subType;
-    this.position = 0;
-  }
-
-  if(buffer != null && !(buffer instanceof Number)) {
-    // Only accept Buffer, Uint8Array or Arrays
-    if(typeof buffer == 'string') {
-      // Different ways of writing the length of the string for the different types
-      if(typeof Buffer != 'undefined') {
-        this.buffer = new Buffer(buffer);
-      } else if(typeof Uint8Array != 'undefined' || (Object.prototype.toString.call(buffer) == '[object Array]')) {
-        this.buffer = writeStringToArray(buffer);
-      } else {
-        throw new Error("only String, Buffer, Uint8Array or Array accepted");
-      }
-    } else {
-      this.buffer = buffer;
-    }
-    this.position = buffer.length;
-  } else {
-    if(typeof Buffer != 'undefined') {
-      this.buffer =  new Buffer(Binary.BUFFER_SIZE);
-    } else if(typeof Uint8Array != 'undefined'){
-      this.buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE));
-    } else {
-      this.buffer = new Array(Binary.BUFFER_SIZE);
-    }
-    // Set position to start of buffer
-    this.position = 0;
-  }
-};
-
-/**
- * Updates this binary with byte_value.
- *
- * @method
- * @param {string} byte_value a single byte we wish to write.
- */
-Binary.prototype.put = function put(byte_value) {
-  // If it's a string and a has more than one character throw an error
-  if(byte_value['length'] != null && typeof byte_value != 'number' && byte_value.length != 1) throw new Error("only accepts single character String, Uint8Array or Array");
-  if(typeof byte_value != 'number' && byte_value < 0 || byte_value > 255) throw new Error("only accepts number in a valid unsigned byte range 0-255");
-
-  // Decode the byte value once
-  var decoded_byte = null;
-  if(typeof byte_value == 'string') {
-    decoded_byte = byte_value.charCodeAt(0);
-  } else if(byte_value['length'] != null) {
-    decoded_byte = byte_value[0];
-  } else {
-    decoded_byte = byte_value;
-  }
-
-  if(this.buffer.length > this.position) {
-    this.buffer[this.position++] = decoded_byte;
-  } else {
-    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {
-      // Create additional overflow buffer
-      var buffer = new Buffer(Binary.BUFFER_SIZE + this.buffer.length);
-      // Combine the two buffers together
-      this.buffer.copy(buffer, 0, 0, this.buffer.length);
-      this.buffer = buffer;
-      this.buffer[this.position++] = decoded_byte;
-    } else {
-      var buffer = null;
-      // Create a new buffer (typed or normal array)
-      if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
-        buffer = new Uint8Array(new ArrayBuffer(Binary.BUFFER_SIZE + this.buffer.length));
-      } else {
-        buffer = new Array(Binary.BUFFER_SIZE + this.buffer.length);
-      }
-
-      // We need to copy all the content to the new array
-      for(var i = 0; i < this.buffer.length; i++) {
-        buffer[i] = this.buffer[i];
-      }
-
-      // Reassign the buffer
-      this.buffer = buffer;
-      // Write the byte
-      this.buffer[this.position++] = decoded_byte;
-    }
-  }
-};
-
-/**
- * Writes a buffer or string to the binary.
- *
- * @method
- * @param {(Buffer|string)} string a string or buffer to be written to the Binary BSON object.
- * @param {number} offset specify the binary of where to write the content.
- * @return {null}
- */
-Binary.prototype.write = function write(string, offset) {
-  offset = typeof offset == 'number' ? offset : this.position;
-
-  // If the buffer is to small let's extend the buffer
-  if(this.buffer.length < offset + string.length) {
-    var buffer = null;
-    // If we are in node.js
-    if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {
-      buffer = new Buffer(this.buffer.length + string.length);
-      this.buffer.copy(buffer, 0, 0, this.buffer.length);
-    } else if(Object.prototype.toString.call(this.buffer) == '[object Uint8Array]') {
-      // Create a new buffer
-      buffer = new Uint8Array(new ArrayBuffer(this.buffer.length + string.length))
-      // Copy the content
-      for(var i = 0; i < this.position; i++) {
-        buffer[i] = this.buffer[i];
-      }
-    }
-
-    // Assign the new buffer
-    this.buffer = buffer;
-  }
-
-  if(typeof Buffer != 'undefined' && Buffer.isBuffer(string) && Buffer.isBuffer(this.buffer)) {
-    string.copy(this.buffer, offset, 0, string.length);
-    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
-    // offset = string.length
-  } else if(typeof Buffer != 'undefined' && typeof string == 'string' && Buffer.isBuffer(this.buffer)) {
-    this.buffer.write(string, offset, 'binary');
-    this.position = (offset + string.length) > this.position ? (offset + string.length) : this.position;
-    // offset = string.length;
-  } else if(Object.prototype.toString.call(string) == '[object Uint8Array]'
-    || Object.prototype.toString.call(string) == '[object Array]' && typeof string != 'string') {
-    for(var i = 0; i < string.length; i++) {
-      this.buffer[offset++] = string[i];
-    }
-
-    this.position = offset > this.position ? offset : this.position;
-  } else if(typeof string == 'string') {
-    for(var i = 0; i < string.length; i++) {
-      this.buffer[offset++] = string.charCodeAt(i);
-    }
-
-    this.position = offset > this.position ? offset : this.position;
-  }
-};
-
-/**
- * Reads **length** bytes starting at **position**.
- *
- * @method
- * @param {number} position read from the given position in the Binary.
- * @param {number} length the number of bytes to read.
- * @return {Buffer}
- */
-Binary.prototype.read = function read(position, length) {
-  length = length && length > 0
-    ? length
-    : this.position;
-
-  // Let's return the data based on the type we have
-  if(this.buffer['slice']) {
-    return this.buffer.slice(position, position + length);
-  } else {
-    // Create a buffer to keep the result
-    var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(length)) : new Array(length);
-    for(var i = 0; i < length; i++) {
-      buffer[i] = this.buffer[position++];
-    }
-  }
-  // Return the buffer
-  return buffer;
-};
-
-/**
- * Returns the value of this binary as a string.
- *
- * @method
- * @return {string}
- */
-Binary.prototype.value = function value(asRaw) {
-  asRaw = asRaw == null ? false : asRaw;
-
-  // Optimize to serialize for the situation where the data == size of buffer
-  if(asRaw && typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer) && this.buffer.length == this.position)
-    return this.buffer;
-
-  // If it's a node.js buffer object
-  if(typeof Buffer != 'undefined' && Buffer.isBuffer(this.buffer)) {
-    return asRaw ? this.buffer.slice(0, this.position) : this.buffer.toString('binary', 0, this.position);
-  } else {
-    if(asRaw) {
-      // we support the slice command use it
-      if(this.buffer['slice'] != null) {
-        return this.buffer.slice(0, this.position);
-      } else {
-        // Create a new buffer to copy content to
-        var newBuffer = Object.prototype.toString.call(this.buffer) == '[object Uint8Array]' ? new Uint8Array(new ArrayBuffer(this.position)) : new Array(this.position);
-        // Copy content
-        for(var i = 0; i < this.position; i++) {
-          newBuffer[i] = this.buffer[i];
-        }
-        // Return the buffer
-        return newBuffer;
-      }
-    } else {
-      return convertArraytoUtf8BinaryString(this.buffer, 0, this.position);
-    }
-  }
-};
-
-/**
- * Length.
- *
- * @method
- * @return {number} the length of the binary.
- */
-Binary.prototype.length = function length() {
-  return this.position;
-};
-
-/**
- * @ignore
- */
-Binary.prototype.toJSON = function() {
-  return this.buffer != null ? this.buffer.toString('base64') : '';
-}
-
-/**
- * @ignore
- */
-Binary.prototype.toString = function(format) {
-  return this.buffer != null ? this.buffer.slice(0, this.position).toString(format) : '';
-}
-
-/**
- * Binary default subtype
- * @ignore
- */
-var BSON_BINARY_SUBTYPE_DEFAULT = 0;
-
-/**
- * @ignore
- */
-var writeStringToArray = function(data) {
-  // Create a buffer
-  var buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(data.length)) : new Array(data.length);
-  // Write the content to the buffer
-  for(var i = 0; i < data.length; i++) {
-    buffer[i] = data.charCodeAt(i);
-  }
-  // Write the string to the buffer
-  return buffer;
-}
-
-/**
- * Convert Array ot Uint8Array to Binary String
- *
- * @ignore
- */
-var convertArraytoUtf8BinaryString = function(byteArray, startIndex, endIndex) {
-  var result = "";
-  for(var i = startIndex; i < endIndex; i++) {
-   result = result + String.fromCharCode(byteArray[i]);
-  }
-  return result;
-};
-
-Binary.BUFFER_SIZE = 256;
-
-/**
- * Default BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_DEFAULT = 0;
-/**
- * Function BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_FUNCTION = 1;
-/**
- * Byte Array BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_BYTE_ARRAY = 2;
-/**
- * OLD UUID BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_UUID_OLD = 3;
-/**
- * UUID BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_UUID = 4;
-/**
- * MD5 BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_MD5 = 5;
-/**
- * User BSON type
- *
- * @classconstant SUBTYPE_DEFAULT
- **/
-Binary.SUBTYPE_USER_DEFINED = 128;
-
-/**
- * Expose.
- */
-module.exports = Binary;
-module.exports.Binary = Binary;
diff --git a/node_modules/bson/lib/bson/bson.js b/node_modules/bson/lib/bson/bson.js
deleted file mode 100644
index 60bdde2..0000000
--- a/node_modules/bson/lib/bson/bson.js
+++ /dev/null
@@ -1,325 +0,0 @@
-"use strict"
-
-var writeIEEE754 = require('./float_parser').writeIEEE754,
-	readIEEE754 = require('./float_parser').readIEEE754,
-  Map = require('./map'),
-	Long = require('./long').Long,
-  Double = require('./double').Double,
-  Timestamp = require('./timestamp').Timestamp,
-  ObjectID = require('./objectid').ObjectID,
-  BSONRegExp = require('./regexp').BSONRegExp,
-  Symbol = require('./symbol').Symbol,
-  Code = require('./code').Code,
-	Decimal128 = require('./decimal128').Decimal128,
-  MinKey = require('./min_key').MinKey,
-  MaxKey = require('./max_key').MaxKey,
-  DBRef = require('./db_ref').DBRef,
-  Binary = require('./binary').Binary;
-
-// Parts of the parser
-var deserialize = require('./parser/deserializer'),
-	serializer = require('./parser/serializer'),
-	calculateObjectSize = require('./parser/calculate_size');
-
-/**
- * @ignore
- * @api private
- */
-// Max Size
-var MAXSIZE = (1024*1024*17);
-// Max Document Buffer size
-var buffer = new Buffer(MAXSIZE);
-
-var BSON = function() {
-}
-
-/**
- * Serialize a Javascript object.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Boolean} asBuffer return the serialized object as a Buffer object **(ignore)**.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Buffer} returns the Buffer object containing the serialized object.
- * @api public
- */
-BSON.prototype.serialize = function serialize(object, checkKeys, asBuffer, serializeFunctions, index, ignoreUndefined) {
-	// Attempt to serialize
-	var serializationIndex = serializer(buffer, object, checkKeys, index || 0, 0, serializeFunctions, ignoreUndefined);
-	// Create the final buffer
-	var finishedBuffer = new Buffer(serializationIndex);
-	// Copy into the finished buffer
-	buffer.copy(finishedBuffer, 0, 0, finishedBuffer.length);
-	// Return the buffer
-	return finishedBuffer;
-}
-
-/**
- * Serialize a Javascript object using a predefined Buffer and index into the buffer, useful when pre-allocating the space for serialization.
- *
- * @param {Object} object the Javascript object to serialize.
- * @param {Boolean} checkKeys the serializer will check if keys are valid.
- * @param {Buffer} buffer the Buffer you pre-allocated to store the serialized BSON object.
- * @param {Number} index the index in the buffer where we wish to start serializing into.
- * @param {Boolean} serializeFunctions serialize the javascript functions **(default:false)**.
- * @return {Number} returns the index pointing to the last written byte in the buffer.
- * @api public
- */
-BSON.prototype.serializeWithBufferAndIndex = function(object, checkKeys, finalBuffer, startIndex, serializeFunctions, ignoreUndefined) {
-	// Attempt to serialize
-	var serializationIndex = serializer(buffer, object, checkKeys, startIndex || 0, 0, serializeFunctions, ignoreUndefined);
-	buffer.copy(finalBuffer, startIndex, 0, serializationIndex);
-	// Return the index
-	return serializationIndex - 1;
-}
-
-/**
- * Deserialize data as BSON.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *  - **promoteLongs** {Boolean, default:true}, when deserializing a Long will fit it into a Number if it's smaller than 53 bits
- *
- * @param {Buffer} buffer the buffer containing the serialized set of BSON documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @param {Boolean} [isArray] ignore used for recursive parsing.
- * @return {Object} returns the deserialized Javascript Object.
- * @api public
- */
-BSON.prototype.deserialize = function(data, options) {
-  return deserialize(data, options);
-}
-
-/**
- * Calculate the bson size for a passed in Javascript object.
- *
- * @param {Object} object the Javascript object to calculate the BSON byte size for.
- * @param {Boolean} [serializeFunctions] serialize all functions in the object **(default:false)**.
- * @return {Number} returns the number of bytes the BSON object will take up.
- * @api public
- */
-BSON.prototype.calculateObjectSize = function(object, serializeFunctions, ignoreUndefined) {
-  return calculateObjectSize(object, serializeFunctions, ignoreUndefined);
-}
-
-/**
- * Deserialize stream data as BSON documents.
- *
- * Options
- *  - **evalFunctions** {Boolean, default:false}, evaluate functions in the BSON document scoped to the object deserialized.
- *  - **cacheFunctions** {Boolean, default:false}, cache evaluated functions for reuse.
- *  - **cacheFunctionsCrc32** {Boolean, default:false}, use a crc32 code for caching, otherwise use the string of the function.
- *  - **promoteLongs** {Boolean, default:true}, when deserializing a Long will fit it into a Number if it's smaller than 53 bits
- *
- * @param {Buffer} data the buffer containing the serialized set of BSON documents.
- * @param {Number} startIndex the start index in the data Buffer where the deserialization is to start.
- * @param {Number} numberOfDocuments number of documents to deserialize.
- * @param {Array} documents an array where to store the deserialized documents.
- * @param {Number} docStartIndex the index in the documents array from where to start inserting documents.
- * @param {Object} [options] additional options used for the deserialization.
- * @return {Number} returns the next index in the buffer after deserialization **x** numbers of documents.
- * @api public
- */
-BSON.prototype.deserializeStream = function(data, startIndex, numberOfDocuments, documents, docStartIndex, options) {
-  // if(numberOfDocuments !== documents.length) throw new Error("Number of expected results back is less than the number of documents");
-  options = options != null ? options : {};
-  var index = startIndex;
-  // Loop over all documents
-  for(var i = 0; i < numberOfDocuments; i++) {
-    // Find size of the document
-    var size = data[index] | data[index + 1] << 8 | data[index + 2] << 16 | data[index + 3] << 24;
-    // Update options with index
-    options['index'] = index;
-    // Parse the document at this point
-    documents[docStartIndex + i] = this.deserialize(data, options);
-    // Adjust index by the document size
-    index = index + size;
-  }
-
-  // Return object containing end index of parsing and list of documents
-  return index;
-}
-
-/**
- * @ignore
- * @api private
- */
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
-BSON.BSON_INT64_MIN = -Math.pow(2, 63);
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-// Internal long versions
-var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
-var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
-
-/**
- * Number BSON Type
- *
- * @classconstant BSON_DATA_NUMBER
- **/
-BSON.BSON_DATA_NUMBER = 1;
-/**
- * String BSON Type
- *
- * @classconstant BSON_DATA_STRING
- **/
-BSON.BSON_DATA_STRING = 2;
-/**
- * Object BSON Type
- *
- * @classconstant BSON_DATA_OBJECT
- **/
-BSON.BSON_DATA_OBJECT = 3;
-/**
- * Array BSON Type
- *
- * @classconstant BSON_DATA_ARRAY
- **/
-BSON.BSON_DATA_ARRAY = 4;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_BINARY
- **/
-BSON.BSON_DATA_BINARY = 5;
-/**
- * ObjectID BSON Type
- *
- * @classconstant BSON_DATA_OID
- **/
-BSON.BSON_DATA_OID = 7;
-/**
- * Boolean BSON Type
- *
- * @classconstant BSON_DATA_BOOLEAN
- **/
-BSON.BSON_DATA_BOOLEAN = 8;
-/**
- * Date BSON Type
- *
- * @classconstant BSON_DATA_DATE
- **/
-BSON.BSON_DATA_DATE = 9;
-/**
- * null BSON Type
- *
- * @classconstant BSON_DATA_NULL
- **/
-BSON.BSON_DATA_NULL = 10;
-/**
- * RegExp BSON Type
- *
- * @classconstant BSON_DATA_REGEXP
- **/
-BSON.BSON_DATA_REGEXP = 11;
-/**
- * Code BSON Type
- *
- * @classconstant BSON_DATA_CODE
- **/
-BSON.BSON_DATA_CODE = 13;
-/**
- * Symbol BSON Type
- *
- * @classconstant BSON_DATA_SYMBOL
- **/
-BSON.BSON_DATA_SYMBOL = 14;
-/**
- * Code with Scope BSON Type
- *
- * @classconstant BSON_DATA_CODE_W_SCOPE
- **/
-BSON.BSON_DATA_CODE_W_SCOPE = 15;
-/**
- * 32 bit Integer BSON Type
- *
- * @classconstant BSON_DATA_INT
- **/
-BSON.BSON_DATA_INT = 16;
-/**
- * Timestamp BSON Type
- *
- * @classconstant BSON_DATA_TIMESTAMP
- **/
-BSON.BSON_DATA_TIMESTAMP = 17;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_LONG
- **/
-BSON.BSON_DATA_LONG = 18;
-/**
- * MinKey BSON Type
- *
- * @classconstant BSON_DATA_MIN_KEY
- **/
-BSON.BSON_DATA_MIN_KEY = 0xff;
-/**
- * MaxKey BSON Type
- *
- * @classconstant BSON_DATA_MAX_KEY
- **/
-BSON.BSON_DATA_MAX_KEY = 0x7f;
-
-/**
- * Binary Default Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
- **/
-BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
-/**
- * Binary Function Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
- **/
-BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
-/**
- * Binary Byte Array Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
- **/
-BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
-/**
- * Binary UUID Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_UUID
- **/
-BSON.BSON_BINARY_SUBTYPE_UUID = 3;
-/**
- * Binary MD5 Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_MD5
- **/
-BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
-/**
- * Binary User Defined Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
- **/
-BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
-
-// Return BSON
-module.exports = BSON;
-module.exports.Code = Code;
-module.exports.Map = Map;
-module.exports.Symbol = Symbol;
-module.exports.BSON = BSON;
-module.exports.DBRef = DBRef;
-module.exports.Binary = Binary;
-module.exports.ObjectID = ObjectID;
-module.exports.Long = Long;
-module.exports.Timestamp = Timestamp;
-module.exports.Double = Double;
-module.exports.MinKey = MinKey;
-module.exports.MaxKey = MaxKey;
-module.exports.BSONRegExp = BSONRegExp;
-module.exports.Decimal128 = Decimal128;
diff --git a/node_modules/bson/lib/bson/code.js b/node_modules/bson/lib/bson/code.js
deleted file mode 100644
index bc80ce5..0000000
--- a/node_modules/bson/lib/bson/code.js
+++ /dev/null
@@ -1,24 +0,0 @@
-/**
- * A class representation of the BSON Code type.
- *
- * @class
- * @param {(string|function)} code a string or function.
- * @param {Object} [scope] an optional scope for the function.
- * @return {Code}
- */
-var Code = function Code(code, scope) {
-  if(!(this instanceof Code)) return new Code(code, scope);
-  this._bsontype = 'Code';
-  this.code = code;
-  this.scope = scope;
-};
-
-/**
- * @ignore
- */
-Code.prototype.toJSON = function() {
-  return {scope:this.scope, code:this.code};
-}
-
-module.exports = Code;
-module.exports.Code = Code;
diff --git a/node_modules/bson/lib/bson/db_ref.js b/node_modules/bson/lib/bson/db_ref.js
deleted file mode 100644
index 06789a6..0000000
--- a/node_modules/bson/lib/bson/db_ref.js
+++ /dev/null
@@ -1,32 +0,0 @@
-/**
- * A class representation of the BSON DBRef type.
- *
- * @class
- * @param {string} namespace the collection name.
- * @param {ObjectID} oid the reference ObjectID.
- * @param {string} [db] optional db name, if omitted the reference is local to the current db.
- * @return {DBRef}
- */
-function DBRef(namespace, oid, db) {
-  if(!(this instanceof DBRef)) return new DBRef(namespace, oid, db);
-  
-  this._bsontype = 'DBRef';
-  this.namespace = namespace;
-  this.oid = oid;
-  this.db = db;
-};
-
-/**
- * @ignore
- * @api private
- */
-DBRef.prototype.toJSON = function() {
-  return {
-    '$ref':this.namespace,
-    '$id':this.oid,
-    '$db':this.db == null ? '' : this.db
-  };
-}
-
-module.exports = DBRef;
-module.exports.DBRef = DBRef;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/decimal128.js b/node_modules/bson/lib/bson/decimal128.js
deleted file mode 100644
index 23ae082..0000000
--- a/node_modules/bson/lib/bson/decimal128.js
+++ /dev/null
@@ -1,728 +0,0 @@
-"use strict"
-
-var Long = require('./long');
-
-var PARSE_STRING_REGEXP = /^(\+|\-)?(\d+|(\d*\.\d*))?(E|e)?([\-\+])?(\d+)?$/;
-var PARSE_INF_REGEXP = /^(\+|\-)?(Infinity|inf)$/i;
-var PARSE_NAN_REGEXP = /^(\+|\-)?NaN$/i;
-
-var EXPONENT_MAX = 6111;
-var EXPONENT_MIN = -6176;
-var EXPONENT_BIAS = 6176;
-var MAX_DIGITS = 34;
-
-// Nan value bits as 32 bit values (due to lack of longs)
-var NAN_BUFFER = [0x7c, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00].reverse();
-// Infinity value bits 32 bit values (due to lack of longs)
-var INF_NEGATIVE_BUFFER = [0xf8, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00].reverse();
-var INF_POSITIVE_BUFFER = [0x78, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00].reverse();
-
-var EXPONENT_REGEX = /^([\-\+])?(\d+)?$/;
-
-
-// Detect if the value is a digit
-var isDigit = function(value) {
-  return !isNaN(parseInt(value, 10));
-}
-
-// Divide two uint128 values
-var divideu128 = function(value) {
-  var DIVISOR = Long.fromNumber(1000 * 1000 * 1000);
-  var _rem = Long.fromNumber(0);
-  var i = 0;
-
-  if(!value.parts[0] && !value.parts[1] &&
-     !value.parts[2] && !value.parts[3]) {
-    return { quotient: value, rem: _rem };
-  }
-
-  for(var i = 0; i <= 3; i++) {
-    // Adjust remainder to match value of next dividend
-    _rem = _rem.shiftLeft(32);
-    // Add the divided to _rem
-    _rem = _rem.add(new Long(value.parts[i], 0));
-    value.parts[i] = _rem.div(DIVISOR).low_;
-    _rem = _rem.modulo(DIVISOR);
-  }
-
-  return { quotient: value, rem: _rem };
-}
-
-// Multiply two Long values and return the 128 bit value
-var multiply64x2 = function(left, right) {
-  if(!left && !right) {
-    return {high: Long.fromNumber(0), low: Long.fromNumber(0)};
-  }
-
-  var leftHigh = left.shiftRightUnsigned(32);
-  var leftLow = new Long(left.getLowBits(), 0);
-  var rightHigh = right.shiftRightUnsigned(32);
-  var rightLow = new Long(right.getLowBits(), 0);
-
-  var productHigh = leftHigh.multiply(rightHigh);
-  var productMid = leftHigh.multiply(rightLow);
-  var productMid2 = leftLow.multiply(rightHigh);
-  var productLow = leftLow.multiply(rightLow);
-
-  productHigh = productHigh.add(productMid.shiftRightUnsigned(32));
-  productMid = new Long(productMid.getLowBits(), 0)
-                .add(productMid2)
-                .add(productLow.shiftRightUnsigned(32));
-
-  productHigh = productHigh.add(productMid.shiftRightUnsigned(32));
-  productLow = productMid.shiftLeft(32).add(new Long(productLow.getLowBits(), 0));
-
-  // Return the 128 bit result
-  return {high: productHigh, low: productLow};
-}
-
-var lessThan = function(left, right) {
-  // Make values unsigned
-  var uhleft = left.high_ >>> 0;
-  var uhright = right.high_ >>> 0;
-
-  // Compare high bits first
-  if(uhleft < uhright) {
-    return true
-  } else if(uhleft == uhright) {
-    var ulleft = left.low_ >>> 0;
-    var ulright = right.low_ >>> 0;
-    if(ulleft < ulright) return true;
-  }
-
-  return false;
-}
-
-var longtoHex = function(value) {
-  var buffer = new Buffer(8);
-  var index = 0;
-  // Encode the low 64 bits of the decimal
-  // Encode low bits
-  buffer[index++] = value.low_ & 0xff;
-  buffer[index++] = (value.low_ >> 8) & 0xff;
-  buffer[index++] = (value.low_ >> 16) & 0xff;
-  buffer[index++] = (value.low_ >> 24) & 0xff;
-  // Encode high bits
-  buffer[index++] = value.high_ & 0xff;
-  buffer[index++] = (value.high_ >> 8) & 0xff;
-  buffer[index++] = (value.high_ >> 16) & 0xff;
-  buffer[index++] = (value.high_ >> 24) & 0xff;
-  return buffer.reverse().toString('hex');
-}
-
-var int32toHex = function(value) {
-  var buffer = new Buffer(4);
-  var index = 0;
-  // Encode the low 64 bits of the decimal
-  // Encode low bits
-  buffer[index++] = value & 0xff;
-  buffer[index++] = (value >> 8) & 0xff;
-  buffer[index++] = (value >> 16) & 0xff;
-  buffer[index++] = (value >> 24) & 0xff;
-  return buffer.reverse().toString('hex');
-}
-
-var Decimal128 = function(bytes) {
-  this._bsontype = 'Decimal128';
-  this.bytes = bytes;
-}
-
-Decimal128.fromString = function(string) {
-  // Parse state tracking
-  var isNegative = false;
-  var sawRadix = false;
-  var foundNonZero = false;
-
-  // Total number of significant digits (no leading or trailing zero)
-  var significantDigits = 0;
-  // Total number of significand digits read
-  var nDigitsRead = 0;
-  // Total number of digits (no leading zeros)
-  var nDigits = 0;
-  // The number of the digits after radix
-  var radixPosition = 0;
-  // The index of the first non-zero in *str*
-  var firstNonZero = 0;
-
-  // Digits Array
-  var digits = [0];
-  // The number of digits in digits
-  var nDigitsStored = 0;
-  // Insertion pointer for digits
-  var digitsInsert = 0;
-  // The index of the first non-zero digit
-  var firstDigit = 0;
-  // The index of the last digit
-  var lastDigit = 0;
-
-  // Exponent
-  var exponent = 0;
-  // loop index over array
-  var i = 0;
-  // The high 17 digits of the significand
-  var significandHigh = [0, 0];
-  // The low 17 digits of the significand
-  var significandLow = [0, 0];
-  // The biased exponent
-  var biasedExponent = 0;
-
-  // Read index
-  var index = 0;
-
-  // Trim the string
-  string = string.trim();
-
-  // Results
-  var stringMatch = string.match(PARSE_STRING_REGEXP);
-  var infMatch = string.match(PARSE_INF_REGEXP);
-  var nanMatch = string.match(PARSE_NAN_REGEXP);
-
-  // Validate the string
-  if(!stringMatch
-    && ! infMatch
-    && ! nanMatch || string.length == 0) {
-      throw new Error("" + string + " not a valid Decimal128 string");
-  }
-
-  // Check if we have an illegal exponent format
-  if(stringMatch && stringMatch[4] && stringMatch[2] === undefined) {
-    throw new Error("" + string + " not a valid Decimal128 string");
-  }
-
-  // Get the negative or positive sign
-  if(string[index] == '+' || string[index] == '-') {
-    isNegative = string[index++] == '-';
-  }
-
-  // Check if user passed Infinity or NaN
-  if(!isDigit(string[index]) && string[index] != '.') {
-    if(string[index] == 'i' || string[index] == 'I') {
-      return new Decimal128(new Buffer(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER));
-    } else if(string[index] == 'N') {
-      return new Decimal128(new Buffer(NAN_BUFFER));
-    }
-  }
-
-  // Read all the digits
-  while(isDigit(string[index]) || string[index] == '.') {
-    if(string[index] == '.') {
-      if(sawRadix) {
-        return new Decimal128(new Buffer(NAN_BUFFER));
-      }
-
-      sawRadix = true;
-      index = index + 1;
-      continue;
-    }
-
-    if(nDigitsStored < 34) {
-      if(string[index] != '0' || foundNonZero) {
-        if(!foundNonZero) {
-          firstNonZero = nDigitsRead;
-        }
-
-        foundNonZero = true;
-
-        // Only store 34 digits
-        digits[digitsInsert++] = parseInt(string[index], 10);
-        nDigitsStored = nDigitsStored + 1;
-      }
-    }
-
-    if(foundNonZero) {
-      nDigits = nDigits + 1;
-    }
-
-    if(sawRadix) {
-      radixPosition = radixPosition + 1;
-    }
-
-    nDigitsRead = nDigitsRead + 1;
-    index = index + 1;
-  }
-
-  if(sawRadix && !nDigitsRead) {
-    throw new Error("" + string + " not a valid Decimal128 string");
-  }
-
-  // Read exponent if exists
-  if(string[index] == 'e' || string[index] == 'E') {
-    // Read exponent digits
-    var match = string.substr(++index).match(EXPONENT_REGEX);
-
-    // No digits read
-    if(!match || !match[2]) {
-      return new Decimal128(new Buffer(NAN_BUFFER));
-    }
-
-    // Get exponent
-    exponent = parseInt(match[0], 10);
-
-    // Adjust the index
-    index = index + match[0].length;
-  }
-
-  // Return not a number
-  if(string[index]) {
-    return new Decimal128(new Buffer(NAN_BUFFER));
-  }
-
-  // Done reading input
-  // Find first non-zero digit in digits
-  firstDigit = 0;
-
-  if(!nDigitsStored) {
-    firstDigit = 0;
-    lastDigit = 0;
-    digits[0] = 0;
-    nDigits = 1;
-    nDigitsStored = 1;
-    significantDigits = 0;
-  } else {
-    lastDigit = nDigitsStored - 1;
-    significantDigits = nDigits;
-
-    if(exponent != 0 && significantDigits != 1) {
-      while(string[firstNonZero + significantDigits - 1] == '0') {
-        significantDigits = significantDigits - 1;
-      }
-    }
-  }
-
-  // Normalization of exponent
-  // Correct exponent based on radix position, and shift significand as needed
-  // to represent user input
-
-  // Overflow prevention
-  if(exponent <= radixPosition && radixPosition - exponent > (1 << 14)) {
-    exponent = EXPONENT_MIN;
-  } else {
-    exponent = exponent - radixPosition;
-  }
-
-  // Attempt to normalize the exponent
-  while(exponent > EXPONENT_MAX) {
-    // Shift exponent to significand and decrease
-    lastDigit = lastDigit + 1;
-
-    if(lastDigit - firstDigit > MAX_DIGITS) {
-      // Check if we have a zero then just hard clamp, otherwise fail
-      var digitsString = digits.join('');
-      if(digitsString.match(/^0+$/)) {
-        exponent = EXPONENT_MAX;
-        break;
-      } else {
-        return new Decimal128(new Buffer(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER));
-      }
-    }
-
-    exponent = exponent - 1;
-  }
-
-  while(exponent < EXPONENT_MIN || nDigitsStored < nDigits) {
-    // Shift last digit
-    if(lastDigit == 0) {
-      exponent = EXPONENT_MIN;
-      significantDigits = 0;
-      break;
-    }
-
-    if(nDigitsStored < nDigits) {
-      // adjust to match digits not stored
-      nDigits = nDigits - 1;
-    } else {
-      // adjust to round
-      lastDigit = lastDigit - 1;
-    }
-
-    if(exponent < EXPONENT_MAX) {
-      exponent = exponent + 1;
-    } else {
-      // Check if we have a zero then just hard clamp, otherwise fail
-      var digitsString = digits.join('');
-      if(digitsString.match(/^0+$/)) {
-        exponent = EXPONENT_MAX;
-        break;
-      } else {
-        return new Decimal128(new Buffer(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER))
-      }
-    }
-  }
-
-
-  // Round
-  // We've normalized the exponent, but might still need to round.
-  if((lastDigit - firstDigit + 1 < significantDigits) && string[significantDigits] != '0') {
-    var endOfString = nDigitsRead;
-
-    // If we have seen a radix point, 'string' is 1 longer than we have
-    // documented with ndigits_read, so inc the position of the first nonzero
-    // digit and the position that digits are read to.
-    if(sawRadix && exponent == EXPONENT_MIN) {
-      firstNonZero = firstNonZero + 1;
-      endOfString = endOfString + 1;
-    }
-
-    var roundDigit = parseInt(string[firstNonZero + lastDigit + 1], 10);
-    var roundBit = 0;
-
-    if(roundDigit >= 5) {
-      roundBit = 1;
-
-      if(roundDigit == 5) {
-        roundBit = digits[lastDigit] % 2 == 1;
-
-        for(var i = firstNonZero + lastDigit + 2; i < endOfString; i++) {
-          if(parseInt(string[i], 10)) {
-            roundBit = 1;
-            break;
-          }
-        }
-      }
-    }
-
-    if(roundBit) {
-      var dIdx = lastDigit;
-
-      for(; dIdx >= 0; dIdx--) {
-        if(++digits[dIdx] > 9) {
-          digits[dIdx] = 0;
-
-          // overflowed most significant digit
-          if(dIdx == 0) {
-            if(exponent < EXPONENT_MAX) {
-              exponent = exponent + 1;
-              digits[dIdx] = 1;
-            } else {
-              return new Decimal128(new Buffer(isNegative ? INF_NEGATIVE_BUFFER : INF_POSITIVE_BUFFER))
-            }
-          }
-        } else {
-          break;
-        }
-      }
-    }
-  }
-
-  // Encode significand
-  // The high 17 digits of the significand
-  significandHigh = Long.fromNumber(0);
-  // The low 17 digits of the significand
-  significandLow = Long.fromNumber(0);
-
-  // read a zero
-  if(significantDigits == 0) {
-    significandHigh = Long.fromNumber(0);
-    significandLow = Long.fromNumber(0);
-  } else if(lastDigit - firstDigit < 17) {
-    var dIdx = firstDigit;
-    significandLow = Long.fromNumber(digits[dIdx++]);
-    significandHigh = new Long(0, 0);
-
-    for(; dIdx <= lastDigit; dIdx++) {
-      significandLow = significandLow.multiply(Long.fromNumber(10));
-      significandLow = significandLow.add(Long.fromNumber(digits[dIdx]));
-    }
-  } else {
-    var dIdx = firstDigit;
-    significandHigh = Long.fromNumber(digits[dIdx++]);
-
-    for(; dIdx <= lastDigit - 17; dIdx++) {
-      significandHigh = significandHigh.multiply(Long.fromNumber(10));
-      significandHigh = significandHigh.add(Long.fromNumber(digits[dIdx]));
-    }
-
-    significandLow = Long.fromNumber(digits[dIdx++]);
-
-    for(; dIdx <= lastDigit; dIdx++) {
-      significandLow = significandLow.multiply(Long.fromNumber(10));
-      significandLow = significandLow.add(Long.fromNumber(digits[dIdx]));
-    }
-  }
-
-  var significand = multiply64x2(significandHigh, Long.fromString("100000000000000000"));
-
-  significand.low = significand.low.add(significandLow);
-
-  if(lessThan(significand.low, significandLow)) {
-    significand.high = significand.high.add(Long.fromNumber(1));
-  }
-
-  // Biased exponent
-  var biasedExponent = (exponent + EXPONENT_BIAS);
-  var dec = { low: Long.fromNumber(0), high: Long.fromNumber(0) };
-
-  // Encode combination, exponent, and significand.
-  if(significand.high.shiftRightUnsigned(49).and(Long.fromNumber(1)).equals(Long.fromNumber)) {
-    // Encode '11' into bits 1 to 3
-    dec.high = dec.high.or(Long.fromNumber(0x3).shiftLeft(61));
-    dec.high = dec.high.or(Long.fromNumber(biasedExponent).and(Long.fromNumber(0x3fff).shiftLeft(47)));
-    dec.high = dec.high.or(significand.high.and(Long.fromNumber(0x7fffffffffff)));
-  } else {
-    dec.high = dec.high.or(Long.fromNumber(biasedExponent & 0x3fff).shiftLeft(49));
-    dec.high = dec.high.or(significand.high.and(Long.fromNumber(0x1ffffffffffff)));
-  }
-
-  dec.low = significand.low;
-
-  // Encode sign
-  if(isNegative) {
-    dec.high = dec.high.or(Long.fromString('9223372036854775808'));
-  }
-
-  // Encode into a buffer
-  var buffer = new Buffer(16);
-  var index = 0;
-
-  // Encode the low 64 bits of the decimal
-  // Encode low bits
-  buffer[index++] = dec.low.low_ & 0xff;
-  buffer[index++] = (dec.low.low_ >> 8) & 0xff;
-  buffer[index++] = (dec.low.low_ >> 16) & 0xff;
-  buffer[index++] = (dec.low.low_ >> 24) & 0xff;
-  // Encode high bits
-  buffer[index++] = dec.low.high_ & 0xff;
-  buffer[index++] = (dec.low.high_ >> 8) & 0xff;
-  buffer[index++] = (dec.low.high_ >> 16) & 0xff;
-  buffer[index++] = (dec.low.high_ >> 24) & 0xff;
-
-  // Encode the high 64 bits of the decimal
-  // Encode low bits
-  buffer[index++] = dec.high.low_ & 0xff;
-  buffer[index++] = (dec.high.low_ >> 8) & 0xff;
-  buffer[index++] = (dec.high.low_ >> 16) & 0xff;
-  buffer[index++] = (dec.high.low_ >> 24) & 0xff;
-  // Encode high bits
-  buffer[index++] = dec.high.high_ & 0xff;
-  buffer[index++] = (dec.high.high_ >> 8) & 0xff;
-  buffer[index++] = (dec.high.high_ >> 16) & 0xff;
-  buffer[index++] = (dec.high.high_ >> 24) & 0xff;
-
-  // Return the new Decimal128
-  return new Decimal128(buffer);
-}
-
-// Extract least significant 5 bits
-var COMBINATION_MASK = 0x1f;
-// Extract least significant 14 bits
-var EXPONENT_MASK = 0x3fff;
-// Value of combination field for Inf
-var COMBINATION_INFINITY = 30;
-// Value of combination field for NaN
-var COMBINATION_NAN = 31;
-// Value of combination field for NaN
-var COMBINATION_SNAN = 32;
-// decimal128 exponent bias
-var EXPONENT_BIAS = 6176;
-
-Decimal128.prototype.toString = function() {
-  // Note: bits in this routine are referred to starting at 0,
-  // from the sign bit, towards the coefficient.
-
-  // bits 0 - 31
-  var high;
-  // bits 32 - 63
-  var midh;
-  // bits 64 - 95
-  var midl;
-  // bits 96 - 127
-  var low;
-  // bits 1 - 5
-  var combination;
-  // decoded biased exponent (14 bits)
-  var biased_exponent;
-  // the number of significand digits
-  var significand_digits = 0;
-  // the base-10 digits in the significand
-  var significand = new Array(36);
-  for(var i = 0; i < significand.length; i++) significand[i] = 0;
-  // read pointer into significand
-  var index = 0;
-
-  // unbiased exponent
-  var exponent;
-  // the exponent if scientific notation is used
-  var scientific_exponent;
-
-  // true if the number is zero
-  var is_zero = false;
-
-  // the most signifcant significand bits (50-46)
-  var significand_msb;
-  // temporary storage for significand decoding
-  var significand128 = {parts: new Array(4)};
-  // indexing variables
-  var i;
-  var j, k;
-
-  // Output string
-  var string = [];
-
-  // Unpack index
-  var index = 0;
-
-  // Buffer reference
-  var buffer = this.bytes;
-
-  // Unpack the low 64bits into a long
-  low = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-  midl = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-  // Unpack the high 64bits into a long
-  midh = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-  high = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-  // Unpack index
-  var index = 0;
-
-  // Create the state of the decimal
-  var dec = {
-    low: new Long(low, midl),
-    high: new Long(midh, high) };
-
-  if(dec.high.lessThan(Long.ZERO)) {
-    string.push('-');
-  }
-
-  // Decode combination field and exponent
-  combination = (high >> 26) & COMBINATION_MASK;
-
-  if((combination >> 3) == 3) {
-    // Check for 'special' values
-    if(combination == COMBINATION_INFINITY) {
-      return string.join('') + "Infinity";
-    } else if(combination == COMBINATION_NAN) {
-      return "NaN";
-    } else {
-      biased_exponent = (high >> 15) & EXPONENT_MASK;
-      significand_msb = 0x08 + ((high >> 14) & 0x01);
-    }
-  } else {
-    significand_msb = (high >> 14) & 0x07;
-    biased_exponent = (high >> 17) & EXPONENT_MASK;
-  }
-
-  exponent = biased_exponent - EXPONENT_BIAS;
-
-  // Create string of significand digits
-
-  // Convert the 114-bit binary number represented by
-  // (significand_high, significand_low) to at most 34 decimal
-  // digits through modulo and division.
-  significand128.parts[0] = (high & 0x3fff) + ((significand_msb & 0xf) << 14);
-  significand128.parts[1] = midh;
-  significand128.parts[2] = midl;
-  significand128.parts[3] = low;
-
-  if(significand128.parts[0] == 0 && significand128.parts[1] == 0
-    && significand128.parts[2] == 0 && significand128.parts[3] == 0) {
-      is_zero = true;
-  } else {
-    for(var k = 3; k >= 0; k--) {
-      var least_digits = 0;
-      // Peform the divide
-      var result = divideu128(significand128);
-      significand128 = result.quotient;
-      least_digits = result.rem.low_;
-
-      // We now have the 9 least significant digits (in base 2).
-      // Convert and output to string.
-      if(!least_digits) continue;
-
-      for(var j = 8; j >= 0; j--) {
-        // significand[k * 9 + j] = Math.round(least_digits % 10);
-        significand[k * 9 + j] = least_digits % 10;
-        // least_digits = Math.round(least_digits / 10);
-        least_digits = Math.floor(least_digits / 10);
-      }
-    }
-  }
-
-  // Output format options:
-  // Scientific - [-]d.dddE(+/-)dd or [-]dE(+/-)dd
-  // Regular    - ddd.ddd
-
-  if(is_zero) {
-    significand_digits = 1;
-    significand[index] = 0;
-  } else {
-    significand_digits = 36;
-    var i = 0;
-
-    while(!significand[index]) {
-      i++;
-      significand_digits = significand_digits - 1;
-      index = index + 1;
-    }
-  }
-
-  scientific_exponent = significand_digits - 1 + exponent;
-
-  // The scientific exponent checks are dictated by the string conversion
-  // specification and are somewhat arbitrary cutoffs.
-  //
-  // We must check exponent > 0, because if this is the case, the number
-  // has trailing zeros.  However, we *cannot* output these trailing zeros,
-  // because doing so would change the precision of the value, and would
-  // change stored data if the string converted number is round tripped.
-
-  if(scientific_exponent >= 34 || scientific_exponent <= -7 ||
-    exponent > 0) {
-    // Scientific format
-    string.push(significand[index++]);
-    significand_digits = significand_digits - 1;
-
-    if(significand_digits) {
-      string.push('.');
-    }
-
-    for(var i = 0; i < significand_digits; i++) {
-      string.push(significand[index++]);
-    }
-
-    // Exponent
-    string.push('E');
-    if(scientific_exponent > 0) {
-      string.push('+' + scientific_exponent);
-    } else {
-      string.push(scientific_exponent);
-    }
-  } else {
-    // Regular format with no decimal place
-    if(exponent >= 0) {
-      for(var i = 0; i < significand_digits; i++) {
-        string.push(significand[index++]);
-      }
-    } else {
-      var radix_position = significand_digits + exponent;
-
-      // non-zero digits before radix
-      if(radix_position > 0) {
-        for(var i = 0; i < radix_position; i++) {
-          string.push(significand[index++]);
-        }
-      } else {
-        string.push('0');
-      }
-
-      string.push('.');
-      // add leading zeros after radix
-      while(radix_position++ < 0) {
-        string.push('0');
-      }
-
-      for(var i = 0; i < significand_digits - Math.max(radix_position - 1, 0); i++) {
-        string.push(significand[index++]);
-      }
-    }
-  }
-
-  return string.join('');
-}
-
-Decimal128.prototype.toJSON = function() {
-  return { "$numberDecimal": this.toString() };
-}
-
-module.exports = Decimal128;
-module.exports.Decimal128 = Decimal128;
diff --git a/node_modules/bson/lib/bson/double.js b/node_modules/bson/lib/bson/double.js
deleted file mode 100644
index 09ed222..0000000
--- a/node_modules/bson/lib/bson/double.js
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- * A class representation of the BSON Double type.
- *
- * @class
- * @param {number} value the number we want to represent as a double.
- * @return {Double}
- */
-function Double(value) {
-  if(!(this instanceof Double)) return new Double(value);
-  
-  this._bsontype = 'Double';
-  this.value = value;
-}
-
-/**
- * Access the number value.
- *
- * @method
- * @return {number} returns the wrapped double number.
- */
-Double.prototype.valueOf = function() {
-  return this.value;
-};
-
-/**
- * @ignore
- */
-Double.prototype.toJSON = function() {
-  return this.value;
-}
-
-module.exports = Double;
-module.exports.Double = Double;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/float_parser.js b/node_modules/bson/lib/bson/float_parser.js
deleted file mode 100644
index 6fca392..0000000
--- a/node_modules/bson/lib/bson/float_parser.js
+++ /dev/null
@@ -1,121 +0,0 @@
-// Copyright (c) 2008, Fair Oaks Labs, Inc.
-// All rights reserved.
-// 
-// Redistribution and use in source and binary forms, with or without
-// modification, are permitted provided that the following conditions are met:
-// 
-//  * Redistributions of source code must retain the above copyright notice,
-//    this list of conditions and the following disclaimer.
-// 
-//  * Redistributions in binary form must reproduce the above copyright notice,
-//    this list of conditions and the following disclaimer in the documentation
-//    and/or other materials provided with the distribution.
-// 
-//  * Neither the name of Fair Oaks Labs, Inc. nor the names of its contributors
-//    may be used to endorse or promote products derived from this software
-//    without specific prior written permission.
-// 
-// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-// ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-// POSSIBILITY OF SUCH DAMAGE.
-//
-//
-// Modifications to writeIEEE754 to support negative zeroes made by Brian White
-
-var readIEEE754 = function(buffer, offset, endian, mLen, nBytes) {
-  var e, m,
-      bBE = (endian === 'big'),
-      eLen = nBytes * 8 - mLen - 1,
-      eMax = (1 << eLen) - 1,
-      eBias = eMax >> 1,
-      nBits = -7,
-      i = bBE ? 0 : (nBytes - 1),
-      d = bBE ? 1 : -1,
-      s = buffer[offset + i];
-
-  i += d;
-
-  e = s & ((1 << (-nBits)) - 1);
-  s >>= (-nBits);
-  nBits += eLen;
-  for (; nBits > 0; e = e * 256 + buffer[offset + i], i += d, nBits -= 8);
-
-  m = e & ((1 << (-nBits)) - 1);
-  e >>= (-nBits);
-  nBits += mLen;
-  for (; nBits > 0; m = m * 256 + buffer[offset + i], i += d, nBits -= 8);
-
-  if (e === 0) {
-    e = 1 - eBias;
-  } else if (e === eMax) {
-    return m ? NaN : ((s ? -1 : 1) * Infinity);
-  } else {
-    m = m + Math.pow(2, mLen);
-    e = e - eBias;
-  }
-  return (s ? -1 : 1) * m * Math.pow(2, e - mLen);
-};
-
-var writeIEEE754 = function(buffer, value, offset, endian, mLen, nBytes) {
-  var e, m, c,
-      bBE = (endian === 'big'),
-      eLen = nBytes * 8 - mLen - 1,
-      eMax = (1 << eLen) - 1,
-      eBias = eMax >> 1,
-      rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0),
-      i = bBE ? (nBytes-1) : 0,
-      d = bBE ? -1 : 1,
-      s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0;
-
-  value = Math.abs(value);
-
-  if (isNaN(value) || value === Infinity) {
-    m = isNaN(value) ? 1 : 0;
-    e = eMax;
-  } else {
-    e = Math.floor(Math.log(value) / Math.LN2);
-    if (value * (c = Math.pow(2, -e)) < 1) {
-      e--;
-      c *= 2;
-    }
-    if (e+eBias >= 1) {
-      value += rt / c;
-    } else {
-      value += rt * Math.pow(2, 1 - eBias);
-    }
-    if (value * c >= 2) {
-      e++;
-      c /= 2;
-    }
-
-    if (e + eBias >= eMax) {
-      m = 0;
-      e = eMax;
-    } else if (e + eBias >= 1) {
-      m = (value * c - 1) * Math.pow(2, mLen);
-      e = e + eBias;
-    } else {
-      m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen);
-      e = 0;
-    }
-  }
-
-  for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8);
-
-  e = (e << mLen) | m;
-  eLen += mLen;
-  for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8);
-
-  buffer[offset + i - d] |= s * 128;
-};
-
-exports.readIEEE754 = readIEEE754;
-exports.writeIEEE754 = writeIEEE754;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/index.js b/node_modules/bson/lib/bson/index.js
deleted file mode 100644
index c90443a..0000000
--- a/node_modules/bson/lib/bson/index.js
+++ /dev/null
@@ -1,86 +0,0 @@
-try {
-  exports.BSONPure = require('./bson');
-  exports.BSONNative = require('./bson');
-} catch(err) {
-}
-
-[ './binary'
-  , './code'
-  , './map'
-  , './db_ref'
-  , './double'
-  , './max_key'
-  , './min_key'
-  , './objectid'
-  , './regexp'
-  , './symbol'
-  , './decimal128'
-  , './timestamp'
-  , './long'].forEach(function (path) {
-  	var module = require(path);
-  	for (var i in module) {
-  		exports[i] = module[i];
-    }
-});
-
-// Exports all the classes for the PURE JS BSON Parser
-exports.pure = function() {
-  var classes = {};
-  // Map all the classes
-  [ './binary'
-    , './code'
-    , './map'
-    , './db_ref'
-    , './double'
-    , './max_key'
-    , './min_key'
-    , './objectid'
-    , './regexp'
-    , './symbol'
-    , './decimal128'
-    , './timestamp'
-    , './long'
-    , './bson'].forEach(function (path) {
-    	var module = require(path);
-    	for (var i in module) {
-    		classes[i] = module[i];
-      }
-  });
-  // Return classes list
-  return classes;
-}
-
-// Exports all the classes for the NATIVE JS BSON Parser
-exports.native = function() {
-  var classes = {};
-  // Map all the classes
-  [ './binary'
-    , './code'
-    , './map'
-    , './db_ref'
-    , './double'
-    , './max_key'
-    , './min_key'
-    , './objectid'
-    , './regexp'
-    , './symbol'
-    , './decimal128'
-    , './timestamp'
-    , './long'
-  ].forEach(function (path) {
-      var module = require(path);
-      for (var i in module) {
-        classes[i] = module[i];
-      }
-  });
-
-  // Catch error and return no classes found
-  try {
-    classes['BSON'] = require('./bson');
-  } catch(err) {
-    return exports.pure();
-  }
-
-  // Return classes list
-  return classes;
-}
diff --git a/node_modules/bson/lib/bson/long.js b/node_modules/bson/lib/bson/long.js
deleted file mode 100644
index 6f18885..0000000
--- a/node_modules/bson/lib/bson/long.js
+++ /dev/null
@@ -1,856 +0,0 @@
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//
-// Copyright 2009 Google Inc. All Rights Reserved
-
-/**
- * Defines a Long class for representing a 64-bit two's-complement
- * integer value, which faithfully simulates the behavior of a Java "Long". This
- * implementation is derived from LongLib in GWT.
- *
- * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
- * values as *signed* integers.  See the from* functions below for more
- * convenient ways of constructing Longs.
- *
- * The internal representation of a Long is the two given signed, 32-bit values.
- * We use 32-bit pieces because these are the size of integers on which
- * Javascript performs bit-operations.  For operations like addition and
- * multiplication, we split each number into 16-bit pieces, which can easily be
- * multiplied within Javascript's floating-point representation without overflow
- * or change in sign.
- *
- * In the algorithms below, we frequently reduce the negative case to the
- * positive case by negating the input(s) and then post-processing the result.
- * Note that we must ALWAYS check specially whether those values are MIN_VALUE
- * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
- * a positive number, it overflows back into a negative).  Not handling this
- * case would often result in infinite recursion.
- *
- * @class
- * @param {number} low  the low (signed) 32 bits of the Long.
- * @param {number} high the high (signed) 32 bits of the Long.
- * @return {Long}
- */
-function Long(low, high) {
-  if(!(this instanceof Long)) return new Long(low, high);
-  
-  this._bsontype = 'Long';
-  /**
-   * @type {number}
-   * @ignore
-   */
-  this.low_ = low | 0;  // force into 32 signed bits.
-
-  /**
-   * @type {number}
-   * @ignore
-   */
-  this.high_ = high | 0;  // force into 32 signed bits.
-};
-
-/**
- * Return the int value.
- *
- * @method
- * @return {number} the value, assuming it is a 32-bit integer.
- */
-Long.prototype.toInt = function() {
-  return this.low_;
-};
-
-/**
- * Return the Number value.
- *
- * @method
- * @return {number} the closest floating-point representation to this value.
- */
-Long.prototype.toNumber = function() {
-  return this.high_ * Long.TWO_PWR_32_DBL_ +
-         this.getLowBitsUnsigned();
-};
-
-/**
- * Return the JSON value.
- *
- * @method
- * @return {string} the JSON representation.
- */
-Long.prototype.toJSON = function() {
-  return this.toString();
-}
-
-/**
- * Return the String value.
- *
- * @method
- * @param {number} [opt_radix] the radix in which the text should be written.
- * @return {string} the textual representation of this value.
- */
-Long.prototype.toString = function(opt_radix) {
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (this.isZero()) {
-    return '0';
-  }
-
-  if (this.isNegative()) {
-    if (this.equals(Long.MIN_VALUE)) {
-      // We need to change the Long value before it can be negated, so we remove
-      // the bottom-most digit in this base and then recurse to do the rest.
-      var radixLong = Long.fromNumber(radix);
-      var div = this.div(radixLong);
-      var rem = div.multiply(radixLong).subtract(this);
-      return div.toString(radix) + rem.toInt().toString(radix);
-    } else {
-      return '-' + this.negate().toString(radix);
-    }
-  }
-
-  // Do several (6) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Long.fromNumber(Math.pow(radix, 6));
-
-  var rem = this;
-  var result = '';
-  while (true) {
-    var remDiv = rem.div(radixToPower);
-    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
-    var digits = intval.toString(radix);
-
-    rem = remDiv;
-    if (rem.isZero()) {
-      return digits + result;
-    } else {
-      while (digits.length < 6) {
-        digits = '0' + digits;
-      }
-      result = '' + digits + result;
-    }
-  }
-};
-
-/**
- * Return the high 32-bits value.
- *
- * @method
- * @return {number} the high 32-bits as a signed value.
- */
-Long.prototype.getHighBits = function() {
-  return this.high_;
-};
-
-/**
- * Return the low 32-bits value.
- *
- * @method
- * @return {number} the low 32-bits as a signed value.
- */
-Long.prototype.getLowBits = function() {
-  return this.low_;
-};
-
-/**
- * Return the low unsigned 32-bits value.
- *
- * @method
- * @return {number} the low 32-bits as an unsigned value.
- */
-Long.prototype.getLowBitsUnsigned = function() {
-  return (this.low_ >= 0) ?
-      this.low_ : Long.TWO_PWR_32_DBL_ + this.low_;
-};
-
-/**
- * Returns the number of bits needed to represent the absolute value of this Long.
- *
- * @method
- * @return {number} Returns the number of bits needed to represent the absolute value of this Long.
- */
-Long.prototype.getNumBitsAbs = function() {
-  if (this.isNegative()) {
-    if (this.equals(Long.MIN_VALUE)) {
-      return 64;
-    } else {
-      return this.negate().getNumBitsAbs();
-    }
-  } else {
-    var val = this.high_ != 0 ? this.high_ : this.low_;
-    for (var bit = 31; bit > 0; bit--) {
-      if ((val & (1 << bit)) != 0) {
-        break;
-      }
-    }
-    return this.high_ != 0 ? bit + 33 : bit + 1;
-  }
-};
-
-/**
- * Return whether this value is zero.
- *
- * @method
- * @return {boolean} whether this value is zero.
- */
-Long.prototype.isZero = function() {
-  return this.high_ == 0 && this.low_ == 0;
-};
-
-/**
- * Return whether this value is negative.
- *
- * @method
- * @return {boolean} whether this value is negative.
- */
-Long.prototype.isNegative = function() {
-  return this.high_ < 0;
-};
-
-/**
- * Return whether this value is odd.
- *
- * @method
- * @return {boolean} whether this value is odd.
- */
-Long.prototype.isOdd = function() {
-  return (this.low_ & 1) == 1;
-};
-
-/**
- * Return whether this Long equals the other
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} whether this Long equals the other
- */
-Long.prototype.equals = function(other) {
-  return (this.high_ == other.high_) && (this.low_ == other.low_);
-};
-
-/**
- * Return whether this Long does not equal the other.
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} whether this Long does not equal the other.
- */
-Long.prototype.notEquals = function(other) {
-  return (this.high_ != other.high_) || (this.low_ != other.low_);
-};
-
-/**
- * Return whether this Long is less than the other.
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} whether this Long is less than the other.
- */
-Long.prototype.lessThan = function(other) {
-  return this.compare(other) < 0;
-};
-
-/**
- * Return whether this Long is less than or equal to the other.
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} whether this Long is less than or equal to the other.
- */
-Long.prototype.lessThanOrEqual = function(other) {
-  return this.compare(other) <= 0;
-};
-
-/**
- * Return whether this Long is greater than the other.
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} whether this Long is greater than the other.
- */
-Long.prototype.greaterThan = function(other) {
-  return this.compare(other) > 0;
-};
-
-/**
- * Return whether this Long is greater than or equal to the other.
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} whether this Long is greater than or equal to the other.
- */
-Long.prototype.greaterThanOrEqual = function(other) {
-  return this.compare(other) >= 0;
-};
-
-/**
- * Compares this Long with the given one.
- *
- * @method
- * @param {Long} other Long to compare against.
- * @return {boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
- */
-Long.prototype.compare = function(other) {
-  if (this.equals(other)) {
-    return 0;
-  }
-
-  var thisNeg = this.isNegative();
-  var otherNeg = other.isNegative();
-  if (thisNeg && !otherNeg) {
-    return -1;
-  }
-  if (!thisNeg && otherNeg) {
-    return 1;
-  }
-
-  // at this point, the signs are the same, so subtraction will not overflow
-  if (this.subtract(other).isNegative()) {
-    return -1;
-  } else {
-    return 1;
-  }
-};
-
-/**
- * The negation of this value.
- *
- * @method
- * @return {Long} the negation of this value.
- */
-Long.prototype.negate = function() {
-  if (this.equals(Long.MIN_VALUE)) {
-    return Long.MIN_VALUE;
-  } else {
-    return this.not().add(Long.ONE);
-  }
-};
-
-/**
- * Returns the sum of this and the given Long.
- *
- * @method
- * @param {Long} other Long to add to this one.
- * @return {Long} the sum of this and the given Long.
- */
-Long.prototype.add = function(other) {
-  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 + b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 + b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 + b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 + b48;
-  c48 &= 0xFFFF;
-  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns the difference of this and the given Long.
- *
- * @method
- * @param {Long} other Long to subtract from this.
- * @return {Long} the difference of this and the given Long.
- */
-Long.prototype.subtract = function(other) {
-  return this.add(other.negate());
-};
-
-/**
- * Returns the product of this and the given Long.
- *
- * @method
- * @param {Long} other Long to multiply with this.
- * @return {Long} the product of this and the other.
- */
-Long.prototype.multiply = function(other) {
-  if (this.isZero()) {
-    return Long.ZERO;
-  } else if (other.isZero()) {
-    return Long.ZERO;
-  }
-
-  if (this.equals(Long.MIN_VALUE)) {
-    return other.isOdd() ? Long.MIN_VALUE : Long.ZERO;
-  } else if (other.equals(Long.MIN_VALUE)) {
-    return this.isOdd() ? Long.MIN_VALUE : Long.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().multiply(other.negate());
-    } else {
-      return this.negate().multiply(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.multiply(other.negate()).negate();
-  }
-
-  // If both Longs are small, use float multiplication
-  if (this.lessThan(Long.TWO_PWR_24_) &&
-      other.lessThan(Long.TWO_PWR_24_)) {
-    return Long.fromNumber(this.toNumber() * other.toNumber());
-  }
-
-  // Divide each Long into 4 chunks of 16 bits, and then add up 4x4 products.
-  // We can skip products that would overflow.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 * b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 * b00;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c16 += a00 * b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 * b00;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a16 * b16;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a00 * b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
-  c48 &= 0xFFFF;
-  return Long.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns this Long divided by the given one.
- *
- * @method
- * @param {Long} other Long by which to divide.
- * @return {Long} this Long divided by the given one.
- */
-Long.prototype.div = function(other) {
-  if (other.isZero()) {
-    throw Error('division by zero');
-  } else if (this.isZero()) {
-    return Long.ZERO;
-  }
-
-  if (this.equals(Long.MIN_VALUE)) {
-    if (other.equals(Long.ONE) ||
-        other.equals(Long.NEG_ONE)) {
-      return Long.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
-    } else if (other.equals(Long.MIN_VALUE)) {
-      return Long.ONE;
-    } else {
-      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
-      var halfThis = this.shiftRight(1);
-      var approx = halfThis.div(other).shiftLeft(1);
-      if (approx.equals(Long.ZERO)) {
-        return other.isNegative() ? Long.ONE : Long.NEG_ONE;
-      } else {
-        var rem = this.subtract(other.multiply(approx));
-        var result = approx.add(rem.div(other));
-        return result;
-      }
-    }
-  } else if (other.equals(Long.MIN_VALUE)) {
-    return Long.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().div(other.negate());
-    } else {
-      return this.negate().div(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.div(other.negate()).negate();
-  }
-
-  // Repeat the following until the remainder is less than other:  find a
-  // floating-point that approximates remainder / other *from below*, add this
-  // into the result, and subtract it from the remainder.  It is critical that
-  // the approximate value is less than or equal to the real value so that the
-  // remainder never becomes negative.
-  var res = Long.ZERO;
-  var rem = this;
-  while (rem.greaterThanOrEqual(other)) {
-    // Approximate the result of division. This may be a little greater or
-    // smaller than the actual value.
-    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
-
-    // We will tweak the approximate result by changing it in the 48-th digit or
-    // the smallest non-fractional digit, whichever is larger.
-    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
-    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
-
-    // Decrease the approximation until it is smaller than the remainder.  Note
-    // that if it is too large, the product overflows and is negative.
-    var approxRes = Long.fromNumber(approx);
-    var approxRem = approxRes.multiply(other);
-    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
-      approx -= delta;
-      approxRes = Long.fromNumber(approx);
-      approxRem = approxRes.multiply(other);
-    }
-
-    // We know the answer can't be zero... and actually, zero would cause
-    // infinite recursion since we would make no progress.
-    if (approxRes.isZero()) {
-      approxRes = Long.ONE;
-    }
-
-    res = res.add(approxRes);
-    rem = rem.subtract(approxRem);
-  }
-  return res;
-};
-
-/**
- * Returns this Long modulo the given one.
- *
- * @method
- * @param {Long} other Long by which to mod.
- * @return {Long} this Long modulo the given one.
- */
-Long.prototype.modulo = function(other) {
-  return this.subtract(this.div(other).multiply(other));
-};
-
-/**
- * The bitwise-NOT of this value.
- *
- * @method
- * @return {Long} the bitwise-NOT of this value.
- */
-Long.prototype.not = function() {
-  return Long.fromBits(~this.low_, ~this.high_);
-};
-
-/**
- * Returns the bitwise-AND of this Long and the given one.
- *
- * @method
- * @param {Long} other the Long with which to AND.
- * @return {Long} the bitwise-AND of this and the other.
- */
-Long.prototype.and = function(other) {
-  return Long.fromBits(this.low_ & other.low_, this.high_ & other.high_);
-};
-
-/**
- * Returns the bitwise-OR of this Long and the given one.
- *
- * @method
- * @param {Long} other the Long with which to OR.
- * @return {Long} the bitwise-OR of this and the other.
- */
-Long.prototype.or = function(other) {
-  return Long.fromBits(this.low_ | other.low_, this.high_ | other.high_);
-};
-
-/**
- * Returns the bitwise-XOR of this Long and the given one.
- *
- * @method
- * @param {Long} other the Long with which to XOR.
- * @return {Long} the bitwise-XOR of this and the other.
- */
-Long.prototype.xor = function(other) {
-  return Long.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
-};
-
-/**
- * Returns this Long with bits shifted to the left by the given amount.
- *
- * @method
- * @param {number} numBits the number of bits by which to shift.
- * @return {Long} this shifted to the left by the given amount.
- */
-Long.prototype.shiftLeft = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var low = this.low_;
-    if (numBits < 32) {
-      var high = this.high_;
-      return Long.fromBits(
-                 low << numBits,
-                 (high << numBits) | (low >>> (32 - numBits)));
-    } else {
-      return Long.fromBits(0, low << (numBits - 32));
-    }
-  }
-};
-
-/**
- * Returns this Long with bits shifted to the right by the given amount.
- *
- * @method
- * @param {number} numBits the number of bits by which to shift.
- * @return {Long} this shifted to the right by the given amount.
- */
-Long.prototype.shiftRight = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Long.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >> numBits);
-    } else {
-      return Long.fromBits(
-                 high >> (numBits - 32),
-                 high >= 0 ? 0 : -1);
-    }
-  }
-};
-
-/**
- * Returns this Long with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
- *
- * @method
- * @param {number} numBits the number of bits by which to shift.
- * @return {Long} this shifted to the right by the given amount, with zeros placed into the new leading bits.
- */
-Long.prototype.shiftRightUnsigned = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Long.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >>> numBits);
-    } else if (numBits == 32) {
-      return Long.fromBits(high, 0);
-    } else {
-      return Long.fromBits(high >>> (numBits - 32), 0);
-    }
-  }
-};
-
-/**
- * Returns a Long representing the given (32-bit) integer value.
- *
- * @method
- * @param {number} value the 32-bit integer in question.
- * @return {Long} the corresponding Long value.
- */
-Long.fromInt = function(value) {
-  if (-128 <= value && value < 128) {
-    var cachedObj = Long.INT_CACHE_[value];
-    if (cachedObj) {
-      return cachedObj;
-    }
-  }
-
-  var obj = new Long(value | 0, value < 0 ? -1 : 0);
-  if (-128 <= value && value < 128) {
-    Long.INT_CACHE_[value] = obj;
-  }
-  return obj;
-};
-
-/**
- * Returns a Long representing the given value, provided that it is a finite number. Otherwise, zero is returned.
- *
- * @method
- * @param {number} value the number in question.
- * @return {Long} the corresponding Long value.
- */
-Long.fromNumber = function(value) {
-  if (isNaN(value) || !isFinite(value)) {
-    return Long.ZERO;
-  } else if (value <= -Long.TWO_PWR_63_DBL_) {
-    return Long.MIN_VALUE;
-  } else if (value + 1 >= Long.TWO_PWR_63_DBL_) {
-    return Long.MAX_VALUE;
-  } else if (value < 0) {
-    return Long.fromNumber(-value).negate();
-  } else {
-    return new Long(
-               (value % Long.TWO_PWR_32_DBL_) | 0,
-               (value / Long.TWO_PWR_32_DBL_) | 0);
-  }
-};
-
-/**
- * Returns a Long representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
- *
- * @method
- * @param {number} lowBits the low 32-bits.
- * @param {number} highBits the high 32-bits.
- * @return {Long} the corresponding Long value.
- */
-Long.fromBits = function(lowBits, highBits) {
-  return new Long(lowBits, highBits);
-};
-
-/**
- * Returns a Long representation of the given string, written using the given radix.
- *
- * @method
- * @param {string} str the textual representation of the Long.
- * @param {number} opt_radix the radix in which the text is written.
- * @return {Long} the corresponding Long value.
- */
-Long.fromString = function(str, opt_radix) {
-  if (str.length == 0) {
-    throw Error('number format error: empty string');
-  }
-
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (str.charAt(0) == '-') {
-    return Long.fromString(str.substring(1), radix).negate();
-  } else if (str.indexOf('-') >= 0) {
-    throw Error('number format error: interior "-" character: ' + str);
-  }
-
-  // Do several (8) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Long.fromNumber(Math.pow(radix, 8));
-
-  var result = Long.ZERO;
-  for (var i = 0; i < str.length; i += 8) {
-    var size = Math.min(8, str.length - i);
-    var value = parseInt(str.substring(i, i + size), radix);
-    if (size < 8) {
-      var power = Long.fromNumber(Math.pow(radix, size));
-      result = result.multiply(power).add(Long.fromNumber(value));
-    } else {
-      result = result.multiply(radixToPower);
-      result = result.add(Long.fromNumber(value));
-    }
-  }
-  return result;
-};
-
-// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
-// from* methods on which they depend.
-
-
-/**
- * A cache of the Long representations of small integer values.
- * @type {Object}
- * @ignore
- */
-Long.INT_CACHE_ = {};
-
-// NOTE: the compiler should inline these constant values below and then remove
-// these variables, so there should be no runtime penalty for these.
-
-/**
- * Number used repeated below in calculations.  This must appear before the
- * first call to any from* function below.
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_16_DBL_ = 1 << 16;
-
-/**
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_24_DBL_ = 1 << 24;
-
-/**
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_32_DBL_ = Long.TWO_PWR_16_DBL_ * Long.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_31_DBL_ = Long.TWO_PWR_32_DBL_ / 2;
-
-/**
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_48_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_64_DBL_ = Long.TWO_PWR_32_DBL_ * Long.TWO_PWR_32_DBL_;
-
-/**
- * @type {number}
- * @ignore
- */
-Long.TWO_PWR_63_DBL_ = Long.TWO_PWR_64_DBL_ / 2;
-
-/** @type {Long} */
-Long.ZERO = Long.fromInt(0);
-
-/** @type {Long} */
-Long.ONE = Long.fromInt(1);
-
-/** @type {Long} */
-Long.NEG_ONE = Long.fromInt(-1);
-
-/** @type {Long} */
-Long.MAX_VALUE =
-    Long.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
-
-/** @type {Long} */
-Long.MIN_VALUE = Long.fromBits(0, 0x80000000 | 0);
-
-/**
- * @type {Long}
- * @ignore
- */
-Long.TWO_PWR_24_ = Long.fromInt(1 << 24);
-
-/**
- * Expose.
- */
-module.exports = Long;
-module.exports.Long = Long;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/map.js b/node_modules/bson/lib/bson/map.js
deleted file mode 100644
index f53c8c1..0000000
--- a/node_modules/bson/lib/bson/map.js
+++ /dev/null
@@ -1,126 +0,0 @@
-"use strict"
-
-// We have an ES6 Map available, return the native instance
-if(typeof global.Map !== 'undefined') {
-  module.exports = global.Map;
-  module.exports.Map = global.Map;
-} else {
-  // We will return a polyfill
-  var Map = function(array) {
-    this._keys = [];
-    this._values = {};
-
-    for(var i = 0; i < array.length; i++) {
-      if(array[i] == null) continue;  // skip null and undefined
-      var entry = array[i];
-      var key = entry[0];
-      var value = entry[1];
-      // Add the key to the list of keys in order
-      this._keys.push(key);
-      // Add the key and value to the values dictionary with a point
-      // to the location in the ordered keys list
-      this._values[key] = {v: value, i: this._keys.length - 1};
-    }
-  }
-
-  Map.prototype.clear = function() {
-    this._keys = [];
-    this._values = {};
-  }
-
-  Map.prototype.delete = function(key) {
-    var value = this._values[key];
-    if(value == null) return false;
-    // Delete entry
-    delete this._values[key];
-    // Remove the key from the ordered keys list
-    this._keys.splice(value.i, 1);
-    return true;
-  }
-
-  Map.prototype.entries = function() {
-    var self = this;
-    var index = 0;
-
-    return {
-      next: function() {
-        var key = self._keys[index++];
-        return {
-          value: key !== undefined ? [key, self._values[key].v] : undefined,
-          done: key !== undefined ? false : true
-        }
-      }
-    };
-  }
-
-  Map.prototype.forEach = function(callback, self) {
-    self = self || this;
-
-    for(var i = 0; i < this._keys.length; i++) {
-      var key = this._keys[i];
-      // Call the forEach callback
-      callback.call(self, this._values[key].v, key, self);
-    }
-  }
-
-  Map.prototype.get = function(key) {
-    return this._values[key] ? this._values[key].v : undefined;
-  }
-
-  Map.prototype.has = function(key) {
-    return this._values[key] != null;
-  }
-
-  Map.prototype.keys = function(key) {
-    var self = this;
-    var index = 0;
-
-    return {
-      next: function() {
-        var key = self._keys[index++];
-        return {
-          value: key !== undefined ? key : undefined,
-          done: key !== undefined ? false : true
-        }
-      }
-    };
-  }
-
-  Map.prototype.set = function(key, value) {
-    if(this._values[key]) {
-      this._values[key].v = value;
-      return this;
-    }
-
-    // Add the key to the list of keys in order
-    this._keys.push(key);
-    // Add the key and value to the values dictionary with a point
-    // to the location in the ordered keys list
-    this._values[key] = {v: value, i: this._keys.length - 1};
-    return this;
-  }
-
-  Map.prototype.values = function(key, value) {
-    var self = this;
-    var index = 0;
-
-    return {
-      next: function() {
-        var key = self._keys[index++];
-        return {
-          value: key !== undefined ? self._values[key].v : undefined,
-          done: key !== undefined ? false : true
-        }
-      }
-    };
-  }
-
-  // Last ismaster
-  Object.defineProperty(Map.prototype, 'size', {
-    enumerable:true,
-    get: function() { return this._keys.length; }
-  });
-
-  module.exports = Map;
-  module.exports.Map = Map;
-}
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/max_key.js b/node_modules/bson/lib/bson/max_key.js
deleted file mode 100644
index 03ee9cd..0000000
--- a/node_modules/bson/lib/bson/max_key.js
+++ /dev/null
@@ -1,14 +0,0 @@
-/**
- * A class representation of the BSON MaxKey type.
- *
- * @class
- * @return {MaxKey} A MaxKey instance
- */
-function MaxKey() {
-  if(!(this instanceof MaxKey)) return new MaxKey();
-  
-  this._bsontype = 'MaxKey';  
-}
-
-module.exports = MaxKey;
-module.exports.MaxKey = MaxKey;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/min_key.js b/node_modules/bson/lib/bson/min_key.js
deleted file mode 100644
index 5e120fb..0000000
--- a/node_modules/bson/lib/bson/min_key.js
+++ /dev/null
@@ -1,14 +0,0 @@
-/**
- * A class representation of the BSON MinKey type.
- *
- * @class
- * @return {MinKey} A MinKey instance
- */
-function MinKey() {
-  if(!(this instanceof MinKey)) return new MinKey();
-  
-  this._bsontype = 'MinKey';
-}
-
-module.exports = MinKey;
-module.exports.MinKey = MinKey;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/objectid.js b/node_modules/bson/lib/bson/objectid.js
deleted file mode 100644
index 825481e..0000000
--- a/node_modules/bson/lib/bson/objectid.js
+++ /dev/null
@@ -1,338 +0,0 @@
-/**
- * Machine id.
- *
- * Create a random 3-byte value (i.e. unique for this
- * process). Other drivers use a md5 of the machine id here, but
- * that would mean an asyc call to gethostname, so we don't bother.
- * @ignore
- */
-var MACHINE_ID = parseInt(Math.random() * 0xFFFFFF, 10);
-
-// Regular expression that checks for hex value
-var checkForHexRegExp = new RegExp("^[0-9a-fA-F]{24}$");
-
-/**
-* Create a new ObjectID instance
-*
-* @class
-* @param {(string|number)} id Can be a 24 byte hex string, 12 byte binary string or a Number.
-* @property {number} generationTime The generation time of this ObjectId instance
-* @return {ObjectID} instance of ObjectID.
-*/
-var ObjectID = function ObjectID(id) {
-  // Duck-typing to support ObjectId from different npm packages
-  if(id instanceof ObjectID) return id;
-  if(!(this instanceof ObjectID)) return new ObjectID(id);
-
-  this._bsontype = 'ObjectID';
-
-  var __id = null;
-  var valid = ObjectID.isValid(id);
-
-  // Throw an error if it's not a valid setup
-  if(!valid && id != null){
-    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
-  } else if(valid && typeof id == 'string' && id.length == 24) {
-    return ObjectID.createFromHexString(id);
-  } else if(id == null || typeof id == 'number') {
-    // convert to 12 byte binary string
-    this.id = this.generate(id);
-  } else if(id != null && id.length === 12) {
-    // assume 12 byte string
-    this.id = id;
-  } else if(id != null && id.toHexString) {
-    // Duck-typing to support ObjectId from different npm packages
-    return id;
-  }
-
-  if(ObjectID.cacheHexString) this.__id = this.toHexString();
-};
-
-// Allow usage of ObjectId as well as ObjectID
-var ObjectId = ObjectID;
-
-// Precomputed hex table enables speedy hex string conversion
-var hexTable = [];
-for (var i = 0; i < 256; i++) {
-  hexTable[i] = (i <= 15 ? '0' : '') + i.toString(16);
-}
-
-/**
-* Return the ObjectID id as a 24 byte hex string representation
-*
-* @method
-* @return {string} return the 24 byte hex string representation.
-*/
-ObjectID.prototype.toHexString = function() {
-  if(ObjectID.cacheHexString && this.__id) return this.__id;
-
-  var hexString = '';
-
-  if(this.id instanceof _Buffer) {
-    hexString = convertToHex(this.id);
-    if(ObjectID.cacheHexString) this.__id = hexString;
-    return hexString;
-  }
-
-  for (var i = 0; i < this.id.length; i++) {
-    hexString += hexTable[this.id.charCodeAt(i)];
-  }
-
-  if(ObjectID.cacheHexString) this.__id = hexString;
-  return hexString;
-};
-
-/**
-* Update the ObjectID index used in generating new ObjectID's on the driver
-*
-* @method
-* @return {number} returns next index value.
-* @ignore
-*/
-ObjectID.prototype.get_inc = function() {
-  return ObjectID.index = (ObjectID.index + 1) % 0xFFFFFF;
-};
-
-/**
-* Update the ObjectID index used in generating new ObjectID's on the driver
-*
-* @method
-* @return {number} returns next index value.
-* @ignore
-*/
-ObjectID.prototype.getInc = function() {
-  return this.get_inc();
-};
-
-/**
-* Generate a 12 byte id buffer used in ObjectID's
-*
-* @method
-* @param {number} [time] optional parameter allowing to pass in a second based timestamp.
-* @return {Buffer} return the 12 byte id buffer string.
-*/
-ObjectID.prototype.generate = function(time) {
-  if ('number' != typeof time) {
-    time = ~~(Date.now()/1000);
-  }
-
-  // Use pid
-  var pid = (typeof process === 'undefined' ? Math.floor(Math.random() * 100000) : process.pid) % 0xFFFF;
-  var inc = this.get_inc();
-  // Buffer used
-  var buffer = new Buffer(12);
-  // Encode time
-  buffer[3] = time & 0xff;
-  buffer[2] = (time >> 8) & 0xff;
-  buffer[1] = (time >> 16) & 0xff;
-  buffer[0] = (time >> 24) & 0xff;
-  // Encode machine
-  buffer[6] = MACHINE_ID & 0xff;
-  buffer[5] = (MACHINE_ID >> 8) & 0xff;
-  buffer[4] = (MACHINE_ID >> 16) & 0xff;
-  // Encode pid
-  buffer[8] = pid & 0xff;
-  buffer[7] = (pid >> 8) & 0xff;
-  // Encode index
-  buffer[11] = inc & 0xff;
-  buffer[10] = (inc >> 8) & 0xff;
-  buffer[9] = (inc >> 16) & 0xff;
-  // Return the buffer
-  return buffer;
-};
-
-/**
-* Converts the id into a 24 byte hex string for printing
-*
-* @return {String} return the 24 byte hex string representation.
-* @ignore
-*/
-ObjectID.prototype.toString = function() {
-  return this.toHexString();
-};
-
-/**
-* Converts to a string representation of this Id.
-*
-* @return {String} return the 24 byte hex string representation.
-* @ignore
-*/
-ObjectID.prototype.inspect = ObjectID.prototype.toString;
-
-/**
-* Converts to its JSON representation.
-*
-* @return {String} return the 24 byte hex string representation.
-* @ignore
-*/
-ObjectID.prototype.toJSON = function() {
-  return this.toHexString();
-};
-
-/**
-* Compares the equality of this ObjectID with `otherID`.
-*
-* @method
-* @param {object} otherID ObjectID instance to compare against.
-* @return {boolean} the result of comparing two ObjectID's
-*/
-ObjectID.prototype.equals = function equals (otherId) {
-  var id;
-
-  if(otherId instanceof ObjectID) {
-    return this.toString() == otherId.toString();
-  } else if(typeof otherId == 'string' && ObjectID.isValid(otherId) && otherId.length == 12 && this.id instanceof _Buffer) {
-    return otherId === this.id.toString('binary');
-  } else if(typeof otherId == 'string' && ObjectID.isValid(otherId) && otherId.length == 24) {
-    return otherId === this.toHexString();
-  } else if(typeof otherId == 'string' && ObjectID.isValid(otherId) && otherId.length == 12) {
-    return otherId === this.id;
-  } else if(otherId != null && (otherId instanceof ObjectID || otherId.toHexString)) {
-    return otherId.toHexString() === this.toHexString();
-  } else {
-    return false;
-  }
-}
-
-/**
-* Returns the generation date (accurate up to the second) that this ID was generated.
-*
-* @method
-* @return {date} the generation date
-*/
-ObjectID.prototype.getTimestamp = function() {
-  var timestamp = new Date();
-  var time = this.id[3] | this.id[2] << 8 | this.id[1] << 16 | this.id[0] << 24;
-  timestamp.setTime(Math.floor(time) * 1000);
-  return timestamp;
-}
-
-/**
-* @ignore
-*/
-ObjectID.index = ~~(Math.random() * 0xFFFFFF);
-
-/**
-* @ignore
-*/
-ObjectID.createPk = function createPk () {
-  return new ObjectID();
-};
-
-/**
-* Creates an ObjectID from a second based number, with the rest of the ObjectID zeroed out. Used for comparisons or sorting the ObjectID.
-*
-* @method
-* @param {number} time an integer number representing a number of seconds.
-* @return {ObjectID} return the created ObjectID
-*/
-ObjectID.createFromTime = function createFromTime (time) {
-  var buffer = new Buffer([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]);
-  // Encode time into first 4 bytes
-  buffer[3] = time & 0xff;
-  buffer[2] = (time >> 8) & 0xff;
-  buffer[1] = (time >> 16) & 0xff;
-  buffer[0] = (time >> 24) & 0xff;
-  // Return the new objectId
-  return new ObjectID(buffer);
-};
-
-// Lookup tables
-var encodeLookup = '0123456789abcdef'.split('')
-var decodeLookup = []
-var i = 0
-while (i < 10) decodeLookup[0x30 + i] = i++
-while (i < 16) decodeLookup[0x61 - 10 + i] = i++
-
-var _Buffer = Buffer;
-var convertToHex = function(bytes) {
-  return bytes.toString('hex');
-}
-
-/**
-* Creates an ObjectID from a hex string representation of an ObjectID.
-*
-* @method
-* @param {string} hexString create a ObjectID from a passed in 24 byte hexstring.
-* @return {ObjectID} return the created ObjectID
-*/
-ObjectID.createFromHexString = function createFromHexString (string) {
-  // Throw an error if it's not a valid setup
-  if(typeof string === 'undefined' || string != null && string.length != 24)
-    throw new Error("Argument passed in must be a single String of 12 bytes or a string of 24 hex characters");
-
-  var length = string.length;
-
-  if(length > 12*2) {
-    throw new Error('Id cannot be longer than 12 bytes');
-  }
-
-  // Calculate lengths
-  var sizeof = length >> 1;
-  var array = new _Buffer(sizeof);
-  var n = 0;
-  var i = 0;
-
-  while (i < length) {
-    array[n++] = decodeLookup[string.charCodeAt(i++)] << 4 | decodeLookup[string.charCodeAt(i++)]
-  }
-
-  return new ObjectID(array);
-};
-
-/**
-* Checks if a value is a valid bson ObjectId
-*
-* @method
-* @return {boolean} return true if the value is a valid bson ObjectId, return false otherwise.
-*/
-ObjectID.isValid = function isValid(id) {
-  if(id == null) return false;
-
-  if(typeof id == 'number') {
-    return true;
-  }
-
-  if(typeof id == 'string') {
-    return id.length == 12 || (id.length == 24 && checkForHexRegExp.test(id));
-  }
-
-  if(id instanceof ObjectID) {
-    return true;
-  }
-
-  if(id instanceof _Buffer) {
-    return true;
-  }
-
-  // Duck-Typing detection of ObjectId like objects
-  if(id.toHexString) {
-    return id.id.length == 12 || (id.id.length == 24 && checkForHexRegExp.test(id.id));
-  }
-
-  return false;
-};
-
-/**
-* @ignore
-*/
-Object.defineProperty(ObjectID.prototype, "generationTime", {
-   enumerable: true
- , get: function () {
-     return this.id[3] | this.id[2] << 8 | this.id[1] << 16 | this.id[0] << 24;
-   }
- , set: function (value) {
-     // Encode time into first 4 bytes
-     this.id[3] = value & 0xff;
-     this.id[2] = (value >> 8) & 0xff;
-     this.id[1] = (value >> 16) & 0xff;
-     this.id[0] = (value >> 24) & 0xff;
-   }
-});
-
-/**
- * Expose.
- */
-module.exports = ObjectID;
-module.exports.ObjectID = ObjectID;
-module.exports.ObjectId = ObjectID;
diff --git a/node_modules/bson/lib/bson/parser/calculate_size.js b/node_modules/bson/lib/bson/parser/calculate_size.js
deleted file mode 100644
index 53d338f..0000000
--- a/node_modules/bson/lib/bson/parser/calculate_size.js
+++ /dev/null
@@ -1,152 +0,0 @@
-"use strict"
-
-var writeIEEE754 = require('../float_parser').writeIEEE754
-	, readIEEE754 = require('../float_parser').readIEEE754
-	, Long = require('../long').Long
-  , Double = require('../double').Double
-  , Timestamp = require('../timestamp').Timestamp
-  , ObjectID = require('../objectid').ObjectID
-  , Symbol = require('../symbol').Symbol
-  , BSONRegExp = require('../regexp').BSONRegExp
-  , Code = require('../code').Code
-	, Decimal128 = require('../decimal128')
-  , MinKey = require('../min_key').MinKey
-  , MaxKey = require('../max_key').MaxKey
-  , DBRef = require('../db_ref').DBRef
-  , Binary = require('../binary').Binary;
-
-// To ensure that 0.4 of node works correctly
-var isDate = function isDate(d) {
-  return typeof d === 'object' && Object.prototype.toString.call(d) === '[object Date]';
-}
-
-var calculateObjectSize = function calculateObjectSize(object, serializeFunctions, ignoreUndefined) {
-  var totalLength = (4 + 1);
-
-  if(Array.isArray(object)) {
-    for(var i = 0; i < object.length; i++) {
-      totalLength += calculateElement(i.toString(), object[i], serializeFunctions, true, ignoreUndefined)
-    }
-  } else {
-		// If we have toBSON defined, override the current object
-		if(object.toBSON) {
-			object = object.toBSON();
-		}
-
-		// Calculate size
-    for(var key in object) {
-      totalLength += calculateElement(key, object[key], serializeFunctions, false, ignoreUndefined)
-    }
-  }
-
-  return totalLength;
-}
-
-/**
- * @ignore
- * @api private
- */
-function calculateElement(name, value, serializeFunctions, isArray, ignoreUndefined) {
-	// If we have toBSON defined, override the current object
-  if(value && value.toBSON){
-    value = value.toBSON();
-  }
-
-  switch(typeof value) {
-    case 'string':
-      return 1 + Buffer.byteLength(name, 'utf8') + 1 + 4 + Buffer.byteLength(value, 'utf8') + 1;
-    case 'number':
-      if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-        if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) { // 32 bit
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (4 + 1);
-        } else {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (8 + 1);
-        }
-      } else {  // 64 bit
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (8 + 1);
-      }
-    case 'undefined':
-      if(isArray || !ignoreUndefined) return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (1);
-      return 0;
-    case 'boolean':
-      return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (1 + 1);
-    case 'object':
-      if(value == null || value instanceof MinKey || value instanceof MaxKey || value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (1);
-      } else if(value instanceof ObjectID || value['_bsontype'] == 'ObjectID') {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (12 + 1);
-      } else if(value instanceof Date || isDate(value)) {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (8 + 1);
-      } else if(typeof Buffer !== 'undefined' && Buffer.isBuffer(value)) {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (1 + 4 + 1) + value.length;
-      } else if(value instanceof Long || value instanceof Double || value instanceof Timestamp
-          || value['_bsontype'] == 'Long' || value['_bsontype'] == 'Double' || value['_bsontype'] == 'Timestamp') {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (8 + 1);
-			} else if(value instanceof Decimal128 || value['_bsontype'] == 'Decimal128') {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (16 + 1);
-      } else if(value instanceof Code || value['_bsontype'] == 'Code') {
-        // Calculate size depending on the availability of a scope
-        if(value.scope != null && Object.keys(value.scope).length > 0) {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + 4 + 4 + Buffer.byteLength(value.code.toString(), 'utf8') + 1 + calculateObjectSize(value.scope, serializeFunctions, ignoreUndefined);
-        } else {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + 4 + Buffer.byteLength(value.code.toString(), 'utf8') + 1;
-        }
-      } else if(value instanceof Binary || value['_bsontype'] == 'Binary') {
-        // Check what kind of subtype we have
-        if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (value.position + 1 + 4 + 1 + 4);
-        } else {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + (value.position + 1 + 4 + 1);
-        }
-      } else if(value instanceof Symbol || value['_bsontype'] == 'Symbol') {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + Buffer.byteLength(value.value, 'utf8') + 4 + 1 + 1;
-      } else if(value instanceof DBRef || value['_bsontype'] == 'DBRef') {
-        // Set up correct object for serialization
-        var ordered_values = {
-            '$ref': value.namespace
-          , '$id' : value.oid
-        };
-
-        // Add db reference if it exists
-        if(null != value.db) {
-          ordered_values['$db'] = value.db;
-        }
-
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + calculateObjectSize(ordered_values, serializeFunctions, ignoreUndefined);
-      } else if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]') {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + Buffer.byteLength(value.source, 'utf8') + 1
-            + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
-      } else if(value instanceof BSONRegExp || value['_bsontype'] == 'BSONRegExp') {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + Buffer.byteLength(value.pattern, 'utf8') + 1
-            + Buffer.byteLength(value.options, 'utf8') + 1
-      } else {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + calculateObjectSize(value, serializeFunctions, ignoreUndefined) + 1;
-      }
-    case 'function':
-      // WTF for 0.4.X where typeof /someregexp/ === 'function'
-      if(value instanceof RegExp || Object.prototype.toString.call(value) === '[object RegExp]' || String.call(value) == '[object RegExp]') {
-        return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + Buffer.byteLength(value.source, 'utf8') + 1
-          + (value.global ? 1 : 0) + (value.ignoreCase ? 1 : 0) + (value.multiline ? 1 : 0) + 1
-      } else {
-        if(serializeFunctions && value.scope != null && Object.keys(value.scope).length > 0) {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + 4 + 4 + Buffer.byteLength(value.toString(), 'utf8') + 1 + calculateObjectSize(value.scope, serializeFunctions, ignoreUndefined);
-        } else if(serializeFunctions) {
-          return (name != null ? (Buffer.byteLength(name, 'utf8') + 1) : 0) + 1 + 4 + Buffer.byteLength(value.toString(), 'utf8') + 1;
-        }
-      }
-  }
-
-  return 0;
-}
-
-var BSON = {};
-
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-module.exports = calculateObjectSize;
diff --git a/node_modules/bson/lib/bson/parser/deserializer.js b/node_modules/bson/lib/bson/parser/deserializer.js
deleted file mode 100644
index b553e1e..0000000
--- a/node_modules/bson/lib/bson/parser/deserializer.js
+++ /dev/null
@@ -1,609 +0,0 @@
-"use strict"
-
-var readIEEE754 = require('../float_parser').readIEEE754,
-	f = require('util').format,
-	Long = require('../long').Long,
-  Double = require('../double').Double,
-  Timestamp = require('../timestamp').Timestamp,
-  ObjectID = require('../objectid').ObjectID,
-  Symbol = require('../symbol').Symbol,
-  Code = require('../code').Code,
-  MinKey = require('../min_key').MinKey,
-  MaxKey = require('../max_key').MaxKey,
-	Decimal128 = require('../decimal128'),
-  DBRef = require('../db_ref').DBRef,
-  BSONRegExp = require('../regexp').BSONRegExp,
-  Binary = require('../binary').Binary;
-
-var deserialize = function(buffer, options, isArray) {
-	options = options == null ? {} : options;
-	var index = options && options.index ? options.index : 0;
-	// Read the document size
-  var size = buffer[index] | buffer[index+1] << 8 | buffer[index+2] << 16 | buffer[index+3] << 24;
-
-	// Ensure buffer is valid size
-  if(size < 5 || buffer.length < size || (size + index) < buffer.length) {
-		throw new Error("corrupt bson message");
-	}
-
-	// Illegal end value
-	if(buffer[index + size - 1] != 0) {
-		throw new Error("One object, sized correctly, with a spot for an EOO, but the EOO isn't 0x00");
-	}
-
-	// Start deserializtion
-	return deserializeObject(buffer, index, options, isArray);
-}
-
-var deserializeObject = function(buffer, index, options, isArray) {
-	var evalFunctions = options['evalFunctions'] == null ? false : options['evalFunctions'];
-  var cacheFunctions = options['cacheFunctions'] == null ? false : options['cacheFunctions'];
-  var cacheFunctionsCrc32 = options['cacheFunctionsCrc32'] == null ? false : options['cacheFunctionsCrc32'];
-  var promoteLongs = options['promoteLongs'] == null ? true : options['promoteLongs'];
-	var fieldsAsRaw = options['fieldsAsRaw'] == null ? null : options['fieldsAsRaw'];
-	var raw = options['raw'] == null ? false : options['raw'];
-  // Return BSONRegExp objects instead of native regular expressions
-  var bsonRegExp = typeof options['bsonRegExp'] == 'boolean' ? options['bsonRegExp'] : false;
-  var promoteBuffers = options['promoteBuffers'] == null ? false : options['promoteBuffers'];
-	var startIndex = index;
-
-  // Validate that we have at least 4 bytes of buffer
-  if(buffer.length < 5) throw new Error("corrupt bson message < 5 bytes long");
-
-	// Read the document size
-  var size = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-	// Ensure buffer is valid size
-  if(size < 5 || size > buffer.length) throw new Error("corrupt bson message");
-
-  // Create holding object
-  var object = isArray ? [] : {};
-	// Used for arrays to skip having to perform utf8 decoding
-	var arrayIndex = 0;
-
-  // While we have more left data left keep parsing
-  while(true) {
-    // Read the type
-    var elementType = buffer[index++];
-    // If we get a zero it's the last byte, exit
-    if(elementType == 0) {
-			break;
-		}
-
-		// Get the start search index
-		var i = index;
-		// Locate the end of the c string
-		while(buffer[i] !== 0x00 && i < buffer.length) {
-			i++
-		}
-
-		// If are at the end of the buffer there is a problem with the document
-		if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-		var name = isArray ? arrayIndex++ : buffer.toString('utf8', index, i);
-
-		index = i + 1;
-
-		if(elementType == BSON.BSON_DATA_STRING) {
-      var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-			if(stringSize <= 0 || stringSize > (buffer.length - index) || buffer[index + stringSize - 1] != 0) throw new Error("bad string length in bson");
-      object[name] = buffer.toString('utf8', index, index + stringSize - 1);
-      index = index + stringSize;
-		} else if(elementType == BSON.BSON_DATA_OID) {
-			var oid = new Buffer(12);
-			buffer.copy(oid, 0, index, index + 12);
-      object[name] = new ObjectID(oid);
-      index = index + 12;
-		} else if(elementType == BSON.BSON_DATA_INT) {
-      object[name] = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-		} else if(elementType == BSON.BSON_DATA_NUMBER) {
-			object[name] = buffer.readDoubleLE(index);
-      index = index + 8;
-		} else if(elementType == BSON.BSON_DATA_DATE) {
-      var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-      var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-      object[name] = new Date(new Long(lowBits, highBits).toNumber());
-		} else if(elementType == BSON.BSON_DATA_BOOLEAN) {
-			if(buffer[index] != 0 && buffer[index] != 1) throw new Error('illegal boolean type value');
-      object[name] = buffer[index++] == 1;
-		} else if(elementType == BSON.BSON_DATA_OBJECT) {
-			var _index = index;
-      var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-			if(objectSize <= 0 || objectSize > (buffer.length - index)) throw new Error("bad embedded document length in bson");
-
-			// We have a raw value
-			if(raw) {
-	      object[name] = buffer.slice(index, index + objectSize);
-			} else {
-	      object[name] = deserializeObject(buffer, _index, options, false);
-			}
-
-      index = index + objectSize;
-		} else if(elementType == BSON.BSON_DATA_ARRAY) {
-			var _index = index;
-      var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-			var arrayOptions = options;
-
-			// Stop index
-			var stopIndex = index + objectSize;
-
-			// All elements of array to be returned as raw bson
-			if(fieldsAsRaw && fieldsAsRaw[name]) {
-				arrayOptions = {};
-				for(var n in options) arrayOptions[n] = options[n];
-				arrayOptions['raw'] = true;
-			}
-
-      object[name] = deserializeObject(buffer, _index, arrayOptions, true);
-      index = index + objectSize;
-
-			if(buffer[index - 1] != 0) throw new Error('invalid array terminator byte');
-			if(index != stopIndex) throw new Error('corrupted array bson');
-		} else if(elementType == BSON.BSON_DATA_UNDEFINED) {
-      object[name] = undefined;
-		} else if(elementType == BSON.BSON_DATA_NULL) {
-			object[name] = null;
-		} else if(elementType == BSON.BSON_DATA_LONG) {
-      // Unpack the low and high bits
-      var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-      var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-      var long = new Long(lowBits, highBits);
-      // Promote the long if possible
-      if(promoteLongs) {
-        object[name] = long.lessThanOrEqual(JS_INT_MAX_LONG) && long.greaterThanOrEqual(JS_INT_MIN_LONG) ? long.toNumber() : long;
-      } else {
-        object[name] = long;
-      }
-		} else if(elementType == BSON.BSON_DATA_DECIMAL128) {
-			// Buffer to contain the decimal bytes
-			var bytes = new Buffer(16);
-			// Copy the next 16 bytes into the bytes buffer
-			buffer.copy(bytes, 0, index, index + 16);
-			// Update index
-			index = index + 16;
-			// Assign the new Decimal128 value
-			var decimal128 = new Decimal128(bytes);
-			// If we have an alternative mapper use that
-			object[name] = decimal128.toObject ? decimal128.toObject() : decimal128;
-		} else if(elementType == BSON.BSON_DATA_BINARY) {
-      var binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-			var totalBinarySize = binarySize;
-      var subType = buffer[index++];
-
-			// Did we have a negative binary size, throw
-			if(binarySize < 0) throw new Error('Negative binary type element size found');
-
-			// Is the length longer than the document
-			if(binarySize > buffer.length) throw new Error('Binary type size larger than document size');
-
-			// Decode as raw Buffer object if options specifies it
-      if(buffer['slice'] != null) {
-        // If we have subtype 2 skip the 4 bytes for the size
-        if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
-          binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-					if(binarySize < 0) throw new Error('Negative binary type element size found for subtype 0x02');
-					if(binarySize > (totalBinarySize - 4)) throw new Error('Binary type with subtype 0x02 contains to long binary size');
-					if(binarySize < (totalBinarySize - 4)) throw new Error('Binary type with subtype 0x02 contains to short binary size');
-        }
-
-        if(promoteBuffers) {
-          object[name] = buffer.slice(index, index + binarySize);
-        } else {
-          object[name] = new Binary(buffer.slice(index, index + binarySize), subType);
-        }
-      } else {
-        var _buffer = typeof Uint8Array != 'undefined' ? new Uint8Array(new ArrayBuffer(binarySize)) : new Array(binarySize);
-        // If we have subtype 2 skip the 4 bytes for the size
-        if(subType == Binary.SUBTYPE_BYTE_ARRAY) {
-          binarySize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-					if(binarySize < 0) throw new Error('Negative binary type element size found for subtype 0x02');
-					if(binarySize > (totalBinarySize - 4)) throw new Error('Binary type with subtype 0x02 contains to long binary size');
-					if(binarySize < (totalBinarySize - 4)) throw new Error('Binary type with subtype 0x02 contains to short binary size');
-        }
-
-        // Copy the data
-        for(var i = 0; i < binarySize; i++) {
-          _buffer[i] = buffer[index + i];
-        }
-
-        if(promoteBuffers) {
-          object[name] = _buffer;
-        } else {
-          object[name] = new Binary(_buffer, subType);
-        }
-      }
-
-      // Update the index
-      index = index + binarySize;
-		} else if(elementType == BSON.BSON_DATA_REGEXP && bsonRegExp == false) {
-			// Get the start search index
-			var i = index;
-			// Locate the end of the c string
-			while(buffer[i] !== 0x00 && i < buffer.length) {
-				i++
-			}
-			// If are at the end of the buffer there is a problem with the document
-			if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-			// Return the C string
-			var source = buffer.toString('utf8', index, i);
-      // Create the regexp
-			index = i + 1;
-
-			// Get the start search index
-			var i = index;
-			// Locate the end of the c string
-			while(buffer[i] !== 0x00 && i < buffer.length) {
-				i++
-			}
-			// If are at the end of the buffer there is a problem with the document
-			if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-			// Return the C string
-			var regExpOptions = buffer.toString('utf8', index, i);
-			index = i + 1;
-
-      // For each option add the corresponding one for javascript
-      var optionsArray = new Array(regExpOptions.length);
-
-      // Parse options
-      for(var i = 0; i < regExpOptions.length; i++) {
-        switch(regExpOptions[i]) {
-          case 'm':
-            optionsArray[i] = 'm';
-            break;
-          case 's':
-            optionsArray[i] = 'g';
-            break;
-          case 'i':
-            optionsArray[i] = 'i';
-            break;
-        }
-      }
-
-      object[name] = new RegExp(source, optionsArray.join(''));
-    } else if(elementType == BSON.BSON_DATA_REGEXP && bsonRegExp == true) {
-			// Get the start search index
-			var i = index;
-			// Locate the end of the c string
-			while(buffer[i] !== 0x00 && i < buffer.length) {
-				i++
-			}
-			// If are at the end of the buffer there is a problem with the document
-			if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-			// Return the C string
-			var source = buffer.toString('utf8', index, i);
-      index = i + 1;
-
-			// Get the start search index
-			var i = index;
-			// Locate the end of the c string
-			while(buffer[i] !== 0x00 && i < buffer.length) {
-				i++
-			}
-			// If are at the end of the buffer there is a problem with the document
-			if(i >= buffer.length) throw new Error("Bad BSON Document: illegal CString")
-			// Return the C string
-			var regExpOptions = buffer.toString('utf8', index, i);
-      index = i + 1;
-
-      // Set the object
-      object[name] = new BSONRegExp(source, regExpOptions);
-		} else if(elementType == BSON.BSON_DATA_SYMBOL) {
-      var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-			if(stringSize <= 0 || stringSize > (buffer.length - index) || buffer[index + stringSize - 1] != 0) throw new Error("bad string length in bson");
-      object[name] = new Symbol(buffer.toString('utf8', index, index + stringSize - 1));
-      index = index + stringSize;
-		} else if(elementType == BSON.BSON_DATA_TIMESTAMP) {
-      var lowBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-      var highBits = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-      object[name] = new Timestamp(lowBits, highBits);
-		} else if(elementType == BSON.BSON_DATA_MIN_KEY) {
-      object[name] = new MinKey();
-		} else if(elementType == BSON.BSON_DATA_MAX_KEY) {
-      object[name] = new MaxKey();
-		} else if(elementType == BSON.BSON_DATA_CODE) {
-      var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-			if(stringSize <= 0 || stringSize > (buffer.length - index) || buffer[index + stringSize - 1] != 0) throw new Error("bad string length in bson");
-      var functionString = buffer.toString('utf8', index, index + stringSize - 1);
-
-      // If we are evaluating the functions
-      if(evalFunctions) {
-        var value = null;
-        // If we have cache enabled let's look for the md5 of the function in the cache
-        if(cacheFunctions) {
-          var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
-          // Got to do this to avoid V8 deoptimizing the call due to finding eval
-          object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
-        } else {
-          object[name] = isolateEval(functionString);
-        }
-      } else {
-        object[name]  = new Code(functionString);
-      }
-
-      // Update parse index position
-      index = index + stringSize;
-		} else if(elementType == BSON.BSON_DATA_CODE_W_SCOPE) {
-      var totalSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-
-			// Element cannot be shorter than totalSize + stringSize + documentSize + terminator
-			if(totalSize < (4 + 4 + 4 + 1)) {
-				throw new Error("code_w_scope total size shorter minimum expected length");
-			}
-
-			// Get the code string size
-      var stringSize = buffer[index++] | buffer[index++] << 8 | buffer[index++] << 16 | buffer[index++] << 24;
-			// Check if we have a valid string
-			if(stringSize <= 0 || stringSize > (buffer.length - index) || buffer[index + stringSize - 1] != 0) throw new Error("bad string length in bson");
-
-      // Javascript function
-      var functionString = buffer.toString('utf8', index, index + stringSize - 1);
-      // Update parse index position
-      index = index + stringSize;
-      // Parse the element
-			var _index = index;
-      // Decode the size of the object document
-      var objectSize = buffer[index] | buffer[index + 1] << 8 | buffer[index + 2] << 16 | buffer[index + 3] << 24;
-      // Decode the scope object
-      var scopeObject = deserializeObject(buffer, _index, options, false);
-      // Adjust the index
-      index = index + objectSize;
-
-			// Check if field length is to short
-			if(totalSize < (4 + 4 + objectSize + stringSize)) {
-				throw new Error('code_w_scope total size is to short, truncating scope');
-			}
-
-			// Check if totalSize field is to long
-			if(totalSize > (4 + 4 + objectSize + stringSize)) {
-				throw new Error('code_w_scope total size is to long, clips outer document');
-			}
-
-      // If we are evaluating the functions
-      if(evalFunctions) {
-        // Contains the value we are going to set
-        var value = null;
-        // If we have cache enabled let's look for the md5 of the function in the cache
-        if(cacheFunctions) {
-          var hash = cacheFunctionsCrc32 ? crc32(functionString) : functionString;
-          // Got to do this to avoid V8 deoptimizing the call due to finding eval
-          object[name] = isolateEvalWithHash(functionCache, hash, functionString, object);
-        } else {
-          object[name] = isolateEval(functionString);
-        }
-
-        object[name].scope = scopeObject;
-      } else {
-        object[name]  = new Code(functionString, scopeObject);
-      }
-    } else {
-			throw new Error("Detected unknown BSON type " + elementType.toString(16) + " for fieldname \"" + name + "\", are you using the latest BSON parser");
-		}
-  }
-
-	// Check if the deserialization was against a valid array/object
-	if(size != (index - startIndex)) {
-		if(isArray) throw new Error('corrupt array bson');
-		throw new Error('corrupt object bson');
-	}
-
-  // Check if we have a db ref object
-  if(object['$id'] != null) object = new DBRef(object['$ref'], object['$id'], object['$db']);
-  return object;
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEvalWithHash = function(functionCache, hash, functionString, object) {
-  // Contains the value we are going to set
-  var value = null;
-
-  // Check for cache hit, eval if missing and return cached function
-  if(functionCache[hash] == null) {
-    eval("value = " + functionString);
-    functionCache[hash] = value;
-  }
-  // Set the object
-  return functionCache[hash].bind(object);
-}
-
-/**
- * Ensure eval is isolated.
- *
- * @ignore
- * @api private
- */
-var isolateEval = function(functionString) {
-  // Contains the value we are going to set
-  var value = null;
-  // Eval the function
-  eval("value = " + functionString);
-  return value;
-}
-
-var BSON = {};
-
-/**
- * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
- *
- * @ignore
- * @api private
- */
-var functionCache = BSON.functionCache = {};
-
-/**
- * Number BSON Type
- *
- * @classconstant BSON_DATA_NUMBER
- **/
-BSON.BSON_DATA_NUMBER = 1;
-/**
- * String BSON Type
- *
- * @classconstant BSON_DATA_STRING
- **/
-BSON.BSON_DATA_STRING = 2;
-/**
- * Object BSON Type
- *
- * @classconstant BSON_DATA_OBJECT
- **/
-BSON.BSON_DATA_OBJECT = 3;
-/**
- * Array BSON Type
- *
- * @classconstant BSON_DATA_ARRAY
- **/
-BSON.BSON_DATA_ARRAY = 4;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_BINARY
- **/
-BSON.BSON_DATA_BINARY = 5;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_UNDEFINED
- **/
-BSON.BSON_DATA_UNDEFINED = 6;
-/**
- * ObjectID BSON Type
- *
- * @classconstant BSON_DATA_OID
- **/
-BSON.BSON_DATA_OID = 7;
-/**
- * Boolean BSON Type
- *
- * @classconstant BSON_DATA_BOOLEAN
- **/
-BSON.BSON_DATA_BOOLEAN = 8;
-/**
- * Date BSON Type
- *
- * @classconstant BSON_DATA_DATE
- **/
-BSON.BSON_DATA_DATE = 9;
-/**
- * null BSON Type
- *
- * @classconstant BSON_DATA_NULL
- **/
-BSON.BSON_DATA_NULL = 10;
-/**
- * RegExp BSON Type
- *
- * @classconstant BSON_DATA_REGEXP
- **/
-BSON.BSON_DATA_REGEXP = 11;
-/**
- * Code BSON Type
- *
- * @classconstant BSON_DATA_CODE
- **/
-BSON.BSON_DATA_CODE = 13;
-/**
- * Symbol BSON Type
- *
- * @classconstant BSON_DATA_SYMBOL
- **/
-BSON.BSON_DATA_SYMBOL = 14;
-/**
- * Code with Scope BSON Type
- *
- * @classconstant BSON_DATA_CODE_W_SCOPE
- **/
-BSON.BSON_DATA_CODE_W_SCOPE = 15;
-/**
- * 32 bit Integer BSON Type
- *
- * @classconstant BSON_DATA_INT
- **/
-BSON.BSON_DATA_INT = 16;
-/**
- * Timestamp BSON Type
- *
- * @classconstant BSON_DATA_TIMESTAMP
- **/
-BSON.BSON_DATA_TIMESTAMP = 17;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_LONG
- **/
-BSON.BSON_DATA_LONG = 18;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_DECIMAL128
- **/
-BSON.BSON_DATA_DECIMAL128 = 19;
-/**
- * MinKey BSON Type
- *
- * @classconstant BSON_DATA_MIN_KEY
- **/
-BSON.BSON_DATA_MIN_KEY = 0xff;
-/**
- * MaxKey BSON Type
- *
- * @classconstant BSON_DATA_MAX_KEY
- **/
-BSON.BSON_DATA_MAX_KEY = 0x7f;
-
-/**
- * Binary Default Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
- **/
-BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
-/**
- * Binary Function Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
- **/
-BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
-/**
- * Binary Byte Array Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
- **/
-BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
-/**
- * Binary UUID Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_UUID
- **/
-BSON.BSON_BINARY_SUBTYPE_UUID = 3;
-/**
- * Binary MD5 Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_MD5
- **/
-BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
-/**
- * Binary User Defined Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
- **/
-BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
-
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
-BSON.BSON_INT64_MIN = -Math.pow(2, 63);
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-// Internal long versions
-var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
-var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
-
-module.exports = deserialize
diff --git a/node_modules/bson/lib/bson/parser/serializer.js b/node_modules/bson/lib/bson/parser/serializer.js
deleted file mode 100644
index 7dfecb0..0000000
--- a/node_modules/bson/lib/bson/parser/serializer.js
+++ /dev/null
@@ -1,951 +0,0 @@
-"use strict"
-
-var writeIEEE754 = require('../float_parser').writeIEEE754,
-  readIEEE754 = require('../float_parser').readIEEE754,
-  Long = require('../long').Long,
-  Map = require('../map'),
-  Double = require('../double').Double,
-  Timestamp = require('../timestamp').Timestamp,
-  ObjectID = require('../objectid').ObjectID,
-  Symbol = require('../symbol').Symbol,
-  Code = require('../code').Code,
-  BSONRegExp = require('../regexp').BSONRegExp,
-  MinKey = require('../min_key').MinKey,
-  MaxKey = require('../max_key').MaxKey,
-  Decimal128 = require('../decimal128'),
-  DBRef = require('../db_ref').DBRef,
-  Binary = require('../binary').Binary;
-
-try {
-  var _Buffer = Uint8Array;
-} catch(e) {
-  var _Buffer = Buffer;
-}
-
-var regexp = /\x00/
-
-// To ensure that 0.4 of node works correctly
-var isDate = function isDate(d) {
-  return typeof d === 'object' && Object.prototype.toString.call(d) === '[object Date]';
-}
-
-var isRegExp = function isRegExp(d) {
-  return Object.prototype.toString.call(d) === '[object RegExp]';
-}
-
-var serializeString = function(buffer, key, value, index) {
-  // Encode String type
-  buffer[index++] = BSON.BSON_DATA_STRING;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes + 1;
-  buffer[index - 1] = 0;
-  // Write the string
-  var size = buffer.write(value, index + 4, 'utf8');
-  // Write the size of the string to buffer
-  buffer[index + 3] = (size + 1 >> 24) & 0xff;
-  buffer[index + 2] = (size + 1 >> 16) & 0xff;
-  buffer[index + 1] = (size + 1 >> 8) & 0xff;
-  buffer[index] = size + 1 & 0xff;
-  // Update index
-  index = index + 4 + size;
-  // Write zero
-  buffer[index++] = 0;
-  return index;
-}
-
-var serializeNumber = function(buffer, key, value, index) {
-  // We have an integer value
-  if(Math.floor(value) === value && value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-    // If the value fits in 32 bits encode as int, if it fits in a double
-    // encode it as a double, otherwise long
-    if(value >= BSON.BSON_INT32_MIN && value <= BSON.BSON_INT32_MAX) {
-      // Set int type 32 bits or less
-      buffer[index++] = BSON.BSON_DATA_INT;
-      // Number of written bytes
-      var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-      // Encode the name
-      index = index + numberOfWrittenBytes;
-      buffer[index++] = 0;
-      // Write the int value
-      buffer[index++] = value & 0xff;
-      buffer[index++] = (value >> 8) & 0xff;
-      buffer[index++] = (value >> 16) & 0xff;
-      buffer[index++] = (value >> 24) & 0xff;
-    } else if(value >= BSON.JS_INT_MIN && value <= BSON.JS_INT_MAX) {
-      // Encode as double
-      buffer[index++] = BSON.BSON_DATA_NUMBER;
-      // Number of written bytes
-      var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-      // Encode the name
-      index = index + numberOfWrittenBytes;
-      buffer[index++] = 0;
-      // Write float
-      writeIEEE754(buffer, value, index, 'little', 52, 8);
-      // Ajust index
-      index = index + 8;
-    } else {
-      // Set long type
-      buffer[index++] = BSON.BSON_DATA_LONG;
-      // Number of written bytes
-      var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-      // Encode the name
-      index = index + numberOfWrittenBytes;
-      buffer[index++] = 0;
-      var longVal = Long.fromNumber(value);
-      var lowBits = longVal.getLowBits();
-      var highBits = longVal.getHighBits();
-      // Encode low bits
-      buffer[index++] = lowBits & 0xff;
-      buffer[index++] = (lowBits >> 8) & 0xff;
-      buffer[index++] = (lowBits >> 16) & 0xff;
-      buffer[index++] = (lowBits >> 24) & 0xff;
-      // Encode high bits
-      buffer[index++] = highBits & 0xff;
-      buffer[index++] = (highBits >> 8) & 0xff;
-      buffer[index++] = (highBits >> 16) & 0xff;
-      buffer[index++] = (highBits >> 24) & 0xff;
-    }
-  } else {
-    // Encode as double
-    buffer[index++] = BSON.BSON_DATA_NUMBER;
-    // Number of written bytes
-    var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-    // Encode the name
-    index = index + numberOfWrittenBytes;
-    buffer[index++] = 0;
-    // Write float
-    writeIEEE754(buffer, value, index, 'little', 52, 8);
-    // Ajust index
-    index = index + 8;
-  }
-
-  return index;
-}
-
-var serializeUndefined = function(buffer, key, value, index) {
-  // Set long type
-  buffer[index++] = BSON.BSON_DATA_NULL;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  return index;
-}
-
-var serializeBoolean = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_BOOLEAN;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Encode the boolean value
-  buffer[index++] = value ? 1 : 0;
-  return index;
-}
-
-var serializeDate = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_DATE;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-
-  // Write the date
-  var dateInMilis = Long.fromNumber(value.getTime());
-  var lowBits = dateInMilis.getLowBits();
-  var highBits = dateInMilis.getHighBits();
-  // Encode low bits
-  buffer[index++] = lowBits & 0xff;
-  buffer[index++] = (lowBits >> 8) & 0xff;
-  buffer[index++] = (lowBits >> 16) & 0xff;
-  buffer[index++] = (lowBits >> 24) & 0xff;
-  // Encode high bits
-  buffer[index++] = highBits & 0xff;
-  buffer[index++] = (highBits >> 8) & 0xff;
-  buffer[index++] = (highBits >> 16) & 0xff;
-  buffer[index++] = (highBits >> 24) & 0xff;
-  return index;
-}
-
-var serializeRegExp = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_REGEXP;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  if (value.source && value.source.match(regexp) != null) {
-    throw Error("value " + value.source + " must not contain null bytes");
-  }
-  // Adjust the index
-  index = index + buffer.write(value.source, index, 'utf8');
-  // Write zero
-  buffer[index++] = 0x00;
-  // Write the parameters
-  if(value.global) buffer[index++] = 0x73; // s
-  if(value.ignoreCase) buffer[index++] = 0x69; // i
-  if(value.multiline) buffer[index++] = 0x6d; // m
-  // Add ending zero
-  buffer[index++] = 0x00;
-  return index;
-}
-
-var serializeBSONRegExp = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_REGEXP;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Adjust the index
-  index = index + buffer.write(value.pattern, index, 'utf8');
-  // Write zero
-  buffer[index++] = 0x00;
-  // Write the options
-  index = index + buffer.write(value.options, index, 'utf8');
-  // Add ending zero
-  buffer[index++] = 0x00;
-  return index;
-}
-
-var serializeMinMax = function(buffer, key, value, index) {
-  // Write the type of either min or max key
-  if(value === null) {
-    buffer[index++] = BSON.BSON_DATA_NULL;
-  } else if(value instanceof MinKey) {
-    buffer[index++] = BSON.BSON_DATA_MIN_KEY;
-  } else {
-    buffer[index++] = BSON.BSON_DATA_MAX_KEY;
-  }
-
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  return index;
-}
-
-var serializeObjectId = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_OID;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-
-  // Write the objectId into the shared buffer
-  if(typeof value.id == 'string') {
-    buffer.write(value.id, index, 'binary')
-  } else {
-    value.id.copy(buffer, index, 0, 12);
-  }
-
-  // Ajust index
-  return index + 12;
-}
-
-var serializeBuffer = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_BINARY;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Get size of the buffer (current write point)
-  var size = value.length;
-  // Write the size of the string to buffer
-  buffer[index++] = size & 0xff;
-  buffer[index++] = (size >> 8) & 0xff;
-  buffer[index++] = (size >> 16) & 0xff;
-  buffer[index++] = (size >> 24) & 0xff;
-  // Write the default subtype
-  buffer[index++] = BSON.BSON_BINARY_SUBTYPE_DEFAULT;
-  // Copy the content form the binary field to the buffer
-  value.copy(buffer, index, 0, size);
-  // Adjust the index
-  index = index + size;
-  return index;
-}
-
-var serializeObject = function(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined) {
-  // Write the type
-  buffer[index++] = Array.isArray(value) ? BSON.BSON_DATA_ARRAY : BSON.BSON_DATA_OBJECT;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  var endIndex = serializeInto(buffer, value, checkKeys, index, depth + 1, serializeFunctions, ignoreUndefined);
-  // Write size
-  var size = endIndex - index;
-  return endIndex;
-}
-
-var serializeDecimal128 = function(buffer, key, value, index) {
-  buffer[index++] = BSON.BSON_DATA_DECIMAL128;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Write the data from the value
-  value.bytes.copy(buffer, index, 0, 16);
-  return index + 16;
-}
-
-var serializeLong = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = value._bsontype == 'Long' ? BSON.BSON_DATA_LONG : BSON.BSON_DATA_TIMESTAMP;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Write the date
-  var lowBits = value.getLowBits();
-  var highBits = value.getHighBits();
-  // Encode low bits
-  buffer[index++] = lowBits & 0xff;
-  buffer[index++] = (lowBits >> 8) & 0xff;
-  buffer[index++] = (lowBits >> 16) & 0xff;
-  buffer[index++] = (lowBits >> 24) & 0xff;
-  // Encode high bits
-  buffer[index++] = highBits & 0xff;
-  buffer[index++] = (highBits >> 8) & 0xff;
-  buffer[index++] = (highBits >> 16) & 0xff;
-  buffer[index++] = (highBits >> 24) & 0xff;
-  return index;
-}
-
-var serializeDouble = function(buffer, key, value, index) {
-  // Encode as double
-  buffer[index++] = BSON.BSON_DATA_NUMBER;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Write float
-  writeIEEE754(buffer, value, index, 'little', 52, 8);
-  // Ajust index
-  index = index + 8;
-  return index;
-}
-
-var serializeFunction = function(buffer, key, value, index, checkKeys, depth) {
-  buffer[index++] = BSON.BSON_DATA_CODE;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Function string
-  var functionString = value.toString();
-  // Write the string
-  var size = buffer.write(functionString, index + 4, 'utf8') + 1;
-  // Write the size of the string to buffer
-  buffer[index] = size & 0xff;
-  buffer[index + 1] = (size >> 8) & 0xff;
-  buffer[index + 2] = (size >> 16) & 0xff;
-  buffer[index + 3] = (size >> 24) & 0xff;
-  // Update index
-  index = index + 4 + size - 1;
-  // Write zero
-  buffer[index++] = 0;
-  return index;
-}
-
-var serializeCode = function(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined) {
-  if(value.scope && typeof value.scope == 'object') {
-    // Write the type
-    buffer[index++] = BSON.BSON_DATA_CODE_W_SCOPE;
-    // Number of written bytes
-    var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-    // Encode the name
-    index = index + numberOfWrittenBytes;
-    buffer[index++] = 0;
-
-    // Starting index
-    var startIndex = index;
-
-    // Serialize the function
-    // Get the function string
-    var functionString = typeof value.code == 'string' ? value.code : value.code.toString();
-    // Index adjustment
-    index = index + 4;
-    // Write string into buffer
-    var codeSize = buffer.write(functionString, index + 4, 'utf8') + 1;
-    // Write the size of the string to buffer
-    buffer[index] = codeSize & 0xff;
-    buffer[index + 1] = (codeSize >> 8) & 0xff;
-    buffer[index + 2] = (codeSize >> 16) & 0xff;
-    buffer[index + 3] = (codeSize >> 24) & 0xff;
-    // Write end 0
-    buffer[index + 4 + codeSize - 1] = 0;
-    // Write the
-    index = index + codeSize + 4;
-
-    //
-    // Serialize the scope value
-    var endIndex = serializeInto(buffer, value.scope, checkKeys, index, depth + 1, serializeFunctions, ignoreUndefined)
-    index = endIndex - 1;
-
-    // Writ the total
-    var totalSize = endIndex - startIndex;
-
-    // Write the total size of the object
-    buffer[startIndex++] = totalSize & 0xff;
-    buffer[startIndex++] = (totalSize >> 8) & 0xff;
-    buffer[startIndex++] = (totalSize >> 16) & 0xff;
-    buffer[startIndex++] = (totalSize >> 24) & 0xff;
-    // Write trailing zero
-    buffer[index++] = 0;
-  } else {
-    buffer[index++] = BSON.BSON_DATA_CODE;
-    // Number of written bytes
-    var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-    // Encode the name
-    index = index + numberOfWrittenBytes;
-    buffer[index++] = 0;
-    // Function string
-    var functionString = value.code.toString();
-    // Write the string
-    var size = buffer.write(functionString, index + 4, 'utf8') + 1;
-    // Write the size of the string to buffer
-    buffer[index] = size & 0xff;
-    buffer[index + 1] = (size >> 8) & 0xff;
-    buffer[index + 2] = (size >> 16) & 0xff;
-    buffer[index + 3] = (size >> 24) & 0xff;
-    // Update index
-    index = index + 4 + size - 1;
-    // Write zero
-    buffer[index++] = 0;
-  }
-
-  return index;
-}
-
-var serializeBinary = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_BINARY;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Extract the buffer
-  var data = value.value(true);
-  // Calculate size
-  var size = value.position;
-  // Add the deprecated 02 type 4 bytes of size to total
-  if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) size = size + 4;
-  // Write the size of the string to buffer
-  buffer[index++] = size & 0xff;
-  buffer[index++] = (size >> 8) & 0xff;
-  buffer[index++] = (size >> 16) & 0xff;
-  buffer[index++] = (size >> 24) & 0xff;
-  // Write the subtype to the buffer
-  buffer[index++] = value.sub_type;
-
-  // If we have binary type 2 the 4 first bytes are the size
-  if(value.sub_type == Binary.SUBTYPE_BYTE_ARRAY) {
-    size = size - 4;
-    buffer[index++] = size & 0xff;
-    buffer[index++] = (size >> 8) & 0xff;
-    buffer[index++] = (size >> 16) & 0xff;
-    buffer[index++] = (size >> 24) & 0xff;
-  }
-
-  // Write the data to the object
-  data.copy(buffer, index, 0, value.position);
-  // Adjust the index
-  index = index + value.position;
-  return index;
-}
-
-var serializeSymbol = function(buffer, key, value, index) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_SYMBOL;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-  // Write the string
-  var size = buffer.write(value.value, index + 4, 'utf8') + 1;
-  // Write the size of the string to buffer
-  buffer[index] = size & 0xff;
-  buffer[index + 1] = (size >> 8) & 0xff;
-  buffer[index + 2] = (size >> 16) & 0xff;
-  buffer[index + 3] = (size >> 24) & 0xff;
-  // Update index
-  index = index + 4 + size - 1;
-  // Write zero
-  buffer[index++] = 0x00;
-  return index;
-}
-
-var serializeDBRef = function(buffer, key, value, index, depth, serializeFunctions) {
-  // Write the type
-  buffer[index++] = BSON.BSON_DATA_OBJECT;
-  // Number of written bytes
-  var numberOfWrittenBytes = buffer.write(key, index, 'utf8');
-
-  // Encode the name
-  index = index + numberOfWrittenBytes;
-  buffer[index++] = 0;
-
-  var startIndex = index;
-  var endIndex;
-
-  // Serialize object
-  if(null != value.db) {
-    endIndex = serializeInto(buffer, {
-        '$ref': value.namespace
-      , '$id' : value.oid
-      , '$db' : value.db
-    }, false, index, depth + 1, serializeFunctions);
-  } else {
-    endIndex = serializeInto(buffer, {
-        '$ref': value.namespace
-      , '$id' : value.oid
-    }, false, index, depth + 1, serializeFunctions);
-  }
-
-  // Calculate object size
-  var size = endIndex - startIndex;
-  // Write the size
-  buffer[startIndex++] = size & 0xff;
-  buffer[startIndex++] = (size >> 8) & 0xff;
-  buffer[startIndex++] = (size >> 16) & 0xff;
-  buffer[startIndex++] = (size >> 24) & 0xff;
-  // Set index
-  return endIndex;
-}
-
-var serializeInto = function serializeInto(buffer, object, checkKeys, startingIndex, depth, serializeFunctions, ignoreUndefined) {
-  startingIndex = startingIndex || 0;
-
-  // Start place to serialize into
-  var index = startingIndex + 4;
-  var self = this;
-
-  // Special case isArray
-  if(Array.isArray(object)) {
-    // Get object keys
-    for(var i = 0; i < object.length; i++) {
-      var key = "" + i;
-      var value = object[i];
-
-      // Is there an override value
-      if(value && value.toBSON) {
-        if(typeof value.toBSON != 'function') throw new Error("toBSON is not a function");
-        value = value.toBSON();
-      }
-
-      var type = typeof value;
-      if(type == 'string') {
-        index = serializeString(buffer, key, value, index);
-      } else if(type == 'number') {
-        index = serializeNumber(buffer, key, value, index);
-      } else if(type == 'boolean') {
-        index = serializeBoolean(buffer, key, value, index);
-      } else if(value instanceof Date || isDate(value)) {
-        index = serializeDate(buffer, key, value, index);
-      } else if(type == 'undefined' || value == null) {
-        index = serializeUndefined(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'ObjectID') {
-        index = serializeObjectId(buffer, key, value, index);
-      } else if(Buffer.isBuffer(value)) {
-        index = serializeBuffer(buffer, key, value, index);
-      } else if(value instanceof RegExp || isRegExp(value)) {
-        index = serializeRegExp(buffer, key, value, index);
-      } else if(type == 'object' && value['_bsontype'] == null) {
-        index = serializeObject(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined);
-      } else if(type == 'object' && value['_bsontype'] == 'Decimal128') {
-        index = serializeDecimal128(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
-        index = serializeLong(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Double') {
-        index = serializeDouble(buffer, key, value, index);
-      } else if(typeof value == 'function' && serializeFunctions) {
-        index = serializeFunction(buffer, key, value, index, checkKeys, depth, serializeFunctions);
-      } else if(value['_bsontype'] == 'Code') {
-        index = serializeCode(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined);
-      } else if(value['_bsontype'] == 'Binary') {
-        index = serializeBinary(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Symbol') {
-        index = serializeSymbol(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'DBRef') {
-        index = serializeDBRef(buffer, key, value, index, depth, serializeFunctions);
-      } else if(value['_bsontype'] == 'BSONRegExp') {
-        index = serializeBSONRegExp(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        index = serializeMinMax(buffer, key, value, index);
-      }
-    }
-  } else if(object instanceof Map) {
-    var iterator = object.entries();
-    var done = false;
-
-    while(!done) {
-      // Unpack the next entry
-      var entry = iterator.next();
-      done = entry.done;
-      // Are we done, then skip and terminate
-      if(done) continue;
-
-      // Get the entry values
-      var key = entry.value[0];
-      var value = entry.value[1];
-
-      // Check the type of the value
-      var type = typeof value;
-
-      // Check the key and throw error if it's illegal
-      if(key != '$db' && key != '$ref' && key != '$id') {
-        if (key.match(regexp) != null) {
-          // The BSON spec doesn't allow keys with null bytes because keys are
-          // null-terminated.
-          throw Error("key " + key + " must not contain null bytes");
-        }
-
-        if (checkKeys) {
-          if('$' == key[0]) {
-            throw Error("key " + key + " must not start with '$'");
-          } else if (!!~key.indexOf('.')) {
-            throw Error("key " + key + " must not contain '.'");
-          }
-        }
-      }
-
-      if(type == 'string') {
-        index = serializeString(buffer, key, value, index);
-      } else if(type == 'number') {
-        index = serializeNumber(buffer, key, value, index);
-      } else if(type == 'boolean') {
-        index = serializeBoolean(buffer, key, value, index);
-      } else if(value instanceof Date || isDate(value)) {
-        index = serializeDate(buffer, key, value, index);
-      } else if(value === undefined && ignoreUndefined == true) {
-      } else if(value === null || value === undefined) {
-        index = serializeUndefined(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'ObjectID') {
-        index = serializeObjectId(buffer, key, value, index);
-      } else if(Buffer.isBuffer(value)) {
-        index = serializeBuffer(buffer, key, value, index);
-      } else if(value instanceof RegExp || isRegExp(value)) {
-        index = serializeRegExp(buffer, key, value, index);
-      } else if(type == 'object' && value['_bsontype'] == null) {
-        index = serializeObject(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined);
-      } else if(type == 'object' && value['_bsontype'] == 'Decimal128') {
-        index = serializeDecimal128(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
-        index = serializeLong(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Double') {
-        index = serializeDouble(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Code') {
-        index = serializeCode(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined);
-      } else if(typeof value == 'function' && serializeFunctions) {
-        index = serializeFunction(buffer, key, value, index, checkKeys, depth, serializeFunctions);
-      } else if(value['_bsontype'] == 'Binary') {
-        index = serializeBinary(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Symbol') {
-        index = serializeSymbol(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'DBRef') {
-        index = serializeDBRef(buffer, key, value, index, depth, serializeFunctions);
-      } else if(value['_bsontype'] == 'BSONRegExp') {
-        index = serializeBSONRegExp(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        index = serializeMinMax(buffer, key, value, index);
-      }
-    }
-  } else {
-    // Did we provide a custom serialization method
-    if(object.toBSON) {
-      if(typeof object.toBSON != 'function') throw new Error("toBSON is not a function");
-      object = object.toBSON();
-      if(object != null && typeof object != 'object') throw new Error("toBSON function did not return an object");
-    }
-
-    // Iterate over all the keys
-    for(var key in object) {
-      var value = object[key];
-      // Is there an override value
-      if(value && value.toBSON) {
-        if(typeof value.toBSON != 'function') throw new Error("toBSON is not a function");
-        value = value.toBSON();
-      }
-
-      // Check the type of the value
-      var type = typeof value;
-
-      // Check the key and throw error if it's illegal
-      if(key != '$db' && key != '$ref' && key != '$id') {
-        if (key.match(regexp) != null) {
-          // The BSON spec doesn't allow keys with null bytes because keys are
-          // null-terminated.
-          throw Error("key " + key + " must not contain null bytes");
-        }
-
-        if (checkKeys) {
-          if('$' == key[0]) {
-            throw Error("key " + key + " must not start with '$'");
-          } else if (!!~key.indexOf('.')) {
-            throw Error("key " + key + " must not contain '.'");
-          }
-        }
-      }
-
-      if(type == 'string') {
-        index = serializeString(buffer, key, value, index);
-      } else if(type == 'number') {
-        index = serializeNumber(buffer, key, value, index);
-      } else if(type == 'boolean') {
-        index = serializeBoolean(buffer, key, value, index);
-      } else if(value instanceof Date || isDate(value)) {
-        index = serializeDate(buffer, key, value, index);
-      } else if(value === undefined && ignoreUndefined == true) {
-      } else if(value === null || value === undefined) {
-        index = serializeUndefined(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'ObjectID') {
-        index = serializeObjectId(buffer, key, value, index);
-      } else if(Buffer.isBuffer(value)) {
-        index = serializeBuffer(buffer, key, value, index);
-      } else if(value instanceof RegExp || isRegExp(value)) {
-        index = serializeRegExp(buffer, key, value, index);
-      } else if(type == 'object' && value['_bsontype'] == null) {
-        index = serializeObject(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined);
-      } else if(type == 'object' && value['_bsontype'] == 'Decimal128') {
-        index = serializeDecimal128(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Long' || value['_bsontype'] == 'Timestamp') {
-        index = serializeLong(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Double') {
-        index = serializeDouble(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Code') {
-        index = serializeCode(buffer, key, value, index, checkKeys, depth, serializeFunctions, ignoreUndefined);
-      } else if(typeof value == 'function' && serializeFunctions) {
-        index = serializeFunction(buffer, key, value, index, checkKeys, depth, serializeFunctions);
-      } else if(value['_bsontype'] == 'Binary') {
-        index = serializeBinary(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'Symbol') {
-        index = serializeSymbol(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'DBRef') {
-        index = serializeDBRef(buffer, key, value, index, depth, serializeFunctions);
-      } else if(value['_bsontype'] == 'BSONRegExp') {
-        index = serializeBSONRegExp(buffer, key, value, index);
-      } else if(value['_bsontype'] == 'MinKey' || value['_bsontype'] == 'MaxKey') {
-        index = serializeMinMax(buffer, key, value, index);
-      }
-    }
-  }
-
-  // Final padding byte for object
-  buffer[index++] = 0x00;
-
-  // Final size
-  var size = index - startingIndex;
-  // Write the size of the object
-  buffer[startingIndex++] = size & 0xff;
-  buffer[startingIndex++] = (size >> 8) & 0xff;
-  buffer[startingIndex++] = (size >> 16) & 0xff;
-  buffer[startingIndex++] = (size >> 24) & 0xff;
-  return index;
-}
-
-var BSON = {};
-
-/**
- * Contains the function cache if we have that enable to allow for avoiding the eval step on each deserialization, comparison is by md5
- *
- * @ignore
- * @api private
- */
-var functionCache = BSON.functionCache = {};
-
-/**
- * Number BSON Type
- *
- * @classconstant BSON_DATA_NUMBER
- **/
-BSON.BSON_DATA_NUMBER = 1;
-/**
- * String BSON Type
- *
- * @classconstant BSON_DATA_STRING
- **/
-BSON.BSON_DATA_STRING = 2;
-/**
- * Object BSON Type
- *
- * @classconstant BSON_DATA_OBJECT
- **/
-BSON.BSON_DATA_OBJECT = 3;
-/**
- * Array BSON Type
- *
- * @classconstant BSON_DATA_ARRAY
- **/
-BSON.BSON_DATA_ARRAY = 4;
-/**
- * Binary BSON Type
- *
- * @classconstant BSON_DATA_BINARY
- **/
-BSON.BSON_DATA_BINARY = 5;
-/**
- * ObjectID BSON Type, deprecated
- *
- * @classconstant BSON_DATA_UNDEFINED
- **/
-BSON.BSON_DATA_UNDEFINED = 6;
-/**
- * ObjectID BSON Type
- *
- * @classconstant BSON_DATA_OID
- **/
-BSON.BSON_DATA_OID = 7;
-/**
- * Boolean BSON Type
- *
- * @classconstant BSON_DATA_BOOLEAN
- **/
-BSON.BSON_DATA_BOOLEAN = 8;
-/**
- * Date BSON Type
- *
- * @classconstant BSON_DATA_DATE
- **/
-BSON.BSON_DATA_DATE = 9;
-/**
- * null BSON Type
- *
- * @classconstant BSON_DATA_NULL
- **/
-BSON.BSON_DATA_NULL = 10;
-/**
- * RegExp BSON Type
- *
- * @classconstant BSON_DATA_REGEXP
- **/
-BSON.BSON_DATA_REGEXP = 11;
-/**
- * Code BSON Type
- *
- * @classconstant BSON_DATA_CODE
- **/
-BSON.BSON_DATA_CODE = 13;
-/**
- * Symbol BSON Type
- *
- * @classconstant BSON_DATA_SYMBOL
- **/
-BSON.BSON_DATA_SYMBOL = 14;
-/**
- * Code with Scope BSON Type
- *
- * @classconstant BSON_DATA_CODE_W_SCOPE
- **/
-BSON.BSON_DATA_CODE_W_SCOPE = 15;
-/**
- * 32 bit Integer BSON Type
- *
- * @classconstant BSON_DATA_INT
- **/
-BSON.BSON_DATA_INT = 16;
-/**
- * Timestamp BSON Type
- *
- * @classconstant BSON_DATA_TIMESTAMP
- **/
-BSON.BSON_DATA_TIMESTAMP = 17;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_LONG
- **/
-BSON.BSON_DATA_LONG = 18;
-/**
- * Long BSON Type
- *
- * @classconstant BSON_DATA_DECIMAL128
- **/
-BSON.BSON_DATA_DECIMAL128 = 19;
-/**
- * MinKey BSON Type
- *
- * @classconstant BSON_DATA_MIN_KEY
- **/
-BSON.BSON_DATA_MIN_KEY = 0xff;
-/**
- * MaxKey BSON Type
- *
- * @classconstant BSON_DATA_MAX_KEY
- **/
-BSON.BSON_DATA_MAX_KEY = 0x7f;
-/**
- * Binary Default Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_DEFAULT
- **/
-BSON.BSON_BINARY_SUBTYPE_DEFAULT = 0;
-/**
- * Binary Function Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_FUNCTION
- **/
-BSON.BSON_BINARY_SUBTYPE_FUNCTION = 1;
-/**
- * Binary Byte Array Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_BYTE_ARRAY
- **/
-BSON.BSON_BINARY_SUBTYPE_BYTE_ARRAY = 2;
-/**
- * Binary UUID Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_UUID
- **/
-BSON.BSON_BINARY_SUBTYPE_UUID = 3;
-/**
- * Binary MD5 Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_MD5
- **/
-BSON.BSON_BINARY_SUBTYPE_MD5 = 4;
-/**
- * Binary User Defined Type
- *
- * @classconstant BSON_BINARY_SUBTYPE_USER_DEFINED
- **/
-BSON.BSON_BINARY_SUBTYPE_USER_DEFINED = 128;
-
-// BSON MAX VALUES
-BSON.BSON_INT32_MAX = 0x7FFFFFFF;
-BSON.BSON_INT32_MIN = -0x80000000;
-
-BSON.BSON_INT64_MAX = Math.pow(2, 63) - 1;
-BSON.BSON_INT64_MIN = -Math.pow(2, 63);
-
-// JS MAX PRECISE VALUES
-BSON.JS_INT_MAX = 0x20000000000000;  // Any integer up to 2^53 can be precisely represented by a double.
-BSON.JS_INT_MIN = -0x20000000000000;  // Any integer down to -2^53 can be precisely represented by a double.
-
-// Internal long versions
-var JS_INT_MAX_LONG = Long.fromNumber(0x20000000000000);  // Any integer up to 2^53 can be precisely represented by a double.
-var JS_INT_MIN_LONG = Long.fromNumber(-0x20000000000000);  // Any integer down to -2^53 can be precisely represented by a double.
-
-module.exports = serializeInto;
diff --git a/node_modules/bson/lib/bson/regexp.js b/node_modules/bson/lib/bson/regexp.js
deleted file mode 100644
index 6b148b2..0000000
--- a/node_modules/bson/lib/bson/regexp.js
+++ /dev/null
@@ -1,30 +0,0 @@
-/**
- * A class representation of the BSON RegExp type.
- *
- * @class
- * @return {BSONRegExp} A MinKey instance
- */
-function BSONRegExp(pattern, options) {
-  if(!(this instanceof BSONRegExp)) return new BSONRegExp();
-  
-  // Execute
-  this._bsontype = 'BSONRegExp';
-  this.pattern = pattern;
-  this.options = options;
-
-  // Validate options
-  for(var i = 0; i < options.length; i++) {
-    if(!(this.options[i] == 'i' 
-      || this.options[i] == 'm'
-      || this.options[i] == 'x'
-      || this.options[i] == 'l'
-      || this.options[i] == 's'
-      || this.options[i] == 'u'
-    )) {
-      throw new Error('the regular expression options [' + this.options[i] + "] is not supported");
-    }
-  }
-}
-
-module.exports = BSONRegExp;
-module.exports.BSONRegExp = BSONRegExp;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/symbol.js b/node_modules/bson/lib/bson/symbol.js
deleted file mode 100644
index 7681a4d..0000000
--- a/node_modules/bson/lib/bson/symbol.js
+++ /dev/null
@@ -1,47 +0,0 @@
-/**
- * A class representation of the BSON Symbol type.
- *
- * @class
- * @deprecated
- * @param {string} value the string representing the symbol.
- * @return {Symbol}
- */
-function Symbol(value) {
-  if(!(this instanceof Symbol)) return new Symbol(value);
-  this._bsontype = 'Symbol';
-  this.value = value;
-}
-
-/**
- * Access the wrapped string value.
- *
- * @method
- * @return {String} returns the wrapped string.
- */
-Symbol.prototype.valueOf = function() {
-  return this.value;
-};
-
-/**
- * @ignore
- */
-Symbol.prototype.toString = function() {
-  return this.value;
-}
-
-/**
- * @ignore
- */
-Symbol.prototype.inspect = function() {
-  return this.value;
-}
-
-/**
- * @ignore
- */
-Symbol.prototype.toJSON = function() {
-  return this.value;
-}
-
-module.exports = Symbol;
-module.exports.Symbol = Symbol;
\ No newline at end of file
diff --git a/node_modules/bson/lib/bson/timestamp.js b/node_modules/bson/lib/bson/timestamp.js
deleted file mode 100644
index 7718caf..0000000
--- a/node_modules/bson/lib/bson/timestamp.js
+++ /dev/null
@@ -1,856 +0,0 @@
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//
-// Copyright 2009 Google Inc. All Rights Reserved
-
-/**
- * This type is for INTERNAL use in MongoDB only and should not be used in applications.
- * The appropriate corresponding type is the JavaScript Date type.
- * 
- * Defines a Timestamp class for representing a 64-bit two's-complement
- * integer value, which faithfully simulates the behavior of a Java "Timestamp". This
- * implementation is derived from TimestampLib in GWT.
- *
- * Constructs a 64-bit two's-complement integer, given its low and high 32-bit
- * values as *signed* integers.  See the from* functions below for more
- * convenient ways of constructing Timestamps.
- *
- * The internal representation of a Timestamp is the two given signed, 32-bit values.
- * We use 32-bit pieces because these are the size of integers on which
- * Javascript performs bit-operations.  For operations like addition and
- * multiplication, we split each number into 16-bit pieces, which can easily be
- * multiplied within Javascript's floating-point representation without overflow
- * or change in sign.
- *
- * In the algorithms below, we frequently reduce the negative case to the
- * positive case by negating the input(s) and then post-processing the result.
- * Note that we must ALWAYS check specially whether those values are MIN_VALUE
- * (-2^63) because -MIN_VALUE == MIN_VALUE (since 2^63 cannot be represented as
- * a positive number, it overflows back into a negative).  Not handling this
- * case would often result in infinite recursion.
- *
- * @class
- * @param {number} low  the low (signed) 32 bits of the Timestamp.
- * @param {number} high the high (signed) 32 bits of the Timestamp.
- */
-function Timestamp(low, high) {
-  if(!(this instanceof Timestamp)) return new Timestamp(low, high);
-  this._bsontype = 'Timestamp';
-  /**
-   * @type {number}
-   * @ignore
-   */
-  this.low_ = low | 0;  // force into 32 signed bits.
-
-  /**
-   * @type {number}
-   * @ignore
-   */
-  this.high_ = high | 0;  // force into 32 signed bits.
-};
-
-/**
- * Return the int value.
- *
- * @return {number} the value, assuming it is a 32-bit integer.
- */
-Timestamp.prototype.toInt = function() {
-  return this.low_;
-};
-
-/**
- * Return the Number value.
- *
- * @method
- * @return {number} the closest floating-point representation to this value.
- */
-Timestamp.prototype.toNumber = function() {
-  return this.high_ * Timestamp.TWO_PWR_32_DBL_ +
-         this.getLowBitsUnsigned();
-};
-
-/**
- * Return the JSON value.
- *
- * @method
- * @return {string} the JSON representation.
- */
-Timestamp.prototype.toJSON = function() {
-  return this.toString();
-}
-
-/**
- * Return the String value.
- *
- * @method
- * @param {number} [opt_radix] the radix in which the text should be written.
- * @return {string} the textual representation of this value.
- */
-Timestamp.prototype.toString = function(opt_radix) {
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (this.isZero()) {
-    return '0';
-  }
-
-  if (this.isNegative()) {
-    if (this.equals(Timestamp.MIN_VALUE)) {
-      // We need to change the Timestamp value before it can be negated, so we remove
-      // the bottom-most digit in this base and then recurse to do the rest.
-      var radixTimestamp = Timestamp.fromNumber(radix);
-      var div = this.div(radixTimestamp);
-      var rem = div.multiply(radixTimestamp).subtract(this);
-      return div.toString(radix) + rem.toInt().toString(radix);
-    } else {
-      return '-' + this.negate().toString(radix);
-    }
-  }
-
-  // Do several (6) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 6));
-
-  var rem = this;
-  var result = '';
-  while (true) {
-    var remDiv = rem.div(radixToPower);
-    var intval = rem.subtract(remDiv.multiply(radixToPower)).toInt();
-    var digits = intval.toString(radix);
-
-    rem = remDiv;
-    if (rem.isZero()) {
-      return digits + result;
-    } else {
-      while (digits.length < 6) {
-        digits = '0' + digits;
-      }
-      result = '' + digits + result;
-    }
-  }
-};
-
-/**
- * Return the high 32-bits value.
- *
- * @method
- * @return {number} the high 32-bits as a signed value.
- */
-Timestamp.prototype.getHighBits = function() {
-  return this.high_;
-};
-
-/**
- * Return the low 32-bits value.
- *
- * @method
- * @return {number} the low 32-bits as a signed value.
- */
-Timestamp.prototype.getLowBits = function() {
-  return this.low_;
-};
-
-/**
- * Return the low unsigned 32-bits value.
- *
- * @method
- * @return {number} the low 32-bits as an unsigned value.
- */
-Timestamp.prototype.getLowBitsUnsigned = function() {
-  return (this.low_ >= 0) ?
-      this.low_ : Timestamp.TWO_PWR_32_DBL_ + this.low_;
-};
-
-/**
- * Returns the number of bits needed to represent the absolute value of this Timestamp.
- *
- * @method
- * @return {number} Returns the number of bits needed to represent the absolute value of this Timestamp.
- */
-Timestamp.prototype.getNumBitsAbs = function() {
-  if (this.isNegative()) {
-    if (this.equals(Timestamp.MIN_VALUE)) {
-      return 64;
-    } else {
-      return this.negate().getNumBitsAbs();
-    }
-  } else {
-    var val = this.high_ != 0 ? this.high_ : this.low_;
-    for (var bit = 31; bit > 0; bit--) {
-      if ((val & (1 << bit)) != 0) {
-        break;
-      }
-    }
-    return this.high_ != 0 ? bit + 33 : bit + 1;
-  }
-};
-
-/**
- * Return whether this value is zero.
- *
- * @method
- * @return {boolean} whether this value is zero.
- */
-Timestamp.prototype.isZero = function() {
-  return this.high_ == 0 && this.low_ == 0;
-};
-
-/**
- * Return whether this value is negative.
- *
- * @method
- * @return {boolean} whether this value is negative.
- */
-Timestamp.prototype.isNegative = function() {
-  return this.high_ < 0;
-};
-
-/**
- * Return whether this value is odd.
- *
- * @method
- * @return {boolean} whether this value is odd.
- */
-Timestamp.prototype.isOdd = function() {
-  return (this.low_ & 1) == 1;
-};
-
-/**
- * Return whether this Timestamp equals the other
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} whether this Timestamp equals the other
- */
-Timestamp.prototype.equals = function(other) {
-  return (this.high_ == other.high_) && (this.low_ == other.low_);
-};
-
-/**
- * Return whether this Timestamp does not equal the other.
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} whether this Timestamp does not equal the other.
- */
-Timestamp.prototype.notEquals = function(other) {
-  return (this.high_ != other.high_) || (this.low_ != other.low_);
-};
-
-/**
- * Return whether this Timestamp is less than the other.
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} whether this Timestamp is less than the other.
- */
-Timestamp.prototype.lessThan = function(other) {
-  return this.compare(other) < 0;
-};
-
-/**
- * Return whether this Timestamp is less than or equal to the other.
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} whether this Timestamp is less than or equal to the other.
- */
-Timestamp.prototype.lessThanOrEqual = function(other) {
-  return this.compare(other) <= 0;
-};
-
-/**
- * Return whether this Timestamp is greater than the other.
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} whether this Timestamp is greater than the other.
- */
-Timestamp.prototype.greaterThan = function(other) {
-  return this.compare(other) > 0;
-};
-
-/**
- * Return whether this Timestamp is greater than or equal to the other.
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} whether this Timestamp is greater than or equal to the other.
- */
-Timestamp.prototype.greaterThanOrEqual = function(other) {
-  return this.compare(other) >= 0;
-};
-
-/**
- * Compares this Timestamp with the given one.
- *
- * @method
- * @param {Timestamp} other Timestamp to compare against.
- * @return {boolean} 0 if they are the same, 1 if the this is greater, and -1 if the given one is greater.
- */
-Timestamp.prototype.compare = function(other) {
-  if (this.equals(other)) {
-    return 0;
-  }
-
-  var thisNeg = this.isNegative();
-  var otherNeg = other.isNegative();
-  if (thisNeg && !otherNeg) {
-    return -1;
-  }
-  if (!thisNeg && otherNeg) {
-    return 1;
-  }
-
-  // at this point, the signs are the same, so subtraction will not overflow
-  if (this.subtract(other).isNegative()) {
-    return -1;
-  } else {
-    return 1;
-  }
-};
-
-/**
- * The negation of this value.
- *
- * @method
- * @return {Timestamp} the negation of this value.
- */
-Timestamp.prototype.negate = function() {
-  if (this.equals(Timestamp.MIN_VALUE)) {
-    return Timestamp.MIN_VALUE;
-  } else {
-    return this.not().add(Timestamp.ONE);
-  }
-};
-
-/**
- * Returns the sum of this and the given Timestamp.
- *
- * @method
- * @param {Timestamp} other Timestamp to add to this one.
- * @return {Timestamp} the sum of this and the given Timestamp.
- */
-Timestamp.prototype.add = function(other) {
-  // Divide each number into 4 chunks of 16 bits, and then sum the chunks.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 + b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 + b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 + b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 + b48;
-  c48 &= 0xFFFF;
-  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns the difference of this and the given Timestamp.
- *
- * @method
- * @param {Timestamp} other Timestamp to subtract from this.
- * @return {Timestamp} the difference of this and the given Timestamp.
- */
-Timestamp.prototype.subtract = function(other) {
-  return this.add(other.negate());
-};
-
-/**
- * Returns the product of this and the given Timestamp.
- *
- * @method
- * @param {Timestamp} other Timestamp to multiply with this.
- * @return {Timestamp} the product of this and the other.
- */
-Timestamp.prototype.multiply = function(other) {
-  if (this.isZero()) {
-    return Timestamp.ZERO;
-  } else if (other.isZero()) {
-    return Timestamp.ZERO;
-  }
-
-  if (this.equals(Timestamp.MIN_VALUE)) {
-    return other.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
-  } else if (other.equals(Timestamp.MIN_VALUE)) {
-    return this.isOdd() ? Timestamp.MIN_VALUE : Timestamp.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().multiply(other.negate());
-    } else {
-      return this.negate().multiply(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.multiply(other.negate()).negate();
-  }
-
-  // If both Timestamps are small, use float multiplication
-  if (this.lessThan(Timestamp.TWO_PWR_24_) &&
-      other.lessThan(Timestamp.TWO_PWR_24_)) {
-    return Timestamp.fromNumber(this.toNumber() * other.toNumber());
-  }
-
-  // Divide each Timestamp into 4 chunks of 16 bits, and then add up 4x4 products.
-  // We can skip products that would overflow.
-
-  var a48 = this.high_ >>> 16;
-  var a32 = this.high_ & 0xFFFF;
-  var a16 = this.low_ >>> 16;
-  var a00 = this.low_ & 0xFFFF;
-
-  var b48 = other.high_ >>> 16;
-  var b32 = other.high_ & 0xFFFF;
-  var b16 = other.low_ >>> 16;
-  var b00 = other.low_ & 0xFFFF;
-
-  var c48 = 0, c32 = 0, c16 = 0, c00 = 0;
-  c00 += a00 * b00;
-  c16 += c00 >>> 16;
-  c00 &= 0xFFFF;
-  c16 += a16 * b00;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c16 += a00 * b16;
-  c32 += c16 >>> 16;
-  c16 &= 0xFFFF;
-  c32 += a32 * b00;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a16 * b16;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c32 += a00 * b32;
-  c48 += c32 >>> 16;
-  c32 &= 0xFFFF;
-  c48 += a48 * b00 + a32 * b16 + a16 * b32 + a00 * b48;
-  c48 &= 0xFFFF;
-  return Timestamp.fromBits((c16 << 16) | c00, (c48 << 16) | c32);
-};
-
-/**
- * Returns this Timestamp divided by the given one.
- *
- * @method
- * @param {Timestamp} other Timestamp by which to divide.
- * @return {Timestamp} this Timestamp divided by the given one.
- */
-Timestamp.prototype.div = function(other) {
-  if (other.isZero()) {
-    throw Error('division by zero');
-  } else if (this.isZero()) {
-    return Timestamp.ZERO;
-  }
-
-  if (this.equals(Timestamp.MIN_VALUE)) {
-    if (other.equals(Timestamp.ONE) ||
-        other.equals(Timestamp.NEG_ONE)) {
-      return Timestamp.MIN_VALUE;  // recall that -MIN_VALUE == MIN_VALUE
-    } else if (other.equals(Timestamp.MIN_VALUE)) {
-      return Timestamp.ONE;
-    } else {
-      // At this point, we have |other| >= 2, so |this/other| < |MIN_VALUE|.
-      var halfThis = this.shiftRight(1);
-      var approx = halfThis.div(other).shiftLeft(1);
-      if (approx.equals(Timestamp.ZERO)) {
-        return other.isNegative() ? Timestamp.ONE : Timestamp.NEG_ONE;
-      } else {
-        var rem = this.subtract(other.multiply(approx));
-        var result = approx.add(rem.div(other));
-        return result;
-      }
-    }
-  } else if (other.equals(Timestamp.MIN_VALUE)) {
-    return Timestamp.ZERO;
-  }
-
-  if (this.isNegative()) {
-    if (other.isNegative()) {
-      return this.negate().div(other.negate());
-    } else {
-      return this.negate().div(other).negate();
-    }
-  } else if (other.isNegative()) {
-    return this.div(other.negate()).negate();
-  }
-
-  // Repeat the following until the remainder is less than other:  find a
-  // floating-point that approximates remainder / other *from below*, add this
-  // into the result, and subtract it from the remainder.  It is critical that
-  // the approximate value is less than or equal to the real value so that the
-  // remainder never becomes negative.
-  var res = Timestamp.ZERO;
-  var rem = this;
-  while (rem.greaterThanOrEqual(other)) {
-    // Approximate the result of division. This may be a little greater or
-    // smaller than the actual value.
-    var approx = Math.max(1, Math.floor(rem.toNumber() / other.toNumber()));
-
-    // We will tweak the approximate result by changing it in the 48-th digit or
-    // the smallest non-fractional digit, whichever is larger.
-    var log2 = Math.ceil(Math.log(approx) / Math.LN2);
-    var delta = (log2 <= 48) ? 1 : Math.pow(2, log2 - 48);
-
-    // Decrease the approximation until it is smaller than the remainder.  Note
-    // that if it is too large, the product overflows and is negative.
-    var approxRes = Timestamp.fromNumber(approx);
-    var approxRem = approxRes.multiply(other);
-    while (approxRem.isNegative() || approxRem.greaterThan(rem)) {
-      approx -= delta;
-      approxRes = Timestamp.fromNumber(approx);
-      approxRem = approxRes.multiply(other);
-    }
-
-    // We know the answer can't be zero... and actually, zero would cause
-    // infinite recursion since we would make no progress.
-    if (approxRes.isZero()) {
-      approxRes = Timestamp.ONE;
-    }
-
-    res = res.add(approxRes);
-    rem = rem.subtract(approxRem);
-  }
-  return res;
-};
-
-/**
- * Returns this Timestamp modulo the given one.
- *
- * @method
- * @param {Timestamp} other Timestamp by which to mod.
- * @return {Timestamp} this Timestamp modulo the given one.
- */
-Timestamp.prototype.modulo = function(other) {
-  return this.subtract(this.div(other).multiply(other));
-};
-
-/**
- * The bitwise-NOT of this value.
- *
- * @method
- * @return {Timestamp} the bitwise-NOT of this value.
- */
-Timestamp.prototype.not = function() {
-  return Timestamp.fromBits(~this.low_, ~this.high_);
-};
-
-/**
- * Returns the bitwise-AND of this Timestamp and the given one.
- *
- * @method
- * @param {Timestamp} other the Timestamp with which to AND.
- * @return {Timestamp} the bitwise-AND of this and the other.
- */
-Timestamp.prototype.and = function(other) {
-  return Timestamp.fromBits(this.low_ & other.low_, this.high_ & other.high_);
-};
-
-/**
- * Returns the bitwise-OR of this Timestamp and the given one.
- *
- * @method
- * @param {Timestamp} other the Timestamp with which to OR.
- * @return {Timestamp} the bitwise-OR of this and the other.
- */
-Timestamp.prototype.or = function(other) {
-  return Timestamp.fromBits(this.low_ | other.low_, this.high_ | other.high_);
-};
-
-/**
- * Returns the bitwise-XOR of this Timestamp and the given one.
- *
- * @method
- * @param {Timestamp} other the Timestamp with which to XOR.
- * @return {Timestamp} the bitwise-XOR of this and the other.
- */
-Timestamp.prototype.xor = function(other) {
-  return Timestamp.fromBits(this.low_ ^ other.low_, this.high_ ^ other.high_);
-};
-
-/**
- * Returns this Timestamp with bits shifted to the left by the given amount.
- *
- * @method
- * @param {number} numBits the number of bits by which to shift.
- * @return {Timestamp} this shifted to the left by the given amount.
- */
-Timestamp.prototype.shiftLeft = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var low = this.low_;
-    if (numBits < 32) {
-      var high = this.high_;
-      return Timestamp.fromBits(
-                 low << numBits,
-                 (high << numBits) | (low >>> (32 - numBits)));
-    } else {
-      return Timestamp.fromBits(0, low << (numBits - 32));
-    }
-  }
-};
-
-/**
- * Returns this Timestamp with bits shifted to the right by the given amount.
- *
- * @method
- * @param {number} numBits the number of bits by which to shift.
- * @return {Timestamp} this shifted to the right by the given amount.
- */
-Timestamp.prototype.shiftRight = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Timestamp.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >> numBits);
-    } else {
-      return Timestamp.fromBits(
-                 high >> (numBits - 32),
-                 high >= 0 ? 0 : -1);
-    }
-  }
-};
-
-/**
- * Returns this Timestamp with bits shifted to the right by the given amount, with the new top bits matching the current sign bit.
- *
- * @method
- * @param {number} numBits the number of bits by which to shift.
- * @return {Timestamp} this shifted to the right by the given amount, with zeros placed into the new leading bits.
- */
-Timestamp.prototype.shiftRightUnsigned = function(numBits) {
-  numBits &= 63;
-  if (numBits == 0) {
-    return this;
-  } else {
-    var high = this.high_;
-    if (numBits < 32) {
-      var low = this.low_;
-      return Timestamp.fromBits(
-                 (low >>> numBits) | (high << (32 - numBits)),
-                 high >>> numBits);
-    } else if (numBits == 32) {
-      return Timestamp.fromBits(high, 0);
-    } else {
-      return Timestamp.fromBits(high >>> (numBits - 32), 0);
-    }
-  }
-};
-
-/**
- * Returns a Timestamp representing the given (32-bit) integer value.
- *
- * @method
- * @param {number} value the 32-bit integer in question.
- * @return {Timestamp} the corresponding Timestamp value.
- */
-Timestamp.fromInt = function(value) {
-  if (-128 <= value && value < 128) {
-    var cachedObj = Timestamp.INT_CACHE_[value];
-    if (cachedObj) {
-      return cachedObj;
-    }
-  }
-
-  var obj = new Timestamp(value | 0, value < 0 ? -1 : 0);
-  if (-128 <= value && value < 128) {
-    Timestamp.INT_CACHE_[value] = obj;
-  }
-  return obj;
-};
-
-/**
- * Returns a Timestamp representing the given value, provided that it is a finite number. Otherwise, zero is returned.
- *
- * @method
- * @param {number} value the number in question.
- * @return {Timestamp} the corresponding Timestamp value.
- */
-Timestamp.fromNumber = function(value) {
-  if (isNaN(value) || !isFinite(value)) {
-    return Timestamp.ZERO;
-  } else if (value <= -Timestamp.TWO_PWR_63_DBL_) {
-    return Timestamp.MIN_VALUE;
-  } else if (value + 1 >= Timestamp.TWO_PWR_63_DBL_) {
-    return Timestamp.MAX_VALUE;
-  } else if (value < 0) {
-    return Timestamp.fromNumber(-value).negate();
-  } else {
-    return new Timestamp(
-               (value % Timestamp.TWO_PWR_32_DBL_) | 0,
-               (value / Timestamp.TWO_PWR_32_DBL_) | 0);
-  }
-};
-
-/**
- * Returns a Timestamp representing the 64-bit integer that comes by concatenating the given high and low bits. Each is assumed to use 32 bits.
- *
- * @method
- * @param {number} lowBits the low 32-bits.
- * @param {number} highBits the high 32-bits.
- * @return {Timestamp} the corresponding Timestamp value.
- */
-Timestamp.fromBits = function(lowBits, highBits) {
-  return new Timestamp(lowBits, highBits);
-};
-
-/**
- * Returns a Timestamp representation of the given string, written using the given radix.
- *
- * @method
- * @param {string} str the textual representation of the Timestamp.
- * @param {number} opt_radix the radix in which the text is written.
- * @return {Timestamp} the corresponding Timestamp value.
- */
-Timestamp.fromString = function(str, opt_radix) {
-  if (str.length == 0) {
-    throw Error('number format error: empty string');
-  }
-
-  var radix = opt_radix || 10;
-  if (radix < 2 || 36 < radix) {
-    throw Error('radix out of range: ' + radix);
-  }
-
-  if (str.charAt(0) == '-') {
-    return Timestamp.fromString(str.substring(1), radix).negate();
-  } else if (str.indexOf('-') >= 0) {
-    throw Error('number format error: interior "-" character: ' + str);
-  }
-
-  // Do several (8) digits each time through the loop, so as to
-  // minimize the calls to the very expensive emulated div.
-  var radixToPower = Timestamp.fromNumber(Math.pow(radix, 8));
-
-  var result = Timestamp.ZERO;
-  for (var i = 0; i < str.length; i += 8) {
-    var size = Math.min(8, str.length - i);
-    var value = parseInt(str.substring(i, i + size), radix);
-    if (size < 8) {
-      var power = Timestamp.fromNumber(Math.pow(radix, size));
-      result = result.multiply(power).add(Timestamp.fromNumber(value));
-    } else {
-      result = result.multiply(radixToPower);
-      result = result.add(Timestamp.fromNumber(value));
-    }
-  }
-  return result;
-};
-
-// NOTE: Common constant values ZERO, ONE, NEG_ONE, etc. are defined below the
-// from* methods on which they depend.
-
-
-/**
- * A cache of the Timestamp representations of small integer values.
- * @type {Object}
- * @ignore
- */
-Timestamp.INT_CACHE_ = {};
-
-// NOTE: the compiler should inline these constant values below and then remove
-// these variables, so there should be no runtime penalty for these.
-
-/**
- * Number used repeated below in calculations.  This must appear before the
- * first call to any from* function below.
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_16_DBL_ = 1 << 16;
-
-/**
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_24_DBL_ = 1 << 24;
-
-/**
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_32_DBL_ = Timestamp.TWO_PWR_16_DBL_ * Timestamp.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_31_DBL_ = Timestamp.TWO_PWR_32_DBL_ / 2;
-
-/**
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_48_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_16_DBL_;
-
-/**
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_64_DBL_ = Timestamp.TWO_PWR_32_DBL_ * Timestamp.TWO_PWR_32_DBL_;
-
-/**
- * @type {number}
- * @ignore
- */
-Timestamp.TWO_PWR_63_DBL_ = Timestamp.TWO_PWR_64_DBL_ / 2;
-
-/** @type {Timestamp} */
-Timestamp.ZERO = Timestamp.fromInt(0);
-
-/** @type {Timestamp} */
-Timestamp.ONE = Timestamp.fromInt(1);
-
-/** @type {Timestamp} */
-Timestamp.NEG_ONE = Timestamp.fromInt(-1);
-
-/** @type {Timestamp} */
-Timestamp.MAX_VALUE =
-    Timestamp.fromBits(0xFFFFFFFF | 0, 0x7FFFFFFF | 0);
-
-/** @type {Timestamp} */
-Timestamp.MIN_VALUE = Timestamp.fromBits(0, 0x80000000 | 0);
-
-/**
- * @type {Timestamp}
- * @ignore
- */
-Timestamp.TWO_PWR_24_ = Timestamp.fromInt(1 << 24);
-
-/**
- * Expose.
- */
-module.exports = Timestamp;
-module.exports.Timestamp = Timestamp;
\ No newline at end of file
diff --git a/node_modules/bson/package.json b/node_modules/bson/package.json
deleted file mode 100644
index 3e0660f..0000000
--- a/node_modules/bson/package.json
+++ /dev/null
@@ -1,115 +0,0 @@
-{
-  "_args": [
-    [
-      {
-        "name": "bson",
-        "raw": "bson@~0.5.1",
-        "rawSpec": "~0.5.1",
-        "scope": null,
-        "spec": ">=0.5.1 <0.6.0",
-        "type": "range"
-      },
-      "/Users/warefhaque/CSC309/solutions_repo/node_modules/mongodb-core"
-    ]
-  ],
-  "_from": "bson@>=0.5.1 <0.6.0",
-  "_id": "bson@0.5.2",
-  "_inCache": true,
-  "_installable": true,
-  "_location": "/bson",
-  "_nodeVersion": "4.4.4",
-  "_npmOperationalInternal": {
-    "host": "packages-12-west.internal.npmjs.com",
-    "tmp": "tmp/bson-0.5.2.tgz_1468236520063_0.9097728193737566"
-  },
-  "_npmUser": {
-    "email": "christkv@gmail.com",
-    "name": "christkv"
-  },
-  "_npmVersion": "2.15.1",
-  "_phantomChildren": {},
-  "_requested": {
-    "name": "bson",
-    "raw": "bson@~0.5.1",
-    "rawSpec": "~0.5.1",
-    "scope": null,
-    "spec": ">=0.5.1 <0.6.0",
-    "type": "range"
-  },
-  "_requiredBy": [
-    "/mongodb-core"
-  ],
-  "_resolved": "https://registry.npmjs.org/bson/-/bson-0.5.2.tgz",
-  "_shasum": "ff0fbbf90a99eee06bf33c42edf73e51690fbebd",
-  "_shrinkwrap": null,
-  "_spec": "bson@~0.5.1",
-  "_where": "/Users/warefhaque/CSC309/solutions_repo/node_modules/mongodb-core",
-  "author": {
-    "email": "christkv@gmail.com",
-    "name": "Christian Amor Kvalheim"
-  },
-  "browser": "lib/bson/bson.js",
-  "bugs": {
-    "url": "https://github.com/mongodb/js-bson/issues"
-  },
-  "config": {
-    "native": false
-  },
-  "contributors": [],
-  "dependencies": {},
-  "description": "A bson parser for node.js and the browser",
-  "devDependencies": {
-    "benchmark": "1.0.0",
-    "colors": "1.1.0",
-    "gleak": "0.2.3",
-    "nodeunit": "0.9.0"
-  },
-  "directories": {
-    "lib": "./lib/bson"
-  },
-  "dist": {
-    "shasum": "ff0fbbf90a99eee06bf33c42edf73e51690fbebd",
-    "tarball": "https://registry.npmjs.org/bson/-/bson-0.5.2.tgz"
-  },
-  "engines": {
-    "node": ">=0.6.19"
-  },
-  "files": [
-    "lib",
-    "browser_build",
-    "alternate_parsers",
-    "bower.json",
-    "tools",
-    "deserializer_bak.js"
-  ],
-  "gitHead": "afc468f7119c8dcea19e82984ace3eaa9214134f",
-  "homepage": "https://github.com/mongodb/js-bson",
-  "keywords": [
-    "mongodb",
-    "bson",
-    "parser"
-  ],
-  "license": "Apache-2.0",
-  "main": "./lib/bson/index",
-  "maintainers": [
-    {
-      "email": "chinsay@gmail.com",
-      "name": "octave"
-    },
-    {
-      "email": "christkv@gmail.com",
-      "name": "christkv"
-    }
-  ],
-  "name": "bson",
-  "optionalDependencies": {},
-  "readme": "ERROR: No README data found!",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/mongodb/js-bson.git"
-  },
-  "scripts": {
-    "test": "nodeunit ./test/node"
-  },
-  "version": "0.5.2"
-}
diff --git a/node_modules/bson/tools/gleak.js b/node_modules/bson/tools/gleak.js
deleted file mode 100644
index c707cfc..0000000
--- a/node_modules/bson/tools/gleak.js
+++ /dev/null
@@ -1,21 +0,0 @@
-
-var gleak = require('gleak')();
-gleak.ignore('AssertionError');
-gleak.ignore('testFullSpec_param_found');
-gleak.ignore('events');
-gleak.ignore('Uint8Array');
-gleak.ignore('Uint8ClampedArray');
-gleak.ignore('TAP_Global_Harness');
-gleak.ignore('setImmediate');
-gleak.ignore('clearImmediate');
-
-gleak.ignore('DTRACE_NET_SERVER_CONNECTION');
-gleak.ignore('DTRACE_NET_STREAM_END');
-gleak.ignore('DTRACE_NET_SOCKET_READ');
-gleak.ignore('DTRACE_NET_SOCKET_WRITE');
-gleak.ignore('DTRACE_HTTP_SERVER_REQUEST');
-gleak.ignore('DTRACE_HTTP_SERVER_RESPONSE');
-gleak.ignore('DTRACE_HTTP_CLIENT_REQUEST');
-gleak.ignore('DTRACE_HTTP_CLIENT_RESPONSE');
-
-module.exports = gleak;