axle
package
axle
Value Members
-
def
ackermann(m: Long, n: Long): Long
-
def
applyForever[N](f: (N) ⇒ N, x0: N): Iterator[N]
-
def
applyK[N](f: (N) ⇒ N, x0: N, k: Int): N
-
def
arcCosine[N](x: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]
-
def
arcSine[N](x: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]
-
def
arcTangent[N](x: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]
-
def
arcTangent2[N](x: N, y: N)(implicit arg0: Trig[N], converter: AngleConverter[N]): UnittedQuantity[Angle, N]
-
package
ast
-
def
cosine[N](a: UnittedQuantity[Angle, N])(implicit arg0: MultiplicativeMonoid[N], arg1: Eq[N], arg2: Trig[N], converter: AngleConverter[N]): N
-
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]
-
implicit
def
enrichArray[T](arr: Array[T])(implicit arg0: Manifest[T]): EnrichedArray[T]
-
implicit
def
enrichByteArray(barr: Array[Byte]): EnrichedByteArray
-
implicit
def
enrichGenSeq[T](genSeq: GenSeq[T]): EnrichedGenSeq[T]
-
implicit
def
enrichGenTraversable[T](gt: GenTraversable[T])(implicit arg0: Manifest[T]): EnrichedGenTraversable[T]
-
implicit
def
enrichIndexedSeq[T](is: IndexedSeq[T])(implicit arg0: Manifest[T]): EnrichedIndexedSeq[T]
-
implicit
def
enrichInt(n: Int): EnrichedInt
-
implicit
def
enrichIterator[T](it: Iterator[T]): EnrichedIterator[T]
-
implicit
def
enrichMutableBuffer[T](buffer: Buffer[T]): EnrichedMutableBuffer[T]
-
implicit
def
eqIndexedSeq[T](implicit arg0: Eq[T]): Eq[IndexedSeq[T]]
-
implicit
def
eqSeq[T](implicit arg0: Eq[T]): Eq[Seq[T]]
-
implicit
def
eqSet[S](implicit arg0: Eq[S]): Eq[Set[S]]
-
def
fib(n: Int): Int
-
def
getLine(): String
-
def
html[T](t: T)(implicit arg0: HtmlFrom[T]): Node
-
def
id[A](x: A): A
-
def
inMandelbrotSet[N](radius: N, R: N, I: N, maxIt: Int)(implicit rng: Rng[N], o: Order[N]): Boolean
-
def
inMandelbrotSetAt[N](radius: N, R: N, I: N, maxIt: Int)(implicit rng: Rng[N], o: Order[N]): Option[Int]
-
def
intersperse[T](d: T)(l: List[T]): List[T]
-
def
logisticMap[N](λ: N)(implicit arg0: Ring[N]): (N) ⇒ N
-
def
mandelbrotContinue[N](radius: N)(implicit rng: Rng[N], o: Order[N]): ((N, N)) ⇒ Boolean
-
def
mandelbrotNext[N](R: N, I: N)(implicit rng: Rng[N]): ((N, N)) ⇒ (N, N)
-
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
-
def
orbit[N](f: (N) ⇒ N, x0: N, close: (N) ⇒ (N) ⇒ Boolean): List[N]
-
implicit
val
orderBooleans: Order[Boolean]
-
implicit
val
orderChars: Order[Char]
-
implicit
val
orderDoubles: Order[Double]
-
implicit
val
orderStrings: Order[String]
-
implicit
val
orderSymbols: Order[Symbol]
-
def
recfib(n: Int): Int
-
def
replicate[T](n: Int)(v: T): List[T]
-
def
reverse[T](l: List[T]): List[T]
-
def
show[T](t: T)(implicit arg0: Show[T]): Unit
-
def
sine[N](a: UnittedQuantity[Angle, N])(implicit arg0: MultiplicativeMonoid[N], arg1: Eq[N], arg2: Trig[N], converter: AngleConverter[N]): N
-
def
square[N](x: N)(implicit arg0: Field[N]): N
-
def
string[T](t: T)(implicit arg0: Show[T]): String
-
def
tangent[N](a: UnittedQuantity[Angle, N])(implicit arg0: MultiplicativeMonoid[N], arg1: Eq[N], arg2: Trig[N], converter: AngleConverter[N]): N
-
def
trace[N](f: (N) ⇒ N, x0: N): Iterator[(N, Set[N])]
-
def
wallisΠ(iterations: Int): Rational
-
val
∀: forall.type
-
val
∃: thereexists.type
-
def
√[N](x: N)(implicit arg0: NRoot[N]): N