| 
 | 
          Scala 1.3.0.7 | |||
| Index | 
Iterable object added at the end of 
  the queue.scala.xml.Text node to this
 buffer, returns reference on this NodeBuffer for convenience.elements method.elements method.elements method.elements method.elements method.elements method.elements method.elements method.elements method.elements method.elements method.elements method.Iterable object
  into the priority queue.that to the set.that to the set.map to the map.map to the map.elements method.elements method.Iterable object
  into the priority queue.elements method.elements method.map to the map.map to the map.Iterable object
  on top of the stack.elements method.elements method.that to the set.that to the set.map to the map.map to the map.that to the set.that to the set.Iterable object
  on top of the stack.Iterable object
  into the priority queue.Iterable object
  on top of the stack.Iterable object
  at the end of the queue.Iterable object
  at the end of the queue.Iterable object
  at the end of the queue.key.- can be used to remove a single element from
  a set.- can be used to remove a single element from
  a set.- can be used to remove a single element from
  a set.key.key.- can be used to remove a single element from
  a set.that from the set.it from the set.keys object.keys object.keys object.keys object.that from the set.it from the set.keys object.keys object.that from the set.it from the set.-= can be used to remove a single element from
  a set.key.-= can be used to remove a single element from
  a set.key.key.key.key.key.-= can be used to remove a single element from
  a set.key.-= can be used to remove a single element from
  a set.-= can be used to remove a single element from
  a set.-= can be used to remove a single element from
  a set.-= can be used to remove a single element from
  a set.foldLeft but can be used as
  an operator with the order of list and zero arguments reversed.foldLeft but can be used as
  an operator with the order of list and zero arguments reversed.foldLeft but can be used as
  an operator with the order of list and zero arguments reversed.x at the beginning of this list.prefix and this list.foldRight.foldRight.foldRight.Application class can be used to quickly turn objects
  into executable programs.that.elements method.elements method.elements method.n-th element of this list.n.n.nth element of this list.n.n-th element of this queue.n.attributes
Benchmark can be used to quickly turn an existing
  class into a benchmark.BitSet ...BitSetprovides an immutable bitset view on an
  int array.scala.collection.mutable.Buffer.span but with the predicate inverted.Cell is a generic wrapper which completely
  hides the functionality of the wrapped object.Code provides apply methods
  with different arities (actually up to 9 parameters) to invoke
  a function simply by specifying its name and argument types.
  Example:
    val url = new URL("http://scala.epfl.ch/classes/examples.jar");
    val obj = new Location(url) create "examples.sort";
    val ar = Array(6, 2, 8, 5, 1);
    obj[Array[Int], Unit]("println")(ar);
    obj[Array[Int], Unit]("sort")(ar);
    obj[Array[Int], Unit]("println")(ar);
Console object implements functionality for
  printing Scala values on the terminal.elem is a member of this 
  iterable object.elem is a member of this list.elem.elem.elem.elem.elem.elem.elem.elem.elem.xs with the elements of
  this sequence starting at position start.xs with the elements of
  this sequence starting at position start.xs with the elements of
  this sequence starting at position start.xs with the elements of
  this sequence starting at position start.className
  at this location.that.n first elements.n elements from this iterator.n
  elements of this sequence.n
  elements of this sequence.n
  elements of this sequence.n elements.p.Elem implements the Node trait,
  providing an immutable data object representing an XML element.The class Enumeration provides the same functionality as the
 enum construct found in C-like languages like C++ or Java.
C.C.excl removes many elements from the set.excl removes many elements from the set.excl removes many elements from the set.keys object.excl removes many elements from the set.that from the set.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p to all elements of this
  iterable object and return true, iff there is at least one
  element for which p yields true.p holds 
  for some corresponding elements of the argument lists.p.p.filter removes all elements from the set for
  which the predicate p yields the value false.p returns false.p returns false.p returns false.filter removes all elements from the set for
  which the predicate p yields the value false.p returns false.filter removes all elements from the set for
  which the predicate p yields the value false.p returns false.filter removes all elements from the set for
  which the predicate p yields the value false.key to a value and return the
  value if it exists.f to each element of
  this list, then concatenates the results.f to each element of
  this iterator, then concatenates the results.op, from left to right, and starting with
  the value z.op, from left to right, and starting with
  the value z.op, from left to right, and starting with
  the value z.op, from left to right, and starting with
  the value z.op, from left to right, and starting with
  the value z.op, from rigth to left, and starting with
  the value z.op, from rigth to left, and starting with
  the value z.op, from rigth to left, and starting with
  the value z.op, from rigth to left, and starting with
  the value z.op, from rigth to left, and starting with
  the value z.p to all elements of this
  iterable object and return true, iff the predicate yields
  true for all elements.p is satisfied by all elements
  in this list.p to all elements of this
  iterable object and return true, iff the predicate yields
  true for all elements.p to all elements of this
  iterable object and return true, iff the predicate yields
  true for all elements.p to all elements of this
  iterable object and return true, iff the predicate yields
  true for all elements.p to all elements of this
  iterable object and return true, iff the predicate yields
  true for all elements.p holds 
  for all corresponding elements of the argument lists.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to each element of this list
  (while respecting the order of the elements).f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.f to all elements of this
  iterable object.en+1 = en + 1
  where e0 = lo.en+1 = en + step
  where e0 = lo.en+1 = step(en)
  where e0 = lo.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.nth element of this list or None
  if this element does not exist.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.key to a value and return the
  value if it exists.History[A, B] objects may subscribe to events of
  type A published by an object of type B.elements which returns an iterator over all the
  elements contained in the collection.Iterator object provides various functions for
  creating specialized iterators.incl can be used to add many elements to the set
  at the same time.incl can be used to add many mappings at the same time
  to the map.incl can be used to add many mappings at the same time
  to the map.incl can be used to add many elements to the set
  at the same time.incl can be used to add many mappings at the same time
  to the map.incl can be used to add many elements to the set
  at the same time.incl can be used to add many mappings at the same time
  to the map.incl can be used to add many mappings at the same time
  to the map.incl can be used to add many elements to the set
  at the same time.that to the set.n.n.n.n.n.n.n.n.n.that.that.that.that.that.x?
