trait _Trait extends Any.Able.ToInfo

Reposition is a precise definition how elements within Idx.Range should be reorganized

Consider ordering a list of integers. This could be accomplished it two steps:

  • First, based on some Ordering , we create a Reposition object, which captures all necessary position permutations
  • Second, apply reposition to the list
val buffer = (0 ~+~ (3 ~+ 1 + 2) + 4).to[Idx.M]

buffer.all lp      // Prints:  ~(0, 3, 1, 2, 4)

// Creating reposition based on ordering
val rep = Idx.Reposition.fromOrdering(buffer)

rep lp             // Prints: Reposition{range=1 <>> 4,(1,3)(2,1)(3,2)}

rep.apply(buffer)  // Applying reposition

buffer.all.lp      // Prints: ~(0, 1, 2, 3, 4)

Reposition has rich library, where all derivative methods are located

This is done not to pollute main name space, because reposition can be implemented by classes doing something else

Ordering
  1. Alphabetic
Inherited
  1. Reposition
  2. Any.Able.ToInfo
  3. Any.Able.ToString
  4. Any.Able.ToText
  5. scala.AnyRef
  6. scala.Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Method

  1. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  2. def clone(): AnyRef
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  3. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  4. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  5. def finalize(): Unit
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  6. def hashCode(): Int
    Definition Classes
    AnyRef → Any
  7. abstract def indexes: Ints

    New positions

    New positions

    Int indexes on new positions

    // Repositioning range from 3 to 6 in reverse indexes = 6,5,4,3
    
    val r = Idx.Reposition.make(3 <> 6, Ints.*(6, 5, 4, 3))
    
    r lp  // Prints: Reposition{range=3 <>> 7,(3,6)(4,5)(5,4)(6,3)}
    Definition Classes
    _Trait
  8. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  9. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  10. final def notify(): Unit
    Definition Classes
    AnyRef
  11. final def notifyAll(): Unit
    Definition Classes
    AnyRef
  12. abstract def range: Idx.Range

    Scope

    Scope

    Idx.Range the reposition is applicable to

    Definition Classes
    _Trait
  13. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  14. def toInfo: Pro.Info

    Info

    Info

    Returns Pro.Info object, loaded with property names and values describing this instance

    Definition Classes
    _TraitToInfo
  15. def toString: String

    Custom single line description

    Custom single line description

    If not overridden further, toString returns toInfo.toString

    Definition Classes
    ToInfoToString → Any
  16. def toText: String

    Custom multi line description

    Custom multi line description

    If not overridden further, toText returns toInfo.toText

    Definition Classes
    ToInfoToText
  17. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  18. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  19. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Operator

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
Linear Supertypes
Known Subclasses
Source: _Trait.scala