sealed abstract
class
Rope extends AnyRef
Abstract Value Members
-
abstract
def
+(that: Rope): Rope
-
abstract
def
charAt(idx: Int): Char
-
abstract
def
depth: Int
-
abstract
def
filter(f: (Char) ⇒ Boolean): Rope
-
abstract
def
flatMap(f: (Char) ⇒ Rope): Rope
-
abstract
def
foldLeft[Acc](zero: Acc)(f: (Acc, Char) ⇒ Acc): Acc
-
abstract
def
foldRight[Acc](zero: Acc)(f: (Char, Acc) ⇒ Acc): Acc
-
abstract
def
foreach(f: (Char) ⇒ Unit): Unit
-
abstract
def
map(f: (Char) ⇒ Char): Rope
-
abstract
def
size: Int
-
abstract
def
splitAt(idx: Int): (Rope, Rope)
Concrete Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
def
+(c: Char): Rope
-
def
+(a: Array[Char]): Rope
-
def
+(s: String): Rope
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
delete(start: Int, length: Int): Rope
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(obj: Any): Boolean
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
insertAt(idx: Int, that: Rope): Rope
-
final
def
isInstanceOf[T0]: Boolean
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
substring(start: Int): Rope
-
def
substring(start: Int, length: Int): Rope
-
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
-
-
-
def
withFilter(f: (Char) ⇒ Boolean): Rope
Rope data structure as a binary tree of character arrays. First described in
Ropes: an Alternative to Stringsby Hans-J. Boehm, Russ Atkinson and Michael Plass.