jsPerf.app is an online JavaScript performance benchmark test runner & jsperf.com mirror. It is a complete rewrite in homage to the once excellent jsperf.com now with hopefully a more modern & maintainable codebase.
jsperf.com URLs are mirrored at the same path, e.g:
https://jsperf.com/negative-modulo/2
Can be accessed at:
https://jsperf.app/negative-modulo/2
<script>
/*
======================================================
uuid-v4.js :: Random UUID (v4) Generator - Usage: UUID()
======================================================
Copyright (c) 2011 Matt Williams <matt@makeable.co.uk>. All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are
permitted provided that the following conditions are met:
1. Redistributions of source code must retain the above copyright notice, this list of
conditions and the following disclaimer.
2. 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.
THIS SOFTWARE IS PROVIDED BY MATT WILLIAMS ''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 MATT WILLIAMS 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.
The views and conclusions contained in the software and documentation are those of the
authors and should not be interpreted as representing official policies, either expressed
or implied, of Matt Williams.
*/
(function(){
var dec2hex = [];
for (var i=0; i<=15; i++) {
dec2hex[i] = i.toString(16);
}
var UUID = function() {
var uuid = '';
for (var i=1; i<=36; i++) {
if (i===9 || i===14 || i===19 || i===24) {
uuid += '-';
} else if (i===15) {
uuid += 4;
} else if (i===20) {
uuid += dec2hex[(Math.random()*4|0 + 8)];
} else {
uuid += dec2hex[(Math.random()*15|0)];
}
}
return uuid;
};
if (typeof exports !== 'undefined') {
module.exports = UUID;
} else {
this.UUID = UUID;
}
})(this);
// uuid.js
//
// Copyright (c) 2010-2012 Robert Kieffer
// MIT License - http://opensource.org/licenses/mit-license.php
(function() {
var _global = this;
// Unique ID creation requires a high quality random # generator. We feature
// detect to determine the best RNG source, normalizing to a function that
// returns 128-bits of randomness, since that's what's usually required
var _rng;
// Node.js crypto-based RNG - http://nodejs.org/docs/v0.6.2/api/crypto.html
//
// Moderately fast, high quality
if (typeof(require) == 'function') {
try {
var _rb = require('crypto').randomBytes;
_rng = _rb && function() {
return _rb(16);
};
} catch (e) {}
}
if (!_rng && _global.crypto && crypto.getRandomValues) {
// WHATWG crypto-based RNG - http://wiki.whatwg.org/wiki/Crypto
//
// Moderately fast, high quality
var _rnds8 = new Uint8Array(16);
_rng = function whatwgRNG() {
crypto.getRandomValues(_rnds8);
return _rnds8;
};
}
if (!_rng) {
// Math.random()-based (RNG)
//
// If all else fails, use Math.random(). It's fast, but is of unspecified
// quality.
var _rnds = new Array(16);
_rng = function() {
for (var i = 0, r; i < 16; i++) {
if ((i & 0x03) === 0) r = Math.random() * 0x100000000;
_rnds[i] = r >>> ((i & 0x03) << 3) & 0xff;
}
return _rnds;
};
}
// Buffer class to use
var BufferClass = typeof(Buffer) == 'function' ? Buffer : Array;
// Maps for number <-> hex string conversion
var _byteToHex = [];
var _hexToByte = {};
for (var i = 0; i < 256; i++) {
_byteToHex[i] = (i + 0x100).toString(16).substr(1);
_hexToByte[_byteToHex[i]] = i;
}
// **`parse()` - Parse a UUID into it's component bytes**
function parse(s, buf, offset) {
var i = (buf && offset) || 0,
ii = 0;
buf = buf || [];
s.toLowerCase().replace(/[0-9a-f]{2}/g, function(oct) {
if (ii < 16) { // Don't overflow!
buf[i + ii++] = _hexToByte[oct];
}
});
// Zero out remaining bytes if string was short
while (ii < 16) {
buf[i + ii++] = 0;
}
return buf;
}
// **`unparse()` - Convert UUID byte array (ala parse()) into a string**
function unparse(buf, offset) {
var i = offset || 0,
bth = _byteToHex;
return bth[buf[i++]] + bth[buf[i++]] + bth[buf[i++]] + bth[buf[i++]] + '-' + bth[buf[i++]] + bth[buf[i++]] + '-' + bth[buf[i++]] + bth[buf[i++]] + '-' + bth[buf[i++]] + bth[buf[i++]] + '-' + bth[buf[i++]] + bth[buf[i++]] + bth[buf[i++]] + bth[buf[i++]] + bth[buf[i++]] + bth[buf[i++]];
}
// **`v1()` - Generate time-based UUID**
//
// Inspired by https://github.com/LiosK/UUID.js
// and http://docs.python.org/library/uuid.html
// random #'s we need to init node and clockseq
var _seedBytes = _rng();
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
var _nodeId = [
_seedBytes[0] | 0x01,
_seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5]];
// Per 4.2.2, randomize (14 bit) clockseq
var _clockseq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff;
// Previous uuid creation time
var _lastMSecs = 0,
_lastNSecs = 0;
// See https://github.com/broofa/node-uuid for API details
function v1(options, buf, offset) {
var i = buf && offset || 0;
var b = buf || [];
options = options || {};
var clockseq = options.clockseq != null ? options.clockseq : _clockseq;
// UUID timestamps are 100 nano-second units since the Gregorian epoch,
// (1582-10-15 00:00). JSNumbers aren't precise enough for this, so
// time is handled internally as 'msecs' (integer milliseconds) and 'nsecs'
// (100-nanoseconds offset from msecs) since unix epoch, 1970-01-01 00:00.
var msecs = options.msecs != null ? options.msecs : new Date().getTime();
// Per 4.2.1.2, use count of uuid's generated during the current clock
// cycle to simulate higher resolution clock
var nsecs = options.nsecs != null ? options.nsecs : _lastNSecs + 1;
// Time since last uuid creation (in msecs)
var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs) / 10000;
// Per 4.2.1.2, Bump clockseq on clock regression
if (dt < 0 && options.clockseq == null) {
clockseq = clockseq + 1 & 0x3fff;
}
// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
// time interval
if ((dt < 0 || msecs > _lastMSecs) && options.nsecs == null) {
nsecs = 0;
}
// Per 4.2.1.2 Throw error if too many uuids are requested
if (nsecs >= 10000) {
throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');
}
_lastMSecs = msecs;
_lastNSecs = nsecs;
_clockseq = clockseq;
// Per 4.1.4 - Convert from unix epoch to Gregorian epoch
msecs += 12219292800000;
// `time_low`
var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
b[i++] = tl >>> 24 & 0xff;
b[i++] = tl >>> 16 & 0xff;
b[i++] = tl >>> 8 & 0xff;
b[i++] = tl & 0xff;
// `time_mid`
var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;
b[i++] = tmh >>> 8 & 0xff;
b[i++] = tmh & 0xff;
// `time_high_and_version`
b[i++] = tmh >>> 24 & 0xf | 0x10; // include version
b[i++] = tmh >>> 16 & 0xff;
// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
b[i++] = clockseq >>> 8 | 0x80;
// `clock_seq_low`
b[i++] = clockseq & 0xff;
// `node`
var node = options.node || _nodeId;
for (var n = 0; n < 6; n++) {
b[i + n] = node[n];
}
return buf ? buf : unparse(b);
}
// **`v4()` - Generate random UUID**
// See https://github.com/broofa/node-uuid for API details
function v4(options, buf, offset) {
// Deprecated - 'format' argument, as supported in v1.2
var i = buf && offset || 0;
if (typeof(options) == 'string') {
buf = options == 'binary' ? new BufferClass(16) : null;
options = null;
}
options = options || {};
var rnds = options.random || (options.rng || _rng)();
// Per 4.4, set bits for version and `clock_seq_hi_and_reserved`
rnds[6] = (rnds[6] & 0x0f) | 0x40;
rnds[8] = (rnds[8] & 0x3f) | 0x80;
// Copy bytes to buffer, if provided
if (buf) {
for (var ii = 0; ii < 16; ii++) {
buf[i + ii] = rnds[ii];
}
}
return buf || unparse(rnds);
}
// Export public API
var uuid = v4;
uuid.v1 = v1;
uuid.v4 = v4;
uuid.parse = parse;
uuid.unparse = unparse;
uuid.BufferClass = BufferClass;
if (typeof define === 'function' && define.amd) {
// Publish as AMD module
define(function() {
return uuid;
});
} else if (typeof(module) != 'undefined' && module.exports) {
// Publish as node.js module
module.exports = uuid;
} else {
// Publish as global (in browsers)
var _previousRoot = _global.uuid;
// **`noConflict()` - (browser only) to reset global 'uuid' var**
uuid.noConflict = function() {
_global.uuid = _previousRoot;
return uuid;
};
_global.uuid = uuid;
}
}).call(this);
function b() {
return 'xxxxxxxx-xxxx-4xxx-yxxx-xxxxxxxxxxxx'.replace(/[xy]/g, function(c) {
var r = Math.random()*16|0, v = c == 'x' ? r : (r&0x3|0x8);
return v.toString(16);
});
}
var test_uuid = (function() {
var d2h = [], vals = new Array(16);
for (var i = 0; i < 256; ++i) d2h.push((0x100 + i).toString(16).substr(1));
function uuid() {
for (var i = 0; i < 16; ++i) vals[i] = Math.random() * 256 | 0;
vals[6] = vals[6] & 0x0f | 0x40;
vals[8] = vals[8] & 0x3f | 0x80;
return d2h[vals[0]] + d2h[vals[1]] + d2h[vals[2]] + d2h[vals[3]] +
'-' + d2h[vals[4]] + d2h[vals[5]] +
'-' + d2h[vals[6]] + d2h[vals[7]] +
'-' + d2h[vals[8]] + d2h[vals[9]] +
'-' + d2h[vals[10]] + d2h[vals[11]] + d2h[vals[12]] + d2h[vals[13]] + d2h[vals[14]] + d2h[vals[15]];
}
return uuid;
})();
var test_uuid2 = (function() {
var d2h = [], vals = new Array(16);
for (var i = 0; i < 256; ++i) d2h.push((0x100 + i).toString(16).substr(1));
function uuid() {
for (var i = 0; i < 16; ++i) vals[i] = Math.random() * 256 | 0;
vals[6] = vals[6] & 0x0f | 0x40;
vals[8] = vals[8] & 0x3f | 0x80;
return [d2h[vals[0]] + d2h[vals[1]] + d2h[vals[2]] + d2h[vals[3]],
d2h[vals[4]] + d2h[vals[5]],
d2h[vals[6]] + d2h[vals[7]],
d2h[vals[8]] + d2h[vals[9]],
d2h[vals[10]] + d2h[vals[11]] + d2h[vals[12]] + d2h[vals[13]] + d2h[vals[14]] + d2h[vals[15]]]
.join('-');
}
return uuid;
})();
function createUUID() {
var s = [];
var hexDigits = "0123456789abcdef";
for (var i = 0; i < 36; i++) {
s[i] = hexDigits.substr(Math.floor(Math.random() * 0x10), 1);
}
s[14] = "4"; // bits 12-15 of the time_hi_and_version field to 0010
s[19] = hexDigits.substr((s[19] & 0x3) | 0x8, 1); // bits 6-7 of the clock_seq_hi_and_reserved to 01
s[8] = s[13] = s[18] = s[23] = "-";
return s.join("");
}
/**
* Flake ID generator yields k-ordered, conflict-free ids in a distributed environment.
*/
(function () {
"use strict";
/**
* Represents an ID generator.
* @exports FlakeId
* @constructor
* @param {object=} options - Generator options
* @param {Number} options.id - Generator identifier. It can have values from 0 to 1023. It can be provided instead of <tt>datacenter</tt> and <tt>worker</tt> identifiers.
* @param {Number} options.datacenter - Datacenter identifier. It can have values from 0 to 31.
* @param {Number} options.worker - Worker identifier. It can have values from 0 to 31.
* @param {Number} options.epoch - Number used to reduce value of a generated timestamp.
* @param {Number} options.seqMask
*/
var FlakeId = module.exports = function (options) {
this.options = options || {};
// Set generator id from 'id' option or combination of 'datacenter' and 'worker'
if (typeof this.options.id !== 'undefined') {
/*jslint bitwise: true */
this.id = this.options.id & 0x3FF;
} else {
this.id = ((this.options.datacenter || 0) & 0x1F) << 5 | ((this.options.worker || 0) & 0x1F);
}
this.id <<= 12; // id generator identifier - will not change while generating ids
this.epoch = +this.options.epoch || 0;
this.seq = 0;
this.lastTime = 0;
this.overflow = false;
this.seqMask = this.options.seqMask || 0xFFF;
};
FlakeId.POW10 = Math.pow(2, 10); // 2 ^ 10
FlakeId.POW26 = Math.pow(2, 26); // 2 ^ 26
FlakeId.prototype = {
/**
* Generates conflice-free id
* @param {cb=} callback The callback that handles the response.
* @returns {Buffer} Generated id if callback is not provided
* @exception if a sequence exceeded its maximum value and a callback function is not provided
*/
next: function (cb) {
/**
* This callback receives generated id
* @callback callback
* @param {Error} error - Error occurred during id generation
* @param {Buffer} id - Generated id
*/
var id = new Buffer(8), time = Date.now() - this.epoch;
id.fill(0);
// Generates id in the same millisecond as the previous id
if (time === this.lastTime) {
// If all sequence values (4096 unique values including 0) have been used
// to generate ids in the current millisecond (overflow is true) wait till next millisecond
if (this.overflow) {
overflowCond(this, cb);
return;
}
// Increase sequence counter
/*jslint bitwise: true */
this.seq = (this.seq + 1) & this.seqMask;
// sequence counter exceeded its max value (4095)
// - set overflow flag and wait till next millisecond
if (this.seq === 0) {
this.overflow = true;
overflowCond(this, cb);
return;
}
} else {
this.overflow = false;
this.seq = 0;
}
this.lastTime = time;
id.writeUInt32BE(((time & 0x3) << 22) | this.id | this.seq, 4);
id.writeUInt8(Math.floor(time / 4) & 0xFF, 4);
id.writeUInt16BE(Math.floor(time / FlakeId.POW10) & 0xFFFF, 2);
id.writeUInt16BE(Math.floor(time / FlakeId.POW26) & 0xFFFF, 0);
if (cb) {
process.nextTick(cb.bind(null, null, id));
}
else {
return id;
}
}
};
function overflowCond(self, cb) {
if (cb) {
setTimeout(self.next.bind(self, cb), 1);
}
else {
throw new Error('Sequence exceeded its maximum value. Provide callback function to handle sequence overflow');
}
}
}());
var flakeIdGen2 = new FlakeId({ datacenter: 9, worker: 7 });
</script>
Ready to run.
Test | Ops/sec | |
---|---|---|
flake-id |
| ready |
uuid.v1() |
| ready |
uuid.v4() |
| ready |
Crazy Gist |
| ready |
Modified Crazy |
| ready |
UUID |
| ready |
test_uuid2 |
| ready |
createUUID |
| ready |
You can edit these tests or add more tests to this page by appending /edit to the URL.