@firmachain/firma-js
Version:
The Official FirmaChain Javascript SDK written in Typescript
166 lines (165 loc) • 8.29 kB
JavaScript
"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 (g && (g = 0, op[0] && (_ = 0)), _) 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 });
var chai_1 = require("chai");
var FirmaSDK_1 = require("../sdk/FirmaSDK");
var config_test_1 = require("./config_test");
describe('[11. NFT Query Test]', function () {
var firma;
var aliceWallet;
var aliceAddress;
beforeEach(function () {
return __awaiter(this, void 0, void 0, function () {
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
firma = new FirmaSDK_1.FirmaSDK(config_test_1.TestChainConfig);
return [4 /*yield*/, firma.Wallet.fromMnemonic(config_test_1.aliceMnemonic)];
case 1:
aliceWallet = _a.sent();
return [4 /*yield*/, aliceWallet.getAddress()];
case 2:
aliceAddress = _a.sent();
return [2 /*return*/];
}
});
});
});
it('NFT getBalanceOf', function () { return __awaiter(void 0, void 0, void 0, function () {
var totalNft;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, firma.Nft.getBalanceOf(aliceAddress)];
case 1:
totalNft = _a.sent();
(0, chai_1.expect)(totalNft).to.be.equal(totalNft);
(0, chai_1.expect)(totalNft).to.be.greaterThan(0);
return [2 /*return*/];
}
});
}); });
it('NFT getNftIdListOfOwner', function () { return __awaiter(void 0, void 0, void 0, function () {
var result;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, firma.Nft.getNftIdListOfOwner(aliceAddress)];
case 1:
result = _a.sent();
(0, chai_1.expect)(result.nftIdList.length).to.be.greaterThan(0);
return [2 /*return*/];
}
});
}); });
it('NFT getNftItemAllFromAddress-Pagination', function () { return __awaiter(void 0, void 0, void 0, function () {
var result, total, current;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, firma.Nft.getNftItemAllFromAddress(aliceAddress)];
case 1:
result = _a.sent();
total = result.pagination.total;
current = result.dataList.length;
_a.label = 2;
case 2:
if (!(result.pagination.next_key != "" && result.pagination.next_key != null)) return [3 /*break*/, 4];
return [4 /*yield*/, firma.Nft.getNftItemAllFromAddress(aliceAddress, result.pagination.next_key)];
case 3:
result = _a.sent();
current += result.dataList.length;
return [3 /*break*/, 2];
case 4:
(0, chai_1.expect)(current).to.be.equal(total);
return [2 /*return*/];
}
});
}); });
it('NFT getNftItemAllFromAddress', function () { return __awaiter(void 0, void 0, void 0, function () {
var nftItemList;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, firma.Nft.getNftItemAllFromAddress(aliceAddress)];
case 1:
nftItemList = _a.sent();
(0, chai_1.expect)(nftItemList.dataList.length).to.be.greaterThan(0);
return [2 /*return*/];
}
});
}); });
it('NFT getNftItemAll-pagination', function () { return __awaiter(void 0, void 0, void 0, function () {
var result, total, totalItemList, index, i, i;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, firma.Nft.getNftItemAll()];
case 1:
result = _a.sent();
total = result.pagination.total;
totalItemList = [];
index = 0;
_a.label = 2;
case 2:
if (!(result.pagination.next_key != null)) return [3 /*break*/, 4];
for (i = 0; i < result.dataList.length; i++) {
totalItemList[index++] = result.dataList[i];
}
return [4 /*yield*/, firma.Nft.getNftItemAll(result.pagination.next_key)];
case 3:
result = _a.sent();
return [3 /*break*/, 2];
case 4:
for (i = 0; i < result.dataList.length; i++) {
totalItemList[index++] = result.dataList[i];
}
(0, chai_1.expect)(totalItemList.length).to.be.equal(total);
return [2 /*return*/];
}
});
}); });
it('NFT getNftItemAll', function () { return __awaiter(void 0, void 0, void 0, function () {
var result;
return __generator(this, function (_a) {
switch (_a.label) {
case 0: return [4 /*yield*/, firma.Nft.getNftItemAll()];
case 1:
result = _a.sent();
(0, chai_1.expect)(result.dataList.length).to.be.equal(result.dataList.length);
(0, chai_1.expect)(result.dataList.length).to.be.greaterThan(0);
return [2 /*return*/];
}
});
}); });
});