@bitbybit-dev/base 0.19.8 → 0.20.0

package/lib/api/services/{lists.ts → lists.js}

@@ -1,5 +1,4 @@
 import * as Inputs from "../inputs";
-
 /**
  * Contains various list methods.
  * <div>
@@ -15,20 +14,19 @@ export class Lists {
      * @shortname item by index
      * @drawable false
      */
-    getItem<T>(inputs: Inputs.Lists.ListItemDto<T>): T {
+    getItem(inputs) {
         if (inputs.index < 0 || inputs.index >= inputs.list.length) {
             throw new Error("Index out of bounds");
         }
         let result;
         if (inputs.clone) {
             result = structuredClone(inputs.list[inputs.index]);
-        } else {
+        }
+        else {
             result = inputs.list[inputs.index];
         }
         return result;
     }
-
-
     /**
      * Gets items randomly by using a threshold
      * @param inputs a list and a threshold for randomization of items to remove
@@ -37,7 +35,7 @@ export class Lists {
      * @shortname random get threshold
      * @drawable false
      */
-    randomGetThreshold<T>(inputs: Inputs.Lists.RandomThresholdDto<T>): T[] {
+    randomGetThreshold(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -50,7 +48,6 @@ export class Lists {
         }
         return newList;
     }
-
     /**
        * Gets a sub list between start and end indexes
        * @param inputs a list and start and end indexes
@@ -59,16 +56,16 @@ export class Lists {
        * @shortname sublist
        * @drawable false
        */
-    getSubList<T>(inputs: Inputs.Lists.SubListDto<T>): T[] {
+    getSubList(inputs) {
         let result;
         if (inputs.clone) {
             result = structuredClone(inputs.list.slice(inputs.indexStart, inputs.indexEnd));
-        } else {
+        }
+        else {
             result = inputs.list.slice(inputs.indexStart, inputs.indexEnd);
         }
         return result;
     }
-
     /**
      * Gets nth item in the list
      * @param inputs a list and index
@@ -77,7 +74,7 @@ export class Lists {
      * @shortname every n-th
      * @drawable false
      */
-    getNthItem<T>(inputs: Inputs.Lists.GetNthItemDto<T>): T[] {
+    getNthItem(inputs) {
         let cloned = inputs.list;
         if (inputs.clone) {
             cloned = structuredClone(inputs.list);
@@ -98,7 +95,7 @@ export class Lists {
      * @shortname by pattern
      * @drawable false
      */
-    getByPattern<T>(inputs: Inputs.Lists.GetByPatternDto<T>): T[] {
+    getByPattern(inputs) {
         const { list, pattern } = inputs;
         if (!pattern || pattern.length === 0) {
             throw new Error("Pattern is empty or does not exist");
@@ -127,7 +124,6 @@ export class Lists {
         }
         return result;
     }
-
     /**
      * Merge elements of lists on a given level and flatten output if needed
      * @param inputs lists, level and flatten data
@@ -136,10 +132,9 @@ export class Lists {
      * @shortname merge levels
      * @drawable false
      */
-    mergeElementsOfLists<T>(inputs: Inputs.Lists.MergeElementsOfLists<T[]>): T[] {
+    mergeElementsOfLists(inputs) {
         const lists = inputs.lists;
         const level = inputs.level;
-
         const elToMerge = [];
         const result = [];
         lists.forEach(list => {
@@ -147,7 +142,6 @@ export class Lists {
             const elementsToMerge = list.flat(level);
             elToMerge.push(elementsToMerge);
         });
-
         const lengthMerge = this.getLongestListLength({ lists: elToMerge });
         for (let i = 0; i < lengthMerge; i++) {
             const temp = [];
@@ -161,24 +155,25 @@ export class Lists {
                 result.push(temp);
             }
         }
-
         let final = [];
         if (level > 0) {
             for (let i = 0; i < level; i++) {
                 if (i === level - 1 && i !== 0) {
                     final[i - 1].push(result);
-                } else if (i === level - 1) {
+                }
+                else if (i === level - 1) {
                     final.push(result);
-                } else {
+                }
+                else {
                     final.push([]);
                 }
             }
-        } else {
+        }
+        else {
             final = result;
         }
         return final;
     }
-
     /**
      * Gets the longest list length from the list of lists
      * @param inputs a list of lists
@@ -187,21 +182,20 @@ export class Lists {
      * @shortname longest list length
      * @drawable false
      */
-    getLongestListLength<T>(inputs: Inputs.Lists.GetLongestListLength<T[]>): number {
+    getLongestListLength(inputs) {
         let longestSoFar = 0;
         if (inputs.lists) {
-
             inputs.lists.forEach(l => {
                 if (l.length > longestSoFar) {
                     longestSoFar = l.length;
                 }
             });
             return longestSoFar;
-        } else {
+        }
+        else {
             return undefined;
         }
     }
-
     /**
      * Reverse the list
      * @param inputs a list and an index
@@ -210,14 +204,13 @@ export class Lists {
      * @shortname reverse
      * @drawable false
      */
-    reverse<T>(inputs: Inputs.Lists.ListCloneDto<T>): T[] {
+    reverse(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         return res.reverse();
     }
-
     /**
      * Flip 2d lists - every nth element of each list will form a separate list
      * @param inputs a list of lists to flip
@@ -226,7 +219,7 @@ export class Lists {
      * @shortname flip lists
      * @drawable false
      */
-    flipLists<T>(inputs: Inputs.Lists.ListCloneDto<T[]>): T[][] {
+    flipLists(inputs) {
         if (inputs.list.length > 0) {
             const lengthOfFirstList = inputs.list[0].length;
             let allListsSameLength = true;
@@ -245,14 +238,15 @@ export class Lists {
                     result.push(newList);
                 }
                 return result;
-            } else {
+            }
+            else {
                 throw new Error("Lists are not of the same length");
             }
-        } else {
+        }
+        else {
             throw new Error("List is empty");
         }
     }
-
     /**
      * Group in lists of n elements
      * @param inputs a list
@@ -261,8 +255,8 @@ export class Lists {
      * @shortname group elements
      * @drawable false
      */
-    groupNth<T>(inputs: Inputs.Lists.GroupListDto<T>): T[] {
-        const groupElements = (inputs: Inputs.Lists.GroupListDto<T>) => {
+    groupNth(inputs) {
+        const groupElements = (inputs) => {
             const { nrElements, list, keepRemainder } = inputs;
             const nrElementsInGroup = nrElements;
             const result = [];
@@ -282,7 +276,6 @@ export class Lists {
         // TODO make this work on any level
         return groupElements(inputs);
     }
-
     /**
      * Get the depth of the list
      * @param inputs a list
@@ -291,7 +284,7 @@ export class Lists {
      * @shortname max list depth
      * @drawable false
      */
-    getListDepth(inputs: Inputs.Lists.ListCloneDto<[]>): number {
+    getListDepth(inputs) {
         let levels = 0;
         let deeperLevelsExist = true;
         let flatRes = inputs.list;
@@ -305,14 +298,14 @@ export class Lists {
             flatRes = flatRes.flat();
             if (foundArray) {
                 levels++;
-            } else {
+            }
+            else {
                 levels++;
                 deeperLevelsExist = false;
             }
         }
         return levels;
     }
-
     /**
      * Gets the length of the list
      * @param inputs a length list
@@ -321,10 +314,9 @@ export class Lists {
      * @shortname list length
      * @drawable false
      */
-    listLength<T>(inputs: Inputs.Lists.ListCloneDto<T>): number {
+    listLength(inputs) {
         return inputs.list.length;
     }
-
     /**
      * Add item to the list
      * @param inputs a list, item and an index
@@ -333,7 +325,7 @@ export class Lists {
      * @shortname add item
      * @drawable false
      */
-    addItemAtIndex<T>(inputs: Inputs.Lists.AddItemAtIndexDto<T>): T[] {
+    addItemAtIndex(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -343,7 +335,6 @@ export class Lists {
         }
         return res;
     }
-
     /**
      * Adds item to the list of provided indexes
      * @param inputs a list, item and an indexes
@@ -352,7 +343,7 @@ export class Lists {
      * @shortname add item at indexes
      * @drawable false
      */
-    addItemAtIndexes<T>(inputs: Inputs.Lists.AddItemAtIndexesDto<T>): T[] {
+    addItemAtIndexes(inputs) {
         let cloned = inputs.list;
         if (inputs.clone) {
             cloned = structuredClone(inputs.list);
@@ -364,11 +355,9 @@ export class Lists {
             if (index >= 0 && index + i <= cloned.length) {
                 cloned.splice(index + i, 0, inputs.item);
             }
-        }
-        );
+        });
         return cloned;
     }
-
     /**
      * Adds items to the list of provided indexes matching 1:1, first item will go to first index provided, etc.
      * @param inputs a list, items and an indexes
@@ -377,7 +366,7 @@ export class Lists {
      * @shortname add items
      * @drawable false
      */
-    addItemsAtIndexes<T>(inputs: Inputs.Lists.AddItemsAtIndexesDto<T>): T[] {
+    addItemsAtIndexes(inputs) {
         if (inputs.items.length !== inputs.indexes.length) {
             throw new Error("Items and indexes must have the same length");
         }
@@ -401,7 +390,6 @@ export class Lists {
         });
         return cloned;
     }
-
     /**
      * Remove item from the list
      * @param inputs a list and index
@@ -410,7 +398,7 @@ export class Lists {
      * @shortname remove item
      * @drawable false
      */
-    removeItemAtIndex<T>(inputs: Inputs.Lists.RemoveItemAtIndexDto<T>): T[] {
+    removeItemAtIndex(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -420,7 +408,6 @@ export class Lists {
         }
         return res;
     }
-
     /**
      * Remove items from the list of provided indexes
      * @param inputs a list and indexes
@@ -429,7 +416,7 @@ export class Lists {
      * @shortname remove items
      * @drawable false
      */
-    removeItemsAtIndexes<T>(inputs: Inputs.Lists.RemoveItemsAtIndexesDto<T>): T[] {
+    removeItemsAtIndexes(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -443,7 +430,6 @@ export class Lists {
         });
         return res;
     }
-
     /**
      * Remove all items from the list
      * @param inputs a list
@@ -452,11 +438,10 @@ export class Lists {
      * @shortname remove all items
      * @drawable false
      */
-    removeAllItems<T>(inputs: Inputs.Lists.ListDto<T>): T[] {
+    removeAllItems(inputs) {
         inputs.list.length = 0;
         return inputs.list;
     }
-
     /**
      * Remove item from the list
      * @param inputs a list and index
@@ -465,7 +450,7 @@ export class Lists {
      * @shortname every n-th
      * @drawable false
      */
-    removeNthItem<T>(inputs: Inputs.Lists.RemoveNthItemDto<T>): T[] {
+    removeNthItem(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -478,7 +463,6 @@ export class Lists {
         }
         return result;
     }
-
     /**
      * Removes items randomly by using a threshold
      * @param inputs a list and a threshold for randomization of items to remove
@@ -487,7 +471,7 @@ export class Lists {
      * @shortname random remove threshold
      * @drawable false
      */
-    randomRemoveThreshold<T>(inputs: Inputs.Lists.RandomThresholdDto<T>): T[] {
+    randomRemoveThreshold(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -500,7 +484,6 @@ export class Lists {
         }
         return newList;
     }
-
     /**
      * remove duplicate numbers from the list
      * @param inputs a list of numbers
@@ -509,14 +492,13 @@ export class Lists {
      * @shortname remove duplicates
      * @drawable false
      */
-    removeDuplicateNumbers(inputs: Inputs.Lists.RemoveDuplicatesDto<number>): number[] {
+    removeDuplicateNumbers(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         return res.filter((value, index, self) => self.indexOf(value) === index);
     }
-
     /**
      * remove duplicate numbers from the list with tolerance
      * @param inputs a list of numbers and the tolerance
@@ -525,14 +507,13 @@ export class Lists {
      * @shortname remove duplicates tol
      * @drawable false
      */
-    removeDuplicateNumbersTolerance(inputs: Inputs.Lists.RemoveDuplicatesToleranceDto<number>): number[] {
+    removeDuplicateNumbersTolerance(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         return res.filter((value, index, self) => self.findIndex(s => Math.abs(s - value) < inputs.tolerance) === index);
     }
-
     /**
      * Add item to the end of the list
      * @param inputs a list and an item
@@ -541,7 +522,7 @@ export class Lists {
      * @shortname add item to list
      * @drawable false
      */
-    addItem<T>(inputs: Inputs.Lists.AddItemDto<T>): T[] {
+    addItem(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -549,7 +530,6 @@ export class Lists {
         res.push(inputs.item);
         return res;
     }
-
     /**
      * Add item to the beginning of the list
      * @param inputs a list and an item
@@ -558,7 +538,7 @@ export class Lists {
      * @shortname prepend item to list
      * @drawable false
      */
-    prependItem<T>(inputs: Inputs.Lists.AddItemDto<T>): T[] {
+    prependItem(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
@@ -566,7 +546,6 @@ export class Lists {
         res.unshift(inputs.item);
         return res;
     }
-
     /**
      * Add item to the beginning or the end of the list
      * @param inputs a list, item and an option for first or last position
@@ -575,19 +554,19 @@ export class Lists {
      * @shortname item at first or last
      * @drawable false
      */
-    addItemFirstLast<T>(inputs: Inputs.Lists.AddItemFirstLastDto<T>): T[] {
+    addItemFirstLast(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         if (inputs.position === Inputs.Lists.firstLastEnum.first) {
             res.unshift(inputs.item);
-        } else {
+        }
+        else {
             res.push(inputs.item);
         }
         return res;
     }
-
     /**
      * Creates an empty list
      * @returns an empty array list
@@ -595,10 +574,9 @@ export class Lists {
      * @shortname empty list
      * @drawable false
      */
-    createEmptyList(): [] {
+    createEmptyList() {
         return [];
     }
-
     /**
      * Repeat the item and add it in the new list
      * @param inputs an item to multiply
@@ -607,14 +585,13 @@ export class Lists {
      * @shortname repeat
      * @drawable false
      */
-    repeat<T>(inputs: Inputs.Lists.MultiplyItemDto<T>): T[] {
+    repeat(inputs) {
         const result = [];
         for (let i = 0; i < inputs.times; i++) {
             result.push(inputs.item);
         }
         return result;
     }
-
     /**
      * Repeat the list items by adding them in the new list till the certain length of the list is reached
      * @param inputs a list to multiply and a length limit
@@ -623,7 +600,7 @@ export class Lists {
      * @shortname repeat in pattern
      * @drawable false
      */
-    repeatInPattern<T>(inputs: Inputs.Lists.RepeatInPatternDto<T>): T[] {
+    repeatInPattern(inputs) {
         // will repeat the items provided in the patten till the certain length of the list is reached
         let inpList = inputs.list;
         if (inputs.clone) {
@@ -642,7 +619,6 @@ export class Lists {
         }
         return res;
     }
-
     /**
      * Sort the list of numbers in ascending or descending order
      * @param inputs a list of numbers to sort and an option for ascending or descending order
@@ -651,18 +627,18 @@ export class Lists {
      * @shortname sort numbers
      * @drawable false
      */
-    sortNumber(inputs: Inputs.Lists.SortDto<number>): number[] {
+    sortNumber(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         if (inputs.orderAsc) {
             return res.sort((a, b) => a - b);
-        } else {
+        }
+        else {
             return res.sort((a, b) => b - a);
         }
     }
-
     /**
      * Sort the list of texts in ascending or descending order alphabetically
      * @param inputs a list of texts to sort and an option for ascending or descending order
@@ -671,18 +647,18 @@ export class Lists {
      * @shortname sort texts
      * @drawable false
      */
-    sortTexts(inputs: Inputs.Lists.SortDto<string>): string[] {
+    sortTexts(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         if (inputs.orderAsc) {
             return res.sort();
-        } else {
+        }
+        else {
             return res.sort().reverse();
         }
     }
-
     /**
      * Sort by numeric JSON property value
      * @param inputs a list to sort, a property to sort by and an option for ascending or descending order
@@ -691,16 +667,16 @@ export class Lists {
      * @shortname sort json objects
      * @drawable false
      */
-    sortByPropValue(inputs: Inputs.Lists.SortJsonDto<any>): any[] {
+    sortByPropValue(inputs) {
         let res = inputs.list;
         if (inputs.clone) {
             res = structuredClone(inputs.list);
         }
         if (inputs.orderAsc) {
             return res.sort((a, b) => a[inputs.property] - b[inputs.property]);
-        } else {
+        }
+        else {
             return res.sort((a, b) => b[inputs.property] - a[inputs.property]);
         }
     }
-
 }

package/lib/api/services/logic.d.ts

@@ -0,0 +1,99 @@
+import * as Inputs from "../inputs";
+/**
+ * Contains various logic methods.
+ */
+export declare class Logic {
+    /**
+     * Creates a boolean value - true or false
+     * @param inputs a true or false boolean
+     * @returns boolean
+     * @group create
+     * @shortname boolean
+     * @drawable false
+     */
+    boolean(inputs: Inputs.Logic.BooleanDto): boolean;
+    /**
+     * Creates a random boolean list of predefined length
+     * @param inputs a length and a threshold for randomization of true values
+     * @returns booleans
+     * @group create
+     * @shortname random booleans
+     * @drawable false
+     */
+    randomBooleans(inputs: Inputs.Logic.RandomBooleansDto): boolean[];
+    /**
+     * Creates a random boolean list of true and false values based on a list of numbers.
+     * All values between true threshold will be true, all values above false threshold will be false,
+     * and the rest will be distributed between true and false based on the number of levels in a gradient pattern.
+     * That means that the closer the number gets to the false threshold the bigger the chance will be to get random false value.
+     * @param inputs a length and a threshold for randomization of true values
+     * @returns booleans
+     * @group create
+     * @shortname 2 threshold random gradient
+     * @drawable false
+     */
+    twoThresholdRandomGradient(inputs: Inputs.Logic.TwoThresholdRandomGradientDto): boolean[];
+    /**
+     * Creates a boolean list based on a list of numbers and a threshold.
+     * @param inputs a length and a threshold for randomization of true values
+     * @returns booleans
+     * @group create
+     * @shortname threshold boolean list
+     * @drawable false
+     */
+    thresholdBooleanList(inputs: Inputs.Logic.ThresholdBooleanListDto): boolean[];
+    /**
+     * Creates a boolean list based on a list of numbers and a gap thresholds. Gap thresholds are pairs of numbers that define a range of numbers that will be true.
+     * @param inputs a length and a threshold for randomization of true values
+     * @returns booleans
+     * @group create
+     * @shortname threshold gaps boolean list
+     * @drawable false
+     */
+    thresholdGapsBooleanList(inputs: Inputs.Logic.ThresholdGapsBooleanListDto): boolean[];
+    /**
+     * Apply not operator on the boolean
+     * @param inputs a true or false boolean
+     * @returns boolean
+     * @group edit
+     * @shortname not
+     * @drawable false
+     */
+    not(inputs: Inputs.Logic.BooleanDto): boolean;
+    /**
+     * Apply not operator on a list of booleans
+     * @param inputs a list of true or false booleans
+     * @returns booleans
+     * @group edit
+     * @shortname not list
+     * @drawable false
+     */
+    notList(inputs: Inputs.Logic.BooleanListDto): boolean[];
+    /**
+     * Does comparison between first and second values
+     * @param inputs two values to be compared
+     * @returns Result of the comparison
+     * @group operations
+     * @shortname compare
+     * @drawable false
+     */
+    compare<T>(inputs: Inputs.Logic.ComparisonDto<T>): boolean;
+    /**
+     * Transmits a value if boolean provided is true and undefined if boolean provided is false
+     * @param inputs a value and a boolean value
+     * @returns value or undefined
+     * @group operations
+     * @shortname value gate
+     * @drawable false
+     */
+    valueGate<T>(inputs: Inputs.Logic.ValueGateDto<T>): T | undefined;
+    /**
+     * Returns first defined value out of two
+     * @param inputs two values
+     * @returns value or undefined
+     * @group operations
+     * @shortname first defined value gate
+     * @drawable false
+     */
+    firstDefinedValueGate<T, U>(inputs: Inputs.Logic.TwoValueGateDto<T, U>): T | U | undefined;
+}