One way linked list implementation with internal automatic cached memorization of the last access.
Because of the last access memory cache, the traversal of a LINKED_LIST from the lower index to the
upper index using item is quite efficient. As one can expect, adding element using add_first or
add_last is really efficient too, actually, the total number of elements (i.e. count) as well as a
reference to the last cell is also cached automatically. Keep in mind that LINKED_LIST uses a one way
linked storage from lower to upper, so traversing a LINKED_LIST from upper to lower will be
extremely time consumming (also consider TWO_WAY_LINKED_LIST).