You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the documentation `Implementation notes' under the section `Resource
use', it states:
The space overhead for an sparsetable of size N is N + 48N/M bits. For the
default value of M, this is exactly 2 bits per array entry.
This statement is true for architectures with a 32-bit pointer. For an
architecture with a 64-bit pointer, the overhead is
N + 80N/M bits
and for the default value of M=48, the overhead is 8/3 or 2.67 bits per entry.
Cheers,
Shaun
Original issue reported on code.google.com by sjackman on 4 Mar 2009 at 12:41
The text was updated successfully, but these errors were encountered:
Original issue reported on code.google.com by
sjackman
on 4 Mar 2009 at 12:41The text was updated successfully, but these errors were encountered: