A C D F G H I L M N P R S T U

P

PatchWorkArray<T> - Class in com.scottlogic.util
List implementation which is backed by an ArrayList and performs lazy insertions and removals
PatchWorkArray() - Constructor for class com.scottlogic.util.PatchWorkArray
Creates a new PatchWorkArray backed by an ArrayList with an initial capacity of ten.
PatchWorkArray(int) - Constructor for class com.scottlogic.util.PatchWorkArray
Creates a new PatchWorkArray backed by an ArrayList with the given initial capacity.
predecessor() - Method in class com.scottlogic.util.SortedList.Node
Gets the node that is the next smallest in the tree, which is null if this is the smallest valued node.

A C D F G H I L M N P R S T U