New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

add hash table for ID's... #78

Open

FellowTraveler opened this issue May 14, 2012 · 0 comments

Owner

FellowTraveler commented May 14, 2012

All OTIdentifiers should allocate their memory via a hash table or binary tree, and share that memory for all instances of the same ID.

That way, when it comes time to COMPARE IDs, we only have to compare the address, and not the byte-for-byte ID itself.

Should do a lot for optimization to change ALL ID comparisons to a single number instead of 32 of them, or however many bytes are in the ID.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment