Class CollisionCheckStack<E>

  • All Implemented Interfaces:
    Iterable<E>, Collection<E>, List<E>

    public final class CollisionCheckStack<E>
    extends AbstractList<E>
    Stack-like data structure that allows the following efficient operations:
    1. Push/pop operation.
    2. Duplicate check. When an object that's already in the stack is pushed, this class will tell you so.

    Object equality is their identity equality.

    This class implements List for accessing items in the stack, but List methods that alter the stack is not supported.

    Author:
    Kohsuke Kawaguchi
    • Constructor Detail

      • CollisionCheckStack

        public CollisionCheckStack()
    • Method Detail

      • setUseIdentity

        public void setUseIdentity​(boolean useIdentity)
        Set to false to use Object.equals(Object) to detect cycles. This method can be only used when the stack is empty.
      • getUseIdentity

        public boolean getUseIdentity()
      • getLatestPushResult

        public boolean getLatestPushResult()
      • push

        public boolean push​(E o)
        Pushes a new object to the stack.
        Returns:
        true if this object has already been pushed
      • pushNocheck

        public void pushNocheck​(E o)
        Pushes a new object to the stack without making it participate with the collision check.
      • findDuplicate

        public boolean findDuplicate​(E o)
      • pop

        public E pop()
        Pops an object from the stack
      • peek

        public E peek()
        Returns the top of the stack.
      • reset

        public void reset()
        Clears all the contents in the stack.
      • getCycleString

        public String getCycleString()
        String that represents the cycle.