Date: Mon, 22 Jan 2007 02:07:12 +0100
From: "Lennart Borgman (gmail)" <address@hidden>
Cc: address@hidden
I believe however that it takes more time to insert a symbol in big
obarray than in a small. But that depends on how the internal structure
of an obarray looks and how it is handled. I assume it is some kind of
tree structure.
Why assume? the ELisp manual describes that for you; when in the
manual, type "i obarray RET" and read there. You will see that Emacs
uses hashing, like all other implementations of symbol tables (which
is what obarray really is), so adding a new symbol is more or less
independent of the obarray size. The same goes for searches and other
types of access.