final
class
RingDeque[A] extends AnyRef
Instance Constructors
-
new
RingDeque(_bound: Int)(implicit arg0: ClassTag[A])
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
val
bound: Int
-
def
clone(): AnyRef
-
def
empty(): Unit
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
-
final
def
isInstanceOf[T0]: Boolean
-
def
length: Int
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
popBack(): A
-
def
popFront(): A
-
def
pushBack(a: A): Unit
-
def
pushFront(a: A): Unit
-
def
removeBack(length: Int): Unit
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toList: List[A]
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Unchecked and unboxed (fast!) deque implementation with a fixed bound. None of the operations on this datastructure are checked for bounds. You are trusted to get this right on your own. If you do something weird, you could end up overwriting data, reading old results, etc. Don't do that.
No objects were allocated in the making of this film.