Package

axle

Permalink

package axle

Linear Supertypes
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. axle
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Value Members

  1. def ackermann(m: Long, n: Long): Long

    Permalink
  2. def applyForever[N](f: (N) ⇒ N, x0: N): Iterator[N]

    Permalink
  3. def applyK[N](f: (N) ⇒ N, x0: N, k: Int): N

    Permalink
  4. def arcCosine[N](x: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]

    Permalink
  5. def arcSine[N](x: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]

    Permalink
  6. def arcTangent[N](x: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]

    Permalink
  7. def arcTangent2[N](x: N, y: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]

    Permalink
  8. package ast

    Permalink
  9. def cosine[N](a: UnittedQuantity[Angle, N])(implicit arg0: MultiplicativeMonoid[N], arg1: Eq[N], arg2: Trig[N], converter: AngleConverter[N]): N

    Permalink
  10. def distanceOnSphere[N](angle: UnittedQuantity[Angle, N], sphereRadius: UnittedQuantity[Distance, N])(implicit arg0: MultiplicativeMonoid[N], angleConverter: AngleConverter[N], ctn: ConvertableTo[N], angleModule: Module[UnittedQuantity[Angle, N], N], distanceModule: Module[UnittedQuantity[Distance, N], N]): UnittedQuantity[Distance, N]

    Permalink
  11. def dropOutput(s: String): Unit

    Permalink
  12. implicit def enrichArray[T](arr: Array[T])(implicit arg0: Manifest[T]): EnrichedArray[T]

    Permalink
  13. implicit def enrichByteArray(barr: Array[Byte]): EnrichedByteArray

    Permalink
  14. implicit def enrichGenSeq[T](genSeq: GenSeq[T]): EnrichedGenSeq[T]

    Permalink
  15. implicit def enrichGenTraversable[T](gt: GenTraversable[T])(implicit arg0: Manifest[T]): EnrichedGenTraversable[T]

    Permalink
  16. implicit def enrichIndexedSeq[T](is: IndexedSeq[T])(implicit arg0: Manifest[T]): EnrichedIndexedSeq[T]

    Permalink
  17. implicit def enrichInt(n: Int): EnrichedInt

    Permalink
  18. implicit def enrichIterator[T](it: Iterator[T]): EnrichedIterator[T]

    Permalink
  19. implicit def enrichMutableBuffer[T](buffer: Buffer[T]): EnrichedMutableBuffer[T]

    Permalink
  20. implicit val eqSymbol: Eq[Symbol]

    Permalink
  21. def exponentiateByRecursiveSquaring[B, N](base: B, pow: N)(implicit multB: MultiplicativeSemigroup[B], eucRingN: EuclideanRing[N], eqN: Eq[N]): B

    Permalink
  22. def fibonacciByFold(n: Int): Int

    Permalink
  23. def fibonacciRecursively(n: Int): Int

    Permalink
  24. def gaps[T](xs: Seq[T])(implicit ringT: Ring[T]): Seq[(T, T)]

    Permalink
  25. def getLine(): String

    Permalink
  26. def html[T](t: T)(implicit arg0: HtmlFrom[T]): Node

    Permalink
  27. def id[A](x: A): A

    Permalink
  28. def inMandelbrotSet[N](radius: N, R: N, I: N, maxIt: Int)(implicit rng: Rng[N], o: Order[N]): Boolean

    Permalink
  29. def inMandelbrotSetAt[N](radius: N, R: N, I: N, maxIt: Int)(implicit rng: Rng[N], o: Order[N]): Option[Int]

    Permalink
  30. def intersperse[T](d: T)(l: List[T]): List[T]

    Permalink
  31. def logisticMap[N](λ: N)(implicit arg0: Ring[N]): (N) ⇒ N

    Permalink
  32. def mandelbrotContinue[N](radius: N)(implicit rng: Rng[N], o: Order[N]): ((N, N)) ⇒ Boolean

    Permalink
  33. def mandelbrotNext[N](R: N, I: N)(implicit rng: Rng[N]): ((N, N)) ⇒ (N, N)

    Permalink
  34. def monteCarloPiEstimate[F, N, V, G](trials: F, n2v: (N) ⇒ V)(implicit arg0: ConvertableTo[V], finite: Finite[F, N], functor: Functor[F, N, V, G], agg: Aggregatable[G, V, V], field: Field[V]): V

    Permalink
  35. def orbit[N](f: (N) ⇒ N, x0: N, close: (N) ⇒ (N) ⇒ Boolean): List[N]

    Permalink
  36. implicit val orderSymbol: Order[Symbol]

    Permalink
  37. def prefixedDisplay(prefix: String)(display: (String) ⇒ Unit): (String) ⇒ Unit

    Permalink
  38. def print[T](t: T)(implicit arg0: Show[T]): Unit

    Permalink
  39. def replicate[T](n: Int)(v: T): List[T]

    Permalink
  40. def reverse[T](l: List[T]): List[T]

    Permalink
  41. def runs[T](xs: Seq[T])(implicit ringT: Ring[T], orderT: Order[T]): Seq[(T, T)]

    Permalink
  42. def runs[T](xs: Seq[T], breaks: Set[T]): Seq[(T, T)]

    Permalink
  43. def show[T](t: T)(implicit arg0: Show[T]): String

    Permalink
  44. implicit val showBD: Show[BigDecimal]

    Permalink
  45. def showDoubleWithPrecision(p: Int): Show[Double]

    Permalink
  46. implicit val showNode: Show[Node]

    Permalink
  47. implicit val showRational: Show[Rational]

    Permalink
  48. def sine[N](a: UnittedQuantity[Angle, N])(implicit arg0: MultiplicativeMonoid[N], arg1: Eq[N], arg2: Trig[N], converter: AngleConverter[N]): N

    Permalink
  49. def square[N](x: N)(implicit arg0: Field[N]): N

    Permalink
  50. def string[T](t: T)(implicit arg0: Show[T]): String

    Permalink
  51. def tangent[N](a: UnittedQuantity[Angle, N])(implicit arg0: MultiplicativeMonoid[N], arg1: Eq[N], arg2: Trig[N], converter: AngleConverter[N]): N

    Permalink
  52. def trace[N](f: (N) ⇒ N, x0: N): Iterator[(N, Set[N])]

    Permalink
  53. def wallisΠ(iterations: Int): Rational

    Permalink
  54. val : forall.type

    Permalink
  55. val : thereexists.type

    Permalink
  56. def [N](x: N)(implicit arg0: NRoot[N]): N

    Permalink

Inherited from AnyRef

Inherited from Any

Ungrouped