final class MAC extends Solver with LazyLogging
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- MAC
- Solver
- LazyLogging
- Iterator
- TraversableOnce
- GenTraversableOnce
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Instance Constructors
- new MAC(prob: Problem, params: ParameterManager, heuristic: Heuristic)
Type Members
-
class
GroupedIterator[B >: A] extends AbstractIterator[Seq[B]] with Iterator[Seq[B]]
- Definition Classes
- Iterator
-
implicit
class
QuantityMath[T] extends AnyRef
- Definition Classes
- Solver
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
def
++[B >: Map[Variable, Any]](that: ⇒ GenTraversableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
-
def
/:[B](z: B)(op: (B, Map[Variable, Any]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
:\[B](z: B)(op: (Map[Variable, Any], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def addConstraint[A <: Constraint](c: A): A
-
def
addString(b: StringBuilder): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, sep: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
- Definition Classes
- TraversableOnce
-
def
aggregate[B](z: ⇒ B)(seqop: (B, Map[Variable, Any]) ⇒ B, combop: (B, B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
buffered: BufferedIterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
def
collect[B](pf: PartialFunction[Map[Variable, Any], B]): Iterator[B]
- Definition Classes
- Iterator
- Annotations
- @migration
- Migration
(Changed in version 2.8.0)
collect
has changed. The previous behavior can be reproduced withtoSeq
.
-
def
collectFirst[B](pf: PartialFunction[Map[Variable, Any], B]): Option[B]
- Definition Classes
- TraversableOnce
-
def
contains(elem: Any): Boolean
- Definition Classes
- Iterator
-
def
copyToArray[B >: Map[Variable, Any]](xs: Array[B], start: Int, len: Int): Unit
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Map[Variable, Any]](xs: Array[B]): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToArray[B >: Map[Variable, Any]](xs: Array[B], start: Int): Unit
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
copyToBuffer[B >: Map[Variable, Any]](dest: Buffer[B]): Unit
- Definition Classes
- TraversableOnce
-
def
corresponds[B](that: GenTraversableOnce[B])(p: (Map[Variable, Any], B) ⇒ Boolean): Boolean
- Definition Classes
- Iterator
-
def
count(p: (Map[Variable, Any]) ⇒ Boolean): Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
- var currentBTLeft: Option[Int]
- var currentStack: Stack
-
def
drop(n: Int): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
dropWhile(p: (Map[Variable, Any]) ⇒ Boolean): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
duplicate: (Iterator[Map[Variable, Any]], Iterator[Map[Variable, Any]])
- Definition Classes
- Iterator
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
exists(p: (Map[Variable, Any]) ⇒ Boolean): Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
extractSolution(state: ProblemState): Map[Variable, Any]
- Attributes
- protected
- Definition Classes
- Solver
-
def
filter(p: (Map[Variable, Any]) ⇒ Boolean): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
- val filter: Filter
- val filterClass: Class[_ <: Filter]
-
def
filterNot(p: (Map[Variable, Any]) ⇒ Boolean): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
find(p: (Map[Variable, Any]) ⇒ Boolean): Option[Map[Variable, Any]]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
flatMap[B](f: (Map[Variable, Any]) ⇒ GenTraversableOnce[B]): Iterator[B]
- Definition Classes
- Iterator
-
def
fold[A1 >: Map[Variable, Any]](z: A1)(op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldLeft[B](z: B)(op: (B, Map[Variable, Any]) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
foldRight[B](z: B)(op: (Map[Variable, Any], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
forall(p: (Map[Variable, Any]) ⇒ Boolean): Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
foreach[U](f: (Map[Variable, Any]) ⇒ U): Unit
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
-
def
grouped[B >: Map[Variable, Any]](size: Int): GroupedIterator[B]
- Definition Classes
- Iterator
-
def
hasDefiniteSize: Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
hasNext: Boolean
- Definition Classes
- Solver → Iterator
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- val heuristic: Heuristic
-
def
indexOf[B >: Map[Variable, Any]](elem: B, from: Int): Int
- Definition Classes
- Iterator
-
def
indexOf[B >: Map[Variable, Any]](elem: B): Int
- Definition Classes
- Iterator
-
def
indexWhere(p: (Map[Variable, Any]) ⇒ Boolean, from: Int): Int
- Definition Classes
- Iterator
-
def
indexWhere(p: (Map[Variable, Any]) ⇒ Boolean): Int
- Definition Classes
- Iterator
- def init(ps: ProblemState): Outcome
-
def
integerIterator: Iterator[Map[Variable, Integer]]
- Definition Classes
- Solver
-
def
isEmpty: Boolean
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isTraversableAgain: Boolean
- Definition Classes
- Iterator → GenTraversableOnce
-
def
javaCollection: List[Map[Variable, Integer]]
- Definition Classes
- Solver
-
def
javaIterator: Iterator[Map[Variable, Integer]]
- Definition Classes
- Solver
- def learnNoGoods(history: List[Seq[Decision]], stack: List[Outcome]): Unit
-
def
length: Int
- Definition Classes
- Iterator
-
lazy val
logger: Logger
- Attributes
- protected
- Definition Classes
- LazyLogging
-
def
mac(modified: Seq[(Variable, Event)], stack: Stack, maxBacktracks: Option[Int], nbAssignments: Int): (SolverResult, Stack, Option[Int], Int)
- Annotations
- @tailrec()
-
def
map[B](f: (Map[Variable, Any]) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
max[B >: Map[Variable, Any]](implicit cmp: Ordering[B]): Map[Variable, Any]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
maxBy[B](f: (Map[Variable, Any]) ⇒ B)(implicit cmp: Ordering[B]): Map[Variable, Any]
- Definition Classes
- TraversableOnce → GenTraversableOnce
- val measureMem: Boolean
-
def
min[B >: Map[Variable, Any]](implicit cmp: Ordering[B]): Map[Variable, Any]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
minBy[B](f: (Map[Variable, Any]) ⇒ B)(implicit cmp: Ordering[B]): Map[Variable, Any]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString: String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(sep: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
mkString(start: String, sep: String, end: String): String
- Definition Classes
- TraversableOnce → GenTraversableOnce
- var nbAssignments: Int
-
val
nbConstraints: Int
- Definition Classes
- Solver
- var nbRuns: Int
-
var
nbSolutions: Int
- Definition Classes
- Solver
-
val
nbVariables: Int
- Definition Classes
- Solver
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
next(): Map[Variable, Any]
- Definition Classes
- Solver → Iterator
-
def
nextJava(): Map[Variable, Integer]
- Definition Classes
- Solver
- def nextSolution(): SolverResult
-
def
nextSolution(modified: Seq[(Variable, Event)], stack: Stack, maxBacktracks: Option[Int]): (SolverResult, Stack, Option[Int])
- Annotations
- @tailrec()
-
def
nonEmpty: Boolean
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
-
def
obtainOptimConstraint[A <: Constraint](f: ⇒ A): A
- Definition Classes
- Solver
- def oneRun(modified: Seq[(Variable, Event)], stack: Stack, maxBacktracks: Option[Int]): (SolverResult, Stack, Option[Int])
-
var
optimConstraint: Option[Constraint]
- Definition Classes
- Solver
-
def
optimises: Option[Variable]
- Definition Classes
- Solver
-
def
padTo[A1 >: Map[Variable, Any]](len: Int, elem: A1): Iterator[A1]
- Definition Classes
- Iterator
-
val
params: ParameterManager
- Definition Classes
- Solver
-
def
partition(p: (Map[Variable, Any]) ⇒ Boolean): (Iterator[Map[Variable, Any]], Iterator[Map[Variable, Any]])
- Definition Classes
- Iterator
-
def
patch[B >: Map[Variable, Any]](from: Int, patchElems: Iterator[B], replaced: Int): Iterator[B]
- Definition Classes
- Iterator
-
var
preproCpu: Quantity[Double]
- Definition Classes
- Solver
-
var
preproRemoved: Long
- Definition Classes
- Solver
-
final
def
preprocess(filter: Filter, state: ProblemState): Outcome
- Definition Classes
- Solver
-
val
preprocessorClass: Option[Class[_ <: Filter]]
- Definition Classes
- Solver
-
val
problem: Problem
- Definition Classes
- Solver
-
def
product[B >: Map[Variable, Any]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduce[A1 >: Map[Variable, Any]](op: (A1, A1) ⇒ A1): A1
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceLeft[B >: Map[Variable, Any]](op: (B, Map[Variable, Any]) ⇒ B): B
- Definition Classes
- TraversableOnce
-
def
reduceLeftOption[B >: Map[Variable, Any]](op: (B, Map[Variable, Any]) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceOption[A1 >: Map[Variable, Any]](op: (A1, A1) ⇒ A1): Option[A1]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRight[B >: Map[Variable, Any]](op: (Map[Variable, Any], B) ⇒ B): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
reduceRightOption[B >: Map[Variable, Any]](op: (Map[Variable, Any], B) ⇒ B): Option[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
- def reset(): Unit
- var restartStrategy: RestartStrategy
-
def
reversed: List[Map[Variable, Any]]
- Attributes
- protected[this]
- Definition Classes
- TraversableOnce
- val rsClass: Class[_ <: RestartStrategy]
-
var
running: Boolean
- Definition Classes
- Solver
-
def
sameElements(that: Iterator[_]): Boolean
- Definition Classes
- Iterator
-
def
scanLeft[B](z: B)(op: (B, Map[Variable, Any]) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
-
def
scanRight[B](z: B)(op: (Map[Variable, Any], B) ⇒ B): Iterator[B]
- Definition Classes
- Iterator
- var searchCpu: Quantity[Double]
- val searchMeasurer: MeasureBuilder[Unit, Double]
-
def
seq: Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
size: Int
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
sizeHintIfCheap: Int
- Attributes
- protected[scala.collection]
- Definition Classes
- GenTraversableOnce
-
def
slice(from: Int, until: Int): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
sliceIterator(from: Int, until: Int): Iterator[Map[Variable, Any]]
- Attributes
- protected
- Definition Classes
- Iterator
-
def
sliding[B >: Map[Variable, Any]](size: Int, step: Int): GroupedIterator[B]
- Definition Classes
- Iterator
-
def
span(p: (Map[Variable, Any]) ⇒ Boolean): (Iterator[Map[Variable, Any]], Iterator[Map[Variable, Any]])
- Definition Classes
- Iterator
-
val
statistics: StatisticsManager
- Definition Classes
- Solver
-
def
sum[B >: Map[Variable, Any]](implicit num: Numeric[B]): B
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
take(n: Int): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
takeWhile(p: (Map[Variable, Any]) ⇒ Boolean): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Map[Variable, Any], Col[Map[Variable, Any]]]): Col[Map[Variable, Any]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toArray[B >: Map[Variable, Any]](implicit arg0: ClassTag[B]): Array[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toBuffer[B >: Map[Variable, Any]]: Buffer[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIndexedSeq: IndexedSeq[Map[Variable, Any]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterable: Iterable[Map[Variable, Any]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toIterator: Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator → GenTraversableOnce
-
def
toList: List[Map[Variable, Any]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toMap[T, U](implicit ev: <:<[Map[Variable, Any], (T, U)]): Map[T, U]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSeq: Seq[Map[Variable, Any]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toSet[B >: Map[Variable, Any]]: Set[B]
- Definition Classes
- TraversableOnce → GenTraversableOnce
-
def
toStream: Stream[Map[Variable, Any]]
- Definition Classes
- Iterator → GenTraversableOnce
-
def
toString(): String
- Definition Classes
- MAC → Iterator → AnyRef → Any
-
def
toTraversable: Traversable[Map[Variable, Any]]
- Definition Classes
- Iterator → TraversableOnce → GenTraversableOnce
-
def
toVector: Vector[Map[Variable, Any]]
- Definition Classes
- TraversableOnce → GenTraversableOnce
- var usedMem: Long
-
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
- @native() @throws( ... )
-
def
withFilter(p: (Map[Variable, Any]) ⇒ Boolean): Iterator[Map[Variable, Any]]
- Definition Classes
- Iterator
-
def
zip[B](that: Iterator[B]): Iterator[(Map[Variable, Any], B)]
- Definition Classes
- Iterator
-
def
zipAll[B, A1 >: Map[Variable, Any], B1 >: B](that: Iterator[B], thisElem: A1, thatElem: B1): Iterator[(A1, B1)]
- Definition Classes
- Iterator
-
def
zipWithIndex: Iterator[(Map[Variable, Any], Int)]
- Definition Classes
- Iterator