-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathpretty.em
177 lines (154 loc) · 5.85 KB
/
pretty.em
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
/* Sirikata
* pretty.js
*
* Copyright (c) 2011, Ewen Cheslack-Postava
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * 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.
* * Neither the name of Sirikata nor the names of its contributors may
* be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 THE COPYRIGHT OWNER
* 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.
*/
if (typeof(std) === "undefined") /**@namespace */ std = {};
if (typeof(std.core) === "undefined") /** @namespace */ std.core = {};
/**
* Converts an object to a string in a 'pretty' format, i.e. so it is
* human-readable, multiple lines, and handles indentation. If the
* object is not a tree (i.e. it has circular references in it), then
* the normal toString version will be returned. Generally this
* should only be used on small, tree-like objects.
*/
std.core.pretty = function(obj) {
var visited = [];
// Fast path -- if its not an object or array, we can just do the normal conversion
if (typeof(obj) !== "object" || obj === null)
return '' + obj;
var objectPrettyOverride = function(obj) {
// If the object overrides pretty printing, just hand back whatever it wants.
if (typeof(obj.__prettyPrintString__) === "string")
return obj.__prettyPrintString__;
else if (typeof(obj.__prettyPrintString__) === "function")
return obj.__prettyPrintString__();
else
return undefined;
};
{
var override = objectPrettyOverride(obj);
if (override) return override;
}
var objectFields = function(obj) {
if (typeof(obj.__prettyPrintFields__) == "function")
return obj.__prettyPrintFields__();
else
return Object.getOwnPropertyNames(obj);
};
var longObject = function(obj) {
var fields = objectFields(obj);
if (fields.length > 3)
return true;
for(var f in fields)
if(typeof(obj[fields[f]]) === 'object')
return true;
return false;
};
var checkVisited = function (obj)
{
for (var s in visited)
{
if (visited[s][0] === obj)
{
return s;
}
}
return null;
};
var output = '';
var obj_stack = [ {obj: obj, idx: -1} ];
var indent = '';
var numPrint = 1;
while(obj_stack.length != 0) {
var cur = obj_stack.pop();
visited.push([cur.obj,-1,output.length]);
// Check if we need to start this object
if (cur.idx == -1) {
// Start the object
output += '{';
indent += ' ';
obj_stack.push( {obj: cur.obj, idx: cur.idx+1} );
}
else if (cur.idx < objectFields(cur.obj).length) {
// Setup processing of next child
// Add a comma and either space or newline as appropriate
if (cur.idx != 0)
output += ',';
if (longObject(cur.obj))
output += '\n' + indent;
else
output += ' ';
obj_stack.push( {obj: cur.obj, idx: cur.idx+1} );
// And process this one, possibly triggering recursion
var key = objectFields(cur.obj)[cur.idx];
var child = cur.obj[key];
output += key + ': ';
if (typeof(child) === "object" && child !== null) {
//check if we've arleady visited this object.
var visitedIndex = checkVisited(child);
if (visitedIndex != null)
{
var entry = visited[visitedIndex];
if(entry[1] == -1)
{
var tag = '<#' + numPrint + '>';
output = output.slice(0, entry[2]) + tag +
output.slice(entry[2]);
for(var i in visited)
if(visited[i][2] > entry[2])
visited[i][2] += tag.length;
entry[1] = numPrint;
numPrint++;
}
output += '<#'+ entry[1].toString() + '>';
continue;
}
var override = objectPrettyOverride(child);
if (override)
output += override;
else
obj_stack.push( {obj: child, idx: -1} );
}
else
output += child;
}
else {
// Close this object
indent = indent.substr(1);
if (longObject(cur.obj))
output += '\n' + indent;
else
output += ' ';
output += '}';
// No object stack push, we've finished with this object
}
}
return output;
};