Transaction

jrun
MS{"in":0,"ref":["native://Jig"],"out":["a6973db16ce10dc9827bb9ca08ea0a09f8d19433e8eebd818422b85b52a779a2","1fec6ed7b106fb25ef2b2d9c3beb00524f999bb35122b201f770ea37b2328d58","7efc1bde3a0d78ef27705a2db25e2dc2d408a5d0fb4d706e46f39a9cdb20f4e0"],"del":[],"cre":["mzcwZjsbBHgy4rxfULW4mFXVRb6N9pkLV4","mzcwZjsbBHgy4rxfULW4mFXVRb6N9pkLV4","mzcwZjsbBHgy4rxfULW4mFXVRb6N9pkLV4"],"exec":[{"op":"DEPLOY","data":["class Wallet_History_Cache extends Jig {\n // check if something is in the cache in O(1) with last_seen_height and if(wallet_history_cache.cache.hasOwnProperty([txhash]))\n init() {\n this.classname = \"Wallet_History_Cache: \"; //\n\n this.cache = {};\n this.last_seen_height = 0;\n this.length = 0;\n this.cache_ordered_txhash_history = []; // contains array of : {tx_hash: X, height: Y, usertimestamp: Z} // this will come useful once whatsonchain adds pages to their history API or if a wallet contains too much to load fast\n }\n\n get_cache_array() {\n // return the cache as an array instead of an object\n const allkeys = Object.keys(this.cache);\n var cache_array = [];\n\n for (var i = 0; i < allkeys.length; i++) {\n cache_array.push(this.cache[allkeys[i]]);\n }\n\n return cache_array;\n }\n\n add_entries2(array_new_entries) {\n var function_id = this.classname + \" add_entries2(): \";\n console.log(function_id + \" typeof array_new_entries = \" + typeof array_new_entries);\n if (typeof array_new_entries !== 'Object') throw new WeirdError(function_id + 'array_new_entries should be Object : ', array_new_entries); // throw gives better error trace than expect()\n\n console.log(function_id + \" Object.keys(this.cache) : \", Object.keys(this.cache)); // very important to start by ordering the new_entries by blockheight, in case the loop aborts midway, we want a correct last_seen_height !\n\n /*\r\n array_new_entries.sort(function(a, b) {\r\n return a.blockheight - b.blockheight;\r\n });\r\n */\n\n console.log(this.classname + \" add_entries2() : this.length = \", this.length);\n\n for (var i = 0; i < array_new_entries.length; i++) {\n var curr_new_entry = array_new_entries[i];\n console.log(function_id + \" curr_new_entry = \", curr_new_entry);\n if (this.cache.hasOwnProperty(curr_new_entry.txhash)) throw function_id + \" this txhash is already in cache, aborting : \" + curr_new_entry.txhash; // add to object that acts as an hashtable\n\n this.cache[curr_new_entry.txhash] = curr_new_entry; // add to the cached ordered tx hash history\n\n this.cache_ordered_txhash_history.push({\n tx_hash: curr_new_entry.txhash,\n height: curr_new_entry.blockheight,\n usertimestamp: curr_new_entry.timestamp\n }); //\n // TODO maybe we should re-order the cache_ordered_txhash_history after the for loop ?\n //\n\n this.length++; // update last_seen_height\n\n if (curr_new_entry.blockheight > this.last_seen_height) {\n this.last_seen_height = curr_new_entry.blockheight;\n }\n }\n\n console.log(this.classname + \" add_entries2() : this.length = \", this.length);\n }\n\n add_entries(array_new_entries) {\n var function_id = this.classname + \" add_entries(): \";\n expect(array_new_entries).toBeObject(function_id + 'bad array_new_entries type, should be Object: ', array_new_entries); // very important to start by ordering the new_entries by blockheight, in case the loop aborts midway!\n\n array_new_entries.sort(function (a, b) {\n return a.blockheight - b.blockheight;\n });\n\n for (var i = 0; i < array_new_entries.length; i++) {\n var curr_new_entry = array_new_entries[i];\n expect(curr_new_entry).toBeObject(function_id + 'bad curr_new_entry type, should be Object: ', curr_new_entry);\n\n if (!curr_new_entry.blockheight || curr_new_entry.blockheight <= 0) {\n // we should not try to add to cache unconfirmed transactions because blockheight is still unknown\n throw function_id + \" problem with curr_new_entry.blockheight, are you trying to add unconfirmed tx to cache ? : \" + curr_new_entry.blockheight + \" for txhash: \" + curr_new_entry.txhash;\n }\n\n expect(curr_new_entry.blockheight).toBeInteger(function_id + 'curr_new_entry.blockheight must be an integer: ', curr_new_entry.blockheight); //\n\n if (this.cache.hasOwnProperty(curr_new_entry.txhash)) throw function_id + \" this txhash is already in cache, aborting : \" + curr_new_entry.txhash; // add to object that acts as an hashtable\n\n this.cache[curr_new_entry.txhash] = curr_new_entry; // add to the cached ordered tx hash history\n\n this.cache_ordered_txhash_history.push({\n tx_hash: curr_new_entry.txhash,\n height: curr_new_entry.blockheight,\n usertimestamp: curr_new_entry.timestamp\n }); //\n // TODO maybe we should re-order the cache_ordered_txhash_history after the for loop ?\n //\n\n this.length++; // update last_seen_height\n\n if (curr_new_entry.blockheight > this.last_seen_height) {\n this.last_seen_height = curr_new_entry.blockheight;\n }\n }\n }\n\n}",{"deps":{"expect":{"$jig":2},"Jig":{"$jig":0}}},"function expect(t){let e=!1;const n=t=>{if(\"object\"!=typeof t||!t)return t;try{return JSON.stringify(t)}catch(e){return t.toString()}};function r(r,o,i){if(e?r:!r)throw new Error(i||`expected value${e?\" not\":\"\"} to be ${o} but was ${n(t)}`)}function o(t,e){if(t===e)return!0;if(typeof t!=typeof e)return!1;if(\"object\"!=typeof t)return!1;if(null===t||null===e)return!1;if(Object.getPrototypeOf(t)!==Object.getPrototypeOf(e))return!1;if(Object.keys(t).length!==Object.keys(e).length)return!1;if(!Object.keys(t).every(n=>o(t[n],e[n])))return!1;if(t instanceof Set){if(t.size!==e.size)return!1;if(!o(Array.from(t.entries()),Array.from(e.entries())))return!1}if(t instanceof Map){if(t.size!==e.size)return!1;if(!o(Array.from(t.entries()),Array.from(e.entries())))return!1}return!0}function i(t,e){if(\"function\"!=typeof t)return!1;if(\"function\"!=typeof e)return!1;for(;t;)if((t=Object.getPrototypeOf(t))===e)return!0;return!1}return{get not(){return e=!e,this},toBe:(e,o)=>r(t===e,\"\"+n(e),o),toEqual:(e,i)=>r(o(t,e),\"equal to \"+n(e),i),toBeInstanceOf:(e,n)=>r(t&&t instanceof e,\"an instance of \"+(e&&e.name),n),toBeDefined:e=>r(void 0!==t,\"defined\",e),toBeNull:e=>r(null===t,\"null\",e),toBeNumber:e=>r(\"number\"==typeof t,\"a number\",e),toBeInteger:e=>r(Number.isInteger(t),\"an integer\",e),toBeLessThan:(e,n)=>r(t<e&&\"number\"==typeof t&&\"number\"==typeof e,\"less than \"+e,n),toBeLessThanOrEqualTo:(e,n)=>r(t<=e&&\"number\"==typeof t&&\"number\"==typeof e,\"less than or equal to \"+e,n),toBeGreaterThan:(e,n)=>r(t>e&&\"number\"==typeof t&&\"number\"==typeof e,\"greater than \"+e,n),toBeGreaterThanOrEqualTo:(e,n)=>r(t>=e&&\"number\"==typeof t&&\"number\"==typeof e,\"greater than or equal to \"+e,n),toBeBoolean:e=>r(\"boolean\"==typeof t,\"a boolean\",e),toBeString:e=>r(\"string\"==typeof t,\"a string\",e),toBeObject:e=>r(t&&\"object\"==typeof t,\"an object\",e),toBeArray:e=>r(Array.isArray(t),\"an array\",e),toBeSet:e=>r(t instanceof Set,\"a set\",e),toBeMap:e=>r(t instanceof Map,\"a map\",e),toBeUint8Array:e=>r(t instanceof Uint8Array,\"a uint8array\",e),toBeClass:e=>r(\"function\"==typeof t&&t.toString().startsWith(\"class\"),\"a class\",e),toBeFunction:e=>r(\"function\"==typeof t&&!t.toString().startsWith(\"class\"),\"a function\",e),toBeJigClass:e=>r(\"function\"==typeof t&&t.toString().startsWith(\"class\")&&i(t,Jig),\"a jig class\",e),toExtendFrom:(e,n)=>r(i(t,e),\"an extension of \"+(e&&e.name),n)}}",{"deps":{"Jig":{"$dup":["1","deps","Jig"]}}}]},{"op":"NEW","data":[{"$jig":1},[]]}]}