@cortex-js/compute-engine 0.24.1 → 0.25.1

package/dist/types/compute-engine/boxed-expression/order.d.ts

@@ -1,11 +1,11 @@
-/* 0.24.1 */
+/* 0.25.1 */
 export type Order = 'lex' | 'dexlex' | 'grevlex' | 'elim';
 export declare const DEFAULT_COMPLEXITY = 100000;
 /**
  * Sort by higher total degree (sum of degree), if tied, sort by max degree,
  * if tied,
  */
-export declare function sortAdd(ops: BoxedExpression[]): BoxedExpression[];
+export declare function sortAdd(ops: ReadonlyArray<BoxedExpression>): ReadonlyArray<BoxedExpression>;
 /**
  * Given two expressions `a` and `b`, return:
  * - `-1` if `a` should be ordered before `b`
@@ -53,7 +53,7 @@ export declare function canonicalOrder(expr: BoxedExpression, { recursive }: {
  *
  */
 export declare function polynomialOrder(expr: BoxedExpression): SemiBoxedExpression;
-export declare function lexicographicOrder(expr: BoxedExpression, vars?: string[]): SemiBoxedExpression;
-export declare function degreeLexicographicOrder(expr: BoxedExpression, vars?: string[]): SemiBoxedExpression;
-export declare function degreeReverseLexicographicOrder(expr: BoxedExpression, vars?: string[]): SemiBoxedExpression;
-export declare function eliminationOrder(expr: BoxedExpression, vars?: string[]): SemiBoxedExpression;
+export declare function lexicographicOrder(expr: BoxedExpression, vars?: ReadonlyArray<string>): SemiBoxedExpression;
+export declare function degreeLexicographicOrder(expr: BoxedExpression, vars?: ReadonlyArray<string>): SemiBoxedExpression;
+export declare function degreeReverseLexicographicOrder(expr: BoxedExpression, vars?: ReadonlyArray<string>): SemiBoxedExpression;
+export declare function eliminationOrder(expr: BoxedExpression, vars?: ReadonlyArray<string>): SemiBoxedExpression;