[Home] [By Thread] [By Date] [Recent Entries]
> Depends on your hashing implementation and then the bucket handling (ie > making sure the map is big enough in the first place to support all the > attributes without having to re-hash). As most parsers are likely to use > the standard java.util.HashMap, then probably not as it's impl isn't the > worlds best. As a quantitative statement, that is probably true. I just like to point out that some parsers use perhaps STL maps, and others use UserDict objects, yet others custom structs. Please think in abstract data types, not in the implementations that Java gave you. To provide an associative array, hash tables are just one option - another option is to use a tree, or a linear list. Regards, Martin
|

Cart



