Packages

Definition Classes: root

This is the root package for the Openstrat project.

This is the root package for the Openstrat project. The top of this package contains, 32 bit Int based Colours, the Multiple type class, a show and persistence library using RCON (Name may change), Rich Compact Object Notation, array based compound value collections of same length elements, an Either based errors framework and general utilities.

Definition Classes: root

package gOne

This is the package for an extremely simple simultaneous turn game.

Definition Classes: ostrat

package gTwo

Definition Classes: ostrat

package geom

I chose the package name to not clash with "geometry" that may be use in other libraries This package contains Basic geometry.

I chose the package name to not clash with "geometry" that may be use in other libraries This package contains Basic geometry. A number of implementation Value classes of the Int and Double product classes defined in ostrat. 2d graphical objects for generalised use. They are of particular use for the generic canvas based classes defined in pCanv but can be used in any display framework and for printing.

Definition Classes: ostrat

package p1783

This p1783 package is the beginnings of a grand strategy development game starting in 1783.

Definition Classes: ostrat

package p305

This is the beginnings of a grand strategy game starting in BC305 covering Europe, North Africa and West Asia.

Definition Classes: ostrat

package pCanv

The package attempts to encapsulate the various abstract canvas traits while the actual objects that populate a canvas go in package geom.

Definition Classes: ostrat

package pCard

This is ancient code.

This is ancient code. Not use how much is worth salvaging

Definition Classes: ostrat

package pChess

This is a package for Chess and Draughts (also known as Checkers).

This is a package for Chess and Draughts (also known as Checkers). It has been included in the main Strat library, as useful to have code. Because they are finished games, with established rules and iconography. As opposed to applications like GOne, GTwo etc, which are super simple games merely created for the teaching of the use use of the ostrat libraries. And also as opposed to the games in the Dev module which are intended to be developed into interesting games which may at some point have their own individual repositories.

Definition Classes: ostrat

package pCiv

A civilisational development game.

Definition Classes: ostrat

package pCloseOrder

Definition Classes: ostrat

package pDev

Definition Classes: ostrat

package pDraughts

Definition Classes: ostrat

package pDung

Definition Classes: ostrat

package pEarth

Definition Classes: ostrat

package pFlags

Definition Classes: ostrat

package pFx

This package is for JavaFx code.

Definition Classes: ostrat

package pGrid

This package works with hexagonal and Square tile grids.

This package works with hexagonal and Square tile grids. The tile objects themselves will not in the general case the contain grid coordinates, although it may be necessary to include this data for complex Tile values interacting with their wider environment. Its fundamental components are the grid data itself. This is just a linear array of tile data. Compile-time typed grid data. So for example a chess board can be represented by a 64 element Arr, its context determines that it is to be interpreted as an 8 by 8 square grid. Grid descriptions that describe the grid representation in the Array and GridFunctions which implement Cood to T. The grid and grid-gui hierarchies currently contain a mix of new and old systems.

The package name pGrid was chosen to allow you to use the name "grid" in your code.

Definition Classes: ostrat

package pHtmlFac

Definition Classes: ostrat

package pParse

This is the RSON package.

This is the RSON package. Readable Succinct Object Notation. It could be just as accurately be described as Readable Succinct Data Notation, but that wouldn't scan as well and indicate it as a better replacement for JSON. RSON uses the standard semicolon separated statements combined with multilevel bracket hierarchy syntax familiar from C, C++, Java and JavaScript. Its main innovations over JSON and XML are allowing statements to be partitioned into comma delineated clauses, the empty statement, the empty clause and type inference. It uses a context free operator precedence hierarchy, with the exception of allowing the 4 ( - + ~ !) operator to be used as prefix operators. Beyond this it generally follows Scala syntax where this doesn't conflict with the preceding rules. Unlike Scala statements must finish with a semicolon unless it is the last statement of a file or a bracket block. Allowing statements to end with a newline introduces horrendous ambiguities unless one is willing to go completely down the significant whitespace route and I'm not sure if that could work even work for such a general purpose basic syntax.

