blob: 63825e2c4fd7521b88847edc00328dd9e806b5be (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
|
/** @license MIT License (c) copyright 2010-2014 original author or authors */
/** @author Brian Cavalier */
/** @author John Hann */
(function(define) { 'use strict';
define(function() {
var parse, captureStack, format;
if(Error.captureStackTrace) {
// Use Error.captureStackTrace if available
parse = function(e) {
return e && e.stack && e.stack.split('\n');
};
format = formatAsString;
captureStack = Error.captureStackTrace;
} else {
// Otherwise, do minimal feature detection to determine
// how to capture and format reasonable stacks.
parse = function(e) {
var stack = e && e.stack && e.stack.split('\n');
if(stack && e.message) {
stack.unshift(e.message);
}
return stack;
};
(function() {
var e = new Error();
if(typeof e.stack !== 'string') {
format = formatAsString;
captureStack = captureSpiderMonkeyStack;
} else {
format = formatAsErrorWithStack;
captureStack = useStackDirectly;
}
}());
}
function captureSpiderMonkeyStack(host) {
try {
throw new Error();
} catch(err) {
host.stack = err.stack;
}
}
function useStackDirectly(host) {
host.stack = new Error().stack;
}
function formatAsString(longTrace) {
return join(longTrace);
}
function formatAsErrorWithStack(longTrace) {
var e = new Error();
e.stack = formatAsString(longTrace);
return e;
}
// About 5-10x faster than String.prototype.join o_O
function join(a) {
var sep = false;
var s = '';
for(var i=0; i< a.length; ++i) {
if(sep) {
s += '\n' + a[i];
} else {
s+= a[i];
sep = true;
}
}
return s;
}
return {
parse: parse,
format: format,
captureStack: captureStack
};
});
}(typeof define === 'function' && define.amd ? define : function(factory) { module.exports = factory(); }));
|
