dot.dot.dot.exampol
This commit is contained in:
commit
a0bc2d79de
406 changed files with 34577 additions and 0 deletions
4
node_modules/buffer-equal/.travis.yml
generated
vendored
Normal file
4
node_modules/buffer-equal/.travis.yml
generated
vendored
Normal file
|
@ -0,0 +1,4 @@
|
|||
language: node_js
|
||||
node_js:
|
||||
- 0.8
|
||||
- "0.10"
|
18
node_modules/buffer-equal/LICENSE
generated
vendored
Normal file
18
node_modules/buffer-equal/LICENSE
generated
vendored
Normal file
|
@ -0,0 +1,18 @@
|
|||
This software is released under the MIT license:
|
||||
|
||||
Permission is hereby granted, free of charge, to any person obtaining a copy of
|
||||
this software and associated documentation files (the "Software"), to deal in
|
||||
the Software without restriction, including without limitation the rights to
|
||||
use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||||
the Software, and to permit persons to whom the Software is furnished to do so,
|
||||
subject to the following conditions:
|
||||
|
||||
The above copyright notice and this permission notice shall be included in all
|
||||
copies or substantial portions of the Software.
|
||||
|
||||
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
||||
FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
|
||||
COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
||||
IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
||||
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
62
node_modules/buffer-equal/README.markdown
generated
vendored
Normal file
62
node_modules/buffer-equal/README.markdown
generated
vendored
Normal file
|
@ -0,0 +1,62 @@
|
|||
buffer-equal
|
||||
============
|
||||
|
||||
Return whether two buffers are equal.
|
||||
|
||||
[](http://travis-ci.org/substack/node-buffer-equal)
|
||||
|
||||
example
|
||||
=======
|
||||
|
||||
``` js
|
||||
var bufferEqual = require('buffer-equal');
|
||||
|
||||
console.dir(bufferEqual(
|
||||
new Buffer([253,254,255]),
|
||||
new Buffer([253,254,255])
|
||||
));
|
||||
console.dir(bufferEqual(
|
||||
new Buffer('abc'),
|
||||
new Buffer('abcd')
|
||||
));
|
||||
console.dir(bufferEqual(
|
||||
new Buffer('abc'),
|
||||
'abc'
|
||||
));
|
||||
```
|
||||
|
||||
output:
|
||||
|
||||
```
|
||||
true
|
||||
false
|
||||
undefined
|
||||
```
|
||||
|
||||
methods
|
||||
=======
|
||||
|
||||
``` js
|
||||
var bufferEqual = require('buffer-equal')
|
||||
```
|
||||
|
||||
bufferEqual(a, b)
|
||||
-----------------
|
||||
|
||||
Return whether the two buffers `a` and `b` are equal.
|
||||
|
||||
If `a` or `b` is not a buffer, return `undefined`.
|
||||
|
||||
install
|
||||
=======
|
||||
|
||||
With [npm](http://npmjs.org) do:
|
||||
|
||||
```
|
||||
npm install buffer-equal
|
||||
```
|
||||
|
||||
license
|
||||
=======
|
||||
|
||||
MIT
|
14
node_modules/buffer-equal/example/eq.js
generated
vendored
Normal file
14
node_modules/buffer-equal/example/eq.js
generated
vendored
Normal file
|
@ -0,0 +1,14 @@
|
|||
var bufferEqual = require('../');
|
||||
|
||||
console.dir(bufferEqual(
|
||||
new Buffer([253,254,255]),
|
||||
new Buffer([253,254,255])
|
||||
));
|
||||
console.dir(bufferEqual(
|
||||
new Buffer('abc'),
|
||||
new Buffer('abcd')
|
||||
));
|
||||
console.dir(bufferEqual(
|
||||
new Buffer('abc'),
|
||||
'abc'
|
||||
));
|
14
node_modules/buffer-equal/index.js
generated
vendored
Normal file
14
node_modules/buffer-equal/index.js
generated
vendored
Normal file
|
@ -0,0 +1,14 @@
|
|||
var Buffer = require('buffer').Buffer; // for use with browserify
|
||||
|
||||
module.exports = function (a, b) {
|
||||
if (!Buffer.isBuffer(a)) return undefined;
|
||||
if (!Buffer.isBuffer(b)) return undefined;
|
||||
if (typeof a.equals === 'function') return a.equals(b);
|
||||
if (a.length !== b.length) return false;
|
||||
|
||||
for (var i = 0; i < a.length; i++) {
|
||||
if (a[i] !== b[i]) return false;
|
||||
}
|
||||
|
||||
return true;
|
||||
};
|
33
node_modules/buffer-equal/package.json
generated
vendored
Normal file
33
node_modules/buffer-equal/package.json
generated
vendored
Normal file
|
@ -0,0 +1,33 @@
|
|||
{
|
||||
"name" : "buffer-equal",
|
||||
"description" : "return whether two buffers are equal",
|
||||
"version" : "0.0.2",
|
||||
"repository" : {
|
||||
"type" : "git",
|
||||
"url" : "git://github.com/substack/node-buffer-equal.git"
|
||||
},
|
||||
"main" : "index.js",
|
||||
"keywords" : [
|
||||
"buffer",
|
||||
"equal"
|
||||
],
|
||||
"directories" : {
|
||||
"example" : "example",
|
||||
"test" : "test"
|
||||
},
|
||||
"scripts" : {
|
||||
"test" : "tap test/*.js"
|
||||
},
|
||||
"devDependencies" : {
|
||||
"tap" : "0.2.4"
|
||||
},
|
||||
"engines" : {
|
||||
"node" : ">=0.4.0"
|
||||
},
|
||||
"license" : "MIT",
|
||||
"author" : {
|
||||
"name" : "James Halliday",
|
||||
"email" : "mail@substack.net",
|
||||
"url" : "http://substack.net"
|
||||
}
|
||||
}
|
35
node_modules/buffer-equal/test/eq.js
generated
vendored
Normal file
35
node_modules/buffer-equal/test/eq.js
generated
vendored
Normal file
|
@ -0,0 +1,35 @@
|
|||
var bufferEqual = require('../');
|
||||
var test = require('tap').test;
|
||||
|
||||
test('equal', function (t) {
|
||||
var eq = bufferEqual(
|
||||
new Buffer([253,254,255]),
|
||||
new Buffer([253,254,255])
|
||||
);
|
||||
t.strictEqual(eq, true);
|
||||
t.end();
|
||||
});
|
||||
|
||||
test('not equal', function (t) {
|
||||
var eq = bufferEqual(
|
||||
new Buffer('abc'),
|
||||
new Buffer('abcd')
|
||||
);
|
||||
t.strictEqual(eq, false);
|
||||
t.end();
|
||||
});
|
||||
|
||||
test('not equal not buffer', function (t) {
|
||||
var eq = bufferEqual(
|
||||
new Buffer('abc'),
|
||||
'abc'
|
||||
);
|
||||
t.strictEqual(eq, undefined);
|
||||
t.end();
|
||||
});
|
||||
|
||||
test('equal not buffer', function (t) {
|
||||
var eq = bufferEqual('abc', 'abc');
|
||||
t.strictEqual(eq, undefined);
|
||||
t.end();
|
||||
});
|
Loading…
Add table
Add a link
Reference in a new issue