Return Styles: Pseud0ch, Terminal, Valhalla, NES, Geocities, Blue Moon.

Pages: 1-

Hash table of RB trees

Name: Anonymous 2011-08-08 7:45

smart

Name: Anonymous 2011-08-08 7:47

not caring about the mechanism of your associative array until profiling

smart

Name: Anonymous 2011-08-08 8:18

saging  your posts
smart

Name: Anonymous 2011-08-08 8:39

nigger
not smart

Name: Anonymous 2011-08-08 12:10

Insertion is not O(1).

Name: Anonymous 2011-08-08 13:48

(void *)
Smarter

Name: Anonymous 2011-08-08 21:33

>>5
But it's good for scenarios where lookup speed is more important than insertion speed, and where there is a high possibility of collisions.

Name: Anonymous 2011-08-08 21:34

Openly-addressed associative hash-tables with quadratic probing are for more efficient in practice than hash-tables utilizing chained-addressing with lists or trees.

Name: Anonymous 2011-08-08 22:00

>>8
This is a fine example of how a one-letter typo can make your post go from expert to total retard.

Fixed:
Openly-addressed associative hash-tables with anal probing are far more efficient in practice than hash-tables utilizing chained-addressing with lists or trees.

Name: Anonymous 2011-08-08 22:32

>>5
True fact: Only people with premature ejacuation care about O(1) insertion.

Name: Anonymous 2011-08-08 22:45

>>10
cretin

Name: Anonymous 2011-08-08 23:43

>>11
Lisper

Name: Anonymous 2011-08-09 0:49

>>12
Bullshit, Lispers are known to know the value of everything but the cost of nothing.
Don't change these.
Name: Email:
Entire Thread Thread List
All trademarks and copyrights on this site are owned by their respective parties. All comments and posts are the responsibility of their own posters.
- Tinychan + 2ch Mode -