Passes make, make check and a full make doc. Reg test diff attacghed
Attachments:
- [Screenshot from 2020-04-12
13-45-19.png](https://sourceforge.net/p/testlilyissues/issues/_discuss/thread/cadb1e7ba1/5cf0/attachment/Screenshot%20from%202020-04-12%2013-45-19.png)
(61.6 kB; image/png)
---
** [issues:#5886] Reimplement Scheme_hash_table using linear probing.**
**Status:** Started
**Created:** Fri Apr 10, 2020 06:14 PM UTC by Han-Wen Nienhuys
**Last Updated:** Sun Apr 12, 2020 10:42 AM UTC
**Owner:** Han-Wen Nienhuys
Add a unit-test and micro-benchmark, called from
input/regression/scheme-unit-test.ly
The GUILE hash table implementation uses conflict resolution by
chaining. This means that hash lookups involve walking linked lists,
which is both relatively slow (the CPU cannot prefetch the next list
item), and takes up a lot of space (each {key, value} pair needs an
extra cons to form the linked list.
The micro-benchmark for lookup shows a 2x speedup compared to GUILE's
hashtables.
https://codereview.appspot.com/559790043
---
Sent from sourceforge.net because [email protected] is
subscribed to https://sourceforge.net/p/testlilyissues/issues/
To unsubscribe from further messages, a project admin can change settings at
https://sourceforge.net/p/testlilyissues/admin/issues/options. Or, if this is
a mailing list, you can unsubscribe from the mailing list._______________________________________________
Testlilyissues-auto mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/testlilyissues-auto
