'
153 | ];
154 |
155 | $(document.body).insert(html.join());
156 | var outer = $('Z1'),
157 | inner = $('Z2'),
158 | w1 = inner.offsetWidth;
159 | outer.style.overflow = 'scroll';
160 | var w2 = inner.offsetWidth;
161 | if( w1 == w2 ) w2 = outer.clientWidth;
162 | outer.remove();
163 | return this.sbs = w1 - w2;
164 | }
165 | });
166 |
167 |
168 | if( !Prototype.Browser.IE )
169 | FP.push(ResizablePanel);
--------------------------------------------------------------------------------
/public/javascripts/recentlyChangedFiles.js:
--------------------------------------------------------------------------------
1 | var RecentlyChangedFiles = Class.create( PluginBase, {
2 | initialize: function( $super, f ) {
3 | $super(f);
4 | }
5 |
6 | ,recentlyChangedFiles = function(){
7 | if( !this.item ) {
8 | return;
9 | }
10 |
11 | if( !this.item.commit ) { // race conditions!!!!!
12 | return; // commit log not ready
13 | }
14 |
15 | // get the commit log to show the latest changed
16 | GH.Commits.show( this.f.user_id, this.f.repository, this.item.commit.id, {
17 | onData: function(commit) {
18 | var files = commit.modified || []; // TODO: merge and move
19 | var p = $('p' + this.index );
20 | for( var i = 0; i< files.length; i++ ) {
21 | fn = files[i].filename.split('/');
22 | fn = fn[ fn.length-1 ];
23 | var e = p.down('a[data-name="' + fn + '"]');
24 | if( e ) e.up('li').addClassName('recent');
25 | }
26 |
27 | }.bind(this)
28 | } );
29 | }
30 | })
--------------------------------------------------------------------------------
/public/javascripts/userscript.js:
--------------------------------------------------------------------------------
1 | /* Add a button to the github repo listing page */
2 | (function($) {
3 | var ghf = 'http://sr3d.github.com/GithubFinder?utm_source=userscript',
4 | m = (new RegExp("github.com\/(.+)","i")).exec(window.location.href),
5 | path = m ? m[1].split('/') : [],
6 | user = path[0],
7 | repo = path[1],
8 | branch = path[3],
9 | li = $('ul.pagehead-actions li:first')[0],
10 | html = '
Browse in GHFinder';
13 | if(li) {
14 | $(li).before(html);
15 | }
16 |
17 |
18 | /* for userlisting page */
19 | var repoInfo;
20 | $('.profilecols .repositories h3 a').each(function(index,a) {
21 | repoInfo = $(a).attr('href').split('/');
22 | html = '
' +
26 | '
'
27 | '';
28 | $(a).after(html);
29 | });
30 |
31 | })(jQuery);
--------------------------------------------------------------------------------
/public/javascripts/userscript.user.js:
--------------------------------------------------------------------------------
1 | // ==UserScript==
2 | // @name Github Finder Greasemonkey Script
3 | // @description Add an easy "Browse" button of current repository linking to GHFinder.
4 | // @include https://github.com/*
5 | // @include http://github.com/*
6 | // @author GithubFinder by Alex Le (http://sr3d.github.com/GithubFinder)
7 | // ==/UserScript==
8 |
9 | (function() {
10 | var script = document.createElement('script');
11 | // script.src = 'http://localhost/misc/githubfinder/javascripts/userscript.js';
12 | script.src = 'https://raw.github.com/sr3d/GithubFinder/master/public/javascripts/userscript.js';
13 | script.type = 'text/javascript';
14 | document.getElementsByTagName('head')[0].appendChild(script);
15 | })();
--------------------------------------------------------------------------------
/public/javascripts/util.js:
--------------------------------------------------------------------------------
1 | /* make sure we have console */
2 | /*
3 | ;if( typeof(console) == 'undefined' )
4 | console = { log: function(){} };
5 | */
6 | /* placeholder */
7 | // var pH = function() {
8 | // if( 'placeholder' in (document.createElement('input') ) )
9 | // return;
10 | //
11 | // $$('input[placeholder]').each(function(i) {
12 | // var t = i.readAttribute('placeholder');
13 | // var f = function() {
14 | // i.value.strip() == t ? i.value = '' : '';
15 | // };
16 | // i.on('focus', f);
17 | //
18 | // var b = function() {
19 | // i.value.strip() == '' ? i.value = t : '';
20 | // };
21 | // i.on('blur', b);
22 | // b();
23 | // });
24 | // };
25 |
26 |
27 |
28 |
29 | /* Util stuff */
30 |
31 | /* return a truncated sha */
32 | var s = function(h) { return h.substr(0,6); };
33 |
34 | /* truncate text to a minimum length, similar to the way Finder does it */
35 | var t = function(s,l) {
36 | var sl = s.length,
37 | d = '...', // delimiter
38 | dl = d.length,
39 | r = (l - dl) / 2; // radius
40 | return s.length < l ? s : s.substr(0, r) + d + s.substr( sl - r, sl);
41 | }
42 |
43 | /* parse URL Params as a hash with key are lowered case. (Doesn't handle duplicated key). */
44 | var uP = function() {
45 | var ps = [], pair, pairs,
46 | url = window.location.href.split('?');
47 |
48 | if( url.length == 1 ) return ps;
49 |
50 | url = url[1].split('#')[0];
51 |
52 | pairs = url.split('&');
53 | for( var i = 0; i < pairs.length; i++ ) {
54 | pair = pairs[i].split('=');
55 | ps[ pair[0].toLowerCase() ] = pair[1];
56 | }
57 | return ps;
58 | };
59 |
--------------------------------------------------------------------------------
/public/javascripts/vendors/code_highlighter.js:
--------------------------------------------------------------------------------
1 | /* Unobtrustive Code Highlighter By Dan Webb 11/2005
2 | Version: 0.4
3 |
4 | Usage:
5 | Add a script tag for this script and any stylesets you need to use
6 | to the page in question, add correct class names to CODE elements,
7 | define CSS styles for elements. That's it!
8 |
9 | Known to work on:
10 | IE 5.5+ PC
11 | Firefox/Mozilla PC/Mac
12 | Opera 7.23 + PC
13 | Safari 2
14 |
15 | Known to degrade gracefully on:
16 | IE5.0 PC
17 |
18 | Note: IE5.0 fails due to the use of lookahead in some stylesets. To avoid script errors
19 | in older browsers use expressions that use lookahead in string format when defining stylesets.
20 |
21 | This script is inspired by star-light by entirely cunning Dean Edwards
22 | http://dean.edwards.name/star-light/.
23 | */
24 |
25 | // replace callback support for safari.
26 | if ("a".replace(/a/, function() {return "b"}) != "b") (function(){
27 | var default_replace = String.prototype.replace;
28 | String.prototype.replace = function(search,replace){
29 | // replace is not function
30 | if(typeof replace != "function"){
31 | return default_replace.apply(this,arguments)
32 | }
33 | var str = "" + this;
34 | var callback = replace;
35 | // search string is not RegExp
36 | if(!(search instanceof RegExp)){
37 | var idx = str.indexOf(search);
38 | return (
39 | idx == -1 ? str :
40 | default_replace.apply(str,[search,callback(search, idx, str)])
41 | )
42 | }
43 | var reg = search;
44 | var result = [];
45 | var lastidx = reg.lastIndex;
46 | var re;
47 | while((re = reg.exec(str)) != null){
48 | var idx = re.index;
49 | var args = re.concat(idx, str);
50 | result.push(
51 | str.slice(lastidx,idx),
52 | callback.apply(null,args).toString()
53 | );
54 | if(!reg.global){
55 | lastidx += RegExp.lastMatch.length;
56 | break
57 | }else{
58 | lastidx = reg.lastIndex;
59 | }
60 | }
61 | result.push(str.slice(lastidx));
62 | return result.join("")
63 | }
64 | })();
65 |
66 | var CodeHighlighter = { styleSets : new Array };
67 |
68 | CodeHighlighter.addStyle = function(name, rules) {
69 | // using push test to disallow older browsers from adding styleSets
70 | if ([].push) this.styleSets.push({
71 | name : name,
72 | rules : rules,
73 | ignoreCase : arguments[2] || false
74 | })
75 |
76 | // function setEvent() {
77 | // // set highlighter to run on load (use LowPro if present)
78 | // if (typeof Event != 'undefined' && typeof Event.onReady == 'function')
79 | // return Event.onReady(CodeHighlighter.init.bind(CodeHighlighter));
80 | //
81 | // var old = window.onload;
82 | //
83 | // if (typeof window.onload != 'function') {
84 | // window.onload = function() { CodeHighlighter.init() };
85 | // } else {
86 | // window.onload = function() {
87 | // old();
88 | // CodeHighlighter.init();
89 | // }
90 | // }
91 | // }
92 | //
93 | // // only set the event when the first style is added
94 | // if (this.styleSets.length==1) setEvent();
95 | }
96 |
97 | CodeHighlighter.init = function() {
98 | if (!document.getElementsByTagName) return;
99 | if ("a".replace(/a/, function() {return "b"}) != "b") return; // throw out Safari versions that don't support replace function
100 | // throw out older browsers
101 |
102 | // var codeEls = document.getElementsByTagName("CODE");
103 |
104 | // HACK:
105 | var codeEls = [$('code')];
106 |
107 | // collect array of all pre elements
108 | codeEls.filter = function(f) {
109 | var a = new Array;
110 | for (var i = 0; i < this.length; i++)
111 | if (f(this[i]))
112 | a[a.length] = this[i];
113 | return a;
114 | }
115 |
116 | var rules = new Array;
117 | rules.toString = function() {
118 | // joins regexes into one big parallel regex
119 | var exps = new Array;
120 | for (var i = 0; i < this.length; i++) exps.push(this[i].exp);
121 | return exps.join("|");
122 | }
123 |
124 | function addRule(className, rule) {
125 | // add a replace rule
126 | var exp = (typeof rule.exp != "string")?String(rule.exp).substr(1, String(rule.exp).length-2):rule.exp;
127 | // converts regex rules to strings and chops of the slashes
128 | rules.push({
129 | className : className,
130 | exp : "(" + exp + ")",
131 | length : (exp.match(/(^|[^\\])\([^?]/g) || "").length + 1, // number of subexps in rule
132 | replacement : rule.replacement || null
133 | });
134 | }
135 |
136 | function parse(text, ignoreCase) {
137 | // main text parsing and replacement
138 | return text.replace(new RegExp(rules, (ignoreCase)?"gi":"g"), function() {
139 | var i = 0, j = 1, rule;
140 | while (rule = rules[i++]) {
141 | if (arguments[j]) {
142 | // if no custom replacement defined do the simple replacement
143 | if (!rule.replacement) return "
" + arguments[0] + "";
144 | else {
145 | // replace $0 with the className then do normal replaces
146 | var str = rule.replacement.replace("$0", rule.className);
147 | for (var k = 1; k <= rule.length - 1; k++) str = str.replace("$" + k, arguments[j + k]);
148 | return str;
149 | }
150 | } else j+= rule.length;
151 | }
152 | });
153 | }
154 |
155 | function highlightCode(styleSet) {
156 | // clear rules array
157 | var parsed, clsRx = new RegExp("(\\s|^)" + styleSet.name + "(\\s|$)");
158 | rules.length = 0;
159 |
160 | // // get stylable elements by filtering out all code elements without the correct className
161 | var stylableEls = codeEls.filter(function(item) { return clsRx.test(item.className) });
162 | // var stylableEls = codeEls;
163 |
164 | // add style rules to parser
165 | for (var className in styleSet.rules) addRule(className, styleSet.rules[className]);
166 |
167 |
168 | // replace for all elements
169 | for (var i = 0; i < stylableEls.length; i++) {
170 | // EVIL hack to fix IE whitespace badness if it's inside a
171 | if (/MSIE/.test(navigator.appVersion) && stylableEls[i].parentNode.nodeName == 'PRE') {
172 | stylableEls[i] = stylableEls[i].parentNode;
173 |
174 | parsed = stylableEls[i].innerHTML.replace(/(]*>)([^<]*)<\/code>/i, function() {
175 | return arguments[1] + parse(arguments[2], styleSet.ignoreCase) + ""
176 | });
177 | parsed = parsed.replace(/\n( *)/g, function() {
178 | var spaces = "";
179 | for (var i = 0; i < arguments[1].length; i++) spaces+= " ";
180 | return "\n" + spaces;
181 | });
182 | parsed = parsed.replace(/\t/g, " ");
183 | parsed = parsed.replace(/\n(<\/\w+>)?/g, "
$1").replace(/
[\n\r\s]*
/g, "
");
184 |
185 | } else parsed = parse(stylableEls[i].innerHTML, styleSet.ignoreCase);
186 |
187 | stylableEls[i].innerHTML = parsed;
188 | }
189 | }
190 |
191 | // run highlighter on all stylesets
192 | for (var i=0; i < this.styleSets.length; i++) {
193 | highlightCode(this.styleSets[i]);
194 | }
195 | }
196 |
197 |
198 |
199 |
200 | CodeHighlighter.addStyle("css", {
201 | comment : {
202 | exp : /\/\*[^*]*\*+([^\/][^*]*\*+)*\//
203 | },
204 | keywords : {
205 | exp : /@\w[\w\s]*/
206 | },
207 | selectors : {
208 | exp : "([\\w-:\\[.#][^{};>]*)(?={)"
209 | },
210 | properties : {
211 | exp : "([\\w-]+)(?=\\s*:)"
212 | },
213 | units : {
214 | exp : /([0-9])(em|en|px|%|pt)\b/,
215 | replacement : "$1$2"
216 | },
217 | urls : {
218 | exp : /url\([^\)]*\)/
219 | }
220 | });
221 |
222 | CodeHighlighter.addStyle("ruby",{
223 | comment : {
224 | exp : /#[^\n]*/
225 | },
226 | brackets : {
227 | exp : /\(|\)/
228 | },
229 | string : {
230 | exp : /'[^'\\]*(\\.[^'\\]*)*'|"[^"\\]*(\\.[^"\\]*)*"|\%w\(.*\)|`[^`\\]*(\\.[^`\\]*)*`/
231 | },
232 | keywords : {
233 | exp : /\b(do|end|self|class|def|if|module|yield|then|else|for|until|unless|while|elsif|case|when|break|retry|redo|rescue|require|raise|extend)\b/
234 | },
235 | /* Added by Shelly Fisher (shelly@agileevolved.com) */
236 | symbol : {
237 | exp : /([^:])(:[A-Za-z0-9_!?]+)/
238 | }
239 | });
240 |
241 | CodeHighlighter.addStyle("html", {
242 | comment : {
243 | exp: //
244 | },
245 | tag : {
246 | exp: /(<\/?)([a-zA-Z1-9]+\s?)/,
247 | replacement: "$1$2"
248 | },
249 | string : {
250 | exp : /'[^']*'|"[^"]*"/
251 | },
252 | attribute : {
253 | exp: /\b([a-zA-Z-:]+)(=)/,
254 | replacement: "$1$2"
255 | },
256 | doctype : {
257 | exp: //
258 | }
259 | });
260 |
261 | CodeHighlighter.addStyle("javascript",{
262 | comment : {
263 | exp : /(\/\/[^\n]*(\n|$))|(\/\*[^*]*\*+([^\/][^*]*\*+)*\/)/
264 | },
265 | parameter: {
266 | exp: /\bfunction\s?\((.+)\)/
267 | // ,replacement: "$1"
268 | },
269 |
270 | brackets : {
271 | exp : /\(|\)/
272 | },
273 | string : {
274 | exp : /'[^']*'|"[^"]*"/
275 | },
276 | keywords : {
277 | exp : /\b(arguments|break|case|continue|default|delete|do|else|false|for|function|if|in|instanceof|new|null|return|switch|this|true|typeof|var|void|while|with)\b/
278 | },
279 | global : {
280 | exp : /\b(toString|valueOf|window|element|prototype|constructor|document|escape|unescape|parseInt|parseFloat|setTimeout|clearTimeout|setInterval|clearInterval|NaN|isNaN|Infinity|String|Numeric|Array)\b/
281 | }
282 |
283 |
284 | });
285 |
286 | CodeHighlighter.addStyle("yaml", {
287 | keyword : {
288 | exp : /\/\*[^*]*\*+([^\/][^*]*\*+)*\//
289 | },
290 | value : {
291 | exp : /@\w[\w\s]*/
292 | }
293 | });
294 |
295 |
296 |
297 | CodeHighlighter.addStyle("python",{
298 | comment : {
299 | exp : /#[^\n]+/
300 | },
301 | brackets : {
302 | exp : /\(|\)/
303 | },
304 | string : {
305 | exp : /'[^'\\]*(\\.[^'\\]*)*'|"[^"\\]*(\\.[^"\\]*)*"|""".*"""/
306 | },
307 | keywords : {
308 | exp : /\b(and|assert|break|class|continue|def|del|elif|else|except|exec|finally|for|from|global|if|import|in|is|lambda|not|or|pass|print|raise|return|try|while|yield|as|None)\b/
309 | }
310 | });
311 |
312 |
313 | CodeHighlighter.addStyle("applescript",{
314 | comment : {
315 | exp : /--[^\n]+|#![^\n]+/
316 | },
317 | brackets : {
318 | exp : /\(|\)/
319 | },
320 | string : {
321 | exp : /"[^"\\]*(\\.[^"\\]*)*"/
322 | },
323 | keywords : {
324 | exp : /\b(about|above|after|against|and|apart[\s]+from|around|as|aside[\s]+from|at|back|before|beginning|behind|below|beneath|beside|between|but|by|considering|contain|contains|contains|continue|copy|div|does|eighth|else|end|equal|equals|error|every|exit|false|fifth|first|for|fourth|from|front|get|given|global|if|ignoring|in|instead[\s]+of|into|is|it|its|last|local|me|middle|mod|my|ninth|not|of|on|onto|or|out[\s]+of|over|prop|property|put|ref|reference|repeat|return|returning|script|second|set|seventh|since|sixth|some|tell|tenth|that|the|then|third|through|thru|timeout|times|to|transaction|true|try|until|where|while|whose|with|without)\b/
325 | },
326 | global : {
327 | exp : /\b(AppleScript('s)?|current[\s]+application|missing[\s]+value|false|pi|true|version)\b/
328 | }
329 | });
330 |
331 |
332 | CodeHighlighter.addStyle("cpp",{
333 | comment : {
334 | exp : /(\/\/[^\n]*(\n|$))|(\/\*[^*]*\*+([^\/][^*]*\*+)*\/)/
335 | },
336 | brackets : {
337 | exp : /\(|\)/
338 | },
339 | string : {
340 | exp : /"[^"\\]*(\\.[^"\\]*)*"/
341 | },
342 | keywords : {
343 | exp : /\b(break|case|catch|class|const|__finally|__exception|__try|const_cast|continue|private|public|protected|__declspec|default|delete|deprecated|dllexport|dllimport|do|dynamic_cast|else|enum|explicit|extern|if|for|friend|goto|inline|mutable|naked|namespace|new|noinline|noreturn|nothrow|register|reinterpret_cast|return|selectany|sizeof|static|static_cast|struct|switch|template|this|thread|throw|true|false|try|typedef|typeid|typename|union|using|uuid|virtual|void|volatile|whcar_t|while)\b/
344 | },
345 |
346 | datatype: {
347 | exp : /\b(ATOM|BOOL|BOOLEAN|BYTE|CHAR|COLORREF|DWORD|DWORDLONG|DWORD_PTR|DWORD32|DWORD64|FLOAT|HACCEL|HALF_PTR|HANDLE|HBITMAP|HBRUSH|HCOLORSPACE|HCONV|HCONVLIST|HCURSOR|HDC|HDDEDATA|HDESK|HDROP|HDWP|HENHMETAFILE|HFILE|HFONT|HGDIOBJ|HGLOBAL|HHOOK|HICON|HINSTANCE|HKEY|HKL|HLOCAL|HMENU|HMETAFILE|HMODULE|HMONITOR|HPALETTE|HPEN|HRESULT|HRGN|HRSRC|HSZ|HWINSTA|HWND|INT|INT_PTR|INT32|INT64|LANGID|LCID|LCTYPE|LGRPID|LONG|LONGLONG|LONG_PTR|LONG32|LONG64|LPARAM|LPBOOL|LPBYTE|LPCOLORREF|LPCSTR|LPCTSTR|LPCVOID|LPCWSTR|LPDWORD|LPHANDLE|LPINT|LPLONG|LPSTR|LPTSTR|LPVOID|LPWORD|LPWSTR|LRESULT|PBOOL|PBOOLEAN|PBYTE|PCHAR|PCSTR|PCTSTR|PCWSTR|PDWORDLONG|PDWORD_PTR|PDWORD32|PDWORD64|PFLOAT|PHALF_PTR|PHANDLE|PHKEY|PINT|PINT_PTR|PINT32|PINT64|PLCID|PLONG|PLONGLONG|PLONG_PTR|PLONG32|PLONG64|POINTER_32|POINTER_64|PSHORT|PSIZE_T|PSSIZE_T|PSTR|PTBYTE|PTCHAR|PTSTR|PUCHAR|PUHALF_PTR|PUINT|PUINT_PTR|PUINT32|PUINT64|PULONG|PULONGLONG|PULONG_PTR|PULONG32|PULONG64|PUSHORT|PVOID|PWCHAR|PWORD|PWSTR|SC_HANDLE|SC_LOCK|SERVICE_STATUS_HANDLE|SHORT|SIZE_T|SSIZE_T|TBYTE|TCHAR|UCHAR|UHALF_PTR|UINT|UINT_PTR|UINT32|UINT64|ULONG|ULONGLONG|ULONG_PTR|ULONG32|ULONG64|USHORT|USN|VOID|WCHAR|WORD|WPARAM|WPARAM|WPARAM|char|bool|short|int|__int32|__int64|__int8|__int16|long|float|double|__wchar_t|clock_t|_complex|_dev_t|_diskfree_t|div_t|ldiv_t|_exception|_EXCEPTION_POINTERS|FILE|_finddata_t|_finddatai64_t|_wfinddata_t|_wfinddatai64_t|__finddata64_t|__wfinddata64_t|_FPIEEE_RECORD|fpos_t|_HEAPINFO|_HFILE|lconv|intptr_t|jmp_buf|mbstate_t|_off_t|_onexit_t|_PNH|ptrdiff_t|_purecall_handler|sig_atomic_t|size_t|_stat|__stat64|_stati64|terminate_function|time_t|__time64_t|_timeb|__timeb64|tm|uintptr_t|_utimbuf|va_list|wchar_t|wctrans_t|wctype_t|wint_t|signed)\b/
348 | },
349 |
350 | preprocessor : {
351 | exp : /^ *#.*/gm
352 | }
353 | });
354 |
355 |
356 | // http://www.undermyhat.org/blog/wp-content/uploads/2009/09/shBrushClojure.js
357 | CodeHighlighter.addStyle("clojure",{
358 | comment : {
359 | exp : /;[^\]]+$/
360 | },
361 | string : {
362 | exp : /"[^"\\]*(\\.[^"\\]*)*"/m
363 | },
364 | functions : {
365 | exp : /\b(:arglists|:doc|:file|:line|:macro|:name|:ns|:private|:tag|:test|new|alias|alter|and|apply|assert|class|cond|conj|count|def|defmacro|defn|defstruct|deref|do|doall|dorun|doseq|dosync|eval|filter|finally|find|first|fn|gen-class|gensym|if|import|inc|keys|let|list|loop|map|ns|or|print|println|quote|rand|recur|reduce|ref|repeat|require|rest|send|seq|set|sort|str|struct|sync|take|test|throw|trampoline|try|type|use|var|vec|when|while)\b/gmi
366 | },
367 |
368 | keyword : {
369 | exp : /\[|\]/g
370 | },
371 |
372 | symbols : {
373 | exp : /'[a-z][A-Za-z0-9_]*/g
374 | },
375 |
376 | keywords: {
377 | exp: /(:[a-z][A-Za-z0-9_]*)/g
378 | }
379 | });
380 |
381 |
382 |
383 |
384 | CodeHighlighter.addStyle("haskell",{
385 | comment : {
386 | exp : /(\-\-.*$)|(\{\-[\s\S]*?\-\})/gm
387 | },
388 | keywords : {
389 | exp : /\b(as|case|of|class|data|datafamily|data instance|default|deriving|deriving instance|do|forall|foreign|hiding|if|then|else|import|infix|infixl|infixr|instance|let|in|mdo|module|newtype|proc|qualified|rec|type|type family|type instance|where)\b/
390 | },
391 | string : {
392 | exp : /'[^']*'|"[^"]*"/
393 | }
394 | });
--------------------------------------------------------------------------------
/public/javascripts/vendors/difflib.js:
--------------------------------------------------------------------------------
1 | /***
2 | This is part of jsdifflib v1.0.
3 |
4 | Copyright (c) 2007, Snowtide Informatics Systems, Inc.
5 | All rights reserved.
6 |
7 | Redistribution and use in source and binary forms, with or without modification,
8 | are permitted provided that the following conditions are met:
9 |
10 | * Redistributions of source code must retain the above copyright notice, this
11 | list of conditions and the following disclaimer.
12 | * Redistributions in binary form must reproduce the above copyright notice,
13 | this list of conditions and the following disclaimer in the documentation
14 | and/or other materials provided with the distribution.
15 | * Neither the name of the Snowtide Informatics Systems nor the names of its
16 | contributors may be used to endorse or promote products derived from this
17 | software without specific prior written permission.
18 |
19 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
20 | EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 | OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
22 | SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23 | INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
24 | TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
25 | BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
27 | ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
28 | DAMAGE.
29 | ***/
30 | /* Author: Chas Emerick */
31 | __whitespace = {" ":true, "\t":true, "\n":true, "\f":true, "\r":true};
32 |
33 | difflib = {
34 | defJF: function (c) {
35 | return c in __whitespace;
36 | },
37 |
38 | stripLinebreaks: function (str) { return str.replace(/^[\n\r]*|[\n\r]*$/g, ""); },
39 |
40 | stringAsLines: function (str) {
41 | var lfpos = str.indexOf("\n"),
42 | crpos = str.indexOf("\r"),
43 | linebreak = ((lfpos > -1 && crpos > -1) || crpos < 0) ? "\n" : "\r",
44 | l = str.split(linebreak);
45 | for (var i = 0; i < l.length; i++) {
46 | l[i] = difflib.stripLinebreaks(l[i]);
47 | }
48 | return l;
49 | },
50 |
51 | // iteration-based reduce implementation
52 | __reduce: function (func, list, initial) {
53 | if (initial != null) {
54 | var value = initial,
55 | idx = 0;
56 | } else if (list) {
57 | var value = list[0],
58 | idx = 1;
59 | } else {
60 | return null;
61 | }
62 |
63 | for (; idx < list.length; idx++) {
64 | value = func(value, list[idx]);
65 | }
66 |
67 | return value;
68 | },
69 |
70 | // comparison function for sorting lists of numeric tuples
71 | __ntuplecomp: function (a, b) {
72 | var mlen = Math.max(a.length, b.length);
73 | for (var i = 0; i < mlen; i++) {
74 | if (a[i] < b[i]) return -1;
75 | if (a[i] > b[i]) return 1;
76 | }
77 |
78 | return a.length == b.length ? 0 : (a.length < b.length ? -1 : 1);
79 | },
80 |
81 | __calculate_ratio: function (matches, length) {
82 | return length ? 2.0 * matches / length : 1.0;
83 | },
84 |
85 | // returns a function that returns true if a key passed to the returned function
86 | // is in the dict (js object) provided to this function; replaces being able to
87 | // carry around dict.has_key in python...
88 | __isindict: function (dict) {
89 | return function (key) { return key in dict; };
90 | },
91 |
92 | // replacement for python's dict.get function -- need easy default values
93 | __dictget: function (dict, key, defaultValue) {
94 | return key in dict ? dict[key] : defaultValue;
95 | },
96 |
97 | SequenceMatcher: function (a, b, isjunk) {
98 | this.set_seqs = function (a, b) {
99 | this.set_seq1(a);
100 | this.set_seq2(b);
101 | }
102 |
103 | this.set_seq1 = function (a) {
104 | if (a == this.a) return;
105 | this.a = a;
106 | this.matching_blocks = this.opcodes = null;
107 | }
108 |
109 | this.set_seq2 = function (b) {
110 | if (b == this.b) return;
111 | this.b = b;
112 | this.matching_blocks = this.opcodes = this.fullbcount = null;
113 | this.__chain_b();
114 | }
115 |
116 | this.__chain_b = function () {
117 | var b = this.b,
118 | n = b.length,
119 | b2j = this.b2j = {},
120 | populardict = {};
121 | for (var i = 0; i < b.length; i++) {
122 | var elt = b[i];
123 | if (elt in b2j) {
124 | var indices = b2j[elt];
125 | if (n >= 200 && indices.length * 100 > n) {
126 | populardict[elt] = 1;
127 | delete b2j[elt];
128 | } else {
129 | indices.push(i);
130 | }
131 | } else {
132 | b2j[elt] = [i];
133 | }
134 | }
135 |
136 | // debugger
137 | for (var elt in populardict)
138 | delete b2j[elt];
139 |
140 | var isjunk = this.isjunk,
141 | junkdict = {};
142 | if (isjunk) {
143 | for (var elt in populardict) {
144 | if (isjunk(elt)) {
145 | junkdict[elt] = 1;
146 | delete populardict[elt];
147 | }
148 | }
149 | for (var elt in b2j) {
150 | if (isjunk(elt)) {
151 | junkdict[elt] = 1;
152 | delete b2j[elt];
153 | }
154 | }
155 | }
156 |
157 | this.isbjunk = difflib.__isindict(junkdict);
158 | this.isbpopular = difflib.__isindict(populardict);
159 | }
160 |
161 | this.find_longest_match = function (alo, ahi, blo, bhi) {
162 | var a = this.a,
163 | b = this.b,
164 | b2j = this.b2j,
165 | isbjunk = this.isbjunk,
166 | besti = alo,
167 | bestj = blo,
168 | bestsize = 0,
169 | j = null,
170 |
171 | j2len = {},
172 | nothing = [];
173 |
174 | for (var i = alo; i < ahi; i++) {
175 | var newj2len = {},
176 | jdict = difflib.__dictget(b2j, a[i], nothing);
177 | for (var jkey in jdict) {
178 | j = jdict[jkey];
179 | if (j < blo) continue;
180 | if (j >= bhi) break;
181 | newj2len[j] = k = difflib.__dictget(j2len, j - 1, 0) + 1;
182 | if (k > bestsize) {
183 | besti = i - k + 1;
184 | bestj = j - k + 1;
185 | bestsize = k;
186 | }
187 | }
188 | j2len = newj2len;
189 | }
190 |
191 | while (besti > alo && bestj > blo && !isbjunk(b[bestj - 1]) && a[besti - 1] == b[bestj - 1]) {
192 | besti--;
193 | bestj--;
194 | bestsize++;
195 | }
196 |
197 | while (besti + bestsize < ahi && bestj + bestsize < bhi &&
198 | !isbjunk(b[bestj + bestsize]) &&
199 | a[besti + bestsize] == b[bestj + bestsize]) {
200 | bestsize++;
201 | }
202 |
203 | while (besti > alo && bestj > blo && isbjunk(b[bestj - 1]) && a[besti - 1] == b[bestj - 1]) {
204 | besti--;
205 | bestj--;
206 | bestsize++;
207 | }
208 |
209 | while (besti + bestsize < ahi && bestj + bestsize < bhi && isbjunk(b[bestj + bestsize]) &&
210 | a[besti + bestsize] == b[bestj + bestsize]) {
211 | bestsize++;
212 | }
213 |
214 | return [besti, bestj, bestsize];
215 | }
216 |
217 | this.get_matching_blocks = function () {
218 | if (this.matching_blocks != null) return this.matching_blocks;
219 | var la = this.a.length,
220 | lb = this.b.length,
221 | queue = [[0, la, 0, lb]],
222 | matching_blocks = [],
223 | alo, ahi, blo, bhi, qi, i, j, k, x;
224 | while (queue.length) {
225 | qi = queue.pop();
226 | alo = qi[0];
227 | ahi = qi[1];
228 | blo = qi[2];
229 | bhi = qi[3];
230 | x = this.find_longest_match(alo, ahi, blo, bhi);
231 | i = x[0];
232 | j = x[1];
233 | k = x[2];
234 |
235 | if (k) {
236 | matching_blocks.push(x);
237 | if (alo < i && blo < j)
238 | queue.push([alo, i, blo, j]);
239 | if (i+k < ahi && j+k < bhi)
240 | queue.push([i + k, ahi, j + k, bhi]);
241 | }
242 | }
243 |
244 | matching_blocks.sort(difflib.__ntuplecomp);
245 |
246 | var i1 = j1 = k1 = block = 0,
247 | non_adjacent = [];
248 | for (var idx in matching_blocks) {
249 | block = matching_blocks[idx];
250 | i2 = block[0];
251 | j2 = block[1];
252 | k2 = block[2];
253 | if (i1 + k1 == i2 && j1 + k1 == j2) {
254 | k1 += k2;
255 | } else {
256 | if (k1) non_adjacent.push([i1, j1, k1]);
257 | i1 = i2;
258 | j1 = j2;
259 | k1 = k2;
260 | }
261 | }
262 |
263 | if (k1) non_adjacent.push([i1, j1, k1]);
264 |
265 | non_adjacent.push([la, lb, 0]);
266 | this.matching_blocks = non_adjacent;
267 | return this.matching_blocks;
268 | }
269 |
270 | this.get_opcodes = function () {
271 | if (this.opcodes != null) return this.opcodes;
272 | var i = 0,
273 | j = 0,
274 | answer = [];
275 | this.opcodes = answer;
276 | var block, ai, bj, size, tag,
277 | blocks = this.get_matching_blocks();
278 | for (var idx in blocks) {
279 | block = blocks[idx];
280 | ai = block[0];
281 | bj = block[1];
282 | size = block[2];
283 | tag = '';
284 | if (i < ai && j < bj) {
285 | tag = 'replace';
286 | } else if (i < ai) {
287 | tag = 'delete';
288 | } else if (j < bj) {
289 | tag = 'insert';
290 | }
291 | if (tag) answer.push([tag, i, ai, j, bj]);
292 | i = ai + size;
293 | j = bj + size;
294 |
295 | if (size) answer.push(['equal', ai, i, bj, j]);
296 | }
297 |
298 | return answer;
299 | }
300 |
301 | // this is a generator function in the python lib, which of course is not supported in javascript
302 | // the reimplementation builds up the grouped opcodes into a list in their entirety and returns that.
303 | this.get_grouped_opcodes = function (n) {
304 | if (!n) n = 3;
305 | var codes = this.get_opcodes();
306 | if (!codes) codes = [["equal", 0, 1, 0, 1]];
307 | var code, tag, i1, i2, j1, j2;
308 | if (codes[0][0] == 'equal') {
309 | code = codes[0];
310 | tag = code[0];
311 | i1 = code[1];
312 | i2 = code[2];
313 | j1 = code[3];
314 | j2 = code[4];
315 | codes[0] = [tag, Math.max(i1, i2 - n), i2, Math.max(j1, j2 - n), j2];
316 | }
317 | if (codes[codes.length - 1][0] == 'equal') {
318 | code = codes[codes.length - 1];
319 | tag = code[0];
320 | i1 = code[1];
321 | i2 = code[2];
322 | j1 = code[3];
323 | j2 = code[4];
324 | codes[codes.length - 1] = [tag, i1, Math.min(i2, i1 + n), j1, Math.min(j2, j1 + n)];
325 | }
326 |
327 | var nn = n + n;
328 | var groups = [];
329 | for (var idx in codes) {
330 | code = codes[idx];
331 | tag = code[0];
332 | i1 = code[1];
333 | i2 = code[2];
334 | j1 = code[3];
335 | j2 = code[4];
336 | if (tag == 'equal' && i2 - i1 > nn) {
337 | groups.push([tag, i1, Math.min(i2, i1 + n), j1, Math.min(j2, j1 + n)]);
338 | i1 = Math.max(i1, i2-n);
339 | j1 = Math.max(j1, j2-n);
340 | }
341 |
342 | groups.push([tag, i1, i2, j1, j2]);
343 | }
344 |
345 | if (groups && groups[groups.length - 1][0] == 'equal') groups.pop();
346 |
347 | return groups;
348 | }
349 |
350 | this.ratio = function () {
351 | matches = difflib.__reduce(
352 | function (sum, triple) { return sum + triple[triple.length - 1]; },
353 | this.get_matching_blocks(), 0);
354 | return difflib.__calculate_ratio(matches, this.a.length + this.b.length);
355 | }
356 |
357 | this.quick_ratio = function () {
358 | var fullbcount, elt;
359 | if (this.fullbcount == null) {
360 | this.fullbcount = fullbcount = {};
361 | for (var i = 0; i < this.b.length; i++) {
362 | elt = this.b[i];
363 | fullbcount[elt] = difflib.__dictget(fullbcount, elt, 0) + 1;
364 | }
365 | }
366 | fullbcount = this.fullbcount;
367 |
368 | var avail = {},
369 | availhas = difflib.__isindict(avail),
370 | matches = numb = 0;
371 | for (var i = 0; i < this.a.length; i++) {
372 | elt = this.a[i];
373 | if (availhas(elt)) {
374 | numb = avail[elt];
375 | } else {
376 | numb = difflib.__dictget(fullbcount, elt, 0);
377 | }
378 | avail[elt] = numb - 1;
379 | if (numb > 0) matches++;
380 | }
381 |
382 | return difflib.__calculate_ratio(matches, this.a.length + this.b.length);
383 | }
384 |
385 | this.real_quick_ratio = function () {
386 | var la = this.a.length,
387 | lb = this.b.length;
388 | return _calculate_ratio(Math.min(la, lb), la + lb);
389 | }
390 |
391 | this.isjunk = isjunk ? isjunk : difflib.defJF;
392 | this.a = this.b = null;
393 | this.set_seqs(a, b);
394 | }
395 | }
396 |
--------------------------------------------------------------------------------
/public/javascripts/vendors/diffview.js:
--------------------------------------------------------------------------------
1 | /***
2 | This is part of jsdifflib v1.0.
3 |
4 | Copyright (c) 2007, Snowtide Informatics Systems, Inc.
5 | All rights reserved.
6 |
7 | Redistribution and use in source and binary forms, with or without modification,
8 | are permitted provided that the following conditions are met:
9 |
10 | * Redistributions of source code must retain the above copyright notice, this
11 | list of conditions and the following disclaimer.
12 | * Redistributions in binary form must reproduce the above copyright notice,
13 | this list of conditions and the following disclaimer in the documentation
14 | and/or other materials provided with the distribution.
15 | * Neither the name of the Snowtide Informatics Systems nor the names of its
16 | contributors may be used to endorse or promote products derived from this
17 | software without specific prior written permission.
18 |
19 | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY
20 | EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
21 | OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT
22 | SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
23 | INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
24 | TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
25 | BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
26 | CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
27 | ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
28 | DAMAGE.
29 | ***/
30 | /* Author: Chas Emerick */
31 | diffview = {
32 | /**
33 | * Builds and returns a visual diff view. The single parameter, `params', should contain
34 | * the following values:
35 | *
36 | * - baseTextLines: the array of strings that was used as the base text input to SequenceMatcher
37 | * - newTextLines: the array of strings that was used as the new text input to SequenceMatcher
38 | * - opcodes: the array of arrays returned by SequenceMatcher.get_opcodes()
39 | * - baseTextName: the title to be displayed above the base text listing in the diff view; defaults
40 | * to "Base Text"
41 | * - newTextName: the title to be displayed above the new text listing in the diff view; defaults
42 | * to "New Text"
43 | * - contextSize: the number of lines of context to show around differences; by default, all lines
44 | * are shown
45 | * - viewType: if 0, a side-by-side diff view is generated (default); if 1, an inline diff view is
46 | * generated
47 | */
48 | buildView: function (prms) {
49 | var baseTextLines = prms.baseTextLines;
50 | newTextLines = prms.newTextLines;
51 | opcodes = prms.opcodes;
52 | baseTextName = prms.baseTextName // ? params.baseTextName : "Base Text";
53 | newTextName = prms.newTextName //? params.newTextName : "New Text";
54 |
55 | var d = document;
56 |
57 | function celt (name, clazz) {
58 | var e = d.createElement(name);
59 | e.className = clazz;
60 | return e;
61 | }
62 |
63 | function telt (name, text) {
64 | var e = d.createElement(name);
65 | e.appendChild(d.createTextNode(text));
66 | return e;
67 | }
68 |
69 | function ctelt (name, clazz, text) {
70 | var e = d.createElement(name);
71 | e.className = clazz;
72 | e.appendChild(d.createTextNode(text));
73 | return e;
74 | }
75 |
76 | var tdata = d.createElement("thead");
77 | var node = d.createElement("tr");
78 | tdata.appendChild(node);
79 |
80 | node.appendChild(d.createElement("th"));
81 | node.appendChild(ctelt("th", "texttitle", baseTextName));
82 | node.appendChild(d.createElement("th"));
83 | node.appendChild(ctelt("th", "texttitle", newTextName));
84 |
85 | tdata = [tdata];
86 |
87 | var rows = [];
88 | var node2;
89 |
90 | /**
91 | * Adds two cells to the given row; if the given row corresponds to a real
92 | * line number (based on the line index tidx and the endpoint of the
93 | * range in question tend), then the cells will contain the line number
94 | * and the line of text from textLines at position tidx (with the class of
95 | * the second cell set to the name of the change represented), and tidx + 1 will
96 | * be returned. Otherwise, tidx is returned, and two empty cells are added
97 | * to the given row.
98 | */
99 | function addCells (row, tidx, tend, textLines, change) {
100 | if (tidx < tend) {
101 | row.appendChild(telt("th", (tidx + 1).toString()));
102 | row.appendChild(ctelt("td", change, textLines[tidx].replace(/\t/g, "\u00a0\u00a0\u00a0\u00a0")));
103 | return tidx + 1;
104 | } else {
105 | row.appendChild(d.createElement("th"));
106 | row.appendChild(celt("td", "empty"));
107 | return tidx;
108 | }
109 | }
110 |
111 |
112 | for (var idx = 0; idx < opcodes.length; idx++) {
113 | code = opcodes[idx];
114 | change = code[0];
115 | var b = code[1],
116 | be = code[2],
117 | n = code[3],
118 | ne = code[4],
119 | rowcnt = Math.max(be - b, ne - n),
120 | toprows = [],
121 | botrows = [];
122 | for (var i = 0; i < rowcnt; i++) {
123 | toprows.push(node = d.createElement("tr"));
124 | b = addCells(node, b, be, baseTextLines, change);
125 | n = addCells(node, n, ne, newTextLines, change);
126 | }
127 |
128 | for (var i = 0; i < toprows.length; i++) rows.push(toprows[i]);
129 | for (var i = 0; i < botrows.length; i++) rows.push(botrows[i]);
130 | }
131 |
132 |
133 | tdata.push(node = d.createElement("tbody"));
134 |
135 |
136 | for( var i = 0; i < rows.length; i++ ) {
137 | node.appendChild(rows[i]);
138 | }
139 |
140 | node = celt("table", "diff");
141 | for( var i = 0; i < tdata.length; i++ ){
142 | node.appendChild(tdata[i]);
143 | }
144 |
145 | return node;
146 | }
147 | };
--------------------------------------------------------------------------------
/public/javascripts/vendors/jsdiff.js:
--------------------------------------------------------------------------------
1 | /*
2 | * Javascript Diff Algorithm
3 | * By John Resig (http://ejohn.org/)
4 | * Modified by Chu Alan "sprite"
5 | *
6 | * Released under the MIT license.
7 | *
8 | * More Info:
9 | * http://ejohn.org/projects/javascript-diff-algorithm/
10 | */
11 |
12 | function escape(s) {
13 | var n = s;
14 | n = n.replace(/&/g, "&");
15 | n = n.replace(//g, ">");
17 | n = n.replace(/"/g, """);
18 |
19 | return n;
20 | }
21 |
22 | function diffString( o, n ) {
23 | o = o.replace(/\s+$/, '');
24 | n = n.replace(/\s+$/, '');
25 |
26 | var out = diff(o == "" ? [] : o.split(/\s+/), n == "" ? [] : n.split(/\s+/) );
27 | var str = "";
28 |
29 | var oSpace = o.match(/\s+/g);
30 | if (oSpace == null) {
31 | oSpace = ["\n"];
32 | } else {
33 | oSpace.push("\n");
34 | }
35 | var nSpace = n.match(/\s+/g);
36 | if (nSpace == null) {
37 | nSpace = ["\n"];
38 | } else {
39 | nSpace.push("\n");
40 | }
41 |
42 | if (out.n.length == 0) {
43 | for (var i = 0; i < out.o.length; i++) {
44 | str += '' + escape(out.o[i]) + oSpace[i] + "";
45 | }
46 | } else {
47 | if (out.n[0].text == null) {
48 | for (n = 0; n < out.o.length && out.o[n].text == null; n++) {
49 | str += '' + escape(out.o[n]) + oSpace[n] + "";
50 | }
51 | }
52 |
53 | for ( var i = 0; i < out.n.length; i++ ) {
54 | if (out.n[i].text == null) {
55 | str += '' + escape(out.n[i]) + nSpace[i] + "";
56 | } else {
57 | var pre = "";
58 |
59 | for (n = out.n[i].row + 1; n < out.o.length && out.o[n].text == null; n++ ) {
60 | pre += '' + escape(out.o[n]) + oSpace[n] + "";
61 | }
62 | str += " " + out.n[i].text + nSpace[i] + pre;
63 | }
64 | }
65 | }
66 |
67 | return str;
68 | }
69 |
70 | function randomColor() {
71 | return "rgb(" + (Math.random() * 100) + "%, " +
72 | (Math.random() * 100) + "%, " +
73 | (Math.random() * 100) + "%)";
74 | }
75 | /*
76 | function diffString2( o, n ) {
77 | o = o.replace(/\s+$/, '');
78 | n = n.replace(/\s+$/, '');
79 |
80 | var out = diff(o == "" ? [] : o.split(/\s+/), n == "" ? [] : n.split(/\s+/) );
81 |
82 | var oSpace = o.match(/\s+/g);
83 | if (oSpace == null) {
84 | oSpace = ["\n"];
85 | } else {
86 | oSpace.push("\n");
87 | }
88 | var nSpace = n.match(/\s+/g);
89 | if (nSpace == null) {
90 | nSpace = ["\n"];
91 | } else {
92 | nSpace.push("\n");
93 | }
94 |
95 | var os = "";
96 | var colors = new Array();
97 | for (var i = 0; i < out.o.length; i++) {
98 | colors[i] = randomColor();
99 |
100 | if (out.o[i].text != null) {
101 | os += '' +
102 | escape(out.o[i].text) + oSpace[i] + "";
103 | } else {
104 | os += "" + escape(out.o[i]) + oSpace[i] + "";
105 | }
106 | }
107 |
108 | var ns = "";
109 | for (var i = 0; i < out.n.length; i++) {
110 | if (out.n[i].text != null) {
111 | ns += '' +
112 | escape(out.n[i].text) + nSpace[i] + "";
113 | } else {
114 | ns += "" + escape(out.n[i]) + nSpace[i] + "";
115 | }
116 | }
117 |
118 | return { o : os , n : ns };
119 | }
120 | */
121 | function diff( o, n ) {
122 | var ns = new Object();
123 | var os = new Object();
124 |
125 | for ( var i = 0; i < n.length; i++ ) {
126 | if ( ns[ n[i] ] == null )
127 | ns[ n[i] ] = { rows: new Array(), o: null };
128 | ns[ n[i] ].rows.push( i );
129 | }
130 |
131 | for ( var i = 0; i < o.length; i++ ) {
132 | if ( os[ o[i] ] == null )
133 | os[ o[i] ] = { rows: new Array(), n: null };
134 | os[ o[i] ].rows.push( i );
135 | }
136 |
137 | for ( var i in ns ) {
138 | if ( ns[i].rows.length == 1 && typeof(os[i]) != "undefined" && os[i].rows.length == 1 ) {
139 | n[ ns[i].rows[0] ] = { text: n[ ns[i].rows[0] ], row: os[i].rows[0] };
140 | o[ os[i].rows[0] ] = { text: o[ os[i].rows[0] ], row: ns[i].rows[0] };
141 | }
142 | }
143 |
144 | for ( var i = 0; i < n.length - 1; i++ ) {
145 | if ( n[i].text != null && n[i+1].text == null && n[i].row + 1 < o.length && o[ n[i].row + 1 ].text == null &&
146 | n[i+1] == o[ n[i].row + 1 ] ) {
147 | n[i+1] = { text: n[i+1], row: n[i].row + 1 };
148 | o[n[i].row+1] = { text: o[n[i].row+1], row: i + 1 };
149 | }
150 | }
151 |
152 | for ( var i = n.length - 1; i > 0; i-- ) {
153 | if ( n[i].text != null && n[i-1].text == null && n[i].row > 0 && o[ n[i].row - 1 ].text == null &&
154 | n[i-1] == o[ n[i].row - 1 ] ) {
155 | n[i-1] = { text: n[i-1], row: n[i].row - 1 };
156 | o[n[i].row-1] = { text: o[n[i].row-1], row: i - 1 };
157 | }
158 | }
159 |
160 | return { o: o, n: n };
161 | }
162 |
--------------------------------------------------------------------------------
/public/javascripts/vendors/jsonp.js:
--------------------------------------------------------------------------------
1 | // See an updated version of this in it's own git repo:
2 | // http://github.com/dandean/Ajax.JSONRequest
3 |
4 | /* JSON-P implementation for Prototype.js somewhat by Dan Dean (http://www.dandean.com)
5 | *
6 | * *HEAVILY* based on Tobie Langel's version: http://gist.github.com/145466.
7 | * Might as well just call this an iteration.
8 | *
9 | * This version introduces:
10 | * - onCreate and onFailure callback options.
11 | * - option to not invoke request upon instantiation.
12 | *
13 | * Tested in Firefox 3/3.5, Safari 4
14 | *
15 | * Note: while I still think JSON-P is an inherantly flawed technique,
16 | * there are some valid use cases which this can provide for.
17 | *
18 | * See examples below for usage.
19 | */
20 | window.JSP = Class.create(Ajax.Base, (function() {
21 | var id = 0, head = document.getElementsByTagName('head')[0];
22 | return {
23 | initialize: function($super, url, options) {
24 | $super(options);
25 | this.options.url = url;
26 | this.options.callbackParamName = this.options.callbackParamName || 'callback';
27 | this.options.timeout = this.options.timeout || 10000; // Default timeout: 10 seconds
28 | this.options.invokeImmediately = (!Object.isUndefined(this.options.invokeImmediately)) ? this.options.invokeImmediately : true ;
29 | this.responseJSON = {};
30 | if (this.options.invokeImmediately) {
31 | this.request();
32 | }
33 |
34 | Ajax.Responders.dispatch('onCreate', this);
35 | },
36 |
37 | /**
38 | * Ajax.JSONRequest#_cleanup() -> "undefined"
39 | *
40 | * Cleans up after the request
41 | **/
42 | _cleanup: function() {
43 | if (this.timeout) {
44 | clearTimeout(this.timeout);
45 | this.timeout = null;
46 | }
47 | if (this.script && Object.isElement(this.script)) {
48 | this.script.remove();
49 | this.script = null;
50 | }
51 | },
52 |
53 | /**
54 | * Ajax.JSONRequest#request() -> "undefined"
55 | *
56 | * Invokes the JSON-P request lifecycle
57 | **/
58 | request: function() {
59 | // Define local vars
60 | var key = this.options.callbackParamName,
61 | name = '_prototypeJSONPCallback_' + (id++);
62 |
63 | // Add callback as a parameter and build request URL
64 | this.options.parameters[key] = name;
65 | var url = this.options.url + ((this.options.url.include('?') ? '&' : '?') + Object.toQueryString(this.options.parameters));
66 |
67 | // Define callback function
68 | window[name] = function(response) {
69 | this._cleanup(); // Garbage collection
70 | window[name] = undefined;
71 |
72 |
73 | if( typeof(response) == 'Object' )
74 | this.responseJSON = response;
75 | else
76 | this.responseText = response;
77 |
78 | try {
79 | Ajax.Responders.dispatch('onComplete', this, response);
80 |
81 | if (Object.isFunction(this.options.onComplete)) {
82 | this.options.onComplete.call(this, this);
83 | }
84 |
85 | if (Object.isFunction(this.options.onSuccess)) {
86 | this.options.onSuccess.call(this,this);
87 | }
88 | } catch( ex ) {
89 | Ajax.Responders.dispatch('onException', this, ex);
90 | throw ex;
91 | }
92 |
93 | }.bind(this);
94 |
95 | this.script = new Element('script', { type: 'text/javascript', src: url });
96 |
97 | if (Object.isFunction(this.options.onCreate)) {
98 | this.options.onCreate.call(this, this);
99 | }
100 |
101 |
102 | head.appendChild(this.script);
103 |
104 | this.timeout = setTimeout(function() {
105 | this._cleanup();
106 | window[name] = Prototype.emptyFunction;
107 | if (Object.isFunction(this.options.onFailure)) {
108 | this.options.onFailure.call(this, this);
109 | }
110 | }.bind(this), this.options.timeout);
111 | }
112 | };
113 | })());
--------------------------------------------------------------------------------
/public/javascripts/vendors/prettyDate.js:
--------------------------------------------------------------------------------
1 | /* pretty date http://ejohn.org/files/pretty.js */
2 | /*
3 | * JavaScript Pretty Date
4 | * Copyright (c) 2008 John Resig (jquery.com)
5 | * Licensed under the MIT license.
6 | */
7 |
8 | // Takes an ISO time and returns a string representing how
9 | // long ago the date represents.
10 | function prettyDate(time){
11 | var date = new Date((time || "").replace(/-/g,"/").replace(/[TZ]/g," ")),
12 | diff = (((new Date()).getTime() - date.getTime()) / 1000),
13 | day_diff = Math.floor(diff / 86400);
14 |
15 | if ( isNaN(day_diff) || day_diff < 0 || day_diff >= 31 )
16 | return;
17 |
18 | return day_diff == 0 && (
19 | diff < 60 && "just now" ||
20 | diff < 120 && "1 minute ago" ||
21 | diff < 3600 && Math.floor( diff / 60 ) + " minutes ago" ||
22 | diff < 7200 && "1 hour ago" ||
23 | diff < 86400 && Math.floor( diff / 3600 ) + " hours ago") ||
24 | day_diff == 1 && "Yesterday" ||
25 | day_diff < 7 && day_diff + " days ago" ||
26 | day_diff < 31 && Math.ceil( day_diff / 7 ) + " weeks ago";
27 | }
28 |
29 | /* alias */
30 | var pd = prettyDate;
--------------------------------------------------------------------------------
/public/styles.css:
--------------------------------------------------------------------------------
1 | body { font-size: 12px; font-family: Arial; padding: 0px; margin: 0px }
2 | .clear { clear:both }
3 | a { color: #4183C4; text-decoration: none; }
4 | a:active { outline: none; }
5 | :focus { -moz-outline-style: none; outline: none;}
6 | .p { padding: 10px; }
7 | img { border: 0px}
8 |
9 | #content { min-width: 940px }
10 |
11 | #finder { width: 100%; overflow: hidden; }
12 |
13 | #r_w { width: 100%; background-color: #EAEAEA; border-bottom: 1px solid #CCC;}
14 | .tbb { border-bottom: 3px solid #CCC;} /* thick bottom border */
15 |
16 |
17 |
18 | /* logo */
19 | .big { font-size: 14px; font-weight: bold;}
20 | #r_w span { margin-right: 20px; }
21 | #in { position: fixed; background-color: #4F4A45; color: white; top: 0px; right: 0px; padding: 5px;}
22 |
23 | #b_w { width: 79.9%; position: relative; overflow: hidden; overflow-x: auto; height: 300px; float: left;}
24 | .panel { float: left; width: 200px; border-right: 1px solid #CCC; overflow: hidden; overflow-y: auto;
25 | height: 300px }
26 |
27 | .files { padding: 0; margin: 0; }
28 | .files li { list-style:none outside none; border-bottom: 1px solid #CCC; background-color: #F8F8F8; }
29 | #i_w { width: 20%; border-left: 1px solid #CCC; float: left; height: 300px; overflow-y: auto; }
30 | /*.padding { padding: 10px; }*/
31 | #i_w .commits { height: 200px; overflow: auto}
32 |
33 | .t { padding: 10px; border-bottom: 1px solid #CCC; font-size: 14px; font-weight: bold} /* title */
34 |
35 | .tree { background: #F8F8F8 url('./img/la.gif') no-repeat 95% 50%; font-weight: bold; }
36 | .ico { background:url('./img/txt.gif') no-repeat 3px 50%; display: block;}
37 | .tree .ico { background-image: url('./img/dir.gif'); }
38 | .cur { background: #3D8CFF url('./img/la_h.gif') no-repeat 95% 50% !important;}
39 | .cur a { color: white;}
40 | .blob { background-image: none !important; }
41 | .files a { padding: 8px 8px 8px 23px; display:block; }
42 |
43 | #f_c_w .p {padding: 10px}
44 | #f_c { width: 80.85%; float: left; overflow: hidden; }
45 | #c_w { width: 19%; border-left: 1px solid #CCC; border-bottom: 1px solid #CCC;float: right; min-height: 500px; overflow-y: auto;}
46 | #f_c_s { overflow-y: auto; }
47 | #f { border: 1px solid #CCC; }
48 | #f_h_w { border-bottom: 3px solid #CCC; }
49 |
50 | #commits .big { padding: 10px; border-bottom: 1px solid #CCC;}
51 |
52 | /* commit entry */
53 | .ce { padding: 10px 0; border-bottom: 1px solid #CCC; }
54 |
55 | pre, #code, .meta, .diff { font:12px Monaco,monospace; margin: 0; }
56 |
57 | .meta, .diff thead th { background-color: #EEE; color:#333; overflow:hidden; padding:10px; border-bottom: 1px solid #CCC}
58 | .meta span { margin-left: 5px; padding-left: 9px;}
59 |
60 | .ln, .diff th { background-color:#ECECEC; border-right:1px solid #DDD; color:#AAA; text-align: right; padding: 5px 5px }
61 | #code { padding: 5px;}
62 | /*.hover { background-color: #FFFFC7; }*/
63 |
64 | .diffoutput { border: 1px solid #DDD}
65 | .diff { width: 100%; border-collapse:collapse; border-right:1px solid #DDD; font-size: 11px; }
66 | .diff th{ border: 1px solid #BBC; border-bottom: 0px; font-weight: normal;}
67 | .empty { background-color:#DDD; }
68 | .replace { background-color:#FD8; }
69 | .delete { background-color:#B8FFE9; }
70 | .skip { background-color:#EFEFEF; border:1px solid #AAA; border-right:1px solid #BBC;
71 | }
72 | .insert { background-color:#9E9 }
73 |
74 | #diffoutput { border-bottom: 1px solid #CCC}
75 |
76 | #footer { padding: 10px; border-top: 1px solid #CCC}
77 |
78 |
79 | /* extension stuff */
80 | .resize { cursor: col-resize; float: left; background-color: #DCDCDC;border-right: 1px solid #CCC;}
81 | .hrz { cursor: row-resize !important; background-color: #DCDCDC; ;border-bottom: 1px solid #CCC;height: 3px; line-height: 3px; width: 99.9%}
82 | #bml_w { float: right; font-size: 11px; width: 300px;}
83 | .bml { border: 1px solid #CCC; padding: 1px; -moz-border-radius: 3px; -webkit-border-radius: 3px; border-radius: 3px; font-weight: bold;}
84 | .bml:hover { background-color: white;}
85 |
--------------------------------------------------------------------------------
](https://raw.github.com/sr3d/GithubFinder/master/public/img/githubfinder.png)
4 |
5 | To see the finder in action, go to