1 |
|
2 |
|
3 |
|
4 |
|
5 |
|
6 | (function() {
|
7 | var _global = this;
|
8 |
|
9 |
|
10 |
|
11 |
|
12 |
|
13 | var mathRNG, nodeRNG, whatwgRNG;
|
14 |
|
15 |
|
16 | var _rndBytes = new Array(16);
|
17 | mathRNG = function() {
|
18 | var r, b = _rndBytes, i = 0;
|
19 |
|
20 | for (var i = 0, r; i < 16; i++) {
|
21 | if ((i & 0x03) == 0) r = Math.random() * 0x100000000;
|
22 | b[i] = r >>> ((i & 0x03) << 3) & 0xff;
|
23 | }
|
24 |
|
25 | return b;
|
26 | }
|
27 |
|
28 |
|
29 |
|
30 | if (_global.crypto && crypto.getRandomValues) {
|
31 | var _rnds = new Uint32Array(4);
|
32 | whatwgRNG = function() {
|
33 | crypto.getRandomValues(_rnds);
|
34 |
|
35 | for (var c = 0 ; c < 16; c++) {
|
36 | _rndBytes[c] = _rnds[c >> 2] >>> ((c & 0x03) * 8) & 0xff;
|
37 | }
|
38 | return _rndBytes;
|
39 | }
|
40 | }
|
41 |
|
42 |
|
43 |
|
44 | try {
|
45 | var _rb = require('crypto').randomBytes;
|
46 | nodeRNG = _rb && function() {
|
47 | return _rb(16);
|
48 | };
|
49 | } catch (e) {}
|
50 |
|
51 |
|
52 | var _rng = nodeRNG || whatwgRNG || mathRNG;
|
53 |
|
54 |
|
55 | var BufferClass = typeof(Buffer) == 'function' ? Buffer : Array;
|
56 |
|
57 |
|
58 | var _byteToHex = [];
|
59 | var _hexToByte = {};
|
60 | for (var i = 0; i < 256; i++) {
|
61 | _byteToHex[i] = (i + 0x100).toString(16).substr(1);
|
62 | _hexToByte[_byteToHex[i]] = i;
|
63 | }
|
64 |
|
65 |
|
66 | function parse(s, buf, offset) {
|
67 | var i = (buf && offset) || 0, ii = 0;
|
68 |
|
69 | buf = buf || [];
|
70 | s.toLowerCase().replace(/[0-9a-f]{2}/g, function(byte) {
|
71 | if (ii < 16) {
|
72 | buf[i + ii++] = _hexToByte[byte];
|
73 | }
|
74 | });
|
75 |
|
76 |
|
77 | while (ii < 16) {
|
78 | buf[i + ii++] = 0;
|
79 | }
|
80 |
|
81 | return buf;
|
82 | }
|
83 |
|
84 |
|
85 | function unparse(buf, offset) {
|
86 | var i = offset || 0, bth = _byteToHex;
|
87 | return bth[buf[i++]] + bth[buf[i++]] +
|
88 | bth[buf[i++]] + bth[buf[i++]] + '-' +
|
89 | bth[buf[i++]] + bth[buf[i++]] + '-' +
|
90 | bth[buf[i++]] + bth[buf[i++]] + '-' +
|
91 | bth[buf[i++]] + bth[buf[i++]] + '-' +
|
92 | bth[buf[i++]] + bth[buf[i++]] +
|
93 | bth[buf[i++]] + bth[buf[i++]] +
|
94 | bth[buf[i++]] + bth[buf[i++]];
|
95 | }
|
96 |
|
97 |
|
98 |
|
99 |
|
100 |
|
101 |
|
102 |
|
103 | var _seedBytes = _rng();
|
104 |
|
105 |
|
106 | var _nodeId = [
|
107 | _seedBytes[0] | 0x01,
|
108 | _seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5]
|
109 | ];
|
110 |
|
111 |
|
112 | var _clockseq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff;
|
113 |
|
114 |
|
115 | var _lastMSecs = 0, _lastNSecs = 0;
|
116 |
|
117 |
|
118 | function v1(options, buf, offset) {
|
119 | var i = buf && offset || 0;
|
120 | var b = buf || [];
|
121 |
|
122 | options = options || {};
|
123 |
|
124 | var clockseq = options.clockseq != null ? options.clockseq : _clockseq;
|
125 |
|
126 |
|
127 |
|
128 |
|
129 |
|
130 | var msecs = options.msecs != null ? options.msecs : new Date().getTime();
|
131 |
|
132 |
|
133 |
|
134 | var nsecs = options.nsecs != null ? options.nsecs : _lastNSecs + 1;
|
135 |
|
136 |
|
137 | var dt = (msecs - _lastMSecs) + (nsecs - _lastNSecs)/10000;
|
138 |
|
139 |
|
140 | if (dt < 0 && options.clockseq == null) {
|
141 | clockseq = clockseq + 1 & 0x3fff;
|
142 | }
|
143 |
|
144 |
|
145 |
|
146 | if ((dt < 0 || msecs > _lastMSecs) && options.nsecs == null) {
|
147 | nsecs = 0;
|
148 | }
|
149 |
|
150 |
|
151 | if (nsecs >= 10000) {
|
152 | throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');
|
153 | }
|
154 |
|
155 | _lastMSecs = msecs;
|
156 | _lastNSecs = nsecs;
|
157 | _clockseq = clockseq;
|
158 |
|
159 |
|
160 | msecs += 12219292800000;
|
161 |
|
162 |
|
163 | var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
|
164 | b[i++] = tl >>> 24 & 0xff;
|
165 | b[i++] = tl >>> 16 & 0xff;
|
166 | b[i++] = tl >>> 8 & 0xff;
|
167 | b[i++] = tl & 0xff;
|
168 |
|
169 |
|
170 | var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;
|
171 | b[i++] = tmh >>> 8 & 0xff;
|
172 | b[i++] = tmh & 0xff;
|
173 |
|
174 |
|
175 | b[i++] = tmh >>> 24 & 0xf | 0x10;
|
176 | b[i++] = tmh >>> 16 & 0xff;
|
177 |
|
178 |
|
179 | b[i++] = clockseq >>> 8 | 0x80;
|
180 |
|
181 |
|
182 | b[i++] = clockseq & 0xff;
|
183 |
|
184 |
|
185 | var node = options.node || _nodeId;
|
186 | for (var n = 0; n < 6; n++) {
|
187 | b[i + n] = node[n];
|
188 | }
|
189 |
|
190 | return buf ? buf : unparse(b);
|
191 | }
|
192 |
|
193 |
|
194 |
|
195 |
|
196 | function v4(options, buf, offset) {
|
197 |
|
198 | var i = buf && offset || 0;
|
199 |
|
200 | if (typeof(options) == 'string') {
|
201 | buf = options == 'binary' ? new BufferClass(16) : null;
|
202 | options = null;
|
203 | }
|
204 | options = options || {};
|
205 |
|
206 | var rnds = options.random || (options.rng || _rng)();
|
207 |
|
208 |
|
209 | rnds[6] = (rnds[6] & 0x0f) | 0x40;
|
210 | rnds[8] = (rnds[8] & 0x3f) | 0x80;
|
211 |
|
212 |
|
213 | if (buf) {
|
214 | for (var ii = 0; ii < 16; ii++) {
|
215 | buf[i + ii] = rnds[ii];
|
216 | }
|
217 | }
|
218 |
|
219 | return buf || unparse(rnds);
|
220 | }
|
221 |
|
222 |
|
223 | var uuid = v4;
|
224 | uuid.v1 = v1;
|
225 | uuid.v4 = v4;
|
226 | uuid.parse = parse;
|
227 | uuid.unparse = unparse;
|
228 | uuid.BufferClass = BufferClass;
|
229 |
|
230 |
|
231 | uuid.mathRNG = mathRNG;
|
232 | uuid.nodeRNG = nodeRNG;
|
233 | uuid.whatwgRNG = whatwgRNG;
|
234 |
|
235 | if (typeof(module) != 'undefined') {
|
236 |
|
237 | module.exports = uuid;
|
238 | } else {
|
239 |
|
240 | var _previousRoot = _global.uuid;
|
241 |
|
242 |
|
243 | uuid.noConflict = function() {
|
244 | _global.uuid = _previousRoot;
|
245 | return uuid;
|
246 | }
|
247 | _global.uuid = uuid;
|
248 | }
|
249 | }());
|