* Make a cell holding v and link it immediately after current cell
* make a node holding v, link it before the current cell, and return it
* Make a copy of the list and return new head.
* return the number of cells holding element found in a circular * traversal
* return the first cell holding element found in a circular traversal starting * at current cell, or null if no such
* link p before current cell
* return the nth cell traversed from here. It may wrap around.
Set to point to ourselves
Set to point to n as next cell and p as the prior cell
* Return true if current cell is the only one on the list
* return the number of cells in the list
* Unlink self from list it is in. * Causes it to be a singleton
* Unlink the next cell. * This has no effect on the list if isSingleton()
* Unlink the previous cell. * This has no effect on the list if isSingleton()
Clinks are links that are always arranged in circular lists.