...
Notes
Algorithm: Assuming inserting entry I between entries X and Y (for more details, read Linked lists):
| Code Block | ||
|---|---|---|
| ||
*I = X XOR Y *X = *X XOR Y XOR I *Y = *Y XOR X XOR I |
If X and Y are zero then the link is cleared.
Related calls
GN_Xdl, delete an entry from a linked list
GN_Xnx, index next entry in linked list