The usecase imtringued was talking about: > assuming you already know the pointer to the linked list node For example a LinkedHashMap where a hash provides th

The usecase imtringued was talking about: > assuming you already know the pointer to the linked list node For example a LinkedHashMap where a hash provides the primary means of looking up elements and the nodes contain an intrusive linked list. Removing an element from that list doesn't involve chasing pointers from the start of it. The linked benchmark is for a different scenario.