Instance Constructors
-
-
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
-
-
-
-
-
-
final
def
==(arg0: Any): Boolean
-
def
addString(b: StringBuilder): StringBuilder
-
def
addString(b: StringBuilder, sep: String): StringBuilder
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
aggregate[B](z: ⇒ B)(seqop: (B, UnidirectionalSpace[A]) ⇒ B, combop: (B, B) ⇒ B): B
-
-
-
def
applyOrElse[A1 <: Int, B1 >: UnidirectionalSpace[A]](x: A1, default: (A1) ⇒ B1): B1
-
final
def
asInstanceOf[T0]: T0
-
def
canEqual(that: Any): Boolean
-
def
clone(): AnyRef
-
-
-
-
-
-
-
def
containsSlice[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
-
-
-
-
-
-
def
endsWith[B](that: GenSeq[B]): Boolean
-
-
-
-
-
-
def
finalize(): Unit
-
-
-
-
def
fold[A1 >: UnidirectionalSpace[A]](z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft[B](z: B)(op: (B, UnidirectionalSpace[A]) ⇒ B): B
-
def
foldRight[B](z: B)(op: (UnidirectionalSpace[A], B) ⇒ B): B
-
-
-
-
final
def
getClass(): Class[_]
-
-
-
def
hasDefiniteSize: Boolean
-
def
hashCode(): Int
-
-
-
-
-
-
-
-
-
def
indices: Range
-
-
-
-
def
isDefinedAt(idx: Int): Boolean
-
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
isTraversableAgain: Boolean
-
-
-
-
-
-
-
-
-
-
def
length: Int
-
def
lengthCompare(len: Int): Int
-
-
-
-
-
-
-
def
mkString: String
-
def
mkString(sep: String): String
-
def
mkString(start: String, sep: String, end: String): String
-
-
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
-
-
-
-
-
-
-
def
product[B >: UnidirectionalSpace[A]](implicit num: Numeric[B]): B
-
def
reduce[A1 >: UnidirectionalSpace[A]](op: (A1, A1) ⇒ A1): A1
-
-
-
def
reduceOption[A1 >: UnidirectionalSpace[A]](op: (A1, A1) ⇒ A1): Option[A1]
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
def
size: Int
-
-
-
-
-
-
-
-
-
def
startsWith[B](that: GenSeq[B], offset: Int): Boolean
-
def
startsWith[B](that: GenSeq[B]): Boolean
-
def
stringPrefix: String
-
def
sum[B >: UnidirectionalSpace[A]](implicit num: Numeric[B]): B
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
-
-
-
-
-
-
-
def
toArray[B >: UnidirectionalSpace[A]](implicit arg0: ClassTag[B]): Array[B]
-
-
-
-
-
-
-
def
toMap[T, U](implicit ev: <:<[UnidirectionalSpace[A], (T, U)]): Map[T, U]
-
-
-
-
def
toString(): String
-
-
-
-
-
-
-
-
-
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
-
-
-
Inherited from HasNewBuilder[UnidirectionalSpace[A], scala.collection.immutable.LinearSeq[com.rayrobdod.boardGame.UnidirectionalSpace[A]] @scala.annotation.unchecked.uncheckedVariance]
Noticed that the UnaryMovement Spaces look like linked list nodes So, I made a linked list around the UnaryMovement Spaces.
I haven't grown out of my habit of making useless collections yet…
3.0.0 rename from UnaryMovementSpaceSeq to UnidirectionalSpaceSeq