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
More comparison operations can be implemented and sped up using vector operations.
== (basic version available in src/utils)
<
<=
The order can be pretty arbitrary; its just that some consistent order has to exist to allow sorting and binary search tree operations to be well-defined.
The text was updated successfully, but these errors were encountered:
That is a very good point. It allows the internal representation, which is a contiguous piece of memory, to be manually managed (special alignment and padding) for maximum efficiency, so allocations do not have to be done for every operation. It should be easier for us to manually roll a bit vector class, since we want to control the memory carefully.
More comparison operations can be implemented and sped up using vector operations.
==
(basic version available insrc/utils
)<
<=
The order can be pretty arbitrary; its just that some consistent order has to exist to allow sorting and binary search tree operations to be well-defined.
The text was updated successfully, but these errors were encountered: