Instance Constructors
-
new
Jx
(child: NodeSeq)
Type Members
-
type
Self
= NodeSeq
Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
++
[B >: Node, That]
(that: TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
++
[B >: Node, That]
(that: GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
++:
[B >: Node, That]
(that: Traversable[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
++:
[B >: Node, That]
(that: TraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
+:
[B >: Node, That]
(elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
/:
[B]
(z: B)(op: (B, Node) ⇒ B): B
-
def
/:\
[A1 >: Node]
(z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
:+
[B >: Node, That]
(elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
:\
[B]
(z: B)(op: (Node, B) ⇒ B): B
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
def
\
(that: String): NodeSeq
-
def
\\
(that: String): NodeSeq
-
def
addAttrs
(varName: String, attrs: List[MetaData]): JsCmd
-
def
addString
(b: StringBuilder): StringBuilder
-
def
addString
(b: StringBuilder, sep: String): StringBuilder
-
def
addString
(b: StringBuilder, start: String, sep: String, end: String): StringBuilder
-
def
addToDocFrag
(parent: String, elems: List[Node]): JsCmd
-
def
aggregate
[B]
(z: B)(seqop: (B, Node) ⇒ B, combop: (B, B) ⇒ B): B
-
def
andThen
[C]
(k: (Node) ⇒ C): PartialFunction[Int, C]
-
def
appendToParent
(parentName: String): JsCmd
-
def
apply
(f: (Node) ⇒ Boolean): NodeSeq
-
def
apply
(i: Int): Node
-
def
asInstanceOf
[T0]
: T0
-
def
attribute
(uri: String, key: String): Option[Seq[Node]]
-
def
attribute
(key: String): Option[Seq[Node]]
-
def
attributes
: MetaData
-
def
basisForHashCode
: Seq[Any]
-
def
buildString
(stripComments: Boolean): String
-
def
canEqual
(other: Any): Boolean
-
val
child
: NodeSeq
-
def
clone
(): AnyRef
-
def
collect
[B, That]
(pf: PartialFunction[Node, B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
collectFirst
[B]
(pf: PartialFunction[Node, B]): Option[B]
-
def
combinations
(n: Int): Iterator[NodeSeq]
-
def
companion
: GenericCompanion[Seq]
-
def
compose
[A]
(g: (A) ⇒ Int): (A) ⇒ Node
-
def
contains
(elem: Any): Boolean
-
def
containsSlice
[B]
(that: Seq[B]): Boolean
-
def
containsSlice
[B]
(that: GenSeq[B]): Boolean
-
def
copyToArray
[B >: Node]
(xs: Array[B], start: Int, len: Int): Unit
-
def
copyToArray
[B >: Node]
(xs: Array[B]): Unit
-
def
copyToArray
[B >: Node]
(xs: Array[B], start: Int): Unit
-
def
copyToBuffer
[B >: Node]
(dest: Buffer[B]): Unit
-
def
corresponds
[B]
(that: Seq[B])(p: (Node, B) ⇒ Boolean): Boolean
-
def
corresponds
[B]
(that: GenSeq[B])(p: (Node, B) ⇒ Boolean): Boolean
-
def
count
(p: (Node) ⇒ Boolean): Int
-
def
descendant
: List[Node]
-
def
descendant_or_self
: List[Node]
-
def
diff
[B >: Node]
(that: Seq[B]): NodeSeq
-
def
diff
[B >: Node]
(that: GenSeq[B]): NodeSeq
-
def
distinct
: NodeSeq
-
def
doCollectNamespaces
: Boolean
-
def
doTransform
: Boolean
-
def
drop
(n: Int): NodeSeq
-
def
dropRight
(n: Int): NodeSeq
-
def
dropWhile
(p: (Node) ⇒ Boolean): NodeSeq
-
def
endsWith
[B]
(that: Seq[B]): Boolean
-
def
endsWith
[B]
(that: GenSeq[B]): Boolean
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(other: Any): Boolean
-
def
exists
(p: (Node) ⇒ Boolean): Boolean
-
def
filter
(p: (Node) ⇒ Boolean): NodeSeq
-
def
filterNot
(p: (Node) ⇒ Boolean): NodeSeq
-
def
finalize
(): Unit
-
def
find
(p: (Node) ⇒ Boolean): Option[Node]
-
def
flatMap
[B, That]
(f: (Node) ⇒ GenTraversableOnce[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
flatten
[B]
(implicit asTraversable: (Node) ⇒ TraversableOnce[B]): Traversable[B]
-
def
fold
[A1 >: Node]
(z: A1)(op: (A1, A1) ⇒ A1): A1
-
def
foldLeft
[B]
(z: B)(op: (B, Node) ⇒ B): B
-
def
foldRight
[B]
(z: B)(op: (Node, B) ⇒ B): B
-
def
forall
(p: (Node) ⇒ Boolean): Boolean
-
def
foreach
[U]
(f: (Node) ⇒ U): Unit
-
def
genericBuilder
[B]
: Builder[B, Seq[B]]
-
def
getClass
(): java.lang.Class[_]
-
def
getNamespace
(pre: String): String
-
def
groupBy
[K]
(f: (Node) ⇒ K): Map[K, NodeSeq]
-
def
grouped
(size: Int): Iterator[NodeSeq]
-
def
hasDefiniteSize
: Boolean
-
def
hashCode
(): Int
-
def
head
: Node
-
def
headOption
: Option[Node]
-
def
indexOf
[B >: Node]
(elem: B, from: Int): Int
-
def
indexOf
[B >: Node]
(elem: B): Int
-
def
indexOfSlice
[B >: Node]
(that: Seq[B], from: Int): Int
-
def
indexOfSlice
[B >: Node]
(that: GenSeq[B], from: Int): Int
-
def
indexOfSlice
[B >: Node]
(that: Seq[B]): Int
-
def
indexOfSlice
[B >: Node]
(that: GenSeq[B]): Int
-
def
indexWhere
(p: (Node) ⇒ Boolean, from: Int): Int
-
def
indexWhere
(p: (Node) ⇒ Boolean): Int
-
def
indices
: Range
-
def
init
: NodeSeq
-
def
inits
: Iterator[NodeSeq]
-
def
intersect
[B >: Node]
(that: Seq[B]): NodeSeq
-
def
intersect
[B >: Node]
(that: GenSeq[B]): NodeSeq
-
def
isAtom
: Boolean
-
def
isDefinedAt
(idx: Int): Boolean
-
def
isEmpty
: Boolean
-
def
isInstanceOf
[T0]
: Boolean
-
def
isTraversableAgain
: Boolean
-
def
iterator
: Iterator[Node]
-
def
label
: String
-
def
last
: Node
-
def
lastIndexOf
[B >: Node]
(elem: B, end: Int): Int
-
def
lastIndexOf
[B >: Node]
(elem: B): Int
-
def
lastIndexOfSlice
[B >: Node]
(that: Seq[B], end: Int): Int
-
def
lastIndexOfSlice
[B >: Node]
(that: GenSeq[B], end: Int): Int
-
def
lastIndexOfSlice
[B >: Node]
(that: Seq[B]): Int
-
def
lastIndexOfSlice
[B >: Node]
(that: GenSeq[B]): Int
-
def
lastIndexWhere
(p: (Node) ⇒ Boolean, end: Int): Int
-
def
lastIndexWhere
(p: (Node) ⇒ Boolean): Int
-
def
lastOption
: Option[Node]
-
def
length
: Int
-
def
lengthCompare
(len: Int): Int
-
def
lift
: (Int) ⇒ Option[Node]
-
def
map
[B, That]
(f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
max
[B >: Node]
(implicit cmp: Ordering[B]): Node
-
def
maxBy
[B]
(f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
-
def
min
[B >: Node]
(implicit cmp: Ordering[B]): Node
-
def
minBy
[B]
(f: (Node) ⇒ B)(implicit cmp: Ordering[B]): Node
-
def
mkString
: String
-
def
mkString
(sep: String): String
-
def
mkString
(start: String, sep: String, end: String): String
-
def
nameToString
(sb: StringBuilder): StringBuilder
-
def
namespace
: String
-
def
ne
(arg0: AnyRef): Boolean
-
def
newBuilder
: Builder[Node, NodeSeq]
-
def
nonEmpty
: Boolean
-
def
nonEmptyChildren
: Seq[Node]
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
orElse
[A1 <: Int, B1 >: Node]
(that: PartialFunction[A1, B1]): PartialFunction[A1, B1]
-
def
padTo
[B >: Node, That]
(len: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
par
: ParSeq[Node]
-
def
parCombiner
: Combiner[Node, ParSeq[Node]]
-
def
partition
(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
-
def
patch
[B >: Node, That]
(from: Int, patch: Seq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
patch
[B >: Node, That]
(from: Int, patch: GenSeq[B], replaced: Int)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
permutations
: Iterator[NodeSeq]
-
def
prefix
: String
-
def
prefixLength
(p: (Node) ⇒ Boolean): Int
-
def
product
[B >: Node]
(implicit num: Numeric[B]): B
-
def
productArity
: Int
-
def
productElement
(arg0: Int): Any
-
def
productIterator
: Iterator[Any]
-
def
productPrefix
: String
-
def
reduce
[A1 >: Node]
(op: (A1, A1) ⇒ A1): A1
-
def
reduceLeft
[B >: Node]
(op: (B, Node) ⇒ B): B
-
def
reduceLeftOption
[B >: Node]
(op: (B, Node) ⇒ B): Option[B]
-
def
reduceOption
[A1 >: Node]
(op: (A1, A1) ⇒ A1): Option[A1]
-
def
reduceRight
[B >: Node]
(op: (Node, B) ⇒ B): B
-
def
reduceRightOption
[B >: Node]
(op: (Node, B) ⇒ B): Option[B]
-
def
repr
: NodeSeq
-
def
reverse
: NodeSeq
-
def
reverseIterator
: Iterator[Node]
-
def
reverseMap
[B, That]
(f: (Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
reversed
: List[Node]
-
def
sameElements
[B >: Node]
(that: Iterable[B]): Boolean
-
def
sameElements
[B >: Node]
(that: GenIterable[B]): Boolean
-
def
scan
[B >: Node, That]
(z: B)(op: (B, B) ⇒ B)(implicit cbf: CanBuildFrom[NodeSeq, B, That]): That
-
def
scanLeft
[B, That]
(z: B)(op: (B, Node) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
scanRight
[B, That]
(z: B)(op: (Node, B) ⇒ B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
scope
: NamespaceBinding
-
def
segmentLength
(p: (Node) ⇒ Boolean, from: Int): Int
-
def
seq
: Seq[Node]
-
def
size
: Int
-
def
slice
(from: Int, until: Int): NodeSeq
-
def
sliding
[B >: Node]
(size: Int, step: Int): Iterator[NodeSeq]
-
def
sliding
[B >: Node]
(size: Int): Iterator[NodeSeq]
-
def
sortBy
[B]
(f: (Node) ⇒ B)(implicit ord: Ordering[B]): NodeSeq
-
def
sortWith
(lt: (Node, Node) ⇒ Boolean): NodeSeq
-
def
sorted
[B >: Node]
(implicit ord: Ordering[B]): NodeSeq
-
def
span
(p: (Node) ⇒ Boolean): (NodeSeq, NodeSeq)
-
def
splitAt
(n: Int): (NodeSeq, NodeSeq)
-
def
startsWith
[B]
(that: Seq[B], offset: Int): Boolean
-
def
startsWith
[B]
(that: GenSeq[B], offset: Int): Boolean
-
def
startsWith
[B]
(that: Seq[B]): Boolean
-
def
startsWith
[B]
(that: GenSeq[B]): Boolean
-
def
strict_!=
(other: Equality): Boolean
-
def
strict_==
(other: Equality): Boolean
-
def
stringPrefix
: String
-
def
sum
[B >: Node]
(implicit num: Numeric[B]): B
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
tail
: NodeSeq
-
def
tails
: Iterator[NodeSeq]
-
def
take
(n: Int): NodeSeq
-
def
takeRight
(n: Int): NodeSeq
-
def
takeWhile
(p: (Node) ⇒ Boolean): NodeSeq
-
def
text
: String
-
def
theSeq
: Seq[Node]
-
def
thisCollection
: Seq[Node]
-
def
toArray
[B >: Node]
(implicit arg0: ClassManifest[B]): Array[B]
-
def
toBuffer
[B >: Node]
: Buffer[B]
-
def
toCollection
(repr: NodeSeq): Seq[Node]
-
def
toIndexedSeq
[B >: Node]
: IndexedSeq[B]
-
def
toIterable
: Iterable[Node]
-
def
toIterator
: Iterator[Node]
-
def
toJs
: JsExp
-
def
toList
: List[Node]
-
def
toMap
[T, U]
(implicit ev: <:<[Node, (T, U)]): Map[T, U]
-
def
toSeq
: Seq[Node]
-
def
toSet
[B >: Node]
: Set[B]
-
def
toStream
: Stream[Node]
-
def
toString
(): String
-
def
toTraversable
: Traversable[Node]
-
def
transpose
[B]
(implicit asTraversable: (Node) ⇒ TraversableOnce[B]): Traversable[Traversable[B]]
-
def
union
[B >: Node, That]
(that: GenSeq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
union
[B >: Node, That]
(that: Seq[B])(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
unzip
[A1, A2]
(implicit asPair: (Node) ⇒ (A1, A2)): (Seq[A1], Seq[A2])
-
def
unzip3
[A1, A2, A3]
(implicit asTriple: (Node) ⇒ (A1, A2, A3)): (Seq[A1], Seq[A2], Seq[A3])
-
def
updated
[B >: Node, That]
(index: Int, elem: B)(implicit bf: CanBuildFrom[NodeSeq, B, That]): That
-
def
view
(from: Int, until: Int): SeqView[Node, NodeSeq]
-
def
view
: SeqView[Node, NodeSeq]
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
-
def
withFilter
(p: (Node) ⇒ Boolean): FilterMonadic[Node, NodeSeq]
-
def
xmlType
(): TypeSymbol
-
def
xml_!=
(other: Any): Boolean
-
def
xml_==
(other: Any): Boolean
-
def
xml_sameElements
[A]
(that: Iterable[A]): Boolean
-
def
yieldFunction
: JsExp
-
def
zip
[A1 >: Node, B, That]
(that: Iterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
-
def
zip
[A1 >: Node, B, That]
(that: GenIterable[B])(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
-
def
zipAll
[B, A1 >: Node, That]
(that: Iterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
-
def
zipAll
[B, A1 >: Node, That]
(that: GenIterable[B], thisElem: A1, thatElem: B)(implicit bf: CanBuildFrom[NodeSeq, (A1, B), That]): That
-
def
zipWithIndex
[A1 >: Node, That]
(implicit bf: CanBuildFrom[NodeSeq, (A1, Int), That]): That
Deprecated Value Members
-
def
elements
: Iterator[Node]
-
def
equalsWith
[B]
(that: Seq[B])(f: (Node, B) ⇒ Boolean): Boolean
-
def
findIndexOf
(p: (Node) ⇒ Boolean): Int
-
def
findLastIndexOf
(p: (Node) ⇒ Boolean): Int
-
def
first
: Node
-
def
firstOption
: Option[Node]
-
def
productElements
: Iterator[Any]
-
def
projection
: SeqView[Node, NodeSeq]
-
def
reversedElements
: Iterator[Node]
Inherited from Serializable
Inherited from Serializable
Inherited from Product
Inherited from Node
Inherited from NodeSeq
Inherited from Equality
Inherited from Seq[Node]
Inherited from Seq[Node]
Inherited from SeqLike[Node, NodeSeq]
Inherited from GenSeq[Node]
Inherited from GenSeqLike[Node, NodeSeq]
Inherited from PartialFunction[Int, Node]
Inherited from (Int) ⇒ Node
Inherited from Iterable[Node]
Inherited from Iterable[Node]
Inherited from IterableLike[Node, NodeSeq]
Inherited from Equals
Inherited from GenIterable[Node]
Inherited from GenIterableLike[Node, NodeSeq]
Inherited from Traversable[Node]
Inherited from Immutable
Inherited from Traversable[Node]
Inherited from GenTraversable[Node]
Inherited from GenericTraversableTemplate[Node, Seq]
Inherited from TraversableLike[Node, NodeSeq]
Inherited from GenTraversableLike[Node, NodeSeq]
Inherited from Parallelizable[Node, ParSeq[Node]]
Inherited from TraversableOnce[Node]
Inherited from GenTraversableOnce[Node]
Inherited from FilterMonadic[Node, NodeSeq]
Inherited from HasNewBuilder[Node, NodeSeq]
Inherited from AnyRef
Inherited from Any