Bill Page wrote:
>
>
> Since the number of factorizations of a non-commutative polynomial
> over a unique factorization domain is finite but not unique there may
> be some applications where it maybe interesting to know more than one
> or even all possible factorizations. Your current
oldk1331 wrote:
>
> My updated patch is here:
>
> https://github.com/oldk1331/fricas/commit/0bf5c58d3cf72fd6429313c62e5c28bf1312451f.patch
>
OK, pleas commit.
> Following similar logic, "nodes" and "leaves" should give error when
> argument is empty; but "leaf?", "child?", "node?" should not
