@hyperfrontend/list-utils 0.0.1

package/CHANGELOG.md

@@ -0,0 +1,5 @@
+# Changelog
+
+This file was generated using [@jscutlery/semver](https://github.com/jscutlery/semver).
+
+## 0.0.1 (2026-02-15)

package/LICENSE.md

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Andrew Redican
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,175 @@
+# @hyperfrontend/list-utils
+
+<p align="center">
+  <a href="https://github.com/AndrewRedican/hyperfrontend/actions/workflows/ci-lib-list-utils.yml">
+    <img src="https://img.shields.io/github/actions/workflow/status/AndrewRedican/hyperfrontend/ci-lib-list-utils.yml?style=flat-square&logo=github&label=build" alt="Build">
+  </a>
+  <a href="https://codecov.io/gh/AndrewRedican/hyperfrontend/flags?flags%5B0%5D=list-utils">
+    <img src="https://codecov.io/gh/AndrewRedican/hyperfrontend/graph/badge.svg?flag=list-utils" alt="Coverage">
+  </a>
+  <a href="https://www.npmjs.com/package/@hyperfrontend/list-utils">
+    <img src="https://img.shields.io/npm/v/@hyperfrontend/list-utils?style=flat-square" alt="npm version">
+  </a>
+</p>
+<p align="center">
+  <!-- ALL-CONTRIBUTORS-BADGE:START - Do not remove or modify this section -->
+  <a href="#contributors">
+    <img src="https://img.shields.io/github/all-contributors/AndrewRedican/hyperfrontend?color=ee8449&style=flat-square" alt="All Contributors">
+  </a>
+  <!-- ALL-CONTRIBUTORS-BADGE:END -->
+  <a href="https://github.com/AndrewRedican/hyperfrontend/blob/main/LICENSE.md">
+    <img src="https://img.shields.io/badge/license-MIT-blue?style=flat-square" alt="License">
+  </a>
+  <a href="https://www.npmjs.com/package/@hyperfrontend/list-utils">
+    <img src="https://img.shields.io/npm/dm/@hyperfrontend/list-utils?style=flat-square" alt="npm downloads">
+  </a>
+  <a href="https://github.com/AndrewRedican/hyperfrontend">
+    <img src="https://img.shields.io/github/stars/AndrewRedican/hyperfrontend?style=flat-square" alt="GitHub stars">
+  </a>
+  <a href="https://bundlephobia.com/package/@hyperfrontend/list-utils">
+    <img src="https://img.shields.io/bundlephobia/minzip/@hyperfrontend/list-utils?style=flat-square" alt="Bundle Size">
+  </a>
+  <img src="https://img.shields.io/badge/node-%3E%3D18.0.0-brightgreen?style=flat-square&logo=node.js" alt="Node Version">
+  <img src="https://img.shields.io/badge/tree%20shakeable-%E2%9C%93-success?style=flat-square" alt="Tree Shakeable">
+</p>
+
+Purpose-built collection utilities for queue management, filtering, and iteration patterns.
+
+## What is @hyperfrontend/list-utils?
+
+@hyperfrontend/list-utils provides specialized collection utilities focused on common programming patterns that native JavaScript arrays don't handle elegantly. Rather than replicating lodash, this library targets specific use cases: FIFO/LIFO queue management with object reference tracking, cyclical value iteration, and string array sanitization.
+
+The library enforces immutability through frozen interfaces while maintaining high performance. All queue operations (FIFO/LIFO) use native `Set` for O(1) lookups and guaranteed uniqueness, solving the common problem of accidentally adding duplicate items to task queues or event handlers.
+
+### Key Features
+
+- **FIFO and LIFO queues** with type-safe object tracking
+- **Value picker** for cyclical iteration (ideal for round-robin patterns)
+- **String sanitization** utilities (dedupe, trim, filter empty)
+- **Range generation** for loop-free number sequences
+- **Map utilities** for common Map operations
+- **Zero dependencies** (except sibling @hyperfrontend/data-utils)
+
+### Architecture Highlights
+
+Queue implementations return frozen objects to prevent external mutation while using native `Set` internally for optimal performance. Object-only restriction on queues prevents reference comparison issues with primitives.
+
+## Why Use @hyperfrontend/list-utils?
+
+### Prevents Queue Bugs in Event-Driven Systems
+
+Native arrays don't enforce uniqueness, making it easy to accidentally register the same event handler, task, or subscription multiple times. FIFO/LIFO lists automatically reject duplicates based on reference equality, eliminating a common source of memory leaks and duplicate processing in event loops, job queues, and observer patterns.
+
+### Simplifies Round-Robin and Cyclical Patterns
+
+The value picker solves the boilerplate problem of cycling through options (load balancer endpoints, color schemes, retry strategies). No manual index tracking or modulo math—just call `next()`. Particularly useful for testing scenarios where you need predictable value rotation.
+
+### Type-Safe String Sanitization
+
+`nonEmptyStrings()` and `uniqueStrings()` handle the tedious work of cleaning user input, configuration arrays, or CSV parsing results. Filters null/undefined/empty/whitespace-only values in one call, with full TypeScript type narrowing.
+
+### Functional Composition Without Dependencies
+
+All utilities return new arrays or frozen objects, never mutate inputs. This makes them safe for use in React hooks dependencies, Redux reducers, or any pure function context. No lodash required for these specific operations.
+
+## Installation
+
+```bash
+npm install @hyperfrontend/list-utils
+```
+
+## Quick Start
+
+```typescript
+import { createFifoList, createValuePicker, nonEmptyStrings, uniqueStrings } from '@hyperfrontend/list-utils'
+
+// FIFO queue for task management
+const taskQueue = createFifoList<{ id: string; execute: () => void }>()
+taskQueue.push({ id: 'task1', execute: () => console.log('Task 1') })
+taskQueue.push({ id: 'task2', execute: () => console.log('Task 2') })
+const nextTask = taskQueue.pull() // Gets task1 (first in)
+
+// Round-robin value picker
+const colorPicker = createValuePicker(['red', 'blue', 'green'])
+colorPicker.next() // 'red'
+colorPicker.next() // 'blue'
+colorPicker.next() // 'green'
+colorPicker.next() // 'red' (cycles back)
+
+// String sanitization
+const userInputs = ['  hello  ', '', 'world', null, 'hello', '   ', 'world']
+const cleaned = uniqueStrings(nonEmptyStrings(userInputs)) // ['hello', 'world']
+```
+
+## API Overview
+
+### Queue Management
+
+- **`createFifoList<T>()`** - First-in-first-out queue with reference uniqueness
+- **`createLifoList<T>()`** - Last-in-first-out stack with reference uniqueness
+
+### Iteration Utilities
+
+- **`createValuePicker(values)`** - Cyclical iterator for round-robin patterns
+- **`createRange(start, end)`** - Generate number arrays without loops
+
+### String Utilities
+
+- **`nonEmptyStrings(values)`** - Filter null/undefined/empty/whitespace strings
+- **`uniqueStrings(values)`** - Remove duplicates while preserving order
+
+### Map Helpers
+
+- **`getLastKeyInMap(map)`** - Retrieve the last inserted key from a Map
+
+## Compatibility
+
+| Platform                      | Support |
+| ----------------------------- | :-----: |
+| Browser                       |   ✅    |
+| Node.js                       |   ✅    |
+| Web Workers                   |   ✅    |
+| Deno, Bun, Cloudflare Workers |   ✅    |
+
+### Output Formats
+
+| Format | File                       | Tree-Shakeable |
+| ------ | -------------------------- | :------------: |
+| ESM    | `index.esm.js`             |       ✅       |
+| CJS    | `index.cjs.js`             |       ❌       |
+| IIFE   | `bundle/index.iife.min.js` |       ❌       |
+| UMD    | `bundle/index.umd.min.js`  |       ❌       |
+
+**Bundle size:** 1 KB (minified, self-contained)
+
+### CDN Usage
+
+```html
+<!-- unpkg -->
+<script src="https://unpkg.com/@hyperfrontend/list-utils"></script>
+
+<!-- jsDelivr -->
+<script src="https://cdn.jsdelivr.net/npm/@hyperfrontend/list-utils"></script>
+
+<script>
+  const { createQueue, forEach } = HyperfrontendListUtils
+</script>
+```
+
+**Global variable:** `HyperfrontendListUtils`
+
+### Dependencies
+
+| Package                   | Type     |
+| ------------------------- | -------- |
+| @hyperfrontend/data-utils | Internal |
+
+## Part of hyperfrontend
+
+This library is part of the [hyperfrontend](https://github.com/AndrewRedican/hyperfrontend) monorepo. [Full documentation](https://hyperfrontend.dev).
+
+- Used by [@hyperfrontend/network-protocol](https://github.com/AndrewRedican/hyperfrontend/tree/main/libs/network-protocol) for message queue management
+
+## License
+
+MIT

package/SECURITY.md

@@ -0,0 +1,82 @@
+# Security Policy
+
+## Reporting a Vulnerability
+
+We take the security of hyperfrontend seriously. If you discover a security vulnerability, please help us protect our users by following responsible disclosure practices.
+
+### How to Report
+
+**Please DO NOT report security vulnerabilities through public GitHub issues.**
+
+Instead, please report security vulnerabilities directly via email to:
+
+**<andrew.redican.mejia@gmail.com>**
+
+### What to Include
+
+To help us understand and resolve the issue quickly, please include the following information in your report:
+
+- **Description**: A clear description of the vulnerability
+- **Impact**: The potential impact and severity of the issue
+- **Reproduction Steps**: Detailed steps to reproduce the vulnerability
+- **Environment**: The version of hyperfrontend affected, browser/Node.js version, operating system, etc.
+- **Proof of Concept**: If possible, include a minimal code example or proof of concept
+- **Suggested Fix**: If you have ideas on how to fix the issue (optional)
+
+### Response Timeline
+
+- **Acknowledgment**: We will acknowledge receipt of your vulnerability report within 2 business days
+- **Initial Assessment**: We will provide an initial assessment within 5 business days
+- **Patch Development**: We aim to develop and test a patch within 10 days of acknowledgment
+- **Public Disclosure**: Please allow at least **10 days** from the initial report before making the vulnerability publicly known
+
+This grace period gives us time to:
+
+- Verify and reproduce the issue
+- Develop and test a fix
+- Release a patched version
+- Notify users to update their dependencies
+
+### Coordinated Disclosure
+
+We believe in coordinated disclosure and appreciate your cooperation in:
+
+- Not exploiting the vulnerability beyond what is necessary to demonstrate it
+- Not accessing, modifying, or deleting data that doesn't belong to you
+- Allowing us reasonable time to address the issue before public disclosure
+- Making a good faith effort to avoid privacy violations, data destruction, and service interruption
+
+### Recognition
+
+Once the vulnerability is patched and publicly disclosed, we will acknowledge your responsible disclosure in:
+
+- Our release notes
+- Our security advisories (if applicable)
+- This SECURITY.md file (with your permission)
+
+Thank you for helping keep hyperfrontend and its users safe!
+
+## Security Best Practices
+
+When using hyperfrontend in your applications:
+
+1. **Keep Dependencies Updated**: Regularly update to the latest version to receive security patches
+2. **Content Security Policy**: Implement appropriate CSP headers when embedding features
+3. **Input Validation**: Validate and sanitize all data passed between features
+4. **Origin Verification**: Always verify the origin of messages in cross-frame communication
+5. **Authentication**: Implement proper authentication and authorization for sensitive features
+6. **HTTPS**: Always serve hyperfrontend features over HTTPS in production
+
+## Security Updates
+
+Security updates will be released as patch versions and documented in the [CHANGELOG](https://github.com/AndrewRedican/hyperfrontend/releases) and GitHub Security Advisories.
+
+## Supported Versions
+
+We currently provide security updates for:
+
+| Version | Supported          |
+| ------- | ------------------ |
+| 0.0.x   | :white_check_mark: |
+
+As the project matures, we will update this table to reflect our long-term support policy.

package/bundle/index.iife.js

@@ -0,0 +1,210 @@
+var HyperfrontendListUtils = (function (exports) {
+    'use strict';
+
+    const registeredClasses = [];
+
+    /**
+     * Returns the data type of the target.
+     * Uses native `typeof` operator, however, makes distinction between `null`, `array`, and `object`.
+     * Also, when classes are registered via `registerClass`, it checks if objects are instance of any known registered class.
+     *
+     * @param target - The target to get the data type of.
+     * @returns The data type of the target.
+     */
+    const getType = (target) => {
+        if (target === null)
+            return 'null';
+        const nativeDataType = typeof target;
+        if (nativeDataType === 'object') {
+            if (Array.isArray(target))
+                return 'array';
+            for (const registeredClass of registeredClasses) {
+                if (target instanceof registeredClass)
+                    return registeredClass.name;
+            }
+        }
+        return nativeDataType;
+    };
+
+    /**
+     * Creates a FIFO (First-In-First-Out) list.
+     *
+     * @template T The type of elements in the list, must be an object.
+     * @returns {FifoList<T>} A FIFO list with methods to manipulate and query the list.
+     */
+    function createFifoList() {
+        const list = new Set();
+        const push = (item) => {
+            if (getType(item) !== 'object') {
+                throw new Error('A fifo list only non-primitive values');
+            }
+            if (list.has(item)) {
+                throw new Error('Cannot a item that already exists');
+            }
+            list.add(item);
+        };
+        const pull = () => {
+            const value = list.values().next().value;
+            list.delete(value);
+            return value;
+        };
+        const map = (callback) => {
+            return Array.from(list.values()).map(callback);
+        };
+        const forEach = (callback) => {
+            list.forEach(callback);
+        };
+        const remove = (item) => list.delete(item);
+        const has = (item) => list.has(item);
+        const size = () => list.size;
+        const clear = () => list.clear();
+        const result = {
+            push,
+            pull,
+            map,
+            forEach,
+            remove,
+            has,
+            size,
+            clear,
+        };
+        return Object.freeze(result);
+    }
+
+    /**
+     * Creates a LIFO (Last-In-First-Out) list.
+     *
+     * @template T The type of elements in the list, must be an object.
+     * @returns {LifoList<T>} A LIFO list with methods to manipulate and query the list.
+     */
+    function createLifoList() {
+        const list = new Set();
+        const push = (item) => {
+            if (getType(item) !== 'object') {
+                throw new Error('A lifo list only supports non-primitive values');
+            }
+            list.add(item);
+        };
+        const pull = () => {
+            const lastItem = Array.from(list).pop();
+            if (lastItem) {
+                list.delete(lastItem);
+            }
+            return lastItem;
+        };
+        const map = (callback) => {
+            return Array.from(list).map(callback);
+        };
+        const forEach = (callback) => {
+            list.forEach(callback);
+        };
+        const remove = (item) => list.delete(item);
+        const has = (item) => list.has(item);
+        const size = () => list.size;
+        const clear = () => {
+            list.clear();
+        };
+        const result = {
+            push,
+            pull,
+            map,
+            forEach,
+            remove,
+            has,
+            size,
+            clear,
+        };
+        return Object.freeze(result);
+    }
+
+    /**
+     * Creates an array of numbers within a specified range (inclusive).
+     *
+     * @param start - The starting number of the range
+     * @param end - The ending number of the range (inclusive)
+     * @returns An array containing all numbers from start to end
+     */
+    function createRange(start, end) {
+        const range = [];
+        for (let i = start; i <= end; i += 1) {
+            range.push(i);
+        }
+        return range;
+    }
+
+    /**
+     * Creates a value picker that cycles through a list of string values.
+     *
+     * @param values - The array of string values to cycle through
+     * @returns A ValuePicker instance with current and next methods
+     */
+    function createValuePicker(values) {
+        if (!values || !values.length) {
+            throw new Error('Expected values not to be an empty list.');
+        }
+        let index = -1;
+        /**
+         * Returns the current value without advancing the picker.
+         *
+         * @returns The current value in the list
+         */
+        function current() {
+            if (index < 0)
+                index = 0;
+            return values[index];
+        }
+        /**
+         * Advances to and returns the next value, cycling back to the start when reaching the end.
+         *
+         * @returns The next value in the list
+         */
+        function next() {
+            if (index < 0)
+                return current();
+            index = ++index < values.length ? index : 0;
+            return values[index];
+        }
+        return {
+            current: current,
+            next: next,
+        };
+    }
+
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    const getLastKeyInMap = (map) => {
+        const items = [...map.keys()];
+        return items[items.length - 1];
+    };
+
+    /**
+     * Filters out empty, null, undefined, and whitespace-only strings from an array.
+     *
+     * @param values - The array of strings to filter
+     * @returns A new array containing only non-empty strings with content
+     */
+    function nonEmptyStrings(values) {
+        return values.filter((value) => ![undefined, null, ''].includes(value) && value.trim() !== '');
+    }
+
+    /**
+     * Removes duplicate strings from an array, preserving insertion order.
+     *
+     * @param values - The array of strings to deduplicate
+     * @returns A new array containing only unique strings
+     */
+    function uniqueStrings(values) {
+        return Array.from(new Set(values));
+    }
+
+    exports.createFifoList = createFifoList;
+    exports.createLifoList = createLifoList;
+    exports.createRange = createRange;
+    exports.createValuePicker = createValuePicker;
+    exports.getLastKeyInMap = getLastKeyInMap;
+    exports.nonEmptyStrings = nonEmptyStrings;
+    exports.uniqueStrings = uniqueStrings;
+
+    return exports;
+
+})({});
+//# sourceMappingURL=index.iife.js.map

package/bundle/index.iife.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.iife.js","sources":["../../../../../../../../../../libs/utils/data/src/shared/consts.ts","../../../../../../../../../../libs/utils/data/src/get-type.ts","../../../../../../../../../../libs/utils/list/src/create-fifo-list.ts","../../../../../../../../../../libs/utils/list/src/create-lifo-list.ts","../../../../../../../../../../libs/utils/list/src/create-range.ts","../../../../../../../../../../libs/utils/list/src/create-value-picker.ts","../../../../../../../../../../libs/utils/list/src/get-last-key-in-map.ts","../../../../../../../../../../libs/utils/list/src/non-empty-strings.ts","../../../../../../../../../../libs/utils/list/src/unique-strings.ts"],"sourcesContent":[null,null,null,null,null,null,null,null,null],"names":[],"mappings":";;;IAGO,MAAM,iBAAiB,GAAmB,EAAE;;ICAnD;;;;;;;IAOG;IACI,MAAM,OAAO,GAAG,CAA8B,MAAe,KAAO;QACzE,IAAI,MAAM,KAAK,IAAI;IAAE,QAAA,OAAU,MAAM;IACrC,IAAA,MAAM,cAAc,GAAG,OAAO,MAAM;IACpC,IAAA,IAAI,cAAc,KAAK,QAAQ,EAAE;IAC/B,QAAA,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;IAAE,YAAA,OAAU,OAAO;IAC5C,QAAA,KAAK,MAAM,eAAe,IAAI,iBAAiB,EAAE;gBAC/C,IAAI,MAAM,YAAY,eAAe;oBAAE,OAAU,eAAe,CAAC,IAAI;YACvE;QACF;IACA,IAAA,OAAU,cAAc;IAC1B,CAAC;;ICRD;;;;;IAKG;aACa,cAAc,GAAA;IAC5B,IAAA,MAAM,IAAI,GAAW,IAAI,GAAG,EAAE;IAE9B,IAAA,MAAM,IAAI,GAAG,CAAC,IAAO,KAAU;IAC7B,QAAA,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;IAC9B,YAAA,MAAM,IAAI,KAAK,CAAC,uCAAuC,CAAC;YAC1D;IACA,QAAA,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;IAClB,YAAA,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC;YACtD;IACA,QAAA,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;IAChB,IAAA,CAAC;QAED,MAAM,IAAI,GAAG,MAAQ;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK;IACxC,QAAA,IAAI,CAAC,MAAM,CAAI,KAAK,CAAC;IACrB,QAAA,OAAU,KAAK;IACjB,IAAA,CAAC;IAED,IAAA,MAAM,GAAG,GAAG,CAAI,QAAwB,KAAS;IAC/C,QAAA,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;IAChD,IAAA,CAAC;IAED,IAAA,MAAM,OAAO,GAAG,CAAC,QAA2B,KAAU;IACpD,QAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IACxB,IAAA,CAAC;IAED,IAAA,MAAM,MAAM,GAAG,CAAC,IAAO,KAAc,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAEtD,IAAA,MAAM,GAAG,GAAG,CAAC,IAAO,KAAc,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;QAEhD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,IAAI;QAE5B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,KAAK,EAAE;IAEhC,IAAA,MAAM,MAAM,GAAgB;YAC1B,IAAI;YACJ,IAAI;YACJ,GAAG;YACH,OAAO;YACP,MAAM;YACN,GAAG;YACH,IAAI;YACJ,KAAK;SACN;IAED,IAAA,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;IAC9B;;ICrDA;;;;;IAKG;aACa,cAAc,GAAA;IAC5B,IAAA,MAAM,IAAI,GAAW,IAAI,GAAG,EAAE;IAE9B,IAAA,MAAM,IAAI,GAAG,CAAC,IAAO,KAAU;IAC7B,QAAA,IAAI,OAAO,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;IAC9B,YAAA,MAAM,IAAI,KAAK,CAAC,gDAAgD,CAAC;YACnE;IACA,QAAA,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;IAChB,IAAA,CAAC;QAED,MAAM,IAAI,GAAG,MAAoB;YAC/B,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE;YACvC,IAAI,QAAQ,EAAE;IACZ,YAAA,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;YACvB;IACA,QAAA,OAAO,QAAQ;IACjB,IAAA,CAAC;IAED,IAAA,MAAM,GAAG,GAAG,CAAI,QAAwB,KAAS;YAC/C,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC;IACvC,IAAA,CAAC;IAED,IAAA,MAAM,OAAO,GAAG,CAAC,QAA2B,KAAU;IACpD,QAAA,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IACxB,IAAA,CAAC;IAED,IAAA,MAAM,MAAM,GAAG,CAAC,IAAO,KAAc,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;IAEtD,IAAA,MAAM,GAAG,GAAG,CAAC,IAAO,KAAc,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;QAEhD,MAAM,IAAI,GAAG,MAAc,IAAI,CAAC,IAAI;QAEpC,MAAM,KAAK,GAAG,MAAW;YACvB,IAAI,CAAC,KAAK,EAAE;IACd,IAAA,CAAC;IAED,IAAA,MAAM,MAAM,GAAgB;YAC1B,IAAI;YACJ,IAAI;YACJ,GAAG;YACH,OAAO;YACP,MAAM;YACN,GAAG;YACH,IAAI;YACJ,KAAK;SACN;IAED,IAAA,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC;IAC9B;;ICnEA;;;;;;IAMG;IACG,SAAU,WAAW,CAAC,KAAa,EAAE,GAAW,EAAA;QACpD,MAAM,KAAK,GAAa,EAAE;IAC1B,IAAA,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,EAAE;IACpC,QAAA,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QACf;IACA,IAAA,OAAO,KAAK;IACd;;ICRA;;;;;IAKG;IACG,SAAU,iBAAiB,CAAC,MAAgB,EAAA;QAChD,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE;IAC7B,QAAA,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC;QAC7D;IACA,IAAA,IAAI,KAAK,GAAG,EAAE;IACd;;;;IAIG;IACH,IAAA,SAAS,OAAO,GAAA;YACd,IAAI,KAAK,GAAG,CAAC;gBAAE,KAAK,GAAG,CAAC;IACxB,QAAA,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB;IACA;;;;IAIG;IACH,IAAA,SAAS,IAAI,GAAA;YACX,IAAI,KAAK,GAAG,CAAC;gBAAE,OAAO,OAAO,EAAE;IAC/B,QAAA,KAAK,GAAG,EAAE,KAAK,GAAG,MAAM,CAAC,MAAM,GAAG,KAAK,GAAG,CAAC;IAC3C,QAAA,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB;QACA,OAAO;IACL,QAAA,OAAO,EAAE,OAAO;IAChB,QAAA,IAAI,EAAE,IAAI;SACX;IACH;;ICvCA;AACO,UAAM,eAAe,GAAG,CAAU,GAAgB,KAAO;QAC9D,MAAM,KAAK,GAAG,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC7B,OAAO,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAM;IACrC;;ICJA;;;;;IAKG;IACG,SAAU,eAAe,CAAC,MAAgB,EAAA;IAC9C,IAAA,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,SAAS,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC;IAChG;;ICRA;;;;;IAKG;IACG,SAAU,aAAa,CAAC,MAAgB,EAAA;QAC5C,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,CAAC;IACpC;;;;;;;;;;;;;;;;"}

package/bundle/index.iife.min.js

@@ -0,0 +1,2 @@
+var HyperfrontendListUtils=function(e){"use strict";const r=[],t=e=>{if(null===e)return"null";const t=typeof e;if("object"===t){if(Array.isArray(e))return"array";for(const t of r)if(e instanceof t)return t.name}return t};return e.createFifoList=function(){const e=new Set,r={push:r=>{if("object"!==t(r))throw new Error("A fifo list only non-primitive values");if(e.has(r))throw new Error("Cannot a item that already exists");e.add(r)},pull:()=>{const r=e.values().next().value;return e.delete(r),r},map:r=>Array.from(e.values()).map(r),forEach:r=>{e.forEach(r)},remove:r=>e.delete(r),has:r=>e.has(r),size:()=>e.size,clear:()=>e.clear()};return Object.freeze(r)},e.createLifoList=function(){const e=new Set,r={push:r=>{if("object"!==t(r))throw new Error("A lifo list only supports non-primitive values");e.add(r)},pull:()=>{const r=Array.from(e).pop();return r&&e.delete(r),r},map:r=>Array.from(e).map(r),forEach:r=>{e.forEach(r)},remove:r=>e.delete(r),has:r=>e.has(r),size:()=>e.size,clear:()=>{e.clear()}};return Object.freeze(r)},e.createRange=function(e,r){const t=[];for(let n=e;n<=r;n+=1)t.push(n);return t},e.createValuePicker=function(e){if(!e||!e.length)throw new Error("Expected values not to be an empty list.");let r=-1;function t(){return r<0&&(r=0),e[r]}return{current:t,next:function(){return r<0?t():(r=++r<e.length?r:0,e[r])}}},e.getLastKeyInMap=e=>{const r=[...e.keys()];return r[r.length-1]},e.nonEmptyStrings=function(e){return e.filter(e=>![void 0,null,""].includes(e)&&""!==e.trim())},e.uniqueStrings=function(e){return Array.from(new Set(e))},e}({});
+//# sourceMappingURL=index.iife.min.js.map

package/bundle/index.iife.min.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.iife.min.js","sources":["../../../../../../../../../../libs/utils/data/src/shared/consts.ts","../../../../../../../../../../libs/utils/data/src/get-type.ts","../../../../../../../../../../libs/utils/list/src/create-fifo-list.ts","../../../../../../../../../../libs/utils/list/src/create-lifo-list.ts","../../../../../../../../../../libs/utils/list/src/create-range.ts","../../../../../../../../../../libs/utils/list/src/create-value-picker.ts","../../../../../../../../../../libs/utils/list/src/get-last-key-in-map.ts","../../../../../../../../../../libs/utils/list/src/non-empty-strings.ts","../../../../../../../../../../libs/utils/list/src/unique-strings.ts"],"sourcesContent":[null,null,null,null,null,null,null,null,null],"names":["registeredClasses","getType","target","nativeDataType","Array","isArray","registeredClass","name","list","Set","result","push","item","Error","has","add","pull","value","values","next","delete","map","callback","from","forEach","remove","size","clear","Object","freeze","lastItem","pop","start","end","range","i","length","index","current","items","keys","filter","undefined","includes","trim"],"mappings":"oDAGO,MAAMA,EAAoC,GCQpCC,EAAwCC,IACnD,GAAe,OAAXA,EAAiB,MAAU,OAC/B,MAAMC,SAAwBD,EAC9B,GAAuB,WAAnBC,EAA6B,CAC/B,GAAIC,MAAMC,QAAQH,GAAS,MAAU,QACrC,IAAK,MAAMI,KAAmBN,EAC5B,GAAIE,aAAkBI,EAAiB,OAAUA,EAAgBC,IAErE,CACA,OAAUJ,sCCAV,MAAMK,EAAe,IAAIC,IAkCnBC,EAAsB,CAC1BC,KAjCYC,IACZ,GAAsB,WAAlBX,EAAQW,GACV,MAAM,IAAIC,MAAM,yCAElB,GAAIL,EAAKM,IAAIF,GACX,MAAM,IAAIC,MAAM,qCAElBL,EAAKO,IAAIH,IA2BTI,KAxBW,KACX,MAAMC,EAAQT,EAAKU,SAASC,OAAOF,MAEnC,OADAT,EAAKY,OAAUH,GACLA,GAsBVI,IAnBcC,GACPlB,MAAMmB,KAAKf,EAAKU,UAAUG,IAAIC,GAmBrCE,QAhBeF,IACfd,EAAKgB,QAAQF,IAgBbG,OAbcb,GAAqBJ,EAAKY,OAAOR,GAc/CE,IAZWF,GAAqBJ,EAAKM,IAAIF,GAazCc,KAXW,IAAMlB,EAAKkB,KAYtBC,MAVY,IAAMnB,EAAKmB,SAazB,OAAOC,OAAOC,OAAOnB,EACvB,8BC9CE,MAAMF,EAAe,IAAIC,IAmCnBC,EAAsB,CAC1BC,KAlCYC,IACZ,GAAsB,WAAlBX,EAAQW,GACV,MAAM,IAAIC,MAAM,kDAElBL,EAAKO,IAAIH,IA+BTI,KA5BW,KACX,MAAMc,EAAW1B,MAAMmB,KAAKf,GAAMuB,MAIlC,OAHID,GACFtB,EAAKY,OAAOU,GAEPA,GAwBPT,IArBcC,GACPlB,MAAMmB,KAAKf,GAAMa,IAAIC,GAqB5BE,QAlBeF,IACfd,EAAKgB,QAAQF,IAkBbG,OAfcb,GAAqBJ,EAAKY,OAAOR,GAgB/CE,IAdWF,GAAqBJ,EAAKM,IAAIF,GAezCc,KAbW,IAAclB,EAAKkB,KAc9BC,MAZY,KACZnB,EAAKmB,UAcP,OAAOC,OAAOC,OAAOnB,EACvB,gBC5DM,SAAsBsB,EAAeC,GACzC,MAAMC,EAAkB,GACxB,IAAK,IAAIC,EAAIH,EAAOG,GAAKF,EAAKE,GAAK,EACjCD,EAAMvB,KAAKwB,GAEb,OAAOD,CACT,sBCFM,SAA4BhB,GAChC,IAAKA,IAAWA,EAAOkB,OACrB,MAAM,IAAIvB,MAAM,4CAElB,IAAIwB,GAAQ,EAMZ,SAASC,IAEP,OADID,EAAQ,IAAGA,EAAQ,GAChBnB,EAAOmB,EAChB,CAWA,MAAO,CACLC,QAASA,EACTnB,KAPF,WACE,OAAIkB,EAAQ,EAAUC,KACtBD,IAAUA,EAAQnB,EAAOkB,OAASC,EAAQ,EACnCnB,EAAOmB,GAChB,EAKF,oBCtCyChB,IACvC,MAAMkB,EAAQ,IAAIlB,EAAImB,QACtB,OAAOD,EAAMA,EAAMH,OAAS,sBCGxB,SAA0BlB,GAC9B,OAAOA,EAAOuB,OAAQxB,IAAW,MAACyB,EAAW,KAAM,IAAIC,SAAS1B,IAA2B,KAAjBA,EAAM2B,OAClF,kBCFM,SAAwB1B,GAC5B,OAAOd,MAAMmB,KAAK,IAAId,IAAIS,GAC5B"}