On 5/10/26 12:42 PM, Waldek Hebisch wrote:
> 
> I do not see how Lisp EQ hash table could help us: mathematicaly
> equal expressions may be EQ but also may be not.  So if we do
> not get hit we need to do linear search.  While cache hits
> may be faster, I would expect much more cases when we need
> linear search (actually, it is not clear to me if we will
> get _any_ hits).
> 

The "EQ hashtable" is a little misleading:  the insertion
of new kernels is still a linear search, just like current
situation.  The comparison are done via "kerEqual", not EQ.


> 
> I interrupted 'jet.input' after 16 minutes, I do not know if it
> was just slow and would eventually finish (normally on the same
> machine the whole testsuite finishes after 25 seconds of real
> time).
> 

Did you do a fresh build?  What's your SBCL version?
On my side, "make check" returns quickly with 10 failed tests,
no hangup.

- Qian

-- 
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 visit 
https://groups.google.com/d/msgid/fricas-devel/5ca1baf1-b73c-4879-b6f9-8e56ee0cd8b3%40gmail.com.

Reply via email to