TokenSpanMention

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

def !==(other: variable.Var): Boolean

final def ##(): Int

def ++[B >: Token, That](that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def ++:[B >: Token, That](that: Traversable[B])(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def ++:[B >: Token, That](that: TraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def /:[B](z: B)(op: (B, Token) ⇒ B): B

final def :=(newValue: Value): Unit

def :\[B](z: B)(op: (Token, B) ⇒ B): B

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def ===(other: variable.Var): Boolean

Value comparisons (as distinct from variable pointer equality)

def _addChildEntity(e: Entity)(implicit d: variable.DiffList): Unit

def _removeChildEntity(e: Entity)(implicit d: variable.DiffList): Unit

def addString(b: StringBuilder): StringBuilder

def addString(b: StringBuilder, sep: String): StringBuilder

def addString(b: StringBuilder, start: String, sep: String, end: String): StringBuilder

def addedChildHook(entity: Entity)(implicit d: variable.DiffList): Unit

def aggregate[B](z: B)(seqop: (B, Token) ⇒ B, combop: (B, B) ⇒ B): B

def append(n: Int)(implicit d: variable.DiffList): Unit

def apply(index: Int): Token

final def asInstanceOf[T0]: T0

object attr

A collection of attributes, keyed by the attribute class.

def canAppend(n: Int): Boolean

def canEqual(that: Any): Boolean

def canPrepend(n: Int): Boolean

def chain: Section

def changedParentEntityHook(oldEntity: Entity, newEntity: Entity)(implicit d: variable.DiffList): Unit

def childEntities: ChildEntities

def childEntitiesIterator: Iterator[Entity]

def childEntitiesSize: Int

def clone(): AnyRef

def collect[B, That](pf: PartialFunction[Token, B])(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def collectFirst[B](pf: PartialFunction[Token, B]): Option[B]

def companion: GenericCompanion[Iterable]

def contains(elem: Any): Boolean

def containsStrings(span: TokenSpan): Boolean

Returns true if this span contain the words of argument span in order.

def copyToArray[B >: Token](xs: Array[B], start: Int, len: Int): Unit

def copyToArray[B >: Token](xs: Array[B]): Unit

def copyToArray[B >: Token](xs: Array[B], start: Int): Unit

def copyToBuffer[B >: Token](dest: Buffer[B]): Unit

def count(p: (Token) ⇒ Boolean): Int

final def depth: Int

def descendantsOfClass[A <: Entity](implicit m: ClassTag[A]): Seq[A]

def descendantsOfClass[A <: Entity](cls: Class[A]): Seq[A]

def diffIfNotPresent: Boolean

If true then Diff objects will return this as their variable even when the value indicates it is not "present".

final def document: Document

def drop(n: Int): Iterable[Token]

def dropRight(n: Int): Iterable[Token]

def dropWhile(p: (Token) ⇒ Boolean): Iterable[Token]

def end: Int

def entityRoot: Entity

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def exists(f: (Token) ⇒ Boolean): Boolean

def filter(p: (Token) ⇒ Boolean): Iterable[Token]

def filterDescendants(test: (Entity) ⇒ Boolean): Seq[Entity]

Recursively descend sub-entities and return only those matching criterion

def filterNot(p: (Token) ⇒ Boolean): Iterable[Token]

def finalize(): Unit

def find(p: (Token) ⇒ Boolean): Option[Token]

def flatMap[B, That](f: (Token) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def flatten[B](implicit asTraversable: (Token) ⇒ GenTraversableOnce[B]): Iterable[B]

def fold[A1 >: Token](z: A1)(op: (A1, A1) ⇒ A1): A1

def foldLeft[B](z: B)(op: (B, Token) ⇒ B): B

def foldRight[B](z: B)(op: (Token, B) ⇒ B): B

def forall(p: (Token) ⇒ Boolean): Boolean

def foreach[U](f: (Token) ⇒ U): Unit

def genericBuilder[B]: Builder[B, Iterable[B]]

def getAncestor(numGenerationsBack: Int): Entity

final def getClass(): Class[_]

def groupBy[K](f: (Token) ⇒ K): Map[K, Iterable[Token]]

def grouped(size: Int): Iterator[Iterable[Token]]

def hasDefiniteSize: Boolean

def hasPredecessor(i: Int): Boolean

def hashCode(): Int

def head: Token

def headOption: Option[Token]

def id: Any

def indexOf[B >: Token](elem: B, from: Int): Int

def indexOf[B >: Token](elem: B): Int

def indexWhere(p: (Token) ⇒ Boolean): Int

def indexWhere(p: (Token) ⇒ Boolean, from: Int): Int

def init: Iterable[Token]

def initializeAttributesOfStructure(): Unit

def inits: Iterator[Iterable[Token]]

def isConnected: Boolean

def isEmpty: Boolean

final def isInstanceOf[T0]: Boolean

def isLeaf: Boolean

var isObserved: Boolean

def isRoot: Boolean

final def isTraversableAgain: Boolean

def iterator: Iterator[Token]

def last: Token

def lastOption: Option[Token]

def length: Int

def map[B](f: (Token) ⇒ B): IndexedSeq[B]

def map[B, That](f: (Token) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def max[B >: Token](implicit cmp: Ordering[B]): Token

def maxBy[B](f: (Token) ⇒ B)(implicit cmp: Ordering[B]): Token

def min[B >: Token](implicit cmp: Ordering[B]): Token

def minBy[B](f: (Token) ⇒ B)(implicit cmp: Ordering[B]): Token

def mkString: String

def mkString(sep: String): String

def mkString(start: String, sep: String, end: String): String

def name: String

A short name for this span

final def ne(arg0: AnyRef): Boolean

def newBuilder: Builder[Token, Iterable[Token]]

def nonEmpty: Boolean

final def notify(): Unit

final def notifyAll(): Unit

def numLeaves: Int

def par: ParIterable[Token]

def parCombiner: Combiner[Token, ParIterable[Token]]

def parentEntity: Entity

def parentEntityOption: Option[Entity]

def parentEntityRef: EntityRef

def partition(p: (Token) ⇒ Boolean): (Iterable[Token], Iterable[Token])

def phrase: String

def postChange(implicit d: variable.DiffList): Unit

def preChange(implicit d: variable.DiffList): Unit

If true, this SpanVariable will be scored by a difflist, even if it is in its deleted non-"present" state.

def prepend(n: Int)(implicit d: variable.DiffList): Unit

def printName: String

def product[B >: Token](implicit num: Numeric[B]): B

def reduce[A1 >: Token](op: (A1, A1) ⇒ A1): A1

def reduceLeft[B >: Token](op: (B, Token) ⇒ B): B

def reduceLeftOption[B >: Token](op: (B, Token) ⇒ B): Option[B]

def reduceOption[A1 >: Token](op: (A1, A1) ⇒ A1): Option[A1]

def reduceRight[B >: Token](op: (Token, B) ⇒ B): B

def reduceRightOption[B >: Token](op: (Token, B) ⇒ B): Option[B]

def removedChildHook(entity: Entity)(implicit d: variable.DiffList): Unit

def repr: Iterable[Token]

def reversed: List[Token]

def safeChildEntitiesSeq: Seq[Entity]

def sameElements[B >: Token](that: GenIterable[B]): Boolean

def scan[B >: Token, That](z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[Iterable[Token], B, That]): That

def scanLeft[B, That](z: B)(op: (B, Token) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

def scanRight[B, That](z: B)(op: (Token, B) ⇒ B)(implicit bf: CanBuildFrom[Iterable[Token], B, That]): That

final def section: Section

def sentence: Sentence

The Sentence to which the first Token in this TokenSpan belongs.

def seq: Iterable[Token]

def set(newValue: Value)(implicit d: variable.DiffList): Unit

Assign a new value to this variable

def setLength(l: Int)(implicit d: variable.DiffList): Unit

final def setParentEntity(e: Entity)(implicit d: variable.DiffList): Unit

def setStart(s: Int)(implicit d: variable.DiffList): Unit

def size: Int

def slice(from: Int, until: Int): Iterable[Token]

def sliding(size: Int, step: Int): Iterator[Iterable[Token]]

def sliding(size: Int): Iterator[Iterable[Token]]

def span(p: (Token) ⇒ Boolean): (Iterable[Token], Iterable[Token])

def splitAt(n: Int): (Iterable[Token], Iterable[Token])

def start: Int

def string: String

def stringPrefix: String

def sum[B >: Token](implicit num: Numeric[B]): B

final def synchronized[T0](arg0: ⇒ T0): T0

def tail: Iterable[Token]

def tails: Iterator[Iterable[Token]]

def take(n: Int): Iterable[Token]

def takeRight(n: Int): Iterable[Token]

def takeWhile(p: (Token) ⇒ Boolean): Iterable[Token]

def thisCollection: Iterable[Token]

def to[Col[_]](implicit cbf: CanBuildFrom[Nothing, Token, Col[Token]]): Col[Token]

def toArray[B >: Token](implicit arg0: ClassTag[B]): Array[B]

def toBuffer[B >: Token]: Buffer[B]

def toCollection(repr: Iterable[Token]): Iterable[Token]

def toIndexedSeq: IndexedSeq[Token]

def toIterable: Iterable[Token]

def toIterator: Iterator[Token]

def toList: List[Token]

def toMap[T, U](implicit ev: <:<[Token, (T, U)]): Map[T, U]

def toSeq: IndexedSeq[Token]

def toSet[B >: Token]: scala.collection.immutable.Set[B]

def toStream: Stream[Token]

def toString(): String

def toTraversable: Traversable[Token]

def toVector: Vector[Token]

final def tokens: IndexedSeq[Token]

def transpose[B](implicit asTraversable: (Token) ⇒ GenTraversableOnce[B]): Iterable[Iterable[B]]

def trimEnd(n: Int)(implicit d: variable.DiffList): Unit

def trimStart(n: Int)(implicit d: variable.DiffList): Unit

def unzip[A1, A2](implicit asPair: (Token) ⇒ (A1, A2)): (Iterable[A1], Iterable[A2])

def unzip3[A1, A2, A3](implicit asTriple: (Token) ⇒ (A1, A2, A3)): (Iterable[A1], Iterable[A2], Iterable[A3])

def value: Span[Section, Token]

Abstract method to return the value of this variable.

def view(from: Int, until: Int): IterableView[Token, Iterable[Token]]

def view: IterableView[Token, Iterable[Token]]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def withFilter(p: (Token) ⇒ Boolean): FilterMonadic[Token, Iterable[Token]]

def zip[A1 >: Token, B, That](that: GenIterable[B])(implicit bf: CanBuildFrom[Iterable[Token], (A1, B), That]): That

def zipAll[B, A1 >: Token, That](that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[Iterable[Token], (A1, B), That]): That

def zipWithIndex[A1 >: Token, That](implicit bf: CanBuildFrom[Iterable[Token], (A1, Int), That]): That

def /:\[A1 >: Token](z: A1)(op: (A1, A1) ⇒ A1): A1