Class

dsptools.dspmath

Factorization

Related Doc: package dspmath

Permalink

case class Factorization(supportedRadsUnsorted: Seq[Seq[Int]]) extends Product with Serializable

Linear Supertypes
Serializable, Serializable, Product, Equals, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. Factorization
  2. Serializable
  3. Serializable
  4. Product
  5. Equals
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Instance Constructors

  1. new Factorization(supportedRadsUnsorted: Seq[Seq[Int]])

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  5. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @throws( ... )

  6. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  7. def factorizeCoprime(n: Int): Seq[Int]

    Permalink

    Factorizes the coprime into digit radices (mixed radix) i.e.

    Factorizes the coprime into digit radices (mixed radix) i.e. n = 8 -> Seq(4, 2) Note: there's no padding!

  8. def getBasePrime(n: Int): Int

    Permalink

    Gets associated base prime for n (assuming n isn't divisible by other primes) WARNING: Assumes supportedRads contains the base prime!

  9. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate()

  10. def getCoprimes(n: Int): Seq[Int]

    Permalink

    Break n into coprimes i.e.

    Break n into coprimes i.e. n = 45 * 21 * 37 would result in Seq(45 * 21, 37) If supportedRads contains more coprime groups than the ones used, 1 will be associated with the unused groups.

  11. def getPowsFlat(n: Int): Seq[Int]

    Permalink

    Factor n into powers of supported radices (flattened) i.e.

    Factor n into powers of supported radices (flattened) i.e. if supportedRads = Seq(Seq(4, 2), Seq(3)), output = Seq(5, 1, 7) implies n = 45 * 21 * 3^7 If supportedRads contains more radices than the ones used, a power of 0 will be associated with the unused radices.

  12. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  13. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  14. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  15. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate()

  16. val supportedRadsUnsorted: Seq[Seq[Int]]

    Permalink

  17. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  18. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  19. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  20. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Deprecated Value Members

  1. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from Serializable

Inherited from Serializable

Inherited from Product

Inherited from Equals

Inherited from AnyRef

Inherited from Any

Ungrouped