This is the mail archive of the guile@cygnus.com mailing list for the guile project.
| Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
|---|---|---|
| Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
I have done a few skillets implementations and two treap implementations (in a few languages) and was wondering if anybody had thought of a good way to do skiplists in scheme so it allowed cdring down a list as thought it was a normal list. Also, the original work done on Skiplists has shown that they tend to have better average time than highly optimized non-recursive AVL tree code. For those of you who have not heard of skiplists, they are basically a linked list, but have log-n next pointers so that you can go though list quickly by skipping over nodes. I have a good amount of papers on them. Jay -- 4.4 > 98 http://www.xcf.berkeley.edu