Hello, y'all!
I apologize for being somewhat unresponsive in the moment,
but I'm pretty busy in the moment in RL/work.
Alejandro's hash-table fix has been incorporated, and
the whole entry-point stuff is gone (as suggested by Daniel and
Ashely) , together with a simplification
of the embedding
Hi,
I've been playing around with the meroon egg, comparing it to tinyclos.
With tinyclos, I can define a superclass in a one file (or even a static
library), then subclass from it in another file, as long as
both files are linked into the program.
With meroon, the superclass definition must be
On Aug 2, 2005, at 10:50 AM, Nelson Castillo wrote:
On 8/1/05, Ed Watkeys [EMAIL PROTECTED] wrote:
_The Practice of Programming_ (Kernighan Pike) deals with a
situation analgous to this; they grow storage for a string by powers
of two. This works well because it heavily tests the algorithm
On Aug 2, 2005, at 5:09 PM, Toby Butzon wrote:
On Tue, Aug 02, 2005 at 05:22:54PM -0400, Ed Watkeys wrote:
Yup. But you really should use prime numbers for hash tables.
Is there a paper or book that offers a convincing, empirical argument
for this? I've read and heard this exhortation
When, on the other hand, n is prime, o is always 1 so you won't need
to worry about this (you'll just need to worry that no single value
from hash(A) occurs more often than others).
Erm, o is always 1 or n. I'll leave it up to you to figure out what
happens when o is n.
Alejo.
