scalax.control.ManagedSequence

class ManagedSequence

abstract class ManagedSequence[+ A]

 extends PartialFunction[Int, A]


A class which is approximately isomorphic to Seq, but which manages the lifecycle of the underlying data source, and is generally non-strict.


Source: resources.scala(128)

Direct Known Subclasses

CsvFile, KeyValueFile,

 Constructors

def this

 Fields

elements def elements ManagedResource[Iterator[A]]
first def first A
firstOption def firstOption Option[A]
head def head A
headOption def headOption Option[A]
isEmpty def isEmpty Boolean
last def last A
lastOption def lastOption Option[A]
length def length Int
mkString def mkString String
resource abstract val resource ManagedResource[Handle]
reverse def reverse List[A]
stringPrefix protected def stringPrefix String
toList def toList List[A]

 Methods

!= final def !=(arg0 : Object) Boolean AnyRef
!= final def !=(arg0 : Any) Boolean Any
++ def ++[B >: A](that : Seq[B]) ManagedSequence[B]
++ def ++[B >: A](that : ManagedSequence[B]) ManagedSequence[B]
== final def ==(arg0 : Any) Boolean Any
== final def ==(arg0 : Object) Boolean AnyRef
andThen override def andThen[C](arg0 : (B) => C) PartialFunction[A, C] PartialFunction
apply def apply(i : Int) A
apply protected def apply(v : Handle, i : Int) A
asInstanceOf final def asInstanceOf[T0] T0 Any
clone protected def clone Object AnyRef
compose def compose[A](arg0 : (A) => T1) (A) => R Function1
contains def contains(e : Any) Boolean
containsSlice def containsSlice(that : Seq[Any]) Boolean
copyToArray def copyToArray[B >: A](arr : Array[B], start : Int) Unit
copyToBuffer def copyToBuffer[B >: A](buf : Buffer[B]) Unit
drop def drop(n : Int) ManagedSequence[A]
dropWhile def dropWhile(f : (A) => Boolean) ManagedSequence[A]
endsWith def endsWith(that : Seq[Any]) Boolean
eq final def eq(arg0 : Object) Boolean AnyRef
equals def equals(arg0 : Any) Boolean AnyRef
exists def exists(f : (A) => Boolean) Boolean
filter def filter(f : (A) => Boolean) ManagedSequence[A]
finalize protected def finalize Unit AnyRef
find def find(f : (A) => Boolean) Option[A]
findIndexOf def findIndexOf(f : (A) => Boolean) Int
flatMap def flatMap[B](f : (A) => Iterable[B]) ManagedSequence[B]
foldLeft def foldLeft[B](z : B)(op : (B, A) => B) B
foldRight def foldRight[B](z : B)(op : (A, B) => B) B
forall def forall(f : (A) => Boolean) Boolean
foreach def foreach(f : (A) => Unit) Unit
getClass final def getClass Class[Any] AnyRef
hashCode def hashCode Int AnyRef
indexOf def indexOf(e : Any) Int
indexOf def indexOf(that : Seq[Any]) Int
isDefinedAt def isDefinedAt(i : Int) Boolean
isInstanceOf final def isInstanceOf[T0] Boolean Any
iterator protected abstract def iterator(v : Handle) Iterator[A]
lastIndexOf def lastIndexOf(e : Any) Int
length protected def length(v : Handle) Int
map def map[B](f : (A) => B) ManagedSequence[B]
mkString def mkString(start : String, sep : String, end : String) String
mkString def mkString(sep : String) String
ne final def ne(arg0 : Object) Boolean AnyRef
notify final def notify Unit AnyRef
notifyAll final def notifyAll Unit AnyRef
orElse def orElse[A1 <: A, B1 >: B](arg0 : PartialFunction[A1, B1]) PartialFunction[A1, B1] PartialFunction
reduceLeft def reduceLeft[B >: A](op : (B, B) => B) B
reduceRight def reduceRight[B >: A](op : (B, B) => B) B
sameElements def sameElements(that : Iterable[Any]) Boolean
sameElements def sameElements(that : ManagedSequence[Any]) Boolean
slice def slice(from : Int, until : Int) ManagedSequence[A]
startsWith def startsWith(that : Seq[Any]) Boolean
synchronized final def synchronized[T0](arg0 : T0) T0 AnyRef
take def take(n : Int) ManagedSequence[A]
takeWhile def takeWhile(f : (A) => Boolean) ManagedSequence[A]
toArray def toArray[B >: A] Array[B]
toString override def toString String
wait final def wait(arg0 : Long, arg1 : Int) Unit AnyRef
wait final def wait Unit AnyRef
wait final def wait(arg0 : Long) Unit AnyRef
Copyright (c) 2005-2008. All Rights Reserved.