Package-level declarations

SweepQueue is a data structure designed to manage and process events in a sweep line algorithm.

Given a list of potential values at each index in a list, returns all possible combinations of those values.

Calculates a normalization factor based on the maximum value between two given numbers and the exponent of that maximum value. The normalization factor ensures that values within a certain range are normalized appropriately.

Calculates a normalization factor based on the maximum value among the input parameters and their exponent. It ensures the result lies within a reasonable range for numerical stability.

Computes a normalization factor for a given set of four double values. The normalization ensures values are scaled properly based on their maximum magnitude.

Generates permutations of the given list of values. If the size of the list exceeds a certain limit, it returns a fixed number of randomly shuffled permutations. Otherwise, it calculates all possible permutations.

Solves a cubic equation of the form ax^3 + bx^2 + cx + d = 0 and returns its real roots.

Solves a linear equation of the form ax + b = 0 and returns the solution(s) as an array of doubles.

Solves a linear equation of the form ax + b = 0 and stores the solution in the provided array.

Sorts a given array within a specified range based on a selector function that maps each element to a Double value.

Swaps the elements at two specified indices in the given array.