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
|
function openfile(Name,response){
var text;
//console.log(Name);
new Ajax.Request(Name,{
method:'get',
asynchronous:true,
contentType:"text/xml",
onSuccess: function(transport){
response(transport.responseText);
},
onFailure: function(){
console.log('Could not load file...');
response("Could not load file...\n");
},
onException: function(req,exception) {
console.log(exception);
alert("file load Exception "+Name);
return true;
},
});
}
//http://stackoverflow.com/questions/3076414/ways-to-circumvent-the-same-origin-policy
function request(url, file, response){
var server=document.createElement("iframe");
server.style.display="none";
server.id=file;
$("webtronics_main_window").appendChild(server);
function receiveMessage(event){
if(event.data.filename==file){
response(event.data.text);
server.parentNode.removeChild(server);
}
};
window.addEventListener("message", receiveMessage, false);
server.src=url+"/webtronix_server.html?file="+file;
console.log(server.src);
}
// This code was written by Tyler Akins and has been placed in the
// public domain. It would be nice if you left this header intact.
// Base64 code from Tyler Akins -- http://rumkin.com
// schiller: Removed string concatenation in favour of Array.join() optimization,
// also precalculate the size of the array needed.
function encode64(input) {
if(window.btoa){
return window.btoa(input);
}
// base64 strings are 4/3 larger than the original string
var output = new Array( Math.floor( (input.length + 2) / 3 ) * 4 );
var chr1, chr2, chr3;
var enc1, enc2, enc3, enc4;
var i = 0, p = 0;
var _keyStr = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=";
do {
chr1 = input.charCodeAt(i++);
chr2 = input.charCodeAt(i++);
chr3 = input.charCodeAt(i++);
enc1 = chr1 >> 2;
enc2 = ((chr1 & 3) << 4) | (chr2 >> 4);
enc3 = ((chr2 & 15) << 2) | (chr3 >> 6);
enc4 = chr3 & 63;
if (isNaN(chr2)) {
enc3 = enc4 = 64;
}
else if (isNaN(chr3)) {
enc4 = 64;
}
output[p++] = _keyStr.charAt(enc1);
output[p++] = _keyStr.charAt(enc2);
output[p++] = _keyStr.charAt(enc3);
output[p++] = _keyStr.charAt(enc4);
} while (i < input.length);
return output.join('');
}
function createUUID()
{
return [7].map(function(length) {
var uuidpart = "";
for (var i=0; i<length; i++) {
var uuidchar = parseInt((Math.random() * 256)).toString(16);
if (uuidchar.length == 1)
uuidchar = "0" + uuidchar;
uuidpart += uuidchar;
}
return uuidpart;
}).join('-');
}
|