The above allows it to combine a high level of human readability, succinctness, non-programmer / non-expert write-ability, programmer flexibility and composability and fast-parsing. The initial motivating use case was strategy games, which require huge amounts of modable date files. XML and JSON, the current defaults are simply not fit for purpose. RSON aims to break down the walls between game player, game modder, professional game artist, professional game scripter, professional imperative programming wizards in languages such as C / C++ and Rust and professional functional programming wizards in languages such as Scala, Haskell and Idris.

Definition Classes: ostrat

package pReactor

Definition Classes: ostrat

package pSpace

Definition Classes: ostrat

package pStrat

Package for miscellaneous game utilities and data.

Definition Classes: ostrat

package pWW2

This pSimp is the beginnings of a WWII grand strategy game.

Definition Classes: ostrat

package pWeb

This package for the manipulation of Html, XML CSS and Javascript.

This package for the manipulation of Html, XML CSS and Javascript. Some of the functionality could be replaced by Scalatags. As it currently stands the code and design quality of this package is not up to standard, but due to many other higher priorities, I have not been able to take the next step, which is to 1 improve and document it, rewrite it from scratch or 3 replace it with a Scala-tags dependency or some other library.

Definition Classes: ostrat

package pZug

Definition Classes: ostrat

package strat

Definition Classes: ostrat

Arr

ArrayBufferDoubleExtensions

Bad

IterableAnyRefImplicit

LetterOrUnderscoreChar

Opt

ProductLongsCompanion

Show2erTypeExtensions

ShowInstancesPriority2

StringIterableExtensions

IntBuff

final class IntBuff extends AnyVal with ArrayLike[Int]

Linear Supertypes

ArrayLike[Int], ArrayLikeBase[Int @scala.annotation.unchecked.uncheckedVariance], AnyVal, Any

Ordering

Alphabetic
By Inheritance

Inherited

IntBuff
ArrayLike
ArrayLikeBase
AnyVal
Any

Hide All
Show All

Visibility

Public
Protected

Instance Constructors

new IntBuff(unsafeBuff: ArrayBuffer[Int])

Type Members

abstract type ThisT <: ArrayLike[Int]
Definition Classes
ArrayLike

Value Members

final def !=(arg0: Any): Boolean
Definition Classes
Any
final def ##: Int
Definition Classes
Any
final def ==(arg0: Any): Boolean
Definition Classes
Any
def apply(index: Int): Int
Definition Classes
IntBuff → ArrayLike
final def asInstanceOf[T0]: T0
Definition Classes
Any
def collect[B, BB <: ArrBase[B]](pf: PartialFunction[Int, B])(implicit ev: ArrBuild[B, BB]): BB
Collects values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.
Collects values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.
Definition Classes
ArrayLike
def collectList[B](pf: PartialFunction[Int, B]): List[B]
Collects a List values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.
Collects a List values of B by applying partial function to only those elements of A, for which the PartialFunction is defined.
Definition Classes
ArrayLike
def contains[A1 >: Int](elem: A1): Boolean
Definition Classes
ArrayLike
def eMap[B, BB <: ArrBase[B]](f: (Int) => EMon[B])(implicit ev: ArrBuild[B, BB]): EMon[BB]
Definition Classes
ArrayLike
def eMapList[B](f: (Int) => EMon[B]): EMon[List[B]]
Definition Classes
ArrayLike
def empty: Boolean
Definition Classes
ArrayLike
Annotations
@inline()
def existsCount(f: (Int) => Boolean): Int
Counts the number of elements that fulfil the condition A => Boolean
Counts the number of elements that fulfil the condition A => Boolean
Definition Classes
ArrayLike
def fHeadElse[B](noHead: => B)(ifHead: (Int) => B): B
Definition Classes
ArrayLike
def fMax[B](f: (Int) => B)(implicit cmp: Ordering[B]): B
Definition Classes
ArrayLike
def fMin[B](f: (Int) => B)(implicit cmp: Ordering[B]): B
Definition Classes
ArrayLike
def filter[AA <: ArrBase[Int]](f: (Int) => Boolean)(implicit ev: ArrBuild[Int, AA]): AA
Definition Classes
ArrayLike
def filterNot[AA <: ArrBase[Int]](f: (Int) => Boolean)(implicit ev: ArrBuild[Int, AA]): AA
Definition Classes
ArrayLike
def filterToList(f: (Int) => Boolean): List[Int]
Definition Classes
ArrayLike
def flatMap[BB <: ArrBase[_]](f: (Int) => BB)(implicit ev: ArrFlatBuild[BB]): BB
Specialised flatMap to an immutable Arr.
Specialised flatMap to an immutable Arr.
Definition Classes
ArrayLike
def foldHeadTail[B](initial: B)(fHead: (B, Int) => B)(fTail: (B, Int) => B): B
Definition Classes
ArrayLike
def foldLeft[B](initial: B)(f: (B, Int) => B): B
Definition Classes
ArrayLike
def foldTailLeft[B](initial: B)(f: (B, Int) => B): B
Definition Classes
ArrayLike
def forAll(p: (Int) => Boolean): Boolean
Definition Classes
ArrayLike
def foreach[U](f: (Int) => U): Unit
Performs the effectful function on each member of the collection.
Performs the effectful function on each member of the collection.
Definition Classes
ArrayLike → ArrayLikeBase
def foreachInit[U](f: (Int) => U): Unit
Definition Classes
ArrayLike
def foreachReverse[U](f: (Int) => U): Unit
Consider changing this name, as might not be appropriate to all sub classes.
Consider changing this name, as might not be appropriate to all sub classes.
Definition Classes
ArrayLike
def foreachTail[U](f: (Int) => U): Unit
Definition Classes
ArrayLike
def getClass(): Class[_ <: AnyVal]
Definition Classes
AnyVal → Any
def head: Int
Definition Classes
ArrayLike
Annotations
@inline()
def headToStringElse(ifEmptyString: String): String
Definition Classes
ArrayLike
def iFlatMap[BB <: ArrBase[_]](iInit: Int = 0)(f: (Int, Int) => BB)(implicit build: ArrFlatBuild[BB]): BB
Specialised flatMap with index to an immutable Arr.
Specialised flatMap with index to an immutable Arr.
Definition Classes
ArrayLike
def iFlatMap[BB <: ArrBase[_]](f: (Int, Int) => BB)(implicit build: ArrFlatBuild[BB]): BB
Specialised flatMap with index to an immutable Arr.
Specialised flatMap with index to an immutable Arr.
Definition Classes
ArrayLike
def iForAll(p: (Int, Int) => Boolean): Boolean
Definition Classes
ArrayLike
def iForeach[U](f: (Int, Int) => U, startIndex: Int = 0): Unit
foreach with index.
foreach with index. The startIndex parameter is placed 2nd to allow it to have a default value of zero.
Definition Classes
ArrayLike
def iForeachReverse[U](f: (Int, Int) => U): Unit
Definition Classes
ArrayLike
def iMap[B, BB <: ArrBase[B]](f: (Int, Int) => B)(implicit ev: ArrBuild[B, BB]): BB
Specialised map with index to an immutable ArrBase of B.
Specialised map with index to an immutable ArrBase of B. This method should be overridden in sub classes.
Definition Classes
ArrayLike
def ifEmpty[B](vEmpty: => B, vNonEmpty: => B): B
Definition Classes
ArrayLike
def indexOf(elem: Int): Int
Definition Classes
ArrayLike
def indexWhere(f: (Int) => Boolean): Int
Return the index of the first element where predicate is true, or -1 if predicate not true forall.
Return the index of the first element where predicate is true, or -1 if predicate not true forall.
Definition Classes
ArrayLike
final def isInstanceOf[T0]: Boolean
Definition Classes
Any
def iterFlatMap[B, BB <: ArrBase[B]](f: (Int) => Iterable[B])(implicit ev: ArrBuild[B, BB]): BB
FlatMaps over a function from A to any Iterable.
FlatMaps over a function from A to any Iterable.
Definition Classes
ArrayLike
def last: Int
Definition Classes
ArrayLike
Annotations
@inline()
def lenStr: String
Just a handy short cut to give the length of this collection as a string.
Just a handy short cut to give the length of this collection as a string.
Definition Classes
ArrayLikeBase
def length: Int
The number of elements in the collection.
The number of elements in the collection. These collections use underlying mutable Arrays and ArrayBuffers. The length of the underlying Array maybe longer by a multiple of this number.
Definition Classes
IntBuff → ArrayLikeBase
def map[B, BB <: ArrBase[B]](f: (Int) => B)(implicit ev: ArrBuild[B, BB]): BB
Specialised map to an immutable ArrBase of B.
Specialised map to an immutable ArrBase of B.
Definition Classes
ArrayLike
def map2To1[B, BB <: ArrBase[B]](f: (Int, Int) => B)(implicit ev: ArrBuild[B, BB]): BB
map 2 elements of A to 1 element of B.
map 2 elements of A to 1 element of B. Ignores the last element on a collection of odd numbered length.
Definition Classes
ArrayLike
def mapCollectGoods[B, BB <: ArrBase[B]](f: (Int) => EMon[B])(implicit ev: ArrBuild[B, BB]): BB
maps from A to EMon[B], collects the good values.
maps from A to EMon[B], collects the good values.
Definition Classes
ArrayLike
def mapList[B <: AnyRef](f: (Int) => B): List[B]
maps ValueProduct collection to List
maps ValueProduct collection to List
Definition Classes
ArrayLike
def mapWithAcc[B, BB <: ArrBase[B], C](initC: C)(f: (Int, C) => (B, C))(implicit ev: ArrBuild[B, BB]): BB
Definition Classes
ArrayLike
def max[B >: Int](implicit ord: Ordering[B]): Int
Definition Classes
ArrayLike
def min[B >: Int](implicit ord: Ordering[B]): Int
Definition Classes
ArrayLike
def mkString(seperator: String): String
Not sure about this method.
Not sure about this method.
Definition Classes
ArrayLike
def nonEmpty: Boolean
Definition Classes
ArrayLike
Annotations
@inline()
def returnThis: ThisT
Definition Classes
ArrayLike
def sumBy(f: (Int) => Int): Int
Definition Classes
ArrayLike
def toList: List[Int]
Definition Classes
ArrayLike
def toString(): String
Definition Classes
Any
def toStrsCommaFold(fToStr: (Int) => String = _.toString): String
Definition Classes
ArrayLike
def toStrsCommaNoSpaceFold(fToStr: (Int) => String = _.toString): String
Definition Classes
ArrayLike
def toStrsCommaParenth(fToStr: (Int) => String = _.toString): String
Definition Classes
ArrayLike
def toStrsFold(seperator: String = "", f: (Int) => String = _.toString): String
Definition Classes
ArrayLike
def toStrsSemiFold(fToStr: (Int) => String = _.toString): String
Definition Classes
ArrayLike
def toStrsSemiParenth(fToStr: (Int) => String = _.toString): String
Definition Classes
ArrayLike
val unsafeBuff: ArrayBuffer[Int]

Packages

IntBuff

final class IntBuff extends AnyVal with ArrayLike[Int]

Instance Constructors

Type Members

Value Members

Inherited from ArrayLike[Int]

Inherited from ArrayLikeBase[Int @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyVal

Inherited from Any

Ungrouped

Packages

IntBuff

final class IntBuff extends AnyVal with ArrayLike[Int]

Instance Constructors

Type Members

Value Members

Inherited from ArrayLike[Int]

Inherited from ArrayLikeBase[Int @scala.annotation.unchecked.uncheckedVariance]

Inherited from AnyVal

Inherited from Any

Ungrouped

IntBuff