Commit 033e157
Changed files (37)
contrib
hack-master
hackmud-master
hackmud_sample_scripts
contrib/hack-master/bin.js
@@ -0,0 +1,52 @@
+function(C, A)
+{
+ let L = #s.scripts.lib();
+
+ A = A || {};
+ let {set_chan="", send="", dbu1=null, dbf1=""} = A
+ if(!Object.keys(A).length){
+ return `
+{set_chan=""}
+{send:""}
+{dbu1:{id:"", set:{}}
+{dbf1:"id"}
+`
+ }
+
+ let id = {_id:"bin"},
+ {chan} = #db.f(id).first(),
+ U=false,
+ set = v => {U=true;return v};
+
+ if(set_chan) {
+ chan=set(set_chan);
+ L.log(`chan=${chan}`)
+ }
+
+ if(U) {
+ #db.u(id, {
+ $set:{
+ chan
+ }
+ });
+ }
+
+ if(send) {
+ #s.chats.send({channel:chan, msg:send});
+ }
+
+ if(dbu1) {
+ let {id="", set=null} = dbu1;
+ if(id && set) {
+ let {ok} = #db.u({_id:id}, {$set:set});
+ L.log(`Update #db id:${dbu1.id} set:${JSON.stringify(set)} ok:${ok}`);
+ }
+ }
+
+ if(dbf1) {
+ L.log(`find #db:${JSON.stringify(#db.f({_id:dbf1}).first())}`);
+ }
+
+ return L.get_log();
+}
+
contrib/hack-master/db.js
@@ -0,0 +1,5 @@
+function(context, args)
+{
+ let l=#s.scripts.lib();
+ #db.i()
+}
contrib/hack-master/ht1.js
@@ -0,0 +1,65 @@
+function(context, args) { // t:#s.usr.loc
+ const l=#s.scripts.lib();
+ const c=["red","purple","blue","cyan","green","lime","yellow","orange"];
+ const ez=["open","unlock","release"];
+ const triad={[c[0]]:[c[5],c[3]],[c[1]]:[c[6],c[4]],[c[2]]:[c[5],c[7]],[c[3]]:[c[6],c[0]],[c[4]]:[c[7],c[1]],[c[5]]:[c[0],c[2]],[c[6]]:[c[1],c[3]],[c[7]]:[c[6],c[0]]}
+ const k={
+ EZ_25:ez,
+ EZ_35:ez,
+ EZ_40:ez,
+ c001:c,
+ c002:c,
+ c003:c,
+ digit:[0,1,2,3,4,5,6,7,8,9],
+ prime:[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,73,79,83,89,97],
+ color_digit:{[c[0]]:3,[c[1]]:6,[c[2]]:4,[c[3]]:4,[c[4]]:5,[c[5]]:4,[c[6]]:6,[c[7]]:6},
+ complement:{[c[0]]:c[4],[c[1]]:c[5],[c[2]]:c[6],[c[3]]:c[7],[c[4]]:c[0],[c[5]]:c[1],[c[6]]:c[2],[c[7]]:c[3]},
+ c003_triad_1: pc => triad[pc][0],
+ c003_triad_2: pc => triad[pc][1],
+ };
+ const locks = Object.keys(k);
+ const t = a => args.t.call(a);
+ function* ul(al, kv, opts) {
+ for(const v of opts) {
+ al[kv] = v;
+ yield [al, t(al)];
+ }
+ }
+ const crack = (al, kv, opts, lr) => {
+ for(const [na, res] of ul(al, kv, opts)) {
+ if(lr !== res) {
+ return [na, res];
+ }
+ }
+ return [al, null];
+ }
+ let a = {};
+ let res = t(a);
+ let q = false;
+ let c00x = null;
+ while(!q && !res.contains("LOCK_UNLOCKED")) {
+ for(const lt of locks) {
+ if(res.contains(lt)) {
+ switch(lt) {
+ "color_digit":
+ "complement":
+ a[lt]=k[lt][a[c00x]];
+ res = t(a);
+ break;
+ "c003_triad_1":
+ "c003_triad_2":
+ a[lt]=k[lt](a[c00x]);
+ res = t(a);
+ break;
+ default:
+ if(lt === "c001" || lt === "c003" || lt === "c003") c00x=lt;
+ [a, res] = crack(a, lt, k[lt], res);
+ if(!res) return {ok:false, msg:`Unable to find key for ${lt}\nfound: ${l.dump(a)}`}
+ break;
+ }
+ }
+ }
+ }
+
+ return l.ok();
+}
contrib/hack-master/open_t1.js
@@ -0,0 +1,34 @@
+function(context, args) { // t:#s.user.loc
+ var l = #s.scripts.lib();
+ const c=["red", "purple", "blue", "cyan", "green", "lime", "yellow", "orange"];
+ const o=["open", "unlock", "release"];
+ const t = ["EZ_25", "EZ_35", "EZ_40", "c001", "c002", "c003", "ez_digit", "prime", "color_digit", "complement", "c003_triad_1", "c003_triad_2"];
+ const triad=(function(){const r={};for(let i=0;i<8;i++){r[c[i]]=[c[(i+5)%8],c[(i+3)%8]]}return r;})();
+ const keys={
+ [t[0]]:o,
+ [t[1]]:o,
+ [t[2]]:o,
+ [t[3]]:c,
+ [t[4]]:c,
+ [t[5]]:c,
+ [t[6]]:[0,1,2,3,4,5,6,7,8,9],
+ [t[7]]:[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,73,79,83,89,97],
+ [t[8]]:{[c[0]]:3,[c[1]]:6,[c[2]]:4,[c[3]]:4,[c[4]]:5,[c[5]]:4,[c[6]]:6,[c[7]]:6},
+ [t[9]]:{[c[0]]:c[4],[c[1]]:c[5],[c[2]]:c[6],[c[3]]:c[7],[c[4]]:c[0],[c[5]]:c[1],[c[6]]:c[2],[c[7]]:c[3]},
+ [t[10]]: pc => triad[pc][0],
+ [t[11]]: pc => triad[pc][1],
+ };
+
+ const keys=(function(){
+ const r={};
+ for(let i=0;i<6;i++){if(i<3)r[t[i]]=o;else r[t[i]]=c;}
+ r[t[6]]=[0,1,2,3,4,5,6,7,8,9];
+ r[t[7]]=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,73,79,83,89,97];
+ r[t[8]]=(function(){const z={};for(let y of c){z[y]=y.length}})();
+ r[t[9]]=(function(){const z={};for(let [i,y]of c.entries()){z[y]=(i+4)%8}})();
+ r[t[10]]: z=>triad[z][0];
+ r[t[11]]: z=>triad[z][1];
+ })();
+
+ return { ok:false };
+}
contrib/hack-master/print_cheatsheet.js
@@ -0,0 +1,14 @@
+function(context, args) { // chan:"channel"
+ //coloring cheat sheet
+ let out = "\nChat coloring cheat sheet:\n\n",
+ words = ["hello", "world"];
+ for(let [i,c] of "aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ".split('').entries()) {
+ out += `\`\`${c+c+words[i%2]}\`\`${i%2?"\n":" "}`;
+ }
+ out += "\n";
+
+ if(args && args.target)
+ #s.chats.send({channel:args.chan, msg:out});
+ else
+ return out;
+}
contrib/hack-master/qrd.js
@@ -0,0 +1,121 @@
+function(context, A)
+{
+ // s:#s.company.access, p: {username:"", process:""}
+
+ //space is \ u0020 or 32
+ //tab is \ u0009 or 9 tab is also 4 char
+ //top fill is \ u2580 or 9600
+ //bottom fill is \ u2584 or 9604
+ //full fill is \ u2588 or 9608
+
+
+
+ let L = #s.scripts.lib();
+
+ let start = 0;
+ let qrs = [];
+
+ let M = [[1,0],[0,1],[1,1],[0,0]];
+
+ let mask = [
+ (r,c,b) => (r+c)%2?b:~b+2, //000
+ (r,c,b) => r%2?b:~b+2, //001
+ (r,c,b) => c%3?b:~b+2, //010
+ (r,c,b) => (r+c)%3?b:~b+2, //011
+ (r,c,b) => (~~(r/2)+~~(c/3))%2?b:~b+2, //100
+ (r,c,b) => ((r*c)%2)+((r*c)%3)?b:~b+2, //101
+ (r,c,b) => ((r*c)%2)+((r*c)%3)%2?b:~b+2,//110
+ (r,c,b) => ((r+c)%2)+((r*c)%3)%2?b:~b+2 //111
+ ];
+
+ // mask_alt is an alternative masking solution that reduces char count at the expense of computation
+ // m = mask index (based on binary encoding)
+ // r = pixel row
+ // c = pixel col
+ // b = bit (1 or 0)
+ // returns 1 or 0 based on if the r,c,m combo returns true, then the bit was masked and needs to be inverted
+ //let mask_alt = (m,r,c,b)=>([(r+c)%2,r%2,c%3,(r+c)%3,(~~(r/2)+~~(c/3))%2,((r*c)%2)+((r*c)%3),((r*c)%2)+((r*c)%3)%2,((r+c)%2)+((r*c)%3)%2])[m]?b:~b+2;
+
+ let getBin = (arr)=>arr.reduce((x,b)=>(x<<1)|b,0);
+
+ //let lineNum = 0;
+ //let pad = (i,n=3) => '0'.repeat(n - i.toString().length) + i.toString();
+
+ A.s.call(A.p)
+ .replace(/[\w`]/g, '') //remove color
+ .replace(/\t/g,' ') //replace tabs w/ spaces
+ .split('\n') //split lines
+ .filter(l=>l.length > 0 && l.charCodeAt(0) != 200 && l.charCodeAt(0) != 60) //remove lines that are not qr related
+ //find the breaks
+ .forEach((l,i,arr)=>{
+ //detect the last line of a qr code. the assumption is that a completely empty line can only be the last line.
+ //so in other words, no bottom fill or full fill characters in the last line of the qr code string
+ if(!!!l.match(/[\u2588\u2584]/)) {
+ qrs.push(
+ //slice out the individual qr code lines
+ arr.slice(start,i+1)
+ //reduce it to array of array of 1 and 0
+ //remember each line is equivalent to 2 lines of qr code
+ .reduce((qr, l, x)=>{
+ let x0 = x*2,
+ x1 = x0+1;
+ //setup new sub arrays
+ qr[x0] = [];
+ qr[x1] = [];
+
+ //map each character to the top and bottom bit for the 2 rows..
+ for(let ci = 0, t=3,b=3; ci < l.length; ci++) {
+ let cc = l.charCodeAt(ci);
+ if(cc>=9600)
+ [t,b] = M[(cc-9600)/4];
+ else if(cc==32)
+ [t,b] = M[3];
+ else
+ [t,b] = M[0]; //seems to work best to assume junk characters as t=1, b=0 => Error correction should fix it
+ qr[x0].push(t);
+ qr[x1].push(b);
+ }
+ return qr;
+ },[])
+ );
+ start = i+1;
+ }
+ });
+
+ //trim the last line since we know it is blank
+ qrs = qrs.map(qr=>qr.slice(0,qr.length-1));
+
+ //get qr code version (based on size)
+ let version = qrs.map(qr=>(qr[0].length - 17)/4),
+ darkPx = version.map(v=>[8,4*v+9]);
+
+ qrs[1][0][7] = 0;
+ qrs[1][3][48] = 1;
+ qrs[1][5][46] = 1;
+
+ let qr = qrs[1].map(l=>l.map(c=>c?'\u2588':' ').join(''));
+
+ let t = `
+
+${qr.join('\n')}
+
+`;
+
+ //t = `${qrs[0].length} ${qrs[1].length}`
+
+ return t;
+}
+
+
+
+/// TEST CODE
+//blackcore.member_access {username:"shareef_j", process:"order_qrs"}
+// RESULT #0
+// {
+// "id":"ikw4uy",
+// "user":"notused",
+// "packing_notes":"1 unit",
+// "enj":"6t11do"
+// }
+
+
contrib/hack-master/scratch.js
@@ -0,0 +1,62 @@
+function(context, args)
+{
+// let bar=`\`H${"#".repeat(60)}\``,
+// finished = (msg_arr, rp=2)=>`
+// ${bar}
+// ${msg_arr.map(msg => '\t'.repeat(rp) + msg).join('\n')}
+// ${bar}
+// `;
+
+// let {s, l, b, o, u, p, r, w, k} = #db.f({_id:"button"}, {_id:0}).first(),
+// now = new Date(),
+// n = now.getTime(),
+// elapsed = n - l,
+// isOver = elapsed > maxTime,
+// score = maxTime - elapsed;
+
+#db.u({_id:"button"},
+{
+ $unset: {r:""}
+});
+
+
+// #db.u({_id:"button"},{$set:{cost:50000, minReward:250000, maxTime:5*60*1000, cut:0.85, ocut:0.05}})
+
+// #db.i({_id:"passowrd", root:"Luckyse110ut1!"});
+
+// let lib = #s.scripts.lib();
+// let d = new Date(),
+// dbo={
+// _id:"button",
+// s:d,
+// l:d.getTime(),
+// b:300000,
+// o:"alchemyrain",
+// u:["alchemyrain"],
+// p:50000,
+// r:50000,
+// k:[],
+// w:[]
+// };
+// let {s,l,b,o,u,p,r,w,k} = dbo;
+
+// let msg_width = 60;
+
+// let bar=`\`H${"#".repeat(msg_width)}\``;
+// let output=[];
+// let outmsg=(tc=3)=>`
+// ${bar}
+// ${output.map(v=>" ".repeat(tc)+v).join("\n")}
+// ${bar}
+// `;
+
+// let score = 2 * 60 * 1000;
+// let min = MATH.floor(score / (60*1000)),
+// sec = MATH.floor((score - (min*60*1000)) / 1000);
+
+// output.push(`The ${context.this_script} is currently worth ${lib.to_gc_str(r)}!`)
+// output.push(`Call ${context.this_script} {press:true} to play.`);
+// output.push(`\DHurry\`, only \`D${min} min\` and \`D${sec} sec\` remaining!`)
+// #s.chats.send({channel:"boobus", msg:outmsg()});
+ //return output.map().join("\n");
+}
contrib/hack-master/script_notes.txt
@@ -0,0 +1,16 @@
+script notes:
+
+#db.c is now #db.f().count
+#db.f() returns an object that has the following on it:
+skip(num)
+each(function)
+array
+limit(num)
+sort(args)
+first
+#db.i insert_one
+#db.s update_one
+#db.u update_many
+#db.r delete_many
+#db.f find
+
contrib/hack-master/tools.js
@@ -0,0 +1,8 @@
+function(context, args) { // pwd_check:"pwd"
+ if(args) {
+ if(args.pwd_check) {
+ let {root} = #db.f({_id:"password"}).first();
+ return root === args.pwd_check;
+ }
+ }
+}
contrib/hackmud-master/example/hello_world.js
@@ -0,0 +1,6 @@
+function(context, args) { // greetings:"Hello World!"
+ return {
+ ok: true,
+ msg: args.greetings || "Hello World!"
+ };
+}
contrib/hackmud-master/example/lib.js
@@ -0,0 +1,12 @@
+function(context, args) {
+
+ // Example function
+ function subtraction(minuend, subtrahend) {
+ return minuend - subtrahend;
+ }
+
+ // Export the symbols
+ return {
+ difference: subtraction
+ };
+}
contrib/hackmud-master/hacking/golf/lockpick.429.js
@@ -0,0 +1,1 @@
+function(e,{l}){var n,a,c=["unlock","release","open"],o=[2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97],r=["red","lime","blue","orange","green","purple","yellow","cyan"],t={},i="",d="";do(n=d.match(/!(\w+)!.*$/))&&(i=n[1],a=0),"E"==i[0]&&(t[i]=c[a++]),"d"==i[0]&&(t[i]=a++),"e"==i[0]&&(t[i]=o[a++]),"c"==i[0]&&(t[i]=r[a++],"1"==i[3]&&(t.color_digit=t[i].length)),d=l.call(t);while(!d.match(/terminated/))}
contrib/hackmud-master/hacking/lockpick.js
@@ -0,0 +1,51 @@
+// length 809 chars/ comprimised 565 chars
+// Improvements:
+// - remove dtr import (15)
+// - remove return (25)
+// - interating over 2-99 for ez_prime (~89) (not recommended heavy runtime)
+// - for color_complement or triad iterating over colors (95)
+// doing all shrinks to 340 chars
+
+function(context, args) { // lock:#s.<user>.<script>
+ var lock = args.lock;
+ var d = #s.dtr.lib();
+ var commands = [ "unlock", "release", "open" ];
+ var primes = [ 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97 ];
+ var color = [ "red", "lime", "blue", "orange", "green", "purple", "yellow", "cyan" ];
+ args = {};
+ var type = "", tmp, result = "", index;
+
+ do {
+ tmp = result.match(/!(\w+)!.*$/);
+ if (tmp) {
+ type = tmp[1];
+ index = 0;
+ }
+ if (type[0] == "E") { // EZ_xx
+ args[type] = commands[index++];
+ }
+ if (type[0] == "d") { // digit
+ args[type] = index++;
+ }
+ if (type[0] == "e") { // ez_prime
+ args[type] = primes[index++];
+ }
+ if (type[0] == "c") { // c00x
+ args[type] = color[index++];
+ if (type[3] == "1") { // c001
+ args.color_digit = args[type].length;
+ } else if (type[3] == "2") { // c002
+ args.c002_complement = color[(index + 3) % 8];
+ } else if (type[3] == "3") { // c003
+ args.c003_triad_1 = color[(index + 6) % 8];
+ args.c003_triad_2 = color[index];
+ }
+ }
+ result = lock.call(args);
+ } while (!result.match(/terminated/));
+
+ return {
+ ok: true,
+ msg: d.pp(args)
+ };
+}
contrib/hackmud-master/lib/access.js
@@ -0,0 +1,7 @@
+// access levels
+{
+ TRUST: [ "TRUST", '+' ],
+ PRIVATE: [ "PRIVATE", '-' ],
+ HIDDEN: [ "HIDDEN", 0 ],
+ PUBLIC: [ "PUBLIC", 1 ]
+}
contrib/hackmud-master/lib/classes.js
@@ -0,0 +1,2 @@
+// known classes
+[ "architect", "infiltrator", "scavenger", "executive" ]
contrib/hackmud-master/lib/cmp.js
@@ -0,0 +1,34 @@
+function (a, b, comperator) {
+ var lib = LIBRARY;
+ var i, result;
+
+ // add compare two elements
+ if (!l.is_def(comperator)) {
+ return a < b ? -1 : a > b ? 1 : 0;
+ } else if (l.is_func(comperator)) {
+ return comperator(a, b);
+ } else if (l.is_int(comperator)) {
+ return sign(comperator) * lib.cmp(a[abs(comperator)], b[abs(comperator)]);
+ } else if (l.is_str(comperator)) {
+// var [_, sign, key] = comperator.match(/([+-]?)(.*)/);
+ var match = comperator.match(/([+-]?)(.*)/);
+ key = match[2];
+ var multiplicator = match[1] == "-" ? -1 : 1;
+ return multiplicator * lib.cmp(a[key], b[key]);
+ } else if (l.is_arr(comperator)) {
+ result = 0;
+ for (i in comperator) {
+ result = lib.cmp(a, b, comperator[i]);
+ if (0 !== result) break;
+ }
+ return result;
+ } else if (l.is_obj(comperator)) {
+ result = 0;
+ for (i in comperator) {
+ result = lib.cmp(a[i], b[i], comperator[i]);
+ if (0 !== result) break;
+ }
+ return result;
+ }
+ return 0;
+}
contrib/hackmud-master/lib/parse_timestr.js
@@ -0,0 +1,5 @@
+function (date) {
+ // Convert hackmud timestr to date object
+ var iso = date.replace(/(\d{2})(\d{2})(\d{2})\.(\d{2})(\d{2})/, "20$1-$2-$3T$4:$5-04:00");
+ return new Date(iso);
+}
contrib/hackmud-master/lib/rarity.js
@@ -0,0 +1,7 @@
+// rarities
+[
+ [ "noob", 0 ],
+ [ "kiddie", 1 ],
+ [ "h4x0r", 2 ],
+ [ "h4rdc0r3", 3 ]
+]
contrib/hackmud-master/lib/security.js
@@ -0,0 +1,9 @@
+// security levels
+[
+ [ "NULLSEC", 'D' ],
+ [ "LOWSEC", 'F' ],
+ [ "MIDSEC", 'H' ],
+ [ "HIGHSEC", 'h' ],
+ [ "FULLSEC", 'L' ]
+]
+
contrib/hackmud-master/lib/sort.js
@@ -0,0 +1,11 @@
+function (array, order) {
+ // sort with given order
+
+ var lib = LIBRARY;
+ if (l.is_func(order)) {
+ return array.sort(order);
+ }
+ return array.sort(function(a, b) {
+ return lib.cmp(a, b, order);
+ });
+}
contrib/hackmud-master/tools/bank_statement.js
@@ -0,0 +1,47 @@
+function(context, args) { // count:5
+ var caller = context.caller;
+ var l = #s.scripts.lib();
+ var d = #s.dtr.lib();
+ var list = #s.accts.transactions(args);
+
+ var balance = -1;
+ if (!args || !args.from && !args.to && !args.script) {
+ balance = #s.accts.balance();
+ }
+
+ l.each(list, function(_, transaction) {
+ transaction.time = l.to_game_timestr(transaction.time);
+ transaction.description = transaction.memo || transaction.script;
+ if (transaction.sender == caller) {
+ transaction.withdrawal = transaction.amount;
+ transaction.opposit = transaction.recipient;
+ } else {
+ transaction.deposit = transaction.amount;
+ transaction.opposit = transaction.sender;
+ }
+ if (balance >= 0) {
+ transaction.balance = balance;
+ balance += (transaction.withdrawal || 0) - (transaction.deposit || 0);
+ }
+ });
+
+ var titles = [
+ { name: "+date+", key: "time" },
+ { name: "+description+", key: "description" },
+ { name: "+opposit+", key: "opposit" },
+ { name: "+withdrawals+", key: "withdrawal", dir: -1, func: d.expandGC },
+ { name: "+deposits+", key: "deposit", dir: -1, func: d.expandGC }
+ ];
+
+ if (balance >= 0) {
+ titles.push(
+ { name: "+balance+", key: "balance", dir: -1, func: d.expandGC });
+ }
+
+ var usage = '\n\nFor more transactions, add count:<"all" or number>\nFilter for sender, recipient or script, add from:"<user>", to:"<user>" or script:"<script>".\n';
+
+ return {
+ ok: true,
+ msg: d.columns(list.reverse(), titles, {pre:"", suf:""}, true) + usage
+ };
+}
contrib/hackmud-master/tools/market_browse.js
@@ -0,0 +1,69 @@
+function(context, args) {
+ var l = #s.scripts.lib(),
+ d = #s.dtr.lib();
+
+ args = args || {};
+ if (!(args.name || args.type || args.tier || args.class || args.cost)) {
+ var balance = #s.accts.balance();
+ args.cost = { "$lte": balance };
+ }
+
+ var order = args.order || [ "tier", "type", "name", "rarity" ],
+ list = #s.market.browse(args),
+ market = {};
+
+ if (list.length === 0) {
+ return {
+ ok: false,
+ msg: "No suitable upgrades found.\nUsage: " + context.this_script + ' { name:"<upgrade name", type:"<lock, script_space, script>", tier:<1-4>, class:"<architect, executive, infitrator, scavenger>", cost:<num or GC str>, order:<array of properties> }'
+ };
+ }
+
+ l.each(list, function(_, item) {
+ var id = "" + item.rarity + "-" + item.name;
+ if (!(null === item.i || id in market)) {
+ market[id] = item;
+ }
+ });
+
+ list = [];
+ for (var id in market) {
+ var item = #s.market.browse({ i: market[id].i });
+ for (var key in item.upgrade)
+ item[key] = item.upgrade[key];
+ item.class = item.up_class;
+ list.push(item);
+ }
+
+ list.sort(function(a, b) {
+ var result = 0;
+ for (var key in order) {
+ key = order[key];
+ result = a[key] < b[key] ? -1 : a[key] > b[key] ? 1 : 0;
+ if (0 !== result) break;
+ }
+ return result;
+ });
+
+ var classes = [ "architect", "infiltrator", "scavenger", "executive" ];
+
+ var titles = [
+ { name: "Name", key: "name" },
+ { name: "Rarity", key: "rarity", func: d.coloredRarityLevel },
+ { name: "Cost", key: "cost", dir: -1, func: d.expandGC },
+ { name: "Token", key: "i" },
+ { name: "Type", key: "type" },
+ { name: "Class", key: "class", func: function(value) {
+ return classes[value] || "none";
+ }},
+ { name: "Tier", key: "tier", dir: 0 } ];
+
+ titles.sort(function(a, b) {
+ return order.indexOf(a.key) != -1 ? order.indexOf(b.key) != -1 ? order.indexOf(a.key) - order.indexOf(b.key) : -1 : order.indexOf(b.key) != -1 ? 1 : 0;
+ });
+
+ return {
+ ok: true,
+ msg: d.columns(list, titles, {})
+ };
+}
contrib/hackmud-master/tools/parse_timestr.js
@@ -0,0 +1,20 @@
+function(context, args) { // date:""
+
+ var l = #s.scripts.lib();
+
+ INCLUDE(parse_timestr)
+
+ if (!args || !args.date || !args.date.match(/^\d{6}\.\d{4}$/)) {
+ return {
+ ok: false,
+ msg: "Usage: " + context.this_script + ' { date:"' + l.to_game_timestr(l.get_date()) + '" }'
+ };
+ }
+
+ var date = parse_timestr(args.date);
+
+ return {
+ ok: !isNaN(date.getTime()),
+ msg: date.toString()
+ };
+}
contrib/hackmud-master/tools/qr_decode.js
@@ -0,0 +1,226 @@
+function(context, args) { // qr:<string>
+ var caller = context.caller;
+ var l = #s.scripts.lib();
+
+ if (!args || !args.qr) {
+ return { ok:false, msg:context.this_script + " { qr:<string> }"};
+ }
+
+ var qr = args.qr.split('\n');
+
+ function decode(code) {
+
+ var pattern = { ' ': [ 0, 0 ],
+ '\u2580': [1,0],
+ '\u2584': [0,1],
+ '\u2588': [1,1]
+ };
+
+ function bit(x,y) {
+ return pattern[code[y>>1][x]][y&1];
+ }
+
+ var info = {};
+ info.dimension = code[0].length;
+ info.version = (info.dimension - 17) >> 2;
+
+ var tmp = 0;
+ var i;
+ for (i = 0; i < 5; i++) {
+ tmp = (tmp << 1) | bit(i,8);
+ }
+ tmp ^= 0x15;
+ info.ecl = tmp >> 3;
+ info.mask = tmp % 0x8;
+
+ var masks = [
+ function (x,y) { return ((x + y) & 0x1) === 0;},
+ function (x,y) { return (x & 0x1) === 0;},
+ function (x,y) { return (y % 3) === 0;},
+ function (x,y) { return ((x+y) % 3) === 0;},
+// function (x,y) { return (((x>>1) + Math.floor(y / 3)) & 0x1) === 0;},
+ function (x,y) { return (((y>>1) + Math.floor(x / 3)) & 0x1) === 0;},
+ function (x,y) { return (((x*y) & 0x1) + ((x*y) % 3)) === 0;},
+ function (x,y) { return ((((x*y) & 0x1) + ((x*y) % 3)) & 0x1) === 0;},
+ function (x,y) { return (((((x+y) & 0x1) + ((x*y) % 3)) & 0x1) === 0);}
+ ];
+
+ function databit(x,y) {
+ return masks[info.mask](x,y) ^ bit(x,y);
+ }
+
+ function get_alignment(version) {
+ var result = [];
+ var step = 28 - (Math.floor(168/ (version + 7)) & 0xfe);
+
+ var i = 4 * version + 10;
+ do {
+ result.unshift(i);
+ i -= step;
+ } while ( i > 6);
+ result.unshift(6);
+ return result;
+ }
+ var alignment = get_alignment(info.version);
+
+ function is_data(x,y) {
+ if ((x == 6) || (y == 6)) return true;
+ if ((x < 9) && (y < 9)) return true;
+ if ((x < 9) && (y > info.dimension - 9 )) return true;
+ if ((x > info.dimension - 9) && (y < 9 )) return true;
+ if (info.version > 6) {
+ if ((x < 7) && (y > info.dimension - 12 )) return true;
+ if ((x > info.dimension - 12) && (y < 7 )) return true;
+ }
+ var max = alignment.length;
+ for (var i = 0; i < max; i++) {
+ for (var j = 0; j < max; j++) {
+ if ((i === 0 && (j === 0 || j == max -1)) || (i == max -1 && j === 0)) {
+ continue;
+ }
+ if ((Math.abs(x - alignment[i]) < 3) && (Math.abs(y - alignment[j]) < 3)) {
+ return true;
+ }
+ }
+ }
+ return false;
+ }
+
+ function get_codewords (count) {
+ var result = [];
+
+ var up = true;
+ var bits = 0;
+ var byte = 0;
+ for (var x = info.dimension - 1; x > 0; x -= 2) {
+ if (x == 6) x--;
+ for (var z = 0; z < info.dimension; z++) {
+ var y = up?info.dimension - z -1: z;
+ for (var col= 0; col < 2; col++) {
+ if (!is_data(x-col,y)) {
+ bits++;
+ byte <<= 1;
+ if(databit(x-col,y)) {
+ byte |= 1;
+ }
+ if (bits == 8) {
+ result.push(byte);
+ bits = 0;
+ byte = 0;
+ if (--count === 0) {
+ return result;
+ }
+ }
+ }
+ }
+ }
+ up = !up;
+ }
+ return result;
+ }
+
+ var blocks = [[
+ // Medium
+ null, [1, 16], [ 1, 28], [ 1, 44], [ 2, 64], [ 2, 86], [ 4, 108], [ 4, 124],
+ [ 4, 154], [ 5, 182], [ 5, 216], [ 5, 254], [ 8, 290], [ 9, 334],
+ [ 9, 365], [ 10, 415], [ 10, 453], [ 11, 507], [ 13, 563], [ 14, 627],
+ [ 16, 669], [ 17, 714], [ 17, 782], [ 18, 860], [ 20, 914], [ 21, 1000],
+ [ 23, 1062], [ 25, 1128], [ 26, 1193], [ 28, 1267], [ 29, 1373],
+ [ 31, 1455], [ 33, 1541], [ 35, 1631], [ 37, 1725], [ 38, 1812],
+ [ 40, 1914], [ 43, 1992], [ 45, 2102], [ 47, 2216], [ 49, 2334]
+ ],[
+ // Low
+ null, [ 1, 19], [ 1, 34], [ 1, 55], [ 1, 80], [ 1, 108], [ 2, 136],
+ [ 2, 156], [ 2, 194], [ 2, 232], [ 4, 274], [ 4, 324], [ 4, 370],
+ [ 4, 428], [ 4, 461], [ 6, 523], [ 6, 589], [ 6, 647], [ 6, 721],
+ [ 7, 795], [ 8, 861], [ 8, 932], [ 9, 1006], [ 9, 1094], [ 10, 1174],
+ [ 12, 1276], [ 12, 1370], [ 12, 1468], [ 13, 1531], [ 14, 1631],
+ [ 15, 1735], [ 16, 1843], [ 17, 1955], [ 18, 2071], [ 19, 2191],
+ [ 19, 2306], [ 20, 2434], [ 21, 2566], [ 22, 2702], [ 24, 2812],
+ [ 25, 2956]
+ ],[
+ // High
+ null, [ 1, 9], [ 1, 16], [ 2, 26], [ 4, 36], [ 4, 46], [ 4, 60], [ 5, 66],
+ [ 6, 86], [ 8, 100], [ 8, 122], [ 11, 140], [ 11, 158], [ 16, 180],
+ [ 16, 197], [ 18, 223], [ 16, 253], [ 19, 283], [ 21, 313], [ 25, 341],
+ [ 25, 385], [ 25, 406], [ 34, 442], [ 30, 464], [ 32, 514], [ 35, 538],
+ [ 37, 596], [ 40, 628], [ 42, 661], [ 45, 701], [ 48, 745], [ 51, 793],
+ [ 54, 845], [ 57, 901], [ 60, 961], [ 63, 986], [ 66, 1054], [ 70, 1096],
+ [ 74, 1142], [ 77, 1222], [ 81, 1276]
+ ],[
+ // Quater
+ null, [1, 13], [ 1, 22], [ 2, 34], [ 2, 48], [ 4, 62], [ 4, 76], [ 6, 88],
+ [ 6, 110], [ 8, 132], [ 8, 154], [ 8, 180], [ 10, 206], [ 12, 244],
+ [ 16, 261], [ 12, 295], [ 17, 325], [ 16, 367], [ 18, 397], [ 21, 445],
+ [ 20, 485], [ 23, 512], [ 23, 568], [ 25, 614], [ 27, 664], [ 29, 718],
+ [ 34, 754], [ 34, 808], [ 35, 871], [ 38, 911], [ 40, 985], [ 43, 1033],
+ [ 45, 1115], [ 48, 1171], [ 51, 1231], [ 53, 1286], [ 56, 1354],
+ [ 59, 1426], [ 62, 1502], [ 65, 1582], [ 68, 1666]
+ ]];
+
+ var counts = blocks[info.ecl][info.version];
+
+ var words = get_codewords(counts[1]);
+
+// var [ c, all ] = counts;
+ var c = counts[0];
+ var all = counts[1];
+ tmp = [];
+ for (i = 0; i < c; i++) {
+ tmp.push([]);
+ }
+ var remain = all % c;
+ for (i = 0; i < all - remain; i++) {
+ tmp[i % c].push(words[i]);
+ }
+ for (i = remain; i > 0; i--) {
+ tmp[c-i].push(words[all-i]);
+ }
+ blocks = [];
+ for (i = 0; i < c; i++) {
+ blocks = blocks.concat(tmp[i]);
+ }
+
+ var cursor = 0;
+ function getbits(count) {
+ var result = 0;
+ while ( count > 0) {
+ var tmp = Math.min(count,(8 - (cursor & 0x7)));
+ result = (result << tmp) | ((blocks[cursor >> 3] >> (8 - (cursor & 0x7) -tmp)) & ((1<<tmp) -1));
+ cursor += tmp;
+ count -= tmp;
+ }
+ return result;
+ }
+
+ function getbytes() {
+ var count;
+ if (info.version < 10) {
+ count = getbits(8);
+ } else {
+ count = getbits(16);
+ }
+ var result = "";
+ while(count--) {
+ result += String.fromCharCode(getbits(8));
+ }
+ return result;
+ }
+
+ var results = [];
+ while (cursor / 8 < blocks.length) {
+ var encoding = getbits(4);
+ if (encoding === 0) {
+ return results;
+ } else if (encoding == 4) {
+ results.push(getbytes());
+ } else {
+ return results;
+ }
+ }
+
+ return results;
+ }
+
+ return decode(qr);
+}
contrib/hackmud-master/.gitignore
@@ -0,0 +1,41 @@
+# Logs
+logs
+*.log
+npm-debug.log*
+
+# Runtime data
+pids
+*.pid
+*.seed
+
+# Directory for instrumented libs generated by jscoverage/JSCover
+lib-cov
+
+# Coverage directory used by tools like istanbul
+coverage
+
+# nyc test coverage
+.nyc_output
+
+# Grunt intermediate storage (http://gruntjs.com/creating-plugins#storing-task-files)
+.grunt
+
+# node-waf configuration
+.lock-wscript
+
+# Compiled binary addons (http://nodejs.org/api/addons.html)
+build/Release
+
+# Dependency directories
+node_modules
+jspm_packages
+
+# Optional npm cache directory
+.npm
+
+# Optional REPL history
+.node_repl_history
+
+# Generated directories
+build
+release
contrib/hackmud-master/Gruntfile.js
@@ -0,0 +1,72 @@
+module.exports = function(grunt) {
+ "use strict";
+
+ grunt.initConfig({
+ meta: {
+ user: grunt.option("user") || "nimvek",
+ },
+ clean: {
+ build: [ "build/" ],
+ release: [ "release/" ],
+ },
+ copy: {
+ pre: {
+ expand: true,
+ flatten: true,
+ src: [ "tools/*.js", "hacking/*.js" ],
+ dest: "build/",
+ options: {
+ process: function(content) {
+ return content.replace(/#s\./g, "SCRIPTOR.").replace(/#db\./g, "DATABASE.").replace(/([\s\S]*)/, "($1)();").replace(/INCLUDE\((\w+)\)/g, function (match,name) { return "var "+name+" = " + grunt.file.read("lib/"+name+".js")+";"; });
+ }
+ }
+ },
+ post: {
+ expand: true,
+ flatten: true,
+ src: [ "build/*.js" ],
+ dest: "release/",
+ options: {
+ process: function(content) {
+ return content.replace(/^\!([\s\S]*)\(\);$/, "$1").replace(/^\(([\s\S]*)\)\(\);$/, "$1").replace(/SCRIPTOR\./g, "#s.").replace(/DATABASE\./g, "#db.").replace(/LIBRARY/g, grunt.template.process("#s.<%= meta.user %>.lib()"));
+ }
+ }
+ }
+ },
+ concat: {
+ lib: {
+ options: {
+ banner: "(function () {\nvar l = SCRIPTOR.scripts.lib();\nreturn {\n",
+ footer: "};\n})();",
+ separator: ",\n",
+ process: function(src, filepath) {
+ var path = require('path');
+ return path.basename(filepath, ".js") + ": " + src.replace(/\s*$/, "");
+ }
+ },
+ files: {
+ "build/lib.js": [ "lib/*.js" ],
+ },
+ },
+ },
+ jshint: {
+ files: [ "Gruntfile.js", "build/*.js" ]
+ },
+ uglify: {
+ all: {
+ files: [ {
+ expand: true,
+ src: "build/*.js",
+ } ]
+ }
+ }
+ });
+
+ grunt.loadNpmTasks("grunt-contrib-clean");
+ grunt.loadNpmTasks("grunt-contrib-copy");
+ grunt.loadNpmTasks("grunt-contrib-concat");
+ grunt.loadNpmTasks("grunt-contrib-jshint");
+ grunt.loadNpmTasks("grunt-contrib-uglify");
+
+ grunt.registerTask("default", [ "clean", "copy:pre", "concat", "jshint", "uglify", "copy:post", "clean:build" ]);
+};
contrib/hackmud-master/LICENSE
@@ -0,0 +1,674 @@
+ GNU GENERAL PUBLIC LICENSE
+ Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+ Preamble
+
+ The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+ The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works. By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users. We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors. You can apply it to
+your programs, too.
+
+ When we speak of free software, we are referring to freedom, not
+price. Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+ To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights. Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+ For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received. You must make sure that they, too, receive
+or can get the source code. And you must show them these terms so they
+know their rights.
+
+ Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+ For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software. For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+ Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so. This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software. The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable. Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products. If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+ Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary. To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+ The precise terms and conditions for copying, distribution and
+modification follow.
+
+ TERMS AND CONDITIONS
+
+ 0. Definitions.
+
+ "This License" refers to version 3 of the GNU General Public License.
+
+ "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+ "The Program" refers to any copyrightable work licensed under this
+License. Each licensee is addressed as "you". "Licensees" and
+"recipients" may be individuals or organizations.
+
+ To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy. The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+ A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+ To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy. Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+ To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies. Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+ An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License. If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+ 1. Source Code.
+
+ The "source code" for a work means the preferred form of the work
+for making modifications to it. "Object code" means any non-source
+form of a work.
+
+ A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+ The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form. A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+ The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities. However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work. For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+ The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+ The Corresponding Source for a work in source code form is that
+same work.
+
+ 2. Basic Permissions.
+
+ All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met. This License explicitly affirms your unlimited
+permission to run the unmodified Program. The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work. This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+ You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force. You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright. Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+ Conveying under any other circumstances is permitted solely under
+the conditions stated below. Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+ 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+ No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+ When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+ 4. Conveying Verbatim Copies.
+
+ You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+ You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+ 5. Conveying Modified Source Versions.
+
+ You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+ a) The work must carry prominent notices stating that you modified
+ it, and giving a relevant date.
+
+ b) The work must carry prominent notices stating that it is
+ released under this License and any conditions added under section
+ 7. This requirement modifies the requirement in section 4 to
+ "keep intact all notices".
+
+ c) You must license the entire work, as a whole, under this
+ License to anyone who comes into possession of a copy. This
+ License will therefore apply, along with any applicable section 7
+ additional terms, to the whole of the work, and all its parts,
+ regardless of how they are packaged. This License gives no
+ permission to license the work in any other way, but it does not
+ invalidate such permission if you have separately received it.
+
+ d) If the work has interactive user interfaces, each must display
+ Appropriate Legal Notices; however, if the Program has interactive
+ interfaces that do not display Appropriate Legal Notices, your
+ work need not make them do so.
+
+ A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit. Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+ 6. Conveying Non-Source Forms.
+
+ You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+ a) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by the
+ Corresponding Source fixed on a durable physical medium
+ customarily used for software interchange.
+
+ b) Convey the object code in, or embodied in, a physical product
+ (including a physical distribution medium), accompanied by a
+ written offer, valid for at least three years and valid for as
+ long as you offer spare parts or customer support for that product
+ model, to give anyone who possesses the object code either (1) a
+ copy of the Corresponding Source for all the software in the
+ product that is covered by this License, on a durable physical
+ medium customarily used for software interchange, for a price no
+ more than your reasonable cost of physically performing this
+ conveying of source, or (2) access to copy the
+ Corresponding Source from a network server at no charge.
+
+ c) Convey individual copies of the object code with a copy of the
+ written offer to provide the Corresponding Source. This
+ alternative is allowed only occasionally and noncommercially, and
+ only if you received the object code with such an offer, in accord
+ with subsection 6b.
+
+ d) Convey the object code by offering access from a designated
+ place (gratis or for a charge), and offer equivalent access to the
+ Corresponding Source in the same way through the same place at no
+ further charge. You need not require recipients to copy the
+ Corresponding Source along with the object code. If the place to
+ copy the object code is a network server, the Corresponding Source
+ may be on a different server (operated by you or a third party)
+ that supports equivalent copying facilities, provided you maintain
+ clear directions next to the object code saying where to find the
+ Corresponding Source. Regardless of what server hosts the
+ Corresponding Source, you remain obligated to ensure that it is
+ available for as long as needed to satisfy these requirements.
+
+ e) Convey the object code using peer-to-peer transmission, provided
+ you inform other peers where the object code and Corresponding
+ Source of the work are being offered to the general public at no
+ charge under subsection 6d.
+
+ A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+ A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling. In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage. For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product. A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+ "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source. The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+ If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information. But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+ The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed. Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+ Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+ 7. Additional Terms.
+
+ "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law. If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+ When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it. (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.) You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+ Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+ a) Disclaiming warranty or limiting liability differently from the
+ terms of sections 15 and 16 of this License; or
+
+ b) Requiring preservation of specified reasonable legal notices or
+ author attributions in that material or in the Appropriate Legal
+ Notices displayed by works containing it; or
+
+ c) Prohibiting misrepresentation of the origin of that material, or
+ requiring that modified versions of such material be marked in
+ reasonable ways as different from the original version; or
+
+ d) Limiting the use for publicity purposes of names of licensors or
+ authors of the material; or
+
+ e) Declining to grant rights under trademark law for use of some
+ trade names, trademarks, or service marks; or
+
+ f) Requiring indemnification of licensors and authors of that
+ material by anyone who conveys the material (or modified versions of
+ it) with contractual assumptions of liability to the recipient, for
+ any liability that these contractual assumptions directly impose on
+ those licensors and authors.
+
+ All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10. If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term. If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+ If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+ Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+ 8. Termination.
+
+ You may not propagate or modify a covered work except as expressly
+provided under this License. Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+ However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+ Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+ Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License. If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+ 9. Acceptance Not Required for Having Copies.
+
+ You are not required to accept this License in order to receive or
+run a copy of the Program. Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance. However,
+nothing other than this License grants you permission to propagate or
+modify any covered work. These actions infringe copyright if you do
+not accept this License. Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+ 10. Automatic Licensing of Downstream Recipients.
+
+ Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License. You are not responsible
+for enforcing compliance by third parties with this License.
+
+ An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations. If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+ You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License. For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+ 11. Patents.
+
+ A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based. The
+work thus licensed is called the contributor's "contributor version".
+
+ A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version. For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+ Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+ In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement). To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+ If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients. "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+ If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+ A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License. You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+ Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+ 12. No Surrender of Others' Freedom.
+
+ If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License. If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all. For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+ 13. Use with the GNU Affero General Public License.
+
+ Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work. The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+ 14. Revised Versions of this License.
+
+ The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time. Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+ Each version is given a distinguishing version number. If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation. If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+ If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+ Later license versions may give you additional or different
+permissions. However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+ 15. Disclaimer of Warranty.
+
+ THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+ 16. Limitation of Liability.
+
+ IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+ 17. Interpretation of Sections 15 and 16.
+
+ If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+ END OF TERMS AND CONDITIONS
+
+ How to Apply These Terms to Your New Programs
+
+ If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+ To do so, attach the following notices to the program. It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+ {one line to give the program's name and a brief idea of what it does.}
+ Copyright (C) {year} {name of author}
+
+ This program is free software: you can redistribute it and/or modify
+ it under the terms of the GNU General Public License as published by
+ the Free Software Foundation, either version 3 of the License, or
+ (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+ If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+ {project} Copyright (C) {year} {fullname}
+ This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+ This is free software, and you are welcome to redistribute it
+ under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License. Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+ You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+ The GNU General Public License does not permit incorporating your program
+into proprietary programs. If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library. If this is what you want to do, use the GNU Lesser General
+Public License instead of this License. But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
contrib/hackmud-master/package.json
@@ -0,0 +1,17 @@
+{
+ "name": "hackmud",
+ "license": "GPL-3.0",
+ "private": true,
+ "repository": "NimVek/hackmud",
+ "devDependencies": {
+ "grunt": "latest",
+ "grunt-contrib-clean": "latest",
+ "grunt-contrib-copy": "latest",
+ "grunt-contrib-concat": "latest",
+ "grunt-contrib-jshint": "latest",
+ "grunt-contrib-uglify": "latest"
+ },
+ "scripts": {
+ "build": "grunt"
+ }
+}
contrib/hackmud-master/README.md
@@ -0,0 +1,2 @@
+# hackmud
+Some Hackmud Scripts
contrib/hackmud-master/Scripting.md
@@ -0,0 +1,63 @@
+# Scripting
+
+## Basics
+
+### Scriptor
+
+## Database (`#db`)
+
+## Standard Library (`#s.scripts.lib()`)
+
+| Function | Description |
+| --- | --- |
+| `ok()` | Helper that returns `{ ok:true }`. You can use it in your script as return Value. |
+| `not_impl()` | Helper that returns `{ ok:false, msg:"not implemented" }` |
+| `log(item)` | Adds the `item` to an Array of logmessages, you can use it insteed of `<stdout>`. See `get_log`.|
+| `get_log()` | Returns the array of logmessages, you putted with `log`. |
+| `rand_int(min, max)` | Returns a random integer between `min` and `max`. |
+| `are_ids_eq` | |
+| `is_obj(item)` | Returns `true` if `item` is an `Object` |
+| `is_str` | |
+| `is_num` | |
+| `is_int` | |
+| `is_neg` | |
+| `is_arr` | |
+| `is_func` | |
+| `is_def` | |
+| `is_valid_name` | |
+| `dump` | |
+| `clone` | |
+| `merge` | |
+| `get_values` | |
+| `hash_code` | |
+| `to_gc_str` | |
+| `to_gc_num` | |
+| `to_game_timestr` | |
+| `cap_str_len` | |
+| `each` | |
+| `select` | |
+| `count` | |
+| `select_one` | |
+| `map` | |
+| `shuffle` | |
+| `sort_asc` | |
+| `sort_desc` | |
+| `num_sort_asc` | |
+| `num_sort_desc` | |
+| `max_val_index` | |
+| `add_time` | |
+| `security_level_names` | |
+| `get_security_level_name` | |
+| `create_rand_string` | |
+| `get_user_from_script` | |
+| `u_sort_num_arr_desc` | |
+| `can_continue_execution` | |
+| `can_continue_execution_error` | |
+| `date` | |
+| `get_date` | |
+| `get_date_utcsecs` | |
+| `math` | |
+| `array` | |
+| `parse_int` | |
+| `parse_float` | |
+| `json` | |
contrib/hackmud_sample_scripts/scripts/crack_example.js
@@ -0,0 +1,41 @@
+//This script just demonstrates how a cracker would work.
+//Executing this code in-game WOULD NOT WORK!!!
+function (context,args) {
+ var std = #s.scripts.lib(); //For logging messages
+ var c_1 = ["x","y","z"]; //Possibilities for lock 1
+ var c_2 = ["a","b","c"]; //Possibilities for lock 2
+ var c_3 = [1,2,3]; //Possibilities for lock 3
+ var ret = ""; //To store the result message of a cracking attempt
+ var comb = {}; //To use when target is called
+
+ ret = args.target.call({}); //Initial call of target to determine first lock
+
+ while (/*LOCK_ERROR present in ret*/) {
+ if (/*ret contains lock 1*/) { //Example of "simple" lock
+ for (/*Length of possibilities for lock 1*/) {
+ //Set neccessary args of comb for cracking attempt
+ //Call target with comb (set ret to output)
+
+ if (/*ret DOES NOT contain any hint on the result (lock is cracked)*/) {
+ break; //Break loop (since further attempts are not neccessary)
+ }
+ }
+ if (/*ret contains lock 2*/) { //Example of lock with 2 arguments
+ for (/*Length of possibilites for lock 2, argument 1*/) {
+ for (/*Length of possibilities for lock 2, argument 2*/) {
+ //Set neccessary args of comb for cracking attempt
+ //Call target with comb (set ret to output)
+
+ if (/*ret DOES NOT contain any hint on any of the arguments (lock is cracked)*/) {
+ break; //Break loop (since further attempts are not neccessary)
+ }
+ }
+ }
+ //Depending on the amount of possible locks, further statements must be added
+ }
+ }
+ }
+
+ std.log(comb); //Log final version of comb (version that fully cracked the target)
+ return {ok:true,msg:std.get_log()}; //Return ok and logs
+}
contrib/hackmud_sample_scripts/scripts/fullsec_check_access_log.js
@@ -0,0 +1,29 @@
+// made by Zuris.
+// the original is reportedly available as `diag.log_analyzer`.
+// this script checks sys.access_log only, in a way that's verifiable - so if you check scripts.get_level on this before running it, you'll know for sure that it doesn't touch your upgrades.
+function(context, args){ // { script }
+ if ((args === null) || (typeof args.script === 'undefined')) {
+ return {ok:false, msg:"Please call this script with {script:#s.sys.access_log} to allow access to your logs"};
+ }
+ var logfile = args.script.call();
+
+ var npc_prefix = ['abndnd', 'uknown', 'unknown', 'derelict', 'anonymous', 'unidentified', 'anon'];
+ var insert;
+ var logs = [];
+
+ logfile.map(function(val, index) {
+ insert = true;
+ for (var i = 0; i < npc_prefix.length; i++) {
+ if (val.indexOf(npc_prefix[i]) > -1) {
+ insert = false;
+ }
+ }
+
+ if (insert) {
+ logs.push(val);
+ }
+ });
+
+ return logs;
+}
+// made by Zuris
contrib/hackmud_sample_scripts/README.md
@@ -18,7 +18,7 @@ I welcome contributions! Couple rules:
* No _functional_ lock cracking scripts. I'll accept certain incomplete (non-functional) lock cracking scripts, but not completed ones.
* If you add obvious backdoors, please point them out via a comment ;).
-Since this is a multiplayer game and I am pretend-rich, I'll also offer in game credits ('GC') in exchange for substantive contributions. Just make sure to leave your in-game name somewhere where I can see it, so I know who to reward! Starts at 500KGC, with no specific upper limit.
+Since this is a multiplayer game and I am pretend-rich, I can offer in-game credits (GC) to people who want to write sample code rather than crackking NPCs or PVPing. Contact me to make arrangements.
# License
contrib/print_cheatsheet.js
@@ -0,0 +1,14 @@
+function(context, args) { // chan:"channel"
+ //coloring cheat sheet
+ let out = "\nChat coloring cheat sheet:\n\n",
+ words = ["hello", "world"];
+ for(let [i,c] of "aAbBcCdDeEfFgGhHiIjJkKlLmMnNoOpPqQrRsStTuUvVwWxXyYzZ".split('').entries()) {
+ out += `\`\`${c+c+words[i%2]}\`\`${i%2?"\n":" "}`;
+ }
+ out += "\n";
+
+ if(args && args.target)
+ #s.chats.send({channel:args.chan, msg:out});
+ else
+ return out;
+}