@taskmark/ui 0.2.1 → 0.2.4

package/dist/standalone/node_modules/next/dist/server/lib/incremental-cache/tags-manifest.external.js

@@ -1,55 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-0 && (module.exports = {
-    areTagsExpired: null,
-    areTagsStale: null,
-    tagsManifest: null
-});
-function _export(target, all) {
-    for(var name in all)Object.defineProperty(target, name, {
-        enumerable: true,
-        get: all[name]
-    });
-}
-_export(exports, {
-    areTagsExpired: function() {
-        return areTagsExpired;
-    },
-    areTagsStale: function() {
-        return areTagsStale;
-    },
-    tagsManifest: function() {
-        return tagsManifest;
-    }
-});
-const tagsManifest = new Map();
-const areTagsExpired = (tags, timestamp)=>{
-    for (const tag of tags){
-        const entry = tagsManifest.get(tag);
-        const expiredAt = entry == null ? void 0 : entry.expired;
-        if (typeof expiredAt === 'number') {
-            const now = Date.now();
-            // For immediate expiration (expiredAt <= now) and tag was invalidated after entry was created
-            // OR for future expiration that has now passed (expiredAt > timestamp && expiredAt <= now)
-            const isImmediatelyExpired = expiredAt <= now && expiredAt > timestamp;
-            if (isImmediatelyExpired) {
-                return true;
-            }
-        }
-    }
-    return false;
-};
-const areTagsStale = (tags, timestamp)=>{
-    for (const tag of tags){
-        const entry = tagsManifest.get(tag);
-        const staleAt = (entry == null ? void 0 : entry.stale) ?? 0;
-        if (typeof staleAt === 'number' && staleAt > timestamp) {
-            return true;
-        }
-    }
-    return false;
-};
-
-//# sourceMappingURL=tags-manifest.external.js.map

package/dist/standalone/node_modules/next/dist/server/lib/install-code-frame.js

@@ -1,22 +0,0 @@
-/**
- * Installs code frame rendering support by injecting the renderer into patch-error-inspect.
- * This uses dependency injection to avoid hard dependencies on native bindings in runtime code.
- *
- * Should be called early in dev/build initialization, after native bindings are loaded.
- */ "use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-Object.defineProperty(exports, "installCodeFrameSupport", {
-    enumerable: true,
-    get: function() {
-        return installCodeFrameSupport;
-    }
-});
-function installCodeFrameSupport() {
-    const { setCodeFrameRenderer } = require('../patch-error-inspect');
-    const { getOriginalCodeFrame } = require('../../next-devtools/server/shared');
-    setCodeFrameRenderer(getOriginalCodeFrame);
-}
-
-//# sourceMappingURL=install-code-frame.js.map

package/dist/standalone/node_modules/next/dist/server/lib/is-ipv6.js

@@ -1,41 +0,0 @@
-// Regex from `node/lib/internal/net.js`: https://github.com/nodejs/node/blob/9fc57006c27564ed7f75eee090eca86786508f51/lib/internal/net.js#L19-L29
-// License included below:
-// Copyright Joyent, Inc. and other Node contributors.
-//
-// 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.
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-Object.defineProperty(exports, "isIPv6", {
-    enumerable: true,
-    get: function() {
-        return isIPv6;
-    }
-});
-const v4Seg = '(?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])';
-const v4Str = `(${v4Seg}[.]){3}${v4Seg}`;
-const v6Seg = '(?:[0-9a-fA-F]{1,4})';
-const IPv6Reg = new RegExp('^(' + `(?:${v6Seg}:){7}(?:${v6Seg}|:)|` + `(?:${v6Seg}:){6}(?:${v4Str}|:${v6Seg}|:)|` + `(?:${v6Seg}:){5}(?::${v4Str}|(:${v6Seg}){1,2}|:)|` + `(?:${v6Seg}:){4}(?:(:${v6Seg}){0,1}:${v4Str}|(:${v6Seg}){1,3}|:)|` + `(?:${v6Seg}:){3}(?:(:${v6Seg}){0,2}:${v4Str}|(:${v6Seg}){1,4}|:)|` + `(?:${v6Seg}:){2}(?:(:${v6Seg}){0,3}:${v4Str}|(:${v6Seg}){1,5}|:)|` + `(?:${v6Seg}:){1}(?:(:${v6Seg}){0,4}:${v4Str}|(:${v6Seg}){1,6}|:)|` + `(?::((?::${v6Seg}){0,5}:${v4Str}|(?::${v6Seg}){1,7}|:))` + ')(%[0-9a-zA-Z-.:]{1,})?$');
-function isIPv6(s) {
-    return IPv6Reg.test(s);
-}
-
-//# sourceMappingURL=is-ipv6.js.map

