sealed trait Map[S <: Base[S], A] extends TotalOrder[S]
- Self Type
- Map[S, A]
Linear Supertypes
Ordering
- Alphabetic
- By Inheritance
Inherited
- Map
- TotalOrder
- Mutable
- Disposable
- Writable
- Identifiable
- AnyRef
- Any
- Hide All
- Show All
Visibility
- Public
- All
Type Members
-
final
type
E = Entry[S, A]
- Definition Classes
- Map → TotalOrder
-
final
type
KOpt = KeyOption[S, A]
- Attributes
- protected
Abstract Value Members
-
abstract
def
dispose()(implicit tx: S.Tx): Unit
- Definition Classes
- Disposable
- abstract def entryView: (A) ⇒ E
-
abstract
def
id: S.Id
- Definition Classes
- Identifiable
-
abstract
def
observer: RelabelObserver[S.Tx, A]
- Attributes
- protected
-
abstract
def
root: E
The initial element created from which you can start to append and prepend.
The initial element created from which you can start to append and prepend.
- Definition Classes
- Map → TotalOrder
-
abstract
def
sizeVal: S.Var[Int]
- Attributes
- protected
-
abstract
def
write(out: DataOutput): Unit
- Definition Classes
- Writable
Concrete 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
- implicit final val EntrySerializer: Serializer[S.Tx, S.Acc, E]
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
disposeData()(implicit tx: S.Tx): Unit
- Attributes
- protected
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(that: Any): Boolean
- Definition Classes
- Identifiable → 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
- Identifiable → AnyRef → Any
-
final
def
head(implicit tx: S.Tx): E
Returns the head element of the structure.
Returns the head element of the structure. Note that this is O(n) worst case.
- Definition Classes
- Map → TotalOrder
-
def
insert()(implicit tx: S.Tx): E
Creates a new _unlinked_ entry in the order.
Creates a new _unlinked_ entry in the order. The actual insertion (linking) must be done with a successive call to either
placeAfterorplaceBefore! -
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 placeAfter(prev: A, key: A)(implicit tx: S.Tx): Unit
- def placeBefore(next: A, key: A)(implicit tx: S.Tx): Unit
- final def readEntry(in: DataInput, access: S.Acc)(implicit tx: S.Tx): E
-
final
def
size(implicit tx: S.Tx): Int
The number of elements in the order.
The number of elements in the order. This is
1for a newly created order (consisting only of the root element). You will rarely need this information except for debugging purpose. The operation is O(1).- Definition Classes
- Map → TotalOrder
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
final
def
tagList(from: E)(implicit tx: S.Tx): List[Int]
- Definition Classes
- Map → TotalOrder
-
def
toString(): String
- Definition Classes
- Map → AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @throws( ... )
-
final
def
writeData(out: DataOutput): Unit
- Attributes
- protected