package
commons
Type Members
-
type
BBitSet = BitSet
-
type
BIndexedSeq[+A] = IndexedSeq[A]
-
type
BIterable[+A] = Iterable[A]
-
type
BLinearSeq[+A] = LinearSeq[A]
-
type
BMap[A, +B] = Map[A, B]
-
type
BSeq[+A] = Seq[A]
-
type
BSet[A] = Set[A]
-
type
BSortedMap[A, +B] = SortedMap[A, B]
-
type
BSortedSet[A] = SortedSet[A]
-
type
BTraversable[+A] = Traversable[A]
-
type
ClassTag[T] = scala.reflect.ClassTag[T]
-
-
-
-
type
Failure[+T] = scala.util.Failure[T]
-
type
Future[+T] = scala.concurrent.Future[T]
-
type
IBitSet = BitSet
-
type
IHashMap[A, +B] = HashMap[A, B]
-
type
IHashSet[A] = HashSet[A]
-
type
IIndexedSeq[+A] = IndexedSeq[A]
-
type
IIterable[+A] = Iterable[A]
-
type
ILinearSeq[+A] = LinearSeq[A]
-
type
IListMap[A, +B] = ListMap[A, B]
-
type
IMap[A, +B] = Map[A, B]
-
type
IQueue[+A] = Queue[A]
-
type
ISeq[+A] = Seq[A]
-
type
ISet[A] = Set[A]
-
type
ISortedMap[A, +B] = SortedMap[A, B]
-
type
ISortedSet[A] = SortedSet[A]
-
type
ITraversable[+A] = Traversable[A]
-
type
ITreeMap[A, +B] = TreeMap[A, B]
-
type
ITreeSet[A] = TreeSet[A]
-
type
JArrayDeque[E] = ArrayDeque[E]
-
type
JArrayList[T] = ArrayList[T]
-
type
JBigDecimal = BigDecimal
-
type
JBigInteger = BigInteger
-
type
JBoolean = Boolean
-
type
JByte = Byte
-
type
JCharacter = Character
-
type
JCollection[T] = Collection[T]
-
-
type
JDate = Date
-
type
JDeque[E] = Deque[E]
-
type
JDouble = Double
-
type
JEnum[E <: Enum[E]] = Enum[E]
-
type
JEnumMap[K <: Enum[K], V] = EnumMap[K, V]
-
type
JEnumSet[E <: Enum[E]] = EnumSet[E]
-
type
JFloat = Float
-
type
JHashMap[K, V] = HashMap[K, V]
-
type
JHashSet[T] = HashSet[T]
-
type
JInteger = Integer
-
type
JIterable[T] = Iterable[T]
-
type
JIterator[T] = Iterator[T]
-
type
JLinkedHashMap[K, V] = LinkedHashMap[K, V]
-
type
JLinkedHashSet[T] = LinkedHashSet[T]
-
type
JLinkedList[T] = LinkedList[T]
-
type
JList[T] = List[T]
-
-
type
JListIterator[T] = ListIterator[T]
-
type
JLong = Long
-
type
JMap[K, V] = Map[K, V]
-
abstract
class
JMapCreator[M[K, V] <: JMap[K, V]] extends AnyRef
-
type
JNavigableMap[K, V] = NavigableMap[K, V]
-
type
JNavigableSet[T] = NavigableSet[T]
-
type
JNumber = Number
-
type
JQueue[E] = Queue[E]
-
type
JSet[T] = Set[T]
-
type
JShort = Short
-
type
JSortedMap[K, V] = SortedMap[K, V]
-
-
type
JSortedSet[T] = SortedSet[T]
-
-
type
JStringBuilder = StringBuilder
-
type
JTreeMap[K, V] = TreeMap[K, V]
-
type
JTreeSet[T] = TreeSet[T]
-
type
JVoid = Void
-
type
MArrayBuffer[A] = ArrayBuffer[A]
-
type
MBitSet = BitSet
-
type
MBuffer[A] = Buffer[A]
-
type
MHashMap[A, B] = HashMap[A, B]
-
type
MHashSet[A] = HashSet[A]
-
type
MIndexedSeq[A] = IndexedSeq[A]
-
type
MIterable[A] = Iterable[A]
-
type
MLinearSeq[A] = LinearSeq[A]
-
type
MLinkedHashMap[A, B] = LinkedHashMap[A, B]
-
type
MLinkedHashSet[A] = LinkedHashSet[A]
-
type
MListBuffer[A] = ListBuffer[A]
-
type
MListMap[A, B] = ListMap[A, B]
-
type
MMap[A, B] = Map[A, B]
-
type
MQueue[A] = Queue[A]
-
type
MSeq[A] = Seq[A]
-
type
MSet[A] = Set[A]
-
type
MSortedSet[A] = SortedSet[A]
-
type
MTraversable[A] = Traversable[A]
-
type
MTreeSet[A] = TreeSet[A]
-
-
-
-
-
type
Promise[T] = scala.concurrent.Promise[T]
-
-
type
Success[+T] = scala.util.Success[T]
-
Value Members
-
final
def
BBitSet: BitSet.type
-
final
def
BIndexedSeq: IndexedSeq.type
-
final
def
BIterable: Iterable.type
-
final
def
BLinearSeq: LinearSeq.type
-
final
def
BMap: Map.type
-
final
def
BSeq: Seq.type
-
final
def
BSet: Set.type
-
final
def
BSortedMap: SortedMap.type
-
final
def
BSortedSet: SortedSet.type
-
final
def
BTraversable: Traversable.type
-
-
-
-
final
val
ExecutionContext: scala.concurrent.ExecutionContext.type
-
-
-
final
def
IBitSet: BitSet.type
-
final
def
IHashMap: HashMap.type
-
final
def
IHashSet: HashSet.type
-
final
def
IIndexedSeq: IndexedSeq.type
-
final
def
IIterable: Iterable.type
-
final
def
ILinearSeq: LinearSeq.type
-
final
def
IListMap: ListMap.type
-
final
def
IMap: Map.type
-
final
def
IQueue: Queue.type
-
final
def
ISeq: Seq.type
-
final
def
ISet: Set.type
-
final
def
ISortedMap: SortedMap.type
-
final
def
ISortedSet: SortedSet.type
-
final
def
ITraversable: Traversable.type
-
final
def
ITreeMap: TreeMap.type
-
final
def
ITreeSet: TreeSet.type
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
final
def
MArrayBuffer: ArrayBuffer.type
-
final
def
MBitSet: BitSet.type
-
final
def
MBuffer: Buffer.type
-
final
def
MHashMap: HashMap.type
-
final
def
MHashSet: HashSet.type
-
final
def
MIndexedSeq: IndexedSeq.type
-
final
def
MIterable: Iterable.type
-
final
def
MLinearSeq: LinearSeq.type
-
final
def
MLinkedHashMap: LinkedHashMap.type
-
final
def
MLinkedHashSet: LinkedHashSet.type
-
final
def
MListBuffer: ListBuffer.type
-
final
def
MListMap: ListMap.type
-
final
def
MMap: Map.type
-
final
def
MQueue: Queue.type
-
final
def
MSeq: Seq.type
-
final
def
MSet: Set.type
-
final
def
MSortedSet: SortedSet.type
-
final
def
MTraversable: Traversable.type
-
final
def
MTreeSet: TreeSet.type
-
-
-
-
-
-
-
-
-
final
val
Try: scala.util.Try.type
-
implicit
def
asJavaCollectionConverter[A](i: Iterable[A]): scala.collection.convert.Decorators.AsJavaCollection[A]
-
implicit
def
asJavaDictionaryConverter[A, B](m: Map[A, B]): scala.collection.convert.Decorators.AsJavaDictionary[A, B]
-
implicit
def
asJavaEnumerationConverter[A](i: Iterator[A]): scala.collection.convert.Decorators.AsJavaEnumeration[A]
-
implicit
def
asJavaIterableConverter[A](i: Iterable[A]): scala.collection.convert.Decorators.AsJava[Iterable[A]]
-
implicit
def
asJavaIteratorConverter[A](i: Iterator[A]): scala.collection.convert.Decorators.AsJava[Iterator[A]]
-
implicit
def
asScalaBufferConverter[A](l: List[A]): scala.collection.convert.Decorators.AsScala[Buffer[A]]
-
implicit
def
asScalaIteratorConverter[A](i: Iterator[A]): scala.collection.convert.Decorators.AsScala[Iterator[A]]
-
implicit
def
asScalaSetConverter[A](s: Set[A]): scala.collection.convert.Decorators.AsScala[Set[A]]
-
implicit
def
bufferAsJavaListConverter[A](b: Buffer[A]): scala.collection.convert.Decorators.AsJava[List[A]]
-
final
def
classTag[T](implicit arg0: ClassTag[T]): ClassTag[T]
-
-
implicit
def
collectionAsScalaIterableConverter[A](i: Collection[A]): scala.collection.convert.Decorators.AsScala[Iterable[A]]
-
-
-
implicit
def
dictionaryAsScalaMapConverter[A, B](p: Dictionary[A, B]): scala.collection.convert.Decorators.AsScala[Map[A, B]]
-
implicit
def
enumerationAsScalaIteratorConverter[A](i: Enumeration[A]): scala.collection.convert.Decorators.AsScala[Iterator[A]]
-
-
implicit
def
futureCompanionOps(fut: Future.type): FutureCompanionOps.type
-
implicit
def
futureCompatOps[A](fut: Future[A]): FutureCompatOps[A]
-
implicit
def
futureOps[A](fut: Future[A]): FutureOps[A]
-
implicit
def
intOps(int: Int): IntOps
-
implicit
def
iterableAsScalaIterableConverter[A](i: Iterable[A]): scala.collection.convert.Decorators.AsScala[Iterable[A]]
-
implicit
def
iteratorCompanionOps(it: Iterator.type): IteratorCompanionOps.type
-
implicit
def
iteratorOps[A](it: Iterator[A]): IteratorOps[A]
-
-
def
jCallable[T](expr: ⇒ T): Callable[T]
-
def
jComparator[T](cmp: (T, T) ⇒ Int): Comparator[T]
-
-
implicit
def
jHashMapCBF[K, V]: JMapCBF[K, V, JHashMap[K, V]]
-
-
implicit
def
jLinkedHashMapCBF[K, V]: JMapCBF[K, V, JLinkedHashMap[K, V]]
-
-
-
def
jRunnable(code: ⇒ Any): Runnable
-
implicit
def
jTreeMapCBF[K, V](implicit arg0: Ordering[K]): JMapCBF[K, V, JTreeMap[K, V]]
-
implicit
def
jTreeSetCBF[A](implicit arg0: Ordering[A]): JCollectionCBF[A, JTreeSet[A]]
-
-
implicit
def
jsDateTimestampConversions(jsDate: Date): TimestampConversions
-
-
implicit
def
lazyFutureOps[A](fut: ⇒ Future[A]): LazyFutureOps[A]
-
implicit
def
lazyTryOps[A](tr: ⇒ Try[A]): LazyTryOps[A]
-
implicit
def
lazyUniversalOps[A](a: ⇒ A): LazyUniversalOps[A]
-
implicit
def
mapAsJavaConcurrentMapConverter[A, B](m: Map[A, B]): scala.collection.convert.Decorators.AsJava[ConcurrentMap[A, B]]
-
implicit
def
mapAsJavaMapConverter[A, B](m: Map[A, B]): scala.collection.convert.Decorators.AsJava[Map[A, B]]
-
implicit
def
mapAsScalaConcurrentMapConverter[A, B](m: ConcurrentMap[A, B]): scala.collection.convert.Decorators.AsScala[Map[A, B]]
-
implicit
def
mapAsScalaMapConverter[A, B](m: Map[A, B]): scala.collection.convert.Decorators.AsScala[Map[A, B]]
-
implicit
def
mapOps[M[X, Y] <: BMap[X, Y], K, V](map: M[K, V]): MapOps[M, K, V]
-
-
-
implicit
def
mutableMapAsJavaMapConverter[A, B](m: Map[A, B]): scala.collection.convert.Decorators.AsJava[Map[A, B]]
-
implicit
def
mutableSeqAsJavaListConverter[A](b: Seq[A]): scala.collection.convert.Decorators.AsJava[List[A]]
-
implicit
def
mutableSetAsJavaSetConverter[A](s: Set[A]): scala.collection.convert.Decorators.AsJava[Set[A]]
-
implicit
def
nullableOps[A >: Null](a: A): NullableOps[A]
-
implicit
def
optionOps[A](option: Option[A]): OptionOps[A]
-
implicit
def
orderingOps[A](ordering: Ordering[A]): OrderingOps[A]
-
implicit
def
pairTraversableOnceOps[C[X] <: TraversableOnce[X], K, V](coll: C[(K, V)]): PairTraversableOnceOps[C, K, V]
-
implicit
def
pairTraversableOps[A, B](coll: TraversableOnce[(A, B)]): pairTraversableOps[A, B]
-
-
implicit
def
propertiesAsScalaMapConverter(p: Properties): scala.collection.convert.Decorators.AsScala[Map[String, String]]
-
-
package
rpc
-
implicit
def
seqAsJavaListConverter[A](b: Seq[A]): scala.collection.convert.Decorators.AsJava[List[A]]
-
-
implicit
def
setAsJavaSetConverter[A](s: Set[A]): scala.collection.convert.Decorators.AsJava[Set[A]]
-
implicit
def
setOps[A](set: BSet[A]): SetOps[A]
-
implicit
def
stringOps(str: String): StringOps
-
implicit
def
traversableOnceOps[C[X] <: TraversableOnce[X], A](coll: C[A]): TraversableOnceOps[C, A]
-
implicit
def
traversableOps[C[X] <: BTraversable[X], A](coll: C[A]): TraversableOps[C, A]
-
implicit
def
tryCompanionOps(trc: Try.type): TryCompanionOps.type
-
implicit
def
tryCompatOps[A](tr: Try[A]): TryCompatOps[A]
-
implicit
def
tryOps[A](tr: Try[A]): TryOps[A]
-
-
implicit
def
universalOps[A](a: A): UniversalOps[A]
Inherited from AnyRef
Inherited from Any
