"use strict"; var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) { function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); } return new (P || (P = Promise))(function (resolve, reject) { function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } } function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } } function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); } step((generator = generator.apply(thisArg, _arguments || [])).next()); }); }; var __generator = (this && this.__generator) || function (thisArg, body) { var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g; return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g; function verb(n) { return function (v) { return step([n, v]); }; } function step(op) { if (f) throw new TypeError("Generator is already executing."); while (_) try { if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t; if (y = 0, t) op = [op[0] & 2, t.value]; switch (op[0]) { case 0: case 1: t = op; break; case 4: _.label++; return { value: op[1], done: false }; case 5: _.label++; y = op[1]; op = [0]; continue; case 7: op = _.ops.pop(); _.trys.pop(); continue; default: if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; } if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; } if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; } if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; } if (t[2]) _.ops.pop(); _.trys.pop(); continue; } op = body.call(thisArg, _); } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; } if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true }; } }; Object.defineProperty(exports, "__esModule", { value: true }); exports.AccountRegistry = void 0; var AccountRegistry = /** @class */ (function () { function AccountRegistry(w3, abi, address, signerAddress) { this.contract = new w3.eth.Contract(abi, address); if (signerAddress) { this.signerAccount = signerAddress; } else { this.signerAccount = w3.eth.accounts[0]; } } AccountRegistry.prototype.count = function () { return __awaiter(this, void 0, void 0, function () { return __generator(this, function (_a) { return [2 /*return*/, this.contract.methods.count().call()]; }); }); }; AccountRegistry.prototype.have = function (address) { return __awaiter(this, void 0, void 0, function () { return __generator(this, function (_a) { switch (_a.label) { case 0: return [4 /*yield*/, this.contract.methods.accountsIndex(address).call()]; case 1: return [2 /*return*/, (_a.sent()) != 0]; } }); }); }; AccountRegistry.prototype.last = function (n) { return __awaiter(this, void 0, void 0, function () { var c, lo, accounts, i, a; return __generator(this, function (_a) { switch (_a.label) { case 0: return [4 /*yield*/, this.count()]; case 1: c = _a.sent(); lo = c - n - 1; if (lo < 0) { lo = 0; } accounts = []; i = c - 1; _a.label = 2; case 2: if (!(i > lo)) return [3 /*break*/, 5]; return [4 /*yield*/, this.contract.methods.accounts(i).call()]; case 3: a = _a.sent(); accounts.push(a); _a.label = 4; case 4: i--; return [3 /*break*/, 2]; case 5: return [2 /*return*/, accounts]; } }); }); }; AccountRegistry.prototype.add = function (address) { return __awaiter(this, void 0, void 0, function () { return __generator(this, function (_a) { switch (_a.label) { case 0: return [4 /*yield*/, this.contract.methods.add(address).send({ from: this.signerAccount })]; case 1: return [2 /*return*/, _a.sent()]; } }); }); }; return AccountRegistry; }()); exports.AccountRegistry = AccountRegistry;