Package

ap

util

Permalink

package util

Visibility
  1. Public
  2. All

Type Members

  1. abstract class APTestCase extends AnyRef

    Permalink
  2. class CountIt extends Iterator[Int]

    Permalink

    Simple iterator that enumerates the natural numbers, starting with 0

  3. class Dijkstra[Node] extends AnyRef

    Permalink

    An implementation of Dijkstra's algorithm for computing shortest paths to all reachable nodes in a graph.

  4. class FastImmutableMap[A, B] extends Map[A, B]

    Permalink

    A double-backed map class that initially stores its elements in a scala.collection.immutable.Map, but copies all data to a scala.collection.mutable.HashMap when many accesses are taking place (since the mutable map enables faster access than the immutable map).

    A double-backed map class that initially stores its elements in a scala.collection.immutable.Map, but copies all data to a scala.collection.mutable.HashMap when many accesses are taking place (since the mutable map enables faster access than the immutable map).

  5. class FilterIt[T] extends Iterator[T]

    Permalink

    An own class for filtering the elements that are returned by an iterator, because the method Iterator.filter is so broken

    An own class for filtering the elements that are returned by an iterator, because the method Iterator.filter is so broken

  6. abstract class IdealRange extends Seq[IdealInt]

    Permalink

    Extremely simple class for iterating over intervals of integers

    Extremely simple class for iterating over intervals of integers

    TODO: this should be removed

  7. class IntervalIdealRange extends IdealRange

    Permalink
    Attributes
    protected
  8. class IntervalPlainRange extends PlainRange

    Permalink
    Attributes
    protected
  9. class LRUCache[K, V] extends AnyRef

    Permalink

    Naive implementation of a thread-safe LRU cache.

  10. class LazyIndexedSeqConcat[A] extends IndexedSeq[A]

    Permalink
  11. class LazyIndexedSeqSlice[A] extends IndexedSeq[A]

    Permalink
  12. class LazyMappedMap[A, B, C, D] extends Map[C, D]

    Permalink

    Transform a Map m by composing it with two functions into a map valueMapping . m . keyUnmapping.

    Transform a Map m by composing it with two functions into a map valueMapping . m . keyUnmapping. keyMapping has to be the inverse of keyUnmapping, and has to be injective

  13. class LazyMappedSet[A, B] extends Set[B]

    Permalink

    Transform a set by applying a given injective function to all of its arguments.

  14. class POGraph[A] extends AnyRef

    Permalink

    A class to explicitly represent partial orders.

    A class to explicitly represent partial orders. This is used in various contexts to speed up implication checks.

  15. trait PeekIterator[+T] extends Iterator[T]

    Permalink

    Extension of the iterator trait where the next element can be peeked without popping it

  16. class PeekIteratorTrafo[T] extends PeekIterator[T]

    Permalink
  17. abstract class PlainRange extends Seq[Int]

    Permalink

    Extremely simple class for iterating over intervals of integers

    Extremely simple class for iterating over intervals of integers

    TODO: this should be removed

  18. class PredicatedIdealRange extends IntervalIdealRange

    Permalink
    Attributes
    protected
  19. class PredicatedPlainRange extends IntervalPlainRange

    Permalink
    Attributes
    protected
  20. class PriorityQueueWithIterators[A] extends PeekIterator[A]

    Permalink

    Priority queue that can handle both single elements and pre-sorted sequences (iterators) of elements

  21. class Tarjan[Node] extends AnyRef

    Permalink

    An implementation of Tarjan's algorithm for computing the strongly connected components of a graph.

  22. case class Timeout(unfinishedResult: Any) extends Exception with Product with Serializable

    Permalink

    Object that is thrown in case of a timeout (or the user stopped the proof search)

  23. class UnionMap[A, B] extends Map[A, B]

    Permalink

    A (lazy) Map that represents the union of two Maps with disjoint key domains

    A (lazy) Map that represents the union of two Maps with disjoint key domains

  24. class UnionSet[A] extends Set[A]

    Permalink

    A (lazy) Set that represents the union of two (not necessarily disjoint) Sets

    A (lazy) Set that represents the union of two (not necessarily disjoint) Sets

Value Members

  1. object APTestCase

    Permalink
  2. object CmdlParser

    Permalink
  3. object Combinatorics

    Permalink
  4. object Debug

    Permalink

    A collect of methods for writing runtime assertions and inserting debugging information.

    A collect of methods for writing runtime assertions and inserting debugging information. In particular, here the different categories and types of assertions are defined and can be switched on and off.

  5. object Dijkstra

    Permalink
  6. object FastImmutableMap

    Permalink
  7. object FilterIt

    Permalink
  8. object IdealRange

    Permalink
  9. object LazyIndexedSeqConcat

    Permalink
  10. object LazyMappedMap

    Permalink
  11. object LazyMappedSet

    Permalink
  12. object Logic

    Permalink
  13. object POGraph

    Permalink
  14. object PeekIterator

    Permalink
  15. object PlainRange

    Permalink
  16. object RuntimeStatistics

    Permalink

    Object to keep track of some prover statistics, such as the number of problems loaded and the amount of time spent constructing proofs.

    Object to keep track of some prover statistics, such as the number of problems loaded and the amount of time spent constructing proofs. This class is only used from the ParallelFileProver.

  17. object Seqs

    Permalink
  18. object Tarjan

    Permalink
  19. object Timeout extends Serializable

    Permalink
  20. object Timer

    Permalink

    Object for measuring the time needed by the various tasks, methods, etc.

    Object for measuring the time needed by the various tasks, methods, etc. The object, in particular, supports nested operations that call each other and correctly measures the time spent in each of the operations.

    The current implementation of the timer is not thread-safe; if we detect that the class is used from multiple threads we disable time measurements altogether. Calls are still counted.

  21. object UnionMap

    Permalink
  22. object UnionSet

    Permalink

Ungrouped