On Sun, Dec 06, 2020 at 10:59:33AM +0100, Ralf Hemmecke wrote:
> > On 12/5/20 11:26 PM, Waldek Hebisch wrote:
> >> On Sat, Dec 05, 2020 at 09:06:22PM +0800, oldk1331 wrote:
> >>> Almost sure it is bug when adding new kernel in cache, in function
> >>> "enterInCache".
> >>
> >> ATM our handling of kernel cache is unsound.=C2=A0 Basicaly, kernel
> >> cache assumes order and in fact there are no consistent order
> >> on kernels.
>
> Why does Kernel need an order at all?
>
> Wouldn't it be an option to do kernel caching via XHashTable?
The core problem is that kernel reprezentation is noncanonical.
For kernels (and several other noncanonical domains) it is hard
to create hash function which is efficient (has many values in
image) and sound (equal values for equal objects).
--
Waldek Hebisch
--
You received this message because you are subscribed to the Google Groups
"FriCAS - computer algebra system" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/fricas-devel/20201207122533.GA6780%40math.uni.wroc.pl.
