Merge pull request #3 from codeAdityagithub/dev

Merge dev- performance improvements and size reduction

Author: codeAdityagithub

build/index.d.ts

@@ -7,6 +7,7 @@ import { JSXInternal } from './jsx';
 export * from './jsx';
 declare global {
     export import JSX = JSXInternal;
+    const FRAGMENT = "FRAGMENT";
 }
 export * from './types';
 export { cleanUp, createEffect, createSignal, render, createPromise, createRef, computed, createElement, lazy, ArraySignal, BaseSignal, ObjectSignal, PrimitiveSignal, PublicArraySignal, PublicObjectSignal, PublicSignal, Ref, };

build/jsx.d.ts

@@ -1,8 +1,9 @@
+import { ComponentChild } from '../index';
 type PropsOf<T extends (...args: any) => any> = Parameters<T> extends [] ? {} : Parameters<T>[0];
 export declare function lazy<T extends (props: any) => any>(importFn: () => Promise<{
     default: T;
 }>): (props: PropsOf<T> & {
-    fallback?: string | Node;
-    errorFallback?: string | Node | ((error: Error) => Node);
+    fallback?: ComponentChild;
+    errorFallback?: ComponentChild | ((error: Error) => ComponentChild);
 }) => ReturnType<T>;
 export {};

build/lazy/Lazyloading.d.ts

@@ -6,11 +6,4 @@ export declare function applyMoves<T>(arr: T[], moves: Record<string, {
     from: number;
     to: number;
 }>): T[];
-/**
- * Computes the indices of the longest increasing subsequence in the given array.
- * @param arr - An array of numbers.
- * @returns An array of indices representing the longest increasing subsequence.
- *
- * Time Complexity: O(n log n)
- */
 export declare function longestIncreasingSubsequenceIndices(arr: number[]): number[];