AllocationFreeList

```
public class AllocationFreeList<T extends AllocationFreeList.Element<T>>
extends Object
```
A list of elements that can be constructed without allocation, for use by the garbage collector. Elements can be prepended to a list in constant time, and can be disabled in constant time. Disabled elements can be removed from the list before the list is iterated, in time proportional to the length of the list. Prepending elements on a list is atomic. Walking a list starts from a sample, and should be run single-threaded if the list might be scrubbed while it is being walked.

Nested Classes
Modifier and Type	Class and Description
`static class`	`AllocationFreeList.Element<T extends AllocationFreeList.Element<T>>` An element of a AllocationFreeList has slots for the next element in the list, so singly-linked lists can be assembled without allocation.
`static class`	`AllocationFreeList.PreviouslyRegisteredElementException`

Constructors
Modifier	Constructor and Description
`protected`	`AllocationFreeList()` Constructor.

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`static <U extends AllocationFreeList.Element<U>> AllocationFreeList<U>`	`factory()`
`T`	`getFirst()` Get the first enabled element of the list as a T.
`Object`	`getFirstObject()` For detecting errors: Get the first element as an Object so there is no type checking.
`void`	`prepend(T element)` Prepend an element to the list.
`void`	`scrub()` Remove any disabled elements from the list.
`T`	`testingBackDoorGetFirst()` For testing, to iterate without scrubbing.

Class AllocationFreeList<T extends AllocationFreeList.Element<T>>