Content deleted Content added
PerVognsen (talk | contribs) |
→Suggestions: Response |
||
Line 64:
On the topic of the multi-pattern matching code, I think it is worth noting in both the code and the surrounding discussion the possibility for hash table collisions. As it stands, one might wrongly infer from the code that the only possibility is that a hash table either has no entry or a single entry for any given hash code.
:Thanks for looking over the article. The collisions are internal to the implementation of the hash table. Here we are treating it as an abstract set data structure, and don't even really care whether it's a hash table, binary search tree, or association list. If you think you can make this clearer please feel free. [[User:Deco|Deco]] 05:14, 15 November 2005 (UTC)
| |||