package/dist/standalone/node_modules/next/dist/server/lib/is-rsc-request.js

@@ -1,18 +0,0 @@
-/**
- * Normalizes the raw RSC header value. Only the literal string "1" is treated
- * as a valid RSC request marker; malformed or repeated values are ignored.
- */ "use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-Object.defineProperty(exports, "isRSCRequestHeader", {
-    enumerable: true,
-    get: function() {
-        return isRSCRequestHeader;
-    }
-});
-function isRSCRequestHeader(value) {
-    return value === '1';
-}
-
-//# sourceMappingURL=is-rsc-request.js.map

package/dist/standalone/node_modules/next/dist/server/lib/lazy-result.js

@@ -1,46 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-0 && (module.exports = {
-    createLazyResult: null,
-    isResolvedLazyResult: null
-});
-function _export(target, all) {
-    for(var name in all)Object.defineProperty(target, name, {
-        enumerable: true,
-        get: all[name]
-    });
-}
-_export(exports, {
-    createLazyResult: function() {
-        return createLazyResult;
-    },
-    isResolvedLazyResult: function() {
-        return isResolvedLazyResult;
-    }
-});
-function createLazyResult(fn) {
-    let pendingResult;
-    const result = {
-        then (onfulfilled, onrejected) {
-            if (!pendingResult) {
-                pendingResult = Promise.resolve(fn());
-            }
-            pendingResult.then((value)=>{
-                result.value = value;
-            }).catch(()=>{
-            // The externally awaited result will be rejected via `onrejected`. We
-            // don't need to handle it here. But we do want to avoid an unhandled
-            // rejection.
-            });
-            return pendingResult.then(onfulfilled, onrejected);
-        }
-    };
-    return result;
-}
-function isResolvedLazyResult(result) {
-    return result.hasOwnProperty('value');
-}
-
-//# sourceMappingURL=lazy-result.js.map

package/dist/standalone/node_modules/next/dist/server/lib/lru-cache.js

