[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: [Emacs-diffs] feature/byte-switch c4316a2: ; bytecomp.el (byte-compi
Re: [Emacs-diffs] feature/byte-switch c4316a2: ; bytecomp.el (byte-compile-cond-jump-table): Add TODO note
Mon, 6 Feb 2017 11:26:12 -0500
Mozilla/5.0 (X11; Linux x86_64; rv:45.0) Gecko/20100101 Thunderbird/45.7.0
On 2017-02-06 10:35, Stefan Monnier wrote:
> Indeed, we can probably substantially improve our hash-table performance
> for small hash tables (not only in terms of CPU use but also in terms of
> memory use).
> But rather than a :linear-search keyword to make-hash-table, can't we
> just test the value of `count` and use a linear search if it's small?
This would be great. I currently have quite a bit of hash-table-heavy code
with many relatively small hash tables, but in a few rare cases they can grow
large, so alists don't cut it. A linear-search keyword wouldn't really help,
because I can't tell beforehand which ones will be large.