Append given object to this buffer, returns reference on this
NodeBuffer
for convenience.
Append given object to this buffer, returns reference on this
NodeBuffer
for convenience. Some rules apply:
- If argument o
is null
, it is ignored.
- If it is an Iterator
or Iterable
, its elements will be added.
- If o
is a node, it is added as it is.
- If it is anything else, it gets wrapped in an scala.xml.Atom.
converts to an xml node and adds to this node buffer
this nodebuffer
(Changed in version 2.8.0) ++
creates a new buffer. Use ++=
to add an element from this buffer and return that buffer itself.
(Changed in version 2.8.0) -
creates a new buffer. Use -=
to remove an element from this buffer and return that buffer itself.
(Changed in version 2.8.0) -
creates a new buffer. Use -=
to remove an element from this buffer and return that buffer itself.
(Changed in version 2.8.0) --
creates a new buffer. Use --=
to remove an element from this buffer and return that buffer itself.
Projection function, which returns elements of this
sequence based
on the string that
.
Projection function, which returns elements of this
sequence based
on the string that
. Use:
this \ "foo"
to get a list of all elements that are labelled with "foo"
;\ "_"
to get a list of all elements (wildcard);ns \ "@foo"
to get the unprefixed attribute "foo"
;ns \ "@{uri}foo"
to get the prefixed attribute "pre:foo"
whose
prefix "pre"
is resolved to the namespace "uri"
.For attribute projections, the resulting scala.xml.NodeSeq attribute values are wrapped in a scala.xml.Group.
There is no support for searching a prefixed attribute by its literal prefix.
The document order is preserved.
Convenience method which returns string text of the named attribute.
Convenience method which returns string text of the named attribute. Use:
that \@ "foo"
to get the string text of attribute "foo"
;
Projection function, which returns elements of this
sequence and of
all its subsequences, based on the string that
.
Projection function, which returns elements of this
sequence and of
all its subsequences, based on the string that
. Use:
this \\ 'foo
to get a list of all elements that are labelled with "foo"
;\\ "_"
to get a list of all elements (wildcard);ns \\ "@foo"
to get the unprefixed attribute "foo"
;ns \\ "@{uri}foo"
to get each prefixed attribute "pre:foo"
whose
prefix "pre"
is resolved to the namespace "uri"
.For attribute projections, the resulting scala.xml.NodeSeq attribute values are wrapped in a scala.xml.Group.
There is no support for searching a prefixed attribute by its literal prefix.
The document order is preserved.
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(nodeBuffer: NodeSeq).++(that)(bf)
(nodeBuffer: NodeSeq).++:(that)(bf)
(nodeBuffer: NodeSeq).++:(that)(bf)
(nodeBuffer: NodeSeq).+:(elem)(bf)
(nodeBuffer: NodeSeq)./:(z)(op)
(nodeBuffer: NodeSeq).:+(elem)(bf)
(nodeBuffer: NodeSeq).:\(z)(op)
(nodeBuffer: NodeSeq).addString(b)
(nodeBuffer: NodeSeq).addString(b, sep)
(nodeBuffer: NodeSeq).addString(b, start, sep, end)
(nodeBuffer: NodeSeq).aggregate(z)(seqop, combop)
(nodeBuffer: NodeSeq).andThen(k)
(nodeBuffer: NodeSeq).apply(f)
(nodeBuffer: NodeSeq).apply(i)
(nodeBuffer: NodeSeq).applyOrElse(x, default)
We insist we're only equal to other xml.Equality
implementors,
which heads off a lot of inconsistency up front.
We insist we're only equal to other xml.Equality
implementors,
which heads off a lot of inconsistency up front.
(nodeBuffer: NodeSeq).canEqual(other)
(nodeBuffer: NodeSeq).collect(pf)(bf)
(nodeBuffer: NodeSeq).collectFirst(pf)
(nodeBuffer: NodeSeq).combinations(n)
(nodeBuffer: NodeSeq).companion
(nodeBuffer: NodeSeq).compose(g)
(nodeBuffer: NodeSeq).contains(elem)
(nodeBuffer: NodeSeq).containsSlice(that)
(nodeBuffer: NodeSeq).copyToArray(xs, start, len)
(nodeBuffer: NodeSeq).copyToArray(xs)
(nodeBuffer: NodeSeq).copyToArray(xs, start)
(nodeBuffer: NodeSeq).copyToBuffer(dest)
(nodeBuffer: NodeSeq).corresponds(that)(p)
(nodeBuffer: NodeSeq).count(p)
(nodeBuffer: NodeSeq).diff(that)
(nodeBuffer: NodeSeq).distinct
(nodeBuffer: NodeSeq).drop(n)
(nodeBuffer: NodeSeq).dropRight(n)
(nodeBuffer: NodeSeq).dropWhile(p)
(nodeBuffer: NodeSeq).endsWith(that)
(nodeBuffer: NodeSeq).equals(other)
(nodeBuffer: NodeSeq).exists(p)
(nodeBuffer: NodeSeq).filter(p)
(nodeBuffer: MonadOps[Node]).filter(p)
(nodeBuffer: NodeSeq).filterNot(p)
(nodeBuffer: NodeSeq).find(p)
(nodeBuffer: NodeSeq).flatMap(f)(bf)
(nodeBuffer: MonadOps[Node]).flatMap(f)
(nodeBuffer: NodeSeq).flatten(asTraversable)
(nodeBuffer: FlattenOps[Node]).flatten
(nodeBuffer: NodeSeq).fold(z)(op)
(nodeBuffer: NodeSeq).foldLeft(z)(op)
(nodeBuffer: NodeSeq).foldRight(z)(op)
(nodeBuffer: NodeSeq).forall(p)
(nodeBuffer: NodeSeq).foreach(f)
(nodeBuffer: NodeSeq).genericBuilder
(nodeBuffer: NodeSeq).groupBy(f)
(nodeBuffer: NodeSeq).grouped(size)
(nodeBuffer: NodeSeq).hasDefiniteSize
It's be nice to make these final, but there are probably people out there subclassing the XML types, especially when it comes to equals.
It's be nice to make these final, but there are probably people out there subclassing the XML types, especially when it comes to equals. However WE at least can pretend they are final since clearly individual classes cannot be trusted to maintain a semblance of order.
(nodeBuffer: NodeSeq).hashCode()
(nodeBuffer: NodeSeq).head
(nodeBuffer: NodeSeq).headOption
(nodeBuffer: NodeSeq).indexOf(elem, from)
(nodeBuffer: NodeSeq).indexOf(elem)
(nodeBuffer: NodeSeq).indexOfSlice(that, from)
(nodeBuffer: NodeSeq).indexOfSlice(that)
(nodeBuffer: NodeSeq).indexWhere(p, from)
(nodeBuffer: NodeSeq).indexWhere(p)
(nodeBuffer: NodeSeq).indices
(nodeBuffer: NodeSeq).init
(nodeBuffer: NodeSeq).inits
(nodeBuffer: NodeSeq).intersect(that)
(nodeBuffer: NodeSeq).isDefinedAt(idx)
(nodeBuffer: NodeSeq).isEmpty
(nodeBuffer: NodeSeq).isTraversableAgain
(nodeBuffer: NodeSeq).iterator
(nodeBuffer: NodeSeq).last
(nodeBuffer: NodeSeq).lastIndexOf(elem, end)
(nodeBuffer: NodeSeq).lastIndexOf(elem)
(nodeBuffer: NodeSeq).lastIndexOfSlice(that, end)
(nodeBuffer: NodeSeq).lastIndexOfSlice(that)
(nodeBuffer: NodeSeq).lastIndexWhere(p, end)
(nodeBuffer: NodeSeq).lastIndexWhere(p)
(nodeBuffer: NodeSeq).lastOption
(nodeBuffer: NodeSeq).length
(nodeBuffer: NodeSeq).lengthCompare(len)
(nodeBuffer: NodeSeq).lift
(nodeBuffer: NodeSeq).map(f)(bf)
(nodeBuffer: MonadOps[Node]).map(f)
(nodeBuffer: NodeSeq).max(cmp)
(nodeBuffer: NodeSeq).maxBy(f)(cmp)
(nodeBuffer: NodeSeq).min(cmp)
(nodeBuffer: NodeSeq).minBy(f)(cmp)
(nodeBuffer: NodeSeq).mkString
(nodeBuffer: NodeSeq).mkString(sep)
(nodeBuffer: NodeSeq).mkString(start, sep, end)
(nodeBuffer: NodeSeq).nonEmpty
(nodeBuffer: NodeSeq).orElse(that)
(nodeBuffer: NodeSeq).padTo(len, elem)(bf)
(nodeBuffer: NodeSeq).par
(nodeBuffer: NodeSeq).partition(p)
(nodeBuffer: NodeSeq).patch(from, patch, replaced)(bf)
(nodeBuffer: NodeSeq).permutations
(nodeBuffer: NodeSeq).prefixLength(p)
(nodeBuffer: NodeSeq).product(num)
(nodeBuffer: NodeSeq).reduce(op)
(nodeBuffer: NodeSeq).reduceLeft(op)
(nodeBuffer: NodeSeq).reduceLeftOption(op)
(nodeBuffer: NodeSeq).reduceOption(op)
(nodeBuffer: NodeSeq).reduceRight(op)
(nodeBuffer: NodeSeq).reduceRightOption(op)
(nodeBuffer: NodeSeq).repr
(nodeBuffer: NodeSeq).reverse
(nodeBuffer: NodeSeq).reverseIterator
(nodeBuffer: NodeSeq).reverseMap(f)(bf)
(nodeBuffer: NodeSeq).runWith(action)
(nodeBuffer: NodeSeq).sameElements(that)
(nodeBuffer: NodeSeq).scan(z)(op)(cbf)
(nodeBuffer: NodeSeq).scanLeft(z)(op)(bf)
(nodeBuffer: NodeSeq).scanRight(z)(op)(bf)
(Changed in version 2.9.0) The behavior of scanRight
has changed. The previous behavior can be reproduced with scanRight.reverse.
(nodeBuffer: NodeSeq).segmentLength(p, from)
(nodeBuffer: NodeSeq).seq
(nodeBuffer: NodeSeq).size
(nodeBuffer: NodeSeq).slice(from, until)
(nodeBuffer: NodeSeq).sliding(size, step)
(nodeBuffer: NodeSeq).sliding(size)
(nodeBuffer: NodeSeq).sortBy(f)(ord)
(nodeBuffer: NodeSeq).sortWith(lt)
(nodeBuffer: NodeSeq).sorted(ord)
(nodeBuffer: NodeSeq).span(p)
(nodeBuffer: NodeSeq).splitAt(n)
(nodeBuffer: NodeSeq).startsWith(that, offset)
(nodeBuffer: NodeSeq).startsWith(that)
(nodeBuffer: NodeSeq).stringPrefix
(nodeBuffer: NodeSeq).sum(num)
(nodeBuffer: NodeSeq).tail
(nodeBuffer: NodeSeq).tails
(nodeBuffer: NodeSeq).take(n)
(nodeBuffer: NodeSeq).takeRight(n)
(nodeBuffer: NodeSeq).takeWhile(p)
(nodeBuffer: NodeSeq).to(cbf)
(nodeBuffer: NodeSeq).toArray(arg0)
(nodeBuffer: NodeSeq).toBuffer
(nodeBuffer: NodeSeq).toIndexedSeq
(nodeBuffer: NodeSeq).toIterable
(nodeBuffer: NodeSeq).toIterator
(nodeBuffer: NodeSeq).toList
(nodeBuffer: NodeSeq).toMap(ev)
(nodeBuffer: NodeSeq).toSeq
(nodeBuffer: NodeSeq).toSet
(nodeBuffer: NodeSeq).toStream
(nodeBuffer: NodeSeq).toString()
(nodeBuffer: NodeSeq).toTraversable
(nodeBuffer: NodeSeq).toVector
(nodeBuffer: NodeSeq).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(nodeBuffer: NodeSeq).union(that)(bf)
(nodeBuffer: NodeSeq).unzip(asPair)
(nodeBuffer: NodeSeq).unzip3(asTriple)
(nodeBuffer: NodeSeq).updated(index, elem)(bf)
(nodeBuffer: NodeSeq).view(from, until)
(nodeBuffer: NodeSeq).view
(nodeBuffer: NodeSeq).withFilter(p)
(nodeBuffer: MonadOps[Node]).withFilter(p)
(nodeBuffer: NodeSeq).zip(that)(bf)
(nodeBuffer: NodeSeq).zipAll(that, thisElem, thatElem)(bf)
(nodeBuffer: NodeSeq).zipWithIndex(bf)
This class acts as a Buffer for nodes. If it is used as a sequence of nodes
Seq[Node]
, it must be ensured that no updates occur after that point, becausescala.xml.Node
is assumed to be immutable.Despite this being a sequence, don't use it as key in a hashtable. Calling the hashcode function will result in a runtime error.
1.0