j-kompact 1.0.0

package/LICENSE

@@ -0,0 +1,151 @@
+Mozilla Public License
+Version 2.0
+1. Definitions
+1.1. “Contributor”
+means each individual or legal entity that creates, contributes to the creation of, or owns Covered Software.
+
+1.2. “Contributor Version”
+means the combination of the Contributions of others (if any) used by a Contributor and that particular Contributor’s Contribution.
+
+1.3. “Contribution”
+means Covered Software of a particular Contributor.
+
+1.4. “Covered Software”
+means Source Code Form to which the initial Contributor has attached the notice in Exhibit A, the Executable Form of such Source Code Form, and Modifications of such Source Code Form, in each case including portions thereof.
+
+1.5. “Incompatible With Secondary Licenses”
+means
+
+that the initial Contributor has attached the notice described in Exhibit B to the Covered Software; or
+
+that the Covered Software was made available under the terms of version 1.1 or earlier of the License, but not also under the terms of a Secondary License.
+
+1.6. “Executable Form”
+means any form of the work other than Source Code Form.
+
+1.7. “Larger Work”
+means a work that combines Covered Software with other material, in a separate file or files, that is not Covered Software.
+
+1.8. “License”
+means this document.
+
+1.9. “Licensable”
+means having the right to grant, to the maximum extent possible, whether at the time of the initial grant or subsequently, any and all of the rights conveyed by this License.
+
+1.10. “Modifications”
+means any of the following:
+
+any file in Source Code Form that results from an addition to, deletion from, or modification of the contents of Covered Software; or
+
+any new file in Source Code Form that contains any Covered Software.
+
+1.11. “Patent Claims” of a Contributor
+means any patent claim(s), including without limitation, method, process, and apparatus claims, in any patent Licensable by such Contributor that would be infringed, but for the grant of the License, by the making, using, selling, offering for sale, having made, import, or transfer of either its Contributions or its Contributor Version.
+
+1.12. “Secondary License”
+means either the GNU General Public License, Version 2.0, the GNU Lesser General Public License, Version 2.1, the GNU Affero General Public License, Version 3.0, or any later versions of those licenses.
+
+1.13. “Source Code Form”
+means the form of the work preferred for making modifications.
+
+1.14. “You” (or “Your”)
+means an individual or a legal entity exercising rights under this License. For legal entities, “You” includes any entity that controls, is controlled by, or is under common control with You. For purposes of this definition, “control” means (a) the power, direct or indirect, to cause the direction or management of such entity, whether by contract or otherwise, or (b) ownership of more than fifty percent (50%) of the outstanding shares or beneficial ownership of such entity.
+
+2. License Grants and Conditions
+2.1. Grants
+Each Contributor hereby grants You a world-wide, royalty-free, non-exclusive license:
+
+under intellectual property rights (other than patent or trademark) Licensable by such Contributor to use, reproduce, make available, modify, display, perform, distribute, and otherwise exploit its Contributions, either on an unmodified basis, with Modifications, or as part of a Larger Work; and
+
+under Patent Claims of such Contributor to make, use, sell, offer for sale, have made, import, and otherwise transfer either its Contributions or its Contributor Version.
+
+2.2. Effective Date
+The licenses granted in Section 2.1 with respect to any Contribution become effective for each Contribution on the date the Contributor first distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+The licenses granted in this Section 2 are the only rights granted under this License. No additional rights or licenses will be implied from the distribution or licensing of Covered Software under this License. Notwithstanding Section 2.1(b) above, no patent license is granted by a Contributor:
+
+for any code that a Contributor has removed from Covered Software; or
+
+for infringements caused by: (i) Your and any other third party’s modifications of Covered Software, or (ii) the combination of its Contributions with other software (except as part of its Contributor Version); or
+
+under Patent Claims infringed by Covered Software in the absence of its Contributions.
+
+This License does not grant any rights in the trademarks, service marks, or logos of any Contributor (except as may be necessary to comply with the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+No Contributor makes additional grants as a result of Your choice to distribute the Covered Software under a subsequent version of this License (see Section 10.2) or under the terms of a Secondary License (if permitted under the terms of Section 3.3).
+
+2.5. Representation
+Each Contributor represents that the Contributor believes its Contributions are its original creation(s) or it has sufficient rights to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+This License is not intended to limit any rights You have under applicable copyright doctrines of fair use, fair dealing, or other equivalents.
+
+2.7. Conditions
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted in Section 2.1.
+
+3. Responsibilities
+3.1. Distribution of Source Form
+All distribution of Covered Software in Source Code Form, including any Modifications that You create or to which You contribute, must be under the terms of this License. You must inform recipients that the Source Code Form of the Covered Software is governed by the terms of this License, and how they can obtain a copy of this License. You may not attempt to alter or restrict the recipients’ rights in the Source Code Form.
+
+3.2. Distribution of Executable Form
+If You distribute Covered Software in Executable Form then:
+
+such Covered Software must also be made available in Source Code Form, as described in Section 3.1, and You must inform recipients of the Executable Form how they can obtain a copy of such Source Code Form by reasonable means in a timely manner, at a charge no more than the cost of distribution to the recipient; and
+
+You may distribute such Executable Form under the terms of this License, or sublicense it under different terms, provided that the license for the Executable Form does not attempt to limit or alter the recipients’ rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+You may create and distribute a Larger Work under terms of Your choice, provided that You also comply with the requirements of this License for the Covered Software. If the Larger Work is a combination of Covered Software with a work governed by one or more Secondary Licenses, and the Covered Software is not Incompatible With Secondary Licenses, this License permits You to additionally distribute such Covered Software under the terms of such Secondary License(s), so that the recipient of the Larger Work may, at their option, further distribute the Covered Software under the terms of either this License or such Secondary License(s).
+
+3.4. Notices
+You may not remove or alter the substance of any license notices (including copyright notices, patent notices, disclaimers of warranty, or limitations of liability) contained within the Source Code Form of the Covered Software, except that You may alter any license notices to the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+You may choose to offer, and to charge a fee for, warranty, support, indemnity or liability obligations to one or more recipients of Covered Software. However, You may do so only on Your own behalf, and not on behalf of any Contributor. You must make it absolutely clear that any such warranty, support, indemnity, or liability obligation is offered by You alone, and You hereby agree to indemnify every Contributor for any liability incurred by such Contributor as a result of warranty, support, indemnity or liability terms You offer. You may include additional disclaimers of warranty and limitations of liability specific to any jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+If it is impossible for You to comply with any of the terms of this License with respect to some or all of the Covered Software due to statute, judicial order, or regulation then You must: (a) comply with the terms of this License to the maximum extent possible; and (b) describe the limitations and the code they affect. Such description must be placed in a text file included with all distributions of the Covered Software under this License. Except to the extent prohibited by statute or regulation, such description must be sufficiently detailed for a recipient of ordinary skill to be able to understand it.
+
+5. Termination
+5.1. The rights granted under this License will terminate automatically if You fail to comply with any of its terms. However, if You become compliant, then the rights granted under this License from a particular Contributor are reinstated (a) provisionally, unless and until such Contributor explicitly and finally terminates Your grants, and (b) on an ongoing basis, if such Contributor fails to notify You of the non-compliance by some reasonable means prior to 60 days after You have come back into compliance. Moreover, Your grants from a particular Contributor are reinstated on an ongoing basis if such Contributor notifies You of the non-compliance by some reasonable means, this is the first time You have received notice of non-compliance with this License from such Contributor, and You become compliant prior to 30 days after Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent infringement claim (excluding declaratory judgment actions, counter-claims, and cross-claims) alleging that a Contributor Version directly or indirectly infringes any patent, then the rights granted to You by any and all Contributors for the Covered Software under Section 2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all end user license agreements (excluding distributors and resellers) which have been validly granted by You or Your distributors under this License prior to termination shall survive termination.
+
+6. Disclaimer of Warranty
+Covered Software is provided under this License on an “as is” basis, without warranty of any kind, either expressed, implied, or statutory, including, without limitation, warranties that the Covered Software is free of defects, merchantable, fit for a particular purpose or non-infringing. The entire risk as to the quality and performance of the Covered Software is with You. Should any Covered Software prove defective in any respect, You (not any Contributor) assume the cost of any necessary servicing, repair, or correction. This disclaimer of warranty constitutes an essential part of this License. No use of any Covered Software is authorized under this License except under this disclaimer.
+
+7. Limitation of Liability
+Under no circumstances and under no legal theory, whether tort (including negligence), contract, or otherwise, shall any Contributor, or anyone who distributes Covered Software as permitted above, be liable to You for any direct, indirect, special, incidental, or consequential damages of any character including, without limitation, damages for lost profits, loss of goodwill, work stoppage, computer failure or malfunction, or any and all other commercial damages or losses, even if such party shall have been informed of the possibility of such damages. This limitation of liability shall not apply to liability for death or personal injury resulting from such party’s negligence to the extent applicable law prohibits such limitation. Some jurisdictions do not allow the exclusion or limitation of incidental or consequential damages, so this exclusion and limitation may not apply to You.
+
+8. Litigation
+Any litigation relating to this License may be brought only in the courts of a jurisdiction where the defendant maintains its principal place of business and such litigation shall be governed by laws of that jurisdiction, without reference to its conflict-of-law provisions. Nothing in this Section shall prevent a party’s ability to bring cross-claims or counter-claims.
+
+9. Miscellaneous
+This License represents the complete agreement concerning the subject matter hereof. If any provision of this License is held to be unenforceable, such provision shall be reformed only to the extent necessary to make it enforceable. Any law or regulation which provides that the language of a contract shall be construed against the drafter shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+10.1. New Versions
+Mozilla Foundation is the license steward. Except as provided in Section 10.3, no one other than the license steward has the right to modify or publish new versions of this License. Each version will be given a distinguishing version number.
+
+10.2. Effect of New Versions
+You may distribute the Covered Software under the terms of the version of the License under which You originally received the Covered Software, or under the terms of any subsequent version published by the license steward.
+
+10.3. Modified Versions
+If you create software not governed by this License, and you want to create a new license for such software, you may create and use a modified version of this License if you rename the license and remove any references to the name of the license steward (except to note that such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary Licenses
+If You choose to distribute Source Code Form that is Incompatible With Secondary Licenses under the terms of this version of the License, the notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+This Source Code Form is subject to the terms of the Mozilla Public License, v. 2.0. If a copy of the MPL was not distributed with this file, You can obtain one at https://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular file, then You may include the notice in a location (such as a LICENSE file in a relevant directory) where a recipient would be likely to look for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - “Incompatible With Secondary Licenses” Notice
+This Source Code Form is “Incompatible With Secondary Licenses”, as defined by the Mozilla Public License, v. 2.0.

package/dist/Array.d.ts

@@ -0,0 +1,110 @@
+import { MLObject } from './Object.ts';
+import { And, Ascending, Descending, Or } from './Type.ts';
+export declare const isArray: (arg: any) => arg is any[];
+type MLArrayOptions = {
+    flatting?: boolean;
+    deleteNull?: boolean;
+    unique?: boolean;
+    withLog?: boolean;
+};
+export type callbackFunction<T, U> = (value: T, no: number, array: MLArray<T>) => U;
+export type OrderBy = typeof Ascending | typeof Descending;
+export type Logic = typeof And | typeof Or;
+export declare class MLArray<T> extends Array<T> {
+    batchSize: number;
+    withLog: boolean;
+    static from<T>(iterable: Iterable<T> | Array<T>): MLArray<T>;
+    static from<T>(arrayLike: ArrayLike<T>): MLArray<T>;
+    static from<T, U>(arrayLike: ArrayLike<T> | Iterable<T>, mapfn: (v: T, k: number) => U, thisArg?: any): MLArray<U>;
+    static repeat<T>(valueOrFunction: T | ((value: T, no: number) => MLArray<T>), count?: number): T[];
+    static init<const T>(array?: T | Array<T | {
+        [s: string]: T;
+    }>, options?: MLArrayOptions): MLArray<T extends readonly any[] ? T[number] : T>;
+    findIndexInOrder(valueOrFunc: callbackFunction<T, boolean | T>, order?: number): undefined;
+    map<U>(callbackFunc: callbackFunction<T, U>): MLArray<U>;
+    map(callbackFunc: (arg0: any, arg1: any, arg2: any) => any, thisArg?: any): any;
+    mapToObject(callbackFn: (value: T, no: number, array: MLArray<T>) => unknown): any;
+    castToString(): MLArray<string>;
+    /**
+     * Mengubah array yang ada di dalam MLArray biasa menjadi MLArray
+     */
+    mapCast(callbackFunc: callbackFunction<T, any>): MLArray<any>;
+    /**
+     * Fungsi alternatif dari indexOf() dengan sistem one-based index
+     */
+    locationOf(value: T): number;
+    slice(start: number, end: number | null): MLArray<T>;
+    slice(start?: number, end?: number): T[];
+    /**
+     * Mengabungkan array dengan pemisah (default: 'dan') di akhir untuk keterbacaan
+     */
+    readableJoin(options?: {
+        and?: string;
+        separator?: string;
+    }): string;
+    push(...values: T[] | [{
+        many: boolean;
+    }]): MLArray<T>;
+    push(...values: T[]): number;
+    filter(predicate: callbackFunction<T, boolean>): MLArray<T>;
+    filter(predicate: (arg0: any, arg1: any, arg2: any) => boolean): T[];
+    immutableFilter(predicate: callbackFunction<T, boolean>): MLArray<T>;
+    batch<U>(length: number, callbackFunction: callbackFunction<T, U>, from?: number): void;
+    lazyFlat(): MLArray<T>;
+    lazyFlat(): Array<T>;
+    get(...at: number[]): T | MLArray<T | undefined> | undefined;
+    addAfter(at: number, ...data: T[]): this;
+    deleteNull(): MLArray<T>;
+    search(search: string | string[] | ((value: string) => boolean), options?: {
+        plus?: number;
+    }): number[] | number[][];
+    getValueWhere(key: string, val: T): T | undefined;
+    getValuesExcept(key: string, val: T): MLArray<T>;
+    wrap(dimension?: number): MLArray<any>;
+    wrapInside(dimension?: number): MLArray<any[]>;
+    /**
+     * Pembersihan data duplikat di array
+     */
+    unique(): MLArray<T>;
+    toParam(): MLArray<MLArray<T>>;
+    /**
+     * Extract 2d array by index
+     */
+    extract(...at: number[] | [{
+        useWrap?: number;
+        isZeroBasedIndex?: boolean;
+    }]): any;
+    sort(orderBy?: OrderBy | ((a: T, b: T) => number)): this;
+    toObject(): MLObject<unknown>;
+    iterate(callbackFunc: callbackFunction<T, void>): void;
+    sum(): number;
+    subtract(options?: {
+        positive?: boolean;
+    }): number;
+    max(): number;
+    min(): number;
+    minMax(): number[];
+    /**
+     * Mengecek tipe data menggunakan "typeof" bawaan JavaScript untuk banyak variabel sekaligus
+     */
+    isTypeOf(type: ReturnType<typeof typeof_dummy>, options?: {
+        logic?: Logic;
+    }): boolean;
+}
+declare const typeof_dummy: () => "bigint" | "boolean" | "function" | "number" | "object" | "string" | "symbol" | "undefined";
+export declare function initArray<const T>(array?: Array<T | Record<string, T>> | T, options?: MLArrayOptions): MLArray<T extends readonly any[] ? T[number] : T>;
+export declare function flat<T>(array: T[]): any[];
+export declare function getOptions(array: any[]): Record<string, any>;
+type SwitchDimension<T, Dimension extends number> = {
+    1: T[];
+    2: T[][];
+    3: T[][][];
+    4: T[][][][];
+    5: T[][][][][];
+}[Dimension extends keyof 1 | 2 | 3 | 4 | 5 ? Dimension : never];
+type NestedArray<T, Dimension extends number> = Dimension extends 1 | 2 | 3 | 4 | 5 ? SwitchDimension<T, Dimension> : any[];
+export declare function wrap<T, Dimension extends number = 1>(value: T, dimension?: Dimension): NestedArray<T, Dimension>;
+export declare function lazyWrap<T>(value: T | T[]): T[];
+export declare function isAllArray(...arg: any[]): boolean;
+export declare function isIterable(value: any): boolean;
+export {};

package/dist/Array.js

@@ -0,0 +1,298 @@
+/** Override fungsi2 bawaan Array */
+import { Break, iterate } from './Iteration.js';
+import { sameWith } from './Comparison.js';
+import { isObject, MLObject } from './Object.js';
+import { And, Ascending, Descending, Or } from './Type.js';
+import { log } from './Dynamic.js';
+import { isString } from './String.js';
+export const isArray = Array.isArray;
+export class MLArray extends Array {
+    batchSize = 50000;
+    withLog = true;
+    // 4. IMPLEMENTASI UTAMA: Gabungkan semua tipe di atas menggunakan union secara presisi
+    static from(arrayLikeOrIterable, mapfn, thisArg) {
+        // Gunakan 'as any' di internal return agar lolos dari strict check constructor kustom Anda
+        return super.from(arrayLikeOrIterable, mapfn, thisArg);
+    }
+    static repeat(valueOrFunction, count = 1) {
+        return super.from({ length: count }, typeof valueOrFunction === 'function' ? valueOrFunction : (_, __) => valueOrFunction);
+    }
+    static init(array = [], options = {}) {
+        const { flatting = false, deleteNull = false, unique = false, withLog = true } = options;
+        let result = this.from(lazyWrap(array));
+        if (flatting)
+            result.lazyFlat();
+        if (deleteNull)
+            result.deleteNull();
+        if (unique)
+            result.unique();
+        result.withLog = withLog;
+        return result;
+    }
+    findIndexInOrder(valueOrFunc, order = 1) {
+        const isFunction = typeof valueOrFunc === 'function';
+        let currentOrder = 0, result;
+        this.iterate((value, no, array) => {
+            if (isFunction ? valueOrFunc(value, no, array) : value === valueOrFunc) {
+                currentOrder++;
+                if (currentOrder === order) {
+                    result = no;
+                    return Break;
+                }
+            }
+        });
+        return result;
+    }
+    // Jembatan Tipe untuk IntelliSense (IDE)
+    map(callbackFn) {
+        return super.map(callbackFn);
+    }
+    mapToObject(callbackFn) {
+        return this.map(callbackFn).toObject();
+    }
+    castToString() {
+        return this.map(data => typeof data !== 'string' ? data.toString() : data);
+    }
+    /**
+     * Mengubah array yang ada di dalam MLArray biasa menjadi MLArray
+     */
+    mapCast(callbackFunc) {
+        return this.map((data, no, array) => callbackFunc((isArray(data) ? initArray(data) : data), no, array));
+    }
+    /**
+     * Fungsi alternatif dari indexOf() dengan sistem one-based index
+     */
+    locationOf(value) {
+        return super.indexOf(value) + 1;
+    }
+    slice(start, end = null) {
+        if (sameWith(0, start, end, { logic: Or, withLog: this.withLog }))
+            throw Error('Start / end tidak boleh 0');
+        if (start >= 1)
+            start = start - 1;
+        return (end != null ? super.slice(start, end) : super.slice(start));
+    }
+    /**
+     * Mengabungkan array dengan pemisah (default: 'dan') di akhir untuk keterbacaan
+     */
+    readableJoin(options = {}) {
+        switch (this.length) {
+            case 0:
+                return '';
+            case 1:
+                return String(this[0]);
+        }
+        const { and = 'dan', separator = ', ' } = options;
+        return `${this.slice(1, -1).join(separator)} ${and} ${this.at(-1)}`;
+    }
+    push(...values) {
+        const { many = false } = getOptions(values), process = (value) => this.batch(values.length, (_, i) => super.push(...values.slice(i, i + this.batchSize)));
+        if (many)
+            this.forEach((_, no) => values[no] && process(values[no]));
+        else
+            process(values.lazyFlat());
+        return this;
+    }
+    filter(predicate) {
+        let writeIndex = 0;
+        this.iterate((data, no) => {
+            if (predicate(data, no, this))
+                this[writeIndex++] = data;
+        });
+        this.length = writeIndex;
+        return this;
+    }
+    immutableFilter(predicate) {
+        return super.filter(predicate);
+    }
+    batch(length, callbackFunction, from = 0) {
+        iterate((i) => callbackFunction(this[i], i, this), { until: length, addition: this.batchSize, from });
+    }
+    lazyFlat() {
+        if (this.some(isArray)) {
+            const flattened = this.flat(Infinity).asMLArray();
+            this.length = 0;
+            flattened.iterate((data, i) => this[i] = data);
+        }
+        return this;
+    }
+    get(...at) {
+        const { defaultIndex = false } = getOptions(at), flattenAt = initArray(at, { flatting: true });
+        const process = (index) => index === 0
+            ? undefined
+            : index > 0
+                ? this[index - +!defaultIndex]
+                : this.at(index);
+        return flattenAt.length > 2 ? flattenAt.map(process) : process(flattenAt[0]);
+    }
+    addAfter(at, ...data) {
+        data = data.lazyFlat();
+        this.batch(data.length, (_, i) => this.splice(at + i, 0, ...data.slice(i, i + this.batchSize)));
+        return this;
+    }
+    deleteNull() {
+        return this.filter(data => !!data);
+    }
+    search(search, options = {}) {
+        const { plus = 0 } = options;
+        let rows = [], firstRow = null, currentRow = 0;
+        if (this.withLog) {
+            log(`Function Name: getIndexes`);
+            log(`Search Value: ${JSON.stringify(search)}`);
+            log(`Values: ${this}`);
+            log(`Index Plus: ${plus}`);
+        }
+        if (typeof search !== 'function')
+            search = lazyWrap(search);
+        this.iterate((data, index, array) => {
+            let value = data;
+            if (typeof value === 'string')
+                value = value.trim();
+            const isSame = typeof search === 'function'
+                ? search(value)
+                : search.includes(value);
+            if (isSame || firstRow != null)
+                currentRow = plus + index;
+            if (firstRow != null && !isSame) {
+                rows.push([firstRow, currentRow - 1]);
+                firstRow = null;
+            }
+            else if (isSame && firstRow == null)
+                firstRow = currentRow;
+        });
+        if (firstRow)
+            rows.push([firstRow, currentRow]);
+        return rows;
+    }
+    getValueWhere(key, val) {
+        return this.find(k => k[key] === val);
+    }
+    getValuesExcept(key, val) {
+        return this.filter(k => k[key] !== val);
+    }
+    wrap(dimension = 1) {
+        return MLArray.from(wrap(this, dimension));
+    }
+    wrapInside(dimension = 1) {
+        return this.map(value => wrap(value, dimension));
+    }
+    /**
+     * Pembersihan data duplikat di array
+     */
+    unique() {
+        this.lazyFlat().deleteNull();
+        const uniqueCollection = MLArray.init([...new Set(this)]);
+        this.length = 0;
+        uniqueCollection.iterate((data, no) => this[no] = data);
+        return this;
+    }
+    toParam() {
+        let result = initArray([]);
+        for (let i = 0; i < this[0].length; i++)
+            result[i] = this.map((content) => content[i]);
+        return result;
+    }
+    /**
+     * Extract 2d array by index
+     */
+    extract(...at) {
+        const { useWrap = 0, isZeroBasedIndex = false } = getOptions(at), 
+        /**
+         * @param {MLArray} content
+         * @param {number} at
+         * @return {MLArray|*}
+         */
+        process = (content, at) => {
+            const result = content.get(at + isZeroBasedIndex);
+            return useWrap ? wrap(result, useWrap).asMLArray() : result;
+        }, result = initArray(at, { flatting: true }).mapCast(at => this.mapCast(content => process(content, at)));
+        return result.length > 1 ? result : result[0];
+    }
+    sort(orderBy) {
+        if (!orderBy)
+            orderBy = Ascending;
+        return super.sort((a, b) => {
+            if (orderBy === Descending)
+                [a, b] = [b, a];
+            if (typeof orderBy === 'function')
+                return orderBy(a, b);
+            if (initArray([a, b]).isTypeOf('number'))
+                return a - b;
+            else
+                return a.localeCompare(b);
+        });
+    }
+    toObject() {
+        if (this.every(isArray))
+            return MLObject.fromEntries(this);
+        return MLObject.assign(this);
+    }
+    iterate(callbackFunc) {
+        iterate(i => callbackFunc(this[i], i, this), { from: 0, until: this.length, untilBefore: true });
+    }
+    sum() {
+        let decimalNum = 0, numbers = this;
+        if (numbers.isTypeOf('string')) {
+            decimalNum = this.map((val) => val.split('.')[1]?.length).unique()[0] ?? 0;
+            numbers = numbers.map((val) => val.replace('.', ''));
+        }
+        const result = numbers.reduce((total, num) => total + (typeof num === 'number' ? num : Number(num)), 0);
+        return result / (10 ** decimalNum);
+    }
+    subtract(options = {}) {
+        const { positive = true } = options, flattenedArr = this.lazyFlat();
+        if (!flattenedArr.length)
+            return 0;
+        const result = flattenedArr.reduce((total, num) => total - (typeof num === 'number' ? num : Number(num)), 0) + (flattenedArr[0] * 2);
+        return positive ? Math.abs(result) : result;
+    }
+    max() {
+        return Math.max(...this);
+    }
+    min() {
+        return Math.min(...this);
+    }
+    minMax() {
+        return [this.min(), this.max()];
+    }
+    /**
+     * Mengecek tipe data menggunakan "typeof" bawaan JavaScript untuk banyak variabel sekaligus
+     */
+    isTypeOf(type, options = {}) {
+        const { logic = And } = options;
+        return logic === And
+            ? this.every(val => type === 'string' ? isString(val) : typeof val === type)
+            : this.some(val => type === 'string' ? isString(val) : typeof val === type);
+    }
+}
+const typeof_dummy = () => typeof '';
+Array.prototype.asMLArray = function () {
+    return initArray(this);
+};
+Array.prototype.lazyFlat = function () {
+    return flat(this);
+};
+export function initArray(array = [], options = {}) {
+    return MLArray.init(array, options);
+}
+export function flat(array) {
+    return array.some(isArray) ? array.flat(Infinity) : array;
+}
+export function getOptions(array) {
+    return isObject(array.at(-1)) ? array.pop() : {};
+}
+export function wrap(value, dimension = 1) {
+    iterate(() => value = [value], { until: dimension });
+    return value;
+}
+export function lazyWrap(value) {
+    if (typeof value !== 'string' && !(value instanceof String) && isIterable(value))
+        return value;
+    return wrap(value);
+}
+export function isAllArray(...arg) {
+    return arg.length > 1 ? arg.every(isArray) : isArray(arg[0]);
+}
+export function isIterable(value) {
+    return typeof value?.[Symbol.iterator] === 'function';
+}

package/dist/Boolean.d.ts

@@ -0,0 +1,7 @@
+export type StringBoolean = 'TRUE' | 'FALSE';
+/**
+ * Melakukan negasi pada primitif boolean atau boolean pada string.
+ * Contoh: 'TRUE' -> 'FALSE'
+ */
+export declare function reverseBoolean(value: StringBoolean | boolean): string | boolean | undefined;
+export declare function ifTrue<T>(condition: boolean, value: T): "" | T;

package/dist/Boolean.js

@@ -0,0 +1,18 @@
+const stringBoolean = ['TRUE', 'FALSE'], reservedBoolean = ['FALSE', 'TRUE'];
+/**
+ * Melakukan negasi pada primitif boolean atau boolean pada string.
+ * Contoh: 'TRUE' -> 'FALSE'
+ */
+export function reverseBoolean(value) {
+    switch (typeof value) {
+        case 'boolean':
+            return !value;
+        case 'string':
+            if (!stringBoolean.includes(value))
+                throw Error('Value tidak valid.');
+            return reservedBoolean[stringBoolean.indexOf(value)];
+    }
+}
+export function ifTrue(condition, value) {
+    return condition ? value : '';
+}

package/dist/Comparison.d.ts

@@ -0,0 +1,22 @@
+import { type Logic } from './Array.ts';
+type CompareNumber = '<' | '<=' | '<=<' | '<<=';
+type CompareParam<T> = Array<T | {
+    logic: Logic;
+}>;
+export declare function isSame(...arr: any[]): boolean;
+export declare function sameWith<T>(value: T, ...arr: T[] | [{
+    withLog?: boolean;
+    logic?: Logic;
+}]): boolean;
+export declare function notSameWith(value: any, ...arr: any): boolean;
+/**
+ * Mengecek apakah 'value' ada di antara 'start' sampai 'until'
+ * Mendukung komparasi: '<', '<=', '<=<', '<<='
+ */
+export declare function between(start: number, value: number | number[], until: number, compare?: CompareNumber | CompareNumber[]): boolean;
+export declare function lowerThan(value: number, ...comparations: CompareParam<number>): boolean;
+/**
+ * Mengecek tipe data menggunakan "typeof" bawaan JavaScript untuk banyak variabel sekaligus
+ */
+export declare function isTypeOf(type: string, ...array: CompareParam<any>): boolean;
+export {};