Function getComplex

src/compute-engine/boxed-expression/order.ts:546–570

(a: Expression)

  if (!isCommutative) return xs;

  if (def.operator.commutativeOrder)
    return [...xs].sort(def.operator.commutativeOrder);

  return [...xs].sort(order);
}

/**
 * Sort the terms of a polynomial expression (`Add` expression) according
 * to the deglex polynomial ordering
 *
 */
export function polynomialOrder(expr: Expression): Expression {
  // Empirically, the Total Degree Reverse Lexicographic Order (grevlex)
  // is often the fastest to calculate Gröbner basis. We use it as the
  // default ordering for polynomials.
  return degreeReverseLexicographicOrder(expr, expr.unknowns);
}

export function lexicographicOrder(
  expr: Expression,
  vars?: ReadonlyArray<string>
): Expression {
  // This ordering is not implemented yet; preserve the input expression.
  const _vars = vars ?? expr.unknowns;
  return expr;
}

export function degreeLexicographicOrder(