class
ItemIdList extends AnyRef
Instance Constructors
-
new
ItemIdList()
Value Members
-
final
def
!=(arg0: AnyRef): Boolean
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: AnyRef): Boolean
-
final
def
==(arg0: Any): Boolean
-
def
add(xids: Seq[Int]): Unit
-
def
add(xid: Int): Unit
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compact(): Unit
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): java.lang.Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
peek(): Array[Int]
-
def
pop(): Option[Int]
-
def
pop(count: Int): Seq[Int]
-
def
popAll(): Seq[Int]
-
def
remove(xids: Set[Int]): Set[Int]
-
def
size: Int
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
Set of ids that maintains insert order.
The "set" property is not enforced but is assumed because these are meant to be item ids. Good performance assumes that operations are usually add, pop, popAll, or a remove of most or all of the items. (Remove is O(n) so if there are many items and only a few are being removed, performance will be bad.) This is tuned toward the general case where a client will have either very few items open, or will have many items open but will remove them all at once.