LoggedNodeFactory

abstract def create(pre: String, name: String, attrs: MetaData, scope: NamespaceBinding, children: Seq[Node]): A

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final val CACHE: Int(1)

final val FULL: Int(2)

final val NONE: Int(0)

final def asInstanceOf[T0]: T0

val cache: HashMap[Int, List[A]]

def clone(): AnyRef

def construct(hash: Int, old: List[A], pre: String, name: String, attrSeq: MetaData, scope: NamespaceBinding, children: Seq[Node]): A

final def eq(arg0: AnyRef): Boolean

def eqElements(ch1: Seq[Node], ch2: Seq[Node]): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

val ignoreComments: Boolean

val ignoreProcInstr: Boolean

final def isInstanceOf[T0]: Boolean

def log(msg: String): Unit

val logComment: Boolean

val logCompressLevel: Int

0 = no logging, 1 = cache hits, 2 = detail

val logNode: Boolean

val logProcInstr: Boolean

val logText: Boolean

def makeComment(s: String): Seq[Comment]

def makeNode(pre: String, label: String, attrSeq: MetaData, scope: NamespaceBinding, children: Seq[Node]): A

logged version of makeNode method

def makeProcInstr(t: String, s: String): Seq[ProcInstr]

def makeText(s: String): Text

final def ne(arg0: AnyRef): Boolean

def nodeEquals(n: Node, pre: String, name: String, attrSeq: MetaData, scope: NamespaceBinding, children: Seq[Node]): 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