@glitterprotocol/glitter-sdk
Version:
The JavaScript SDK for Glitter
123 lines • 6.44 kB
JavaScript
;
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.insert = void 0;
var index_1 = require("../index");
var const_1 = require("./const");
function insert() {
return __awaiter(this, void 0, void 0, function () {
var client, key, dbClient, row, insertResult, rows, batchInsertResult;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
client = new index_1.LCDClient({
chainID: const_1.chainId,
URL: const_1.url,
gasPrices: const_1.gasPrices,
gasAdjustment: const_1.gasAdjustment,
});
key = new index_1.MnemonicKey({
mnemonic: const_1.mnemonicKey,
account: 0,
index: 0,
});
dbClient = client.db(key);
console.log('=====insert one row:');
row = {
_id: '7f2b6638ab9ec6bfeb5924bf8e7f17e1',
_tx_id: '',
author: 'J. K. Rowling',
extension: 'pdf',
filesize: 743406,
ipfs_cid: 'bafykbzaceah6cdfb3syzrntpuuxycsfp55rtmby4oxzli2wodajgtea3ghafg',
issn: '',
language: 'English',
publisher: '',
series: '',
tags: '',
title: 'Harry Potter and the Sorcerers Stone',
year: '1999',
};
return [4 /*yield*/, dbClient.insert(const_1.dbName, const_1.bookTableName, row)];
case 1:
insertResult = _a.sent();
console.log(insertResult);
console.log('=====insert multi rows:');
rows = [
{
_id: '1532675066c4913e5d0f44b82014ca9e',
_tx_id: '',
author: 'J. K. Rowling',
extension: 'pdf',
filesize: 3475199,
ipfs_cid: 'bafykbzaceasltcubwipjpirdmxklcwdznq4mkdx4zrey5xradmoaif34a5bn2',
issn: '',
language: 'English',
publisher: '',
series: 'Harry Potter 2',
tags: '',
title: 'Harry Potter and the Chamber of Secrets (Book 2)',
year: '2000',
},
{
_id: '50740153c2bf4a5db99f8b807b4a4b60',
_tx_id: '',
author: 'J.K. Rowling, Mary GrandPré',
extension: 'pdf',
filesize: 4478241,
ipfs_cid: 'bafykbzaceaaxtdouipt5managw2creovvg6pscsjkyqfqtocpaqg3zsmbndtm',
issn: '',
language: 'English',
publisher: 'Scholastic',
series: 'Harry Potter 3',
tags: '',
title: 'Harry Potter and the Prisoner of Azkaban',
year: '1999',
},
];
return [4 /*yield*/, dbClient.batchInsert(const_1.dbName, const_1.bookTableName, rows)];
case 2:
batchInsertResult = _a.sent();
console.log(batchInsertResult);
return [2 /*return*/];
}
});
});
}
exports.insert = insert;
//# sourceMappingURL=4_full_text_insert.js.map