Friday, May 03, 2002
Eric and I tried to come up with some ideas for our implementation of a doubly-linked list and the problem of removing an element from the list in real-time. So far, none of our ideas have worked. Eric had this idea about adding a hashtable that references the entries by hashing the object. This way when a delete is called we could reference the list entry in the hashmap and delete it that way. However, collisions and resizing become additional problems, plus the waste of space.
Everything is a trade-off, and we're not sure what's more important -- time, space, flexibility, etc.
Right now we're looking into a doubly-linked list with weak references and seeing if better methods of garbage collection could possibly help us. We're researching stuff on the web in our search.
posted by Amy Sia 3:23 PM
I meant this is not a test!
posted by Eric Fesenmaier 2:03 PM
This is just a test!
posted by Amy Sia 2:01 PM
