CreateFieldDFA

(12:12:21 PM) Mike Beckerle: I think I understand this. Let me explain why the 'backtrack" is ok. (12:12:38 PM) Mike Beckerle: We have this DFA, but in our pictures there's this PTERM state. (12:12:56 PM) Mike Beckerle: That PTERM state is a "macro" for a much more complicated DFA. (12:13:54 PM) Mike Beckerle: The upshot is this "macro" accepts - having consumed a bunch of input, or it fails, and we are supposed to be back at the start of the delimiter. (12:15:06 PM) Mike Beckerle: That "macro" can be expressed by exploding it into a big DFA, or by some claver logic that orchestrates part-specific matchers. (12:16:46 PM) Mike Beckerle: The fastest thing would be to explode it into a big DFA, but pragmatically this might not be noticably faster than the other way. (12:17:38 PM) Taylor: Why I was wondering if we should have two DFA types. Field and delimiter. Where the 'Field' can be 'paused' while we check the delimiters. (12:17:47 PM) Taylor: If the delimiter match succeeds, we're done. (12:18:06 PM) Taylor: if it fails, resume the 'field' DFA with the r.data0 as a char. (12:18:37 PM) Taylor: all the field is doing is handling escape schemes if any (12:18:39 PM) Mike Beckerle: That is, in principle, what the transition to the "macro" PTERM state is. It's suspending current state. So yeah, I'm good with that. (12:18:46 PM) Taylor: ok cool :D (12:19:13 PM) Mike Beckerle: Cut paste this dialog into a comment in the code somewhere.

Linear Supertypes

AnyRef, Any

Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def apply(blockEnd: DFADelimiter, EEC: MaybeChar): DFAField

Constructs a DFAField object with EscpaeSchemeKind.Block
def apply(EC: Char, EEC: MaybeChar): DFAField

Constructs a DFAField object with EscapeSchemeKind.Character
def apply(): DFAField

Constructs a DFAField object without EscapeSchemeKind.None
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Related Doc: package dfa

object CreateFieldDFA

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def apply(blockEnd: DFADelimiter, EEC: MaybeChar): DFAField

def apply(EC: Char, EEC: MaybeChar): DFAField

def apply(): DFAField

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

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

Inherited from AnyRef

Inherited from Any

Ungrouped