[16:13] Keybuk: I think I have an idea for the linked list issue [16:16] oh? [16:16] Keybuk: for cursor objects, why not set the prev pointer to something weird? [16:16] Keybuk: and then have them keep the real prev value in a 3rd element [16:17] so in the insert/delete/etc methods if (prev == (void *)0x2) //the real prev is off the end of the structure, and this is a cursor [16:18] we could even set it NULL, since I think no valid list structure should ever have null pointers [16:22] and have add_after/add know to check for it? [16:23] those, and possibly a few others [16:23] it could touch quite a few functions given how drastic a change it is [16:23] or rather how drastic a departure from the list structure it is [16:24] but all the information you need to operate on the list is always available [16:26] the other thing we need (and we need this for any cursor-based solution) is an NIH_LIST_PREV and NIH_LIST_NEXT set of macros, since just grabbing the pointers is unreliable from within the linking application === notting_ is now known as notting