Well, no they wouldn't.
They would often need to write something like
dense.times(unknown)
They know that their own object is dense, but they don't know what kind of
input they were given. They should still run fast if the input is sparse.
On Mon, Aug 15, 2011 at 3:06 PM, Gilles Sadowski <
gil...@harfang.homelinux.org> wrote:
> > And it really helps for a dense matrix to optimize operations against a
> > sparse operand as in dense.plus(sparse).
>
> Applications that manipulate sparse things would know the limitations of
> polymorphism and would write
> sparse.plus(dense)
