implicit object TickableDouble extends Tickable[Double]
This is a generic numeric implementation that many numeric type can use via Tickable.FromDouble
Wilkenson algorithm???
http://vis.stanford.edu/papers/tick-labels
- Source
- tick.scala
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- TickableDouble
- Tickable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- Protected
Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##: Int
- Definition Classes
- AnyRef → Any
- final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def ceil(x: Double, step: Double): Double
- def ceilCoef(dt: Double): Double
nice human value above
- def clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.CloneNotSupportedException]) @native()
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef → Any
- def extend(n: Int, bound: LerpInv[Double])(implicit b: Boundable[Double]): Bound[Double]
an extended range version of the bound that extends to nice values
an extended range version of the bound that extends to nice values
- Definition Classes
- TickableDouble → Tickable
- def finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- def floor(x: Double, step: Double): Double
- def floorCoef(dt: Double): Double
nice human value below
- def formatter(n: Int, b: LerpInv[Double]): (Double) => String
- Definition Classes
- TickableDouble → Tickable
- final def getClass(): Class[_ <: AnyRef]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- def logTicks(n: Int, lerp: LerpInv[Double], base: Double): Iterable[Double]
return at most
n
nice tick points at beacon valuesreturn at most
n
nice tick points at beacon values- Definition Classes
- TickableDouble → Tickable
- final def ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- final def notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- final def notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native()
- def round(x: Double, step: Double): Double
- def roundCoef(dt: Double): Double
round to the closest floor or ceil
- final def synchronized[T0](arg0: => T0): T0
- Definition Classes
- AnyRef
- def ticks(n: Int, bound: LerpInv[Double]): Iterable[Double]
return at most
n
nice tick points at beacon valuesreturn at most
n
nice tick points at beacon values- Definition Classes
- TickableDouble → Tickable
- def toSI(d: Double): String
- def toString(): String
- Definition Classes
- AnyRef → Any
- final def wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException])
- final def wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.InterruptedException]) @native()