sealed abstract class OrdSeq[A] extends Ops[FingerTree[LastOption[A], A]]
Ordered sequences, based on scalaz.FingerTree
a
has a higher priority than b
if Order[A].greaterThan(a, b)
.
insert
and ++
maintains the ordering.
The measure is calculated with a Monoid[Option[A] @@ Last]
, whose append
operation favours the first argument. Accordingly, the measuer of a node is the
item with the highest priority contained recursively below that node.
- Source
- FingerTree.scala
- Alphabetic
- By Inheritance
- OrdSeq
- Ops
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
- implicit abstract val ord: Order[A]
- abstract def self: FingerTree[LastOption[A], A]
- Definition Classes
- Ops
Concrete Value Members
- final def !=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def ##(): Int
- Definition Classes
- AnyRef → Any
- def ++(xs: OrdSeq[A]): OrdSeq[A]
Append
xs
to this sequence, reordering elements to - final def ==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- final def asInstanceOf[T0]: T0
- Definition Classes
- Any
- def clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws(classOf[java.lang.CloneNotSupportedException])
- final def eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
- def equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
- def finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws(classOf[java.lang.Throwable])
- final def getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native()
- def insert(a: A): OrdSeq[A]
Insert
a
at a the first point that all elements to the left are of higher priority - final def isInstanceOf[T0]: Boolean
- Definition Classes
- Any
- 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 partition(a: A): (OrdSeq[A], OrdSeq[A])
- returns
(higher, lowerOrEqual) The sub-sequences that contain elements of higher and of lower-than-or-equal priority than
a
, and of lower or equal priority respectively.
- final def synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
- 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
- @native() @throws(classOf[java.lang.InterruptedException])