developer-utils

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.

Converts a sorted array of numbers into a list of ranges. Consecutive numbers are grouped into a single range [min, max]. Isolated numbers are represented as [num, num].

Performs a binary search for an exact element in a sorted array.

Performs a binary search for the smallest element greater than or equal to the target.

Performs a binary search for the largest element less than or equal to the target.

Performs a binary search for a range of elements inclusive of the target. Uses binarySearchGE and binarySearchLE.

Consume iterator values asynchronously utilizing macro-task queue to prevent Event Loop blocking.

Returns the type of the value as a lowercase string. More specific than the typeof operator (e.g., distinguishes 'array', 'null', 'date').

Measures the execution time of a given function by running it multiple times. Useful for micro-benchmarking and performance comparison.

Creates a memoized version of a function. Uses a tree structure to store results based on arguments. Compares arguments by reference.

Natural Search Algorithm by gkucmierz Mathematically finds the exponential boundary and binary searches bounds for a conditional function. Useful for finding bounds in sigmoidal functions without known boundaries.

Generates a random number from a normal (Gaussian) distribution. Uses the Box-Muller transform.

Converts a list of ranges into a flat array of numbers.

A safe alternative to setInterval that uses recursive setTimeout. It waits for the callback (even if it's async) to finish before scheduling the next tick, preventing overlapping executions and event loop blocking.