x?
java.util.Map interface.java.util.Set.elem)
  and the tail (next) are mutable.a.Location provides a create
  method to instantiate objects from a network location by
  specifying the URL address of the jar/class file.
  An update of the jar/class file should not break your code as far
  as the used class names and method signatures are the same.
  Example:
    val url = new URL("http://scala.epfl.ch/classes/examples.jar");
    val obj = new Location(url) create "examples.sort";
Location can be used to instantiate
  objects on the same Java VM.Location describes locations in messages implemented
  by class Message.scala.collection.Map.scala.collection.mutable.Map.Message represents messages that are issued by observable
  collection classes whenever a data structure is changed.f to each
  element of this list.f.f.f.f.f.f.f to 
  corresponding elements of the argument lists.toString.toString.toString.toString.
     override def New(sz:Int,t:aNode):This {
       new C[T](order) {
        override def size=sz;
        override protected val tree:aNode=t;
     }
    
   The concrete implementation should also override the def of This
   override type This = C[T];
  
     override def New(sz:Int,t:aNode):This {
       new C[T](order) {
        override def size=sz;
        override protected val tree:aNode=t;
     }
    
   The concrete implementation should also override the def of This
   override type This = C[T];
  
PartialFunction[A, B] is a
  unary function where the domain does not include all values of type
  A.Predef object provides definitions that are
  accessible in all Scala compilation units without explicit
  qualification.Any to another object x.Publisher[A,This] objects publish events of type A
  to all registered subscribers.elements method.elements method.elements method.Queue objects implement data structures that allow to
  insert and retrieve elements in a first-in-first-out (FIFO) manner.Queue objects implement data structures that allow to
  insert and retrieve elements in a first-in-first-out (FIFO) manner.Queue objects implement data structures that allow to
  insert and retrieve elements in a first-in-first-out (FIFO) manner.History object which supports
  an undo operation.en+1 = en + 1
  where e0 = lo
  and ei < end.en+1 = en + step
  where e0 = lo
  and ei < end.en+1 = step(en)
  where e0 = lo
  and ei < end.vn+1 = vn + 1
 where v0 = start
 and vi < end.vn+1 = vn + step
 where v0 = start
 and vi < end.vn+1 = step(vn)
 where v0 = start
 and vi < end.f is defined.f is defined or the timeout is over.p.Scriptable trait allow
  messages to be sent to objects of that class.Seq[A] represents finite sequences of elements
  of type A.Seq[A] represents finite sequences of elements
  of type A.scala.collection.Set.scala.collection.mutable.Set.Option[A] represents existing values of type
  A.The class Stream implements lazy lists where elements
 are only evaluated when they are needed.
Stream provides helper functions
 to manipulate streams.Subscriber[A, B] objects may subscribe to events of
  type A published by an object of type B.Symbol can be created easily with
  Scala's built-in quote mechanism.Queue[T] class.Stack[T] class.<(e1: a, e2: a) => Boolean,
  which should be true iff e1 is smaller than e2.from
  consisting of len elements.from
  consisting of len elements.that.that.that.n first elements of this list.n
  elements.n.n.n.n elements from this list.p.scala.List containing the same
  sequence of elements.[0..size] whose elements are
 indices of bits set to v.toString method.toString method.toString method.toString method.toString method.n elements.n elements.Undoable trait provide an operation
  undo which can be used to undo the last operation.that.elem
  from this set depending on the value of parameter included.key
  to value to the map.n with the new element
  newelem.n with the new element
  newelem.n with the new element
  newelem.key
  to value to the map.key
  to value to the map.key
  to value to the map.key
  to value to the map.key
  to value to the map.n with the new element
  newelem.n with the new element
  newelem.elem
  from this set depending on the value of parameter included.key
  to value to the map.elem
  from this set depending on the value of parameter included.n with the new element
  newelem.key
  to value.key
  to value.key
  to value.that by associating each element of the former with
  the element at the same position in the latter.that by associating each element of the former with
  the element at the same position in the latter.| 
 | 
          Scala 1.3.0.7 | |||