Module list

Lock-free intrusive linked list.

Ideas from Michael. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. SPAA 2002. http://dl.acm.org/citation.cfm?id=564870.564881

Structs

• Entry 🔒
  An entry in a linked list.
• Iter 🔒
  An iterator used for retrieving values from the list.
• List 🔒
  A lock-free, intrusive linked list of type T.

Enums

• IterError 🔒
  An error that occurs during iteration over the list.

Traits

• IsElement 🔒
  Implementing this trait asserts that the type T can be used as an element in the intrusive linked list defined in this module. T has to contain (or otherwise be linked to) an instance of Entry.