User loginNavigation |
Best default sequence?Most languages have a default concrete data type for collections (arrays in C and Perl, lists in Lisp and Haskell, etc.) that get used more often then they probably should. By default, I mean languages generally have better syntax for a particular data type that gets used most often (or better pattern matching, or better names for constructors (think ":" and "[]" or "cadr") or historical reasons or predominance in tutorial material, etc.). But for new languages, what criteria should we use when choosing an appropriate default? For a new functional language, I'm thinking about using catenable deques (with O(1) append, cons, and snoc) or democratic sequences (or some other balanced tree with O(lg n) complexity for almost all operations). Is there something out there that might make for an even better default? Or are the current batch of defaults already close enough to optimal? (And please feel free to opine about different collection defaults in imperative and logic languages as well). By Greg Buchholz at 2005-10-18 20:30 | LtU Forum | previous forum topic | next forum topic | other blogs | 11771 reads
|
Browse archives
Active forum topics
|
Recent comments
11 weeks 1 day ago
15 weeks 3 days ago
17 weeks 11 hours ago
17 weeks 12 hours ago
19 weeks 5 days ago
24 weeks 2 days ago
24 weeks 2 days ago
24 weeks 5 days ago
24 weeks 5 days ago
27 weeks 4 days ago