Class

FixedIntStack

Related Doc: package common

Permalink

class FixedIntStack extends AnyRef

Implements a stack of Int of fixed maximum size.

This is an efficient data structure for representing the trail in a SAT solver. Though it can be used to represent a stack of Int with a fixed maximum size.

Exceptions thrown: IllegalArgumentException if maxSize < 0

Linear Supertypes

AnyRef, Any

Ordering

Alphabetic
By inheritance

Inherited

FixedIntStack
AnyRef
Any

Hide All
Show all

Visibility

Public
All

Instance Constructors

new FixedIntStack(maxSize: Int)

Initializes an empty stack with space to grow up to maxSize
Initializes an empty stack with space to grow up to maxSize
maxSize
the maximum size the stack can grow. Should be positive

Exceptions thrown
IllegalArgumentException if maxSize < 0

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(i: Int): Int

Provides unchecked access to an element in the stack.
Provides unchecked access to an element in the stack.
The access is unchecked in the sense that we do not make sure the element is not outside the current range of the stack, and could return a random value if it is bigger than this.size but smaller than maxSize.
i
the index of the element in the stack, starting at 0
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def contains(el: Int): Boolean
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def get(i: Int): Int

Provides checked access to an element in the stack.
Provides checked access to an element in the stack.
Will throw an exception if the element is outside the actual content of the stack.
i
the index of the element in the stack, starting at 0
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def isEmpty: Boolean
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def pop(): Int
def push(el: Int): Unit
def size: Int
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def top: Int
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped