axle

Value Members

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

   

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

   

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

   

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

   

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

   

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

   

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

   

8. package ast

   

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

   

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]

    

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

    

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

    

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

    

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

    

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

    

16. implicit def enrichInt(n: Int): EnrichedInt

    

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

    

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

    

19. implicit def eqIndexedSeq[T](implicit arg0: Eq[T]): Eq[IndexedSeq[T]]

    

20. implicit def eqSeq[T](implicit arg0: Eq[T]): Eq[Seq[T]]

    

21. implicit def eqSet[S](implicit arg0: Eq[S]): Eq[Set[S]]

    

22. def fib(n: Int): Int

    

23. def getLine(): String

    

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

    

25. def id[A](x: A): A

    

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

    

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

    

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

    

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

    

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

    

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

    

32. 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

    

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

    

34. implicit val orderBooleans: Order[Boolean]

    

35. implicit val orderChars: Order[Char]

    

36. implicit val orderDoubles: Order[Double]

    

37. implicit val orderStrings: Order[String]

    

38. implicit val orderSymbols: Order[Symbol]

    

39. def recfib(n: Int): Int

    

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

    

41. def reverse[T](l: List[T]): List[T]

    

42. def show[T](t: T)(implicit arg0: Show[T]): Unit

    

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

    

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

    

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

    

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

    

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

    

48. def wallisΠ(iterations: Int): Rational

    

49. val ∀: forall.type

    

50. val ∃: thereexists.type

    

51. def √[N](x: N)(implicit arg0: NRoot[N]): N