Bump to v3.0.1.

This commit is contained in:
jdalton
2015-01-29 23:56:52 -08:00
committed by John-David Dalton
parent bb53dde973
commit 60b8329a73
490 changed files with 2148 additions and 2159 deletions

View File

@@ -1,5 +1,5 @@
Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
Based on Underscore.js 1.7.0, copyright 2009-2015 Jeremy Ashkenas,
Based on Underscore.js, copyright 2009-2015 Jeremy Ashkenas,
DocumentCloud and Investigative Reporters & Editors <http://underscorejs.org/>
Permission is hereby granted, free of charge, to any person obtaining

View File

@@ -1,4 +1,4 @@
# lodash._binaryindex v3.0.0
# lodash._binaryindex v3.0.1
The [modern build](https://github.com/lodash/lodash/wiki/Build-Differences) of [lodashs](https://lodash.com/) internal `binaryIndex` exported as a [Node.js](http://nodejs.org/)/[io.js](https://iojs.org/) module.
@@ -17,4 +17,4 @@ In Node.js/io.js:
var binaryIndex = require('lodash._binaryindex');
```
See the [package source](https://github.com/lodash/lodash/blob/3.0.0-npm-packages/lodash._binaryindex) for more details.
See the [package source](https://github.com/lodash/lodash/blob/3.0.1-npm-packages/lodash._binaryindex) for more details.

View File

@@ -1,15 +1,15 @@
/**
* lodash 3.0.0 (Custom Build) <https://lodash.com/>
* lodash 3.0.1 (Custom Build) <https://lodash.com/>
* Build: `lodash modern modularize exports="npm" -o ./`
* Copyright 2012-2015 The Dojo Foundation <http://dojofoundation.org/>
* Based on Underscore.js 1.7.0 <http://underscorejs.org/LICENSE>
* Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>
* Copyright 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
* Available under MIT license <https://lodash.com/license>
*/
var binaryIndexBy = require('lodash._binaryindexby');
/** Used as references for the maximum length and index of an array. */
var MAX_ARRAY_LENGTH = Math.pow(2, 32) - 1,
var MAX_ARRAY_LENGTH = 4294967295,
HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;
/**
@@ -32,7 +32,7 @@ function binaryIndex(array, value, retHighest) {
var mid = (low + high) >>> 1,
computed = array[mid];
if (retHighest ? (computed <= value) : (computed < value)) {
if ((retHighest ? (computed <= value) : (computed < value)) && computed !== null) {
low = mid + 1;
} else {
high = mid;

View File

@@ -1,6 +1,6 @@
{
"name": "lodash._binaryindex",
"version": "3.0.0",
"version": "3.0.1",
"description": "The modern build of lodashs internal `binaryIndex` as a module.",
"homepage": "https://lodash.com/",
"icon": "https://lodash.com/icon.svg",