Waldek wrote: > It still uses order to find positions in kernel cache.
Although order is at least to some extent arbitrary, it is still necessary for the ordering to be consistent during a session to satisfy category 'Comparable'. On Thu, Aug 26, 2021 at 5:22 AM Qian Yun <oldk1...@gmail.com> wrote: > > Most time spent on Kernel should be in "linearSearch". > And since Kernel doesn't have order, I wonder if it is possible to > using some kind of hashtable to store all cached kernels. Of course hash and order are not compatible but it might be possible to maintain a duplicate cache. -- 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 fricas-devel+unsubscr...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/fricas-devel/CAC6x94SOm_TzE5VnmfaiHgG37YMQHrH8D_m3myw2wz%2BbjAux7w%40mail.gmail.com.
