bapig
Version:
Welcome to BAPIG, a powerful backend solution designed to streamline your development process. With over 40 built-in functionalities, BAPIG simplifies CRUD operations, facilitates authentication and encryption, handles communication tasks, and much more.
122 lines • 7.51 kB
JavaScript
;
var __assign = (this && this.__assign) || function () {
__assign = Object.assign || function(t) {
for (var s, i = 1, n = arguments.length; i < n; i++) {
s = arguments[i];
for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p))
t[p] = s[p];
}
return t;
};
return __assign.apply(this, arguments);
};
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 };
}
};
var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
if (ar || !(i in from)) {
if (!ar) ar = Array.prototype.slice.call(from, 0, i);
ar[i] = from[i];
}
}
return to.concat(ar || Array.prototype.slice.call(from));
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.search = void 0;
// dependencies
var fast_web_kit_1 = require("fast-web-kit");
var single_1 = require("../../schema/single");
var helpers_1 = require("../../helpers");
// Search document async function
function search(query) {
return __awaiter(this, void 0, void 0, function () {
var objectKeys, condition, schema, keyword_1, sort, fields, select, joinForeignKeys, schemaFile, model, $or, searchResults, error_1;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
_a.trys.push([0, 2, , 3]);
objectKeys = ["condition", "schema", "keyword", "sort", "fields", "select", "joinForeignKeys"];
// Validate that the query object has all required keys
if (!fast_web_kit_1.object.hasAllKeys(query, objectKeys))
return [2 /*return*/, { success: false, message: "query object must have the following keys: ".concat(objectKeys) }];
condition = query.condition, schema = query.schema, keyword_1 = query.keyword, sort = query.sort, fields = query.fields, select = query.select, joinForeignKeys = query.joinForeignKeys;
// Convert fields to an array and validate that they are strings
fields = (0, helpers_1.convertToArray)(fields);
// Validate that schema and keyword are non-empty strings, and fields is a non-empty array of strings
if (fast_web_kit_1.string.isEmpty(schema))
return [2 /*return*/, { success: false, message: "schema must be a non-empty string" }];
if (fast_web_kit_1.string.isEmpty(keyword_1))
return [2 /*return*/, { success: false, message: "keyword must be a non-empty string" }];
if (!fast_web_kit_1.array.hasSameDataType(fields, "string"))
return [2 /*return*/, { success: false, message: "fields must be a non-empty array of string(s)" }];
schemaFile = (0, single_1.getSingleSchema)(schema);
// Verify schema file existence
if (!schemaFile.message)
return [2 /*return*/, schemaFile];
model = schemaFile.message;
// Convert condition to an object
condition = (0, helpers_1.convertToObject)(condition);
$or = fields.map(function (field) {
var _a;
return (_a = {}, _a[field] = { $regex: keyword_1, $options: "si" }, _a);
});
$or = condition.$or ? __spreadArray(__spreadArray([], $or, true), condition.$or, true) : $or;
condition = __assign(__assign({}, condition), { $or: $or });
return [4 /*yield*/, model
.find(condition)
.select((0, helpers_1.convertToObject)(select))
.lean({ autopopulate: (0, helpers_1.convertToBoolean)(joinForeignKeys) })
.sort((0, helpers_1.convertToObject)(sort))
.exec()];
case 1:
searchResults = _a.sent();
// Handle the case where no documents are found
if (fast_web_kit_1.array.isEmpty(searchResults))
return [2 /*return*/, { success: false, message: "no ".concat(schema, " has been found") }];
// Return successful response with the search results
return [2 /*return*/, { success: true, message: searchResults }];
case 2:
error_1 = _a.sent();
// Return an error response in case of an exception
return [2 /*return*/, { success: false, message: error_1.message }];
case 3: return [2 /*return*/];
}
});
});
}
exports.search = search;
//# sourceMappingURL=search.js.map