@@ -1,191 +0,0 @@
-/**
- * Node in the doubly-linked list used for LRU tracking.
- * Each node represents a cache entry with bidirectional pointers.
- */ "use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-Object.defineProperty(exports, "LRUCache", {
-    enumerable: true,
-    get: function() {
-        return LRUCache;
-    }
-});
-class LRUNode {
-    constructor(key, data, size){
-        this.prev = null;
-        this.next = null;
-        this.key = key;
-        this.data = data;
-        this.size = size;
-    }
-}
-/**
- * Sentinel node used for head/tail boundaries.
- * These nodes don't contain actual cache data but simplify list operations.
- */ class SentinelNode {
-    constructor(){
-        this.prev = null;
-        this.next = null;
-    }
-}
-class LRUCache {
-    constructor(maxSize, calculateSize, onEvict){
-        this.cache = new Map();
-        this.totalSize = 0;
-        this.maxSize = maxSize;
-        this.calculateSize = calculateSize;
-        this.onEvict = onEvict;
-        // Create sentinel nodes to simplify doubly-linked list operations
-        // HEAD <-> TAIL (empty list)
-        this.head = new SentinelNode();
-        this.tail = new SentinelNode();
-        this.head.next = this.tail;
-        this.tail.prev = this.head;
-    }
-    /**
-   * Adds a node immediately after the head (marks as most recently used).
-   * Used when inserting new items or when an item is accessed.
-   * PRECONDITION: node must be disconnected (prev/next should be null)
-   */ addToHead(node) {
-        node.prev = this.head;
-        node.next = this.head.next;
-        // head.next is always non-null (points to tail or another node)
-        this.head.next.prev = node;
-        this.head.next = node;
-    }
-    /**
-   * Removes a node from its current position in the doubly-linked list.
-   * Updates the prev/next pointers of adjacent nodes to maintain list integrity.
-   * PRECONDITION: node must be connected (prev/next are non-null)
-   */ removeNode(node) {
-        // Connected nodes always have non-null prev/next
-        node.prev.next = node.next;
-        node.next.prev = node.prev;
-    }
-    /**
-   * Moves an existing node to the head position (marks as most recently used).
-   * This is the core LRU operation - accessed items become most recent.
-   */ moveToHead(node) {
-        this.removeNode(node);
-        this.addToHead(node);
-    }
-    /**
-   * Removes and returns the least recently used node (the one before tail).
-   * This is called during eviction when the cache exceeds capacity.
-   * PRECONDITION: cache is not empty (ensured by caller)
-   */ removeTail() {
-        const lastNode = this.tail.prev;
-        // tail.prev is always non-null and always LRUNode when cache is not empty
-        this.removeNode(lastNode);
-        return lastNode;
-    }
-    /**
-   * Sets a key-value pair in the cache.
-   * If the key exists, updates the value and moves to head.
-   * If new, adds at head and evicts from tail if necessary.
-   *
-   * Time Complexity:
-   * - O(1) for uniform item sizes
-   * - O(k) where k is the number of items evicted (can be O(N) for variable sizes)
-   */ set(key, value) {
-        const size = (this.calculateSize == null ? void 0 : this.calculateSize.call(this, value)) ?? 1;
-        if (size <= 0) {
-            throw Object.defineProperty(new Error(`LRUCache: calculateSize returned ${size}, but size must be > 0. ` + `Items with size 0 would never be evicted, causing unbounded cache growth.`), "__NEXT_ERROR_CODE", {
-                value: "E1045",
-                enumerable: false,
-                configurable: true
-            });
-        }
-        if (size > this.maxSize) {
-            console.warn('Single item size exceeds maxSize');
-            return false;
-        }
-        const existing = this.cache.get(key);
-        if (existing) {
-            // Update existing node: adjust size and move to head (most recent)
-            existing.data = value;
-            this.totalSize = this.totalSize - existing.size + size;
-            existing.size = size;
-            this.moveToHead(existing);
-        } else {
-            // Add new node at head (most recent position)
-            const newNode = new LRUNode(key, value, size);
-            this.cache.set(key, newNode);
-            this.addToHead(newNode);
-            this.totalSize += size;
-        }
-        // Evict least recently used items until under capacity
-        while(this.totalSize > this.maxSize && this.cache.size > 0){
-            const tail = this.removeTail();
-            this.cache.delete(tail.key);
-            this.totalSize -= tail.size;
-            this.onEvict == null ? void 0 : this.onEvict.call(this, tail.key, tail.data);
-        }
-        return true;
-    }
-    /**
-   * Checks if a key exists in the cache.
-   * This is a pure query operation - does NOT update LRU order.
-   *
-   * Time Complexity: O(1)
-   */ has(key) {
-        return this.cache.has(key);
-    }
-    /**
-   * Retrieves a value by key and marks it as most recently used.
-   * Moving to head maintains the LRU property for future evictions.
-   *
-   * Time Complexity: O(1)
-   */ get(key) {
-        const node = this.cache.get(key);
-        if (!node) return undefined;
-        // Mark as most recently used by moving to head
-        this.moveToHead(node);
-        return node.data;
-    }
-    /**
-   * Returns an iterator over the cache entries. The order is outputted in the
-   * order of most recently used to least recently used.
-   */ *[Symbol.iterator]() {
-        let current = this.head.next;
-        while(current && current !== this.tail){
-            // Between head and tail, current is always LRUNode
-            const node = current;
-            yield [
-                node.key,
-                node.data
-            ];
-            current = current.next;
-        }
-    }
-    /**
-   * Removes a specific key from the cache.
-   * Updates both the hash map and doubly-linked list.
-   *
-   * Note: This is an explicit removal and does NOT trigger the `onEvict`
-   * callback. Use this for intentional deletions where eviction tracking
-   * is not needed.
-   *
-   * Time Complexity: O(1)
-   */ remove(key) {
-        const node = this.cache.get(key);
-        if (!node) return;
-        this.removeNode(node);
-        this.cache.delete(key);
-        this.totalSize -= node.size;
-    }
-    /**
-   * Returns the number of items in the cache.
-   */ get size() {
-        return this.cache.size;
-    }
-    /**
-   * Returns the current total size of all cached items.
-   * This uses the custom size calculation if provided.
-   */ get currentSize() {
-        return this.totalSize;
-    }
-}
-
-//# sourceMappingURL=lru-cache.js.map

package/dist/standalone/node_modules/next/dist/server/lib/match-next-data-pathname.js

@@ -1,18 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", {
-    value: true
-});
-Object.defineProperty(exports, "matchNextDataPathname", {
-    enumerable: true,
-    get: function() {
-        return matchNextDataPathname;
-    }
-});
-const _pathmatch = require("../../shared/lib/router/utils/path-match");
-const matcher = (0, _pathmatch.getPathMatch)('/_next/data/:path*');
-function matchNextDataPathname(pathname) {
-    if (typeof pathname !== 'string') return false;
-    return matcher(pathname);
-}
-
-//# sourceMappingURL=match-next-data-pathname.js.map