I had the code based on Bill Page and Waldek Hebisch suggestions that was
doing what I wanted but this last hint by Themos simplified it a lot. I
will put it here as Marduk seems to be doing a similar exercise in the "Simple
Gaussian integral fails thread".
The goal is to see if we can make
Bill Page wrote:
>
> As a performance test I tried this:
>
> (79) -> h2323:=((h2*h3*h2*h3)^2);
>
> Type:
> XDistributedPolynomial(OrderedVariableList([x,y,z,w,x1,x2,x3,x4,x5]),Fraction(Integer))
>Time: 0.00 (IN) + 2.71 (EV) + 0.00 (OT) = 2.71 sec
> (80) -> dc_fact
oldk1331 wrote:
>
> "children binarySearchTree [1]" should return "[]" instead of "[[]]".
OK, please commit.
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe
"children binarySearchTree [1]" should return "[]" instead of "[[]]".
diff --git a/src/algebra/aggcat.spad b/src/algebra/aggcat.spad
index f960af07..b0edbde7 100644
--- a/src/algebra/aggcat.spad
+++ b/src/algebra/aggcat.spad
@@ -1168,9 +1168,10 @@ BinaryRecursiveAggregate(S : Type) : Category ==
