God damnit Sussman
1
Name:
Anonymous
2012-04-03 12:26
make a BST vs HashTable comparison program
my BST outperforms my HashTable even when nearing 100000 elements on misses
2
Name:
Anonymous
2012-04-03 13:54
Make a non-shit HashTable then.
3
Name:
Anonymous
2012-04-03 14:45
crit-bit
4
Name:
Anonymous
2012-04-03 17:05
APPARENTLY MY MAGIC NUMBER IN MY HASH WAS OFF BY 1 AND MADE COLLISIONS COMMON AND MY HASHTABLE SHITTY.
5
Name:
Anonymous
2012-04-03 17:44
the correct term is ``dictionary'', ``faggot''
6
Name:
Anonymous
2012-04-03 17:53
>>5
Only a ``faggot'' would try to label a hashtable as a dictionary.
7
Name:
Anonymous
2012-04-03 20:30
>>6
guido calls them dictionaries. if it's pythonic it's correct, ``faggot''
8
Name:
Anonymous
2012-04-03 21:47
>>7
If it's pythonic, then it's some scriptkiddie that doesn't know shit. Fuck off, ``faggot''
9
Name:
Anonymous
2012-04-03 23:39
Hashes (Perl)
Hashtable (LISP)
Dictionary (Python, Visual Basic, and the other Visual Basic with the C syntax)
Map (C++)
FrozenVoidSuperArray (BBCode)
10
Name:
Anonymous
2012-04-04 0:02
>>9
Lisp is a gods language therefore it's Hashtable as stated by the gods
11
Name:
Anonymous
2012-04-04 0:33
(display '(dubs)) ;check 'em
12
Name:
Anonymous
2012-04-04 2:50
>>9
A
map is an ADT and a hash table is one way to implement it.
map doesn't mean binary search tree by default.
Dictionary is just a word that's newbie-friendly and helpful to non-programmers.
13
Name:
Anonymous
2012-04-04 2:53
>>12
But if it's called ``hash table'' you've at least got some time complexity guarantees for the most important operations.
``dictionary'' still doesn't mean shit, though.
14
Name:
Anonymous
2012-04-04 5:09
>>12
std::map supports an iterator that traverses the elements in sorted order, which is not necessarily efficient using a hash table.
15
Name:
Anonymous
2012-04-04 11:10
Lisp
GC is shit.
16
Name:
Anonymous
2012-04-04 12:38
>>5
>>13
A HashTable is a particular implementation of a Map/Associative Array/Dictionary
"faggot"
17
Name:
Anonymous
2012-04-04 16:36
>>9
tr1 has an actual hash table. It's called std::tr1::unordered_map. std::map isn't implemented as a hash table because it simply doesn't have the necessary hashing functions for various objects. unordered_map does however.
18
Name:
bampu pantsu
2012-05-29 4:10
bampu pantsu
Newer Posts