Packages

class Log[A] extends Bound[A]

Log interpolate min ~ max ratio while preserving the original values and using the max and min to determine a scale range

Source
bound.scala
Linear Supertypes
Bound[A], LerpInv[A], Lerp[A], AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Log
  2. Bound
  3. LerpInv
  4. Lerp
  5. AnyRef
  6. Any
Implicitly
  1. by richDrxAny
  2. by DrxBoundOps
  3. by any2stringadd
  4. by StringFormat
  5. by Ensuring
  6. by ArrowAssoc
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Instance Constructors

  1. new Log(min: A, max: A)(implicit b: Boundable[A])

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def %(ratio: Double): A

    alias for lerp or apply

    alias for lerp or apply

    Definition Classes
    Bound
  4. def *(gain: Double): Bound[A]

    operator form to scale from the middle scaleAtRatio(gain,0.5)

    operator form to scale from the middle scaleAtRatio(gain,0.5)

    Definition Classes
    Bound
  5. def +(other: String): String
    Implicit
    This member is added by an implicit conversion from Log[A] toany2stringadd[Log[A]] performed by method any2stringadd in scala.Predef.
    Definition Classes
    any2stringadd
  6. def ++(that: Bound[A]): Bound[A]

    merge(grow to a union) bound (useful for parallel processing)

    merge(grow to a union) bound (useful for parallel processing)

    Definition Classes
    Bound
  7. def --(that: Bound[A]): Option[Bound[A]]
    Definition Classes
    Bound
  8. def -->[B](that: Bound[B]): QuantitativeBound[A, B]

    mapsTo, arrow, linear transformation, morphism ...

    mapsTo, arrow, linear transformation, morphism ... https://www.wikiwand.com/en/Map_(mathematics)

    Definition Classes
    Bound
  9. def -->[B](range: Lerp[B]): Quantitative[A, B]
    Definition Classes
    LerpInv
  10. def -->[B](range: LerpInv[B]): QuantitativeInv[A, B]
    Definition Classes
    LerpInv
  11. def ->[B](y: B): (Log[A], B)
    Implicit
    This member is added by an implicit conversion from Log[A] toArrowAssoc[Log[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @inline()
  12. def /(gain: Double): Bound[A]
    Definition Classes
    Bound
  13. def <(v: A): Boolean
    Definition Classes
    Bound
  14. def ==(that: Bound[A]): Boolean
    Definition Classes
    Bound
  15. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  16. def >(v: A): Boolean
    Definition Classes
    Bound
  17. def applyIf(t: Boolean, f: (Log[A]) => Log[A]): Log[A]
    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  18. def applyIf(t: (Log[A]) => Boolean)(f: (Log[A]) => Log[A]): Log[A]

    better chaining for types

    better chaining for types

    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  19. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  20. def bisect(f: (A) => Boolean, N: Int = 64): A

    generic bisect algorithm with N steps for a function that turns from false to true Note:this version requires the initial crossing occurs between min~max, or f(min) == false && f(max) == true)

    generic bisect algorithm with N steps for a function that turns from false to true Note:this version requires the initial crossing occurs between min~max, or f(min) == false && f(max) == true)

    Definition Classes
    Bound
  21. def bisectOption(f: (A) => Boolean, N: Int = 64): Option[A]
    Definition Classes
    Bound
  22. def by[B](stepSize: B)(implicit s: BoundStep[A, B]): Iterator[A]

    a nice step by function that matches the scala.Range form, Note: the implicit typeclass is used for bounds that can not be steped, like colors and also prevent the requirement of a hard coded type parameter for Bounds

    a nice step by function that matches the scala.Range form, Note: the implicit typeclass is used for bounds that can not be steped, like colors and also prevent the requirement of a hard coded type parameter for Bounds

    Definition Classes
    Bound
  23. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @native()
  24. def contains(v: A): Boolean
    Definition Classes
    Bound → LerpInv
  25. def containsAll(that: Bound[A]): Boolean
    Definition Classes
    Bound
  26. def containsNot(v: A): Boolean
    Definition Classes
    Bound
  27. def containsSome(that: Bound[A]): Boolean

    of any part is overlapped cases | condition | a containsSome b | a containsAll b | a contains b is ambiguous (don't use) a{ b( ) } total true true a{ b( } ) partial true false a{} b( ) none false false b( a{} ) inside true false

    of any part is overlapped cases | condition | a containsSome b | a containsAll b | a contains b is ambiguous (don't use) a{ b( ) } total true true a{ b( } ) partial true false a{} b( ) none false false b( a{} ) inside true false

    Definition Classes
    Bound
  28. def dist: Double
    Definition Classes
    Bound
  29. def elementOf(xs: Set[Log[A]]): Boolean
    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  30. def end: A

    alias for max

    alias for max

    Definition Classes
    Lerp
  31. def ensuring(cond: (Log[A]) => Boolean, msg: => Any): Log[A]
    Implicit
    This member is added by an implicit conversion from Log[A] toEnsuring[Log[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  32. def ensuring(cond: (Log[A]) => Boolean): Log[A]
    Implicit
    This member is added by an implicit conversion from Log[A] toEnsuring[Log[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  33. def ensuring(cond: Boolean, msg: => Any): Log[A]
    Implicit
    This member is added by an implicit conversion from Log[A] toEnsuring[Log[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  34. def ensuring(cond: Boolean): Log[A]
    Implicit
    This member is added by an implicit conversion from Log[A] toEnsuring[Log[A]] performed by method Ensuring in scala.Predef.
    Definition Classes
    Ensuring
  35. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  36. def equals(that: Any): Boolean
    Definition Classes
    Bound → AnyRef → Any
  37. def extend(n: Int)(implicit t: Tickable[A]): Bound[A]
    Definition Classes
    Bound
  38. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable])
  39. def formatted(fmtstr: String): String
    Implicit
    This member is added by an implicit conversion from Log[A] toStringFormat[Log[A]] performed by method StringFormat in scala.Predef.
    Definition Classes
    StringFormat
    Annotations
    @inline()
  40. final val gain: Double

    Note: it feels magical and incredible that the interpolation is independent of a log base value, but rather the max/min gain of the bound

  41. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  42. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  43. def in_:(b: Bound[A]): Boolean

    convenience function to make containment tests read better with right associativity

    convenience function to make containment tests read better with right associativity

    Definition Classes
    Bound
  44. def in_:(v: A): Boolean
    Definition Classes
    Bound
  45. def isInside(b: Bound[A]): Boolean

    convenience function to make containment tests read better where a isInside b == b containsAll a

    convenience function to make containment tests read better where a isInside b == b containsAll a

    Definition Classes
    Bound
  46. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  47. def isSingular: Boolean
    Definition Classes
    Bound
  48. def lerp(p: Double): A

    type class based interpolator (0 to 1)

    type class based interpolator (0 to 1)

    Definition Classes
    Log → Bound → Lerp
  49. def linearTicks(n: Int)(implicit t: Tickable[A]): Iterable[A]
  50. def log: Log[A]
    Definition Classes
    Bound
  51. def logTicks(n: Int, base: Double = 10)(implicit t: Tickable[A]): Iterable[A]
    Definition Classes
    LerpInv
  52. def map[B](f: (A) => B)(implicit b: Boundable[B]): Bound[B]

    generic function mapping to convert one bound to another type (that is boundable)

    generic function mapping to convert one bound to another type (that is boundable)

    Definition Classes
    Bound
  53. def mapsTo[B](that: Bound[B]): QuantitativeBound[A, B]

    alias for mapsTo

    alias for mapsTo

    Definition Classes
    Bound
  54. val max: A
    Definition Classes
    Bound → Lerp
  55. def mid: A

    convenience of the mid value

    convenience of the mid value

    Definition Classes
    Lerp
  56. val min: A
    Definition Classes
    Bound → Lerp
  57. def mobius(x: A): A

    modulus in a wrapping fashion

    modulus in a wrapping fashion

    Definition Classes
    LerpInv
  58. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  59. def noneIf(f: (Log[A]) => Boolean): Option[Log[A]]
    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  60. def normal(implicit rand: Rand): A
    Definition Classes
    Lerp
  61. def normalize(xs: Iterable[A]): Iterable[Double]
    Definition Classes
    LerpInv
  62. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  63. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  64. def optionIf(f: (Log[A]) => Boolean): Option[Log[A]]

    optionally wrap an object

    optionally wrap an object

    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  65. def out_:(v: A): Boolean
    Definition Classes
    Bound
  66. def preApply[B](f: (Log[A]) => B): B

    a preApply f => f(a)

    a preApply f => f(a)

    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  67. def pulse(period: Time): A
    Definition Classes
    Lerp
  68. def ramp(t: Time)(implicit t0: Date): A
    Definition Classes
    Lerp
  69. def ratioOf(x: A): Double

    reverse lookup while not mathematically sound a return of 0.5 is nice for visuals

    reverse lookup while not mathematically sound a return of 0.5 is nice for visuals

    Definition Classes
    Log → Bound → LerpInv
  70. def ratioOfOption(x: A): Option[Double]
    Definition Classes
    Bound
  71. def reverse: Bound[A]
    Definition Classes
    Bound
  72. def sat(x: A): A

    simple way to lookup and keep within a bound

    simple way to lookup and keep within a bound

    Definition Classes
    Bound
  73. def satBy(that: Bound[A]): Bound[A]

    produce a new bound that limits the current bound by the second (Note: this is not an intersection because this operation is always defined but is also not associative)

    produce a new bound that limits the current bound by the second (Note: this is not an intersection because this operation is always defined but is also not associative)

    Definition Classes
    Bound
  74. def satOption(x: A): Option[A]

    simple way to lookup and return only if it is in the bound

    simple way to lookup and return only if it is in the bound

    Definition Classes
    Bound
  75. def scale(gain: Double): Bound[A]

    scale with the pivot origin at min (simply applies the gain to the max value)

    scale with the pivot origin at min (simply applies the gain to the max value)

    Definition Classes
    Bound
  76. def scaleAt(gain: Double, pivot: A): Bound[A]

    convenience function for scaleAtRatio by using the imutable pivot lookup value

    convenience function for scaleAtRatio by using the imutable pivot lookup value

    Definition Classes
    Bound
  77. def scaleAtRatio(gain: Double, pivot: Double): Bound[A]

    generic scale and translate around an immutable pivot point without inverse lookup

    generic scale and translate around an immutable pivot point without inverse lookup

    Definition Classes
    Bound
  78. def sideEffect(f: (Log[A]) => Unit): Log[A]

    side effect filter

    side effect filter

    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  79. def someIf(f: (Log[A]) => Boolean): Option[Log[A]]
    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  80. def start: A

    alias for min

    alias for min

    Definition Classes
    Lerp
  81. def swap: Bound[A]
    Definition Classes
    Bound
  82. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  83. def take(n: Int): Iterable[A]
    Definition Classes
    Lerp
  84. val thisAny: Log[A]
    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
  85. def ticks(n: Int)(implicit t: Tickable[A]): Iterable[A]
    Definition Classes
    Log → LerpInv
  86. def ticksOn(path: Segment)(implicit t: Tickable[A]): Iterable[Text]

    auto select tick count based on segment length

    auto select tick count based on segment length

    Definition Classes
    LerpInv
  87. def ticksOn(path: Lerp[Vec], n: Int)(implicit t: Tickable[A]): Iterable[Text]
    Definition Classes
    LerpInv
  88. final def ticksWithFormat(n: Int)(implicit t: Tickable[A], f: Format[A]): Iterable[(A, String)]
    Definition Classes
    LerpInv
  89. def till(maxArg: Log[A]): Bound[Log[A]]

    Bound construction since the Range constructor is deprecated

    Bound construction since the Range constructor is deprecated

    Implicit
    This member is added by an implicit conversion from Log[A] toBoundOps[Log[A]] performed by method DrxBoundOps in cc.drx.predef.Enrich.This conversion will take place only if an implicit value of type Boundable[Log[A]] is in scope.
    Definition Classes
    BoundOps
  90. def toBound(implicit b: Boundable[A]): Bound[A]
    Definition Classes
    Lerp
  91. def toString(): String
    Definition Classes
    Bound → AnyRef → Any
  92. def translate(ratio: Double): Bound[A]

    generic scale and translate without inverse lookup

    generic scale and translate without inverse lookup

    Definition Classes
    Bound
  93. def translateBy(from: A, to: A): Bound[A]

    convenience function to help calculate translation ratios based on the bound values

    convenience function to help calculate translation ratios based on the bound values

    Definition Classes
    Bound
  94. def uniform(implicit rand: Rand): A
    Definition Classes
    Lerp
  95. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  96. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  97. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  98. def zip[B](xs: Iterable[B]): Iterable[(A, B)]
    Definition Classes
    Lerp
  99. def ∈:(v: A): Boolean
    Definition Classes
    Bound
  100. def ∉:(v: A): Boolean
    Definition Classes
    Bound

Deprecated Value Members

  1. def ?>(f: (Log[A]) => Boolean): Option[Log[A]]

    alias for option if

    alias for option if

    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.15) to many symbols are hard to undertand

  2. final def apply(ratio: Double): A
    Definition Classes
    Bound
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.15) use lerp instead since bound now extends Lerp, lerp is the entry point and can be mixed in better, (it will help catch overloaded errors that extended the wrong function root function)

  3. def containsNorm(v: A): Boolean
    Definition Classes
    Bound
    Annotations
    @deprecated
    Deprecated

    (Since version 0.2.13) the 'normal' contains method should provide this functionality

  4. def from[B](that: Bound[B]): QuantitativeBound[B, A]
    Definition Classes
    Bound
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.00) use (a to b) instead of (b from a) to many verbs

  5. def mean: A
    Definition Classes
    Lerp
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.15) use mid instead since 0.5 may not be the mean

  6. lazy val norm: Bound[A]

    Boundable has this as an overridable method that may be specific for some special classses

    Boundable has this as an overridable method that may be specific for some special classses

    Definition Classes
    Bound
    Annotations
    @deprecated
    Deprecated

    (Since version 0.2.13) try not to use this function, it was to specialized

  7. def steps(N: Int): Seq[A]
    Definition Classes
    Lerp
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.4) use take(N:Int) for a more scala semantic

  8. def to[B](that: Bound[B]): QuantitativeBound[A, B]
    Definition Classes
    Bound
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.00) use --> insted of the harder to see and similar 'to' in Range()

  9. def |>[B](f: (Log[A]) => B): B
    Implicit
    This member is added by an implicit conversion from Log[A] toDrxAny[Log[A]] performed by method richDrxAny in cc.drx.predef.Enrich.
    Definition Classes
    DrxAny
    Annotations
    @deprecated
    Deprecated

    (Since version v0.2.15) use preApply if you must (symbols are concise without concision)

  10. def →[B](y: B): (Log[A], B)
    Implicit
    This member is added by an implicit conversion from Log[A] toArrowAssoc[Log[A]] performed by method ArrowAssoc in scala.Predef.
    Definition Classes
    ArrowAssoc
    Annotations
    @deprecated
    Deprecated

    (Since version 2.13.0) Use -> instead. If you still wish to display it as one character, consider using a font with programming ligatures such as Fira Code.

Inherited from Bound[A]

Inherited from LerpInv[A]

Inherited from Lerp[A]

Inherited from AnyRef

Inherited from Any

Inherited by implicit conversion richDrxAny fromLog[A] to DrxAny[Log[A]]

Inherited by implicit conversion DrxBoundOps fromLog[A] to BoundOps[Log[A]]

Inherited by implicit conversion any2stringadd fromLog[A] to any2stringadd[Log[A]]

Inherited by implicit conversion StringFormat fromLog[A] to StringFormat[Log[A]]

Inherited by implicit conversion Ensuring fromLog[A] to Ensuring[Log[A]]

Inherited by implicit conversion ArrowAssoc fromLog[A] to ArrowAssoc[Log[A]]

Ungrouped