object Labeling
- Alphabetic
- By Inheritance
- Labeling
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
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
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @IntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def forceTickCount(bounds: Bounds, tickCount: Int, formatter: Option[(Double) ⇒ String] = None, fixed: Boolean = false): AxisDescriptor
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
label(bounds: Bounds, preferredTickCount: Option[Int] = None, tickCountRange: Option[Seq[Int]] = None, formatter: Option[(Double) ⇒ String] = None, fixed: Boolean = false): AxisDescriptor
Implements a modified version of Wilkinson's labeling algorithm.
Implements a modified version of Wilkinson's labeling algorithm. For reference, see The Grammar of Graphics (L. Wilkinson) pp. 96-97, or An Extension to Wilkinson's Algorithm for Tick Labels on Axes (J. Talbot, et al.)
- bounds
The bounds of the data.
- preferredTickCount
A preferred number of ticks to use.
- tickCountRange
A function to create the range of acceptable tick counts. Labelings with a tick count close to
preferredTickCount
are favored, however we may a choose a "nicer" labeling within this range.- formatter
Function to format tick labels. If none is provided, we attempt to format the tick labels using a reasonable amount of precision in decimal notation.
- fixed
When true, the generated labeling will never produces labels outside of the supplied bounds. In general better labelings can be achieved if fixed is not set.
- returns
A com.cibo.evilplot.numeric.AxisDescriptor representing the optimal labeling given the constraints if it exists, a naive labeling if none can be found.
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @IntrinsicCandidate()
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
Deprecated Value Members
-
def
finalize(): Unit
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] ) @Deprecated
- Deprecated