Creates a child transformer
Creates a child transformer
A strategy for converting numbers to text which may wish to use different formatters or Locales
A strategy for converting numbers to text which may wish to use different formatters or Locales
Transforms the given nodes passing in a block which is used to configure a new transformer to transform the nodes.
Transforms the given nodes passing in a block which is used to configure a new transformer to transform the nodes. This method is typically used when performing nested transformations such as transforming one or more nodes when inside a transformation rule itself.
(transform: Iterable[Node])./:(z)(op)
(transform: NodeSeq)./:(z)(op)
(transform: NodeSeq)./:(z)(op)
(transform: Iterable[Node]).:\(z)(op)
(transform: NodeSeq).:\(z)(op)
(transform: NodeSeq).:\(z)(op)
(transform: NodeSeq).\(that)
(transform: NodeSeq).\(that)
(transform: NodeSeq).\@(attributeName)
(transform: NodeSeq).\@(attributeName)
(transform: NodeSeq).\\(that)
(transform: NodeSeq).\\(that)
(transform: Iterable[Node]).addString(b)
(transform: Iterable[Node]).addString(b, sep)
(transform: Iterable[Node]).addString(b, start, sep, end)
(transform: NodeSeq).addString(b)
(transform: NodeSeq).addString(b, sep)
(transform: NodeSeq).addString(b, start, sep, end)
(transform: NodeSeq).addString(b)
(transform: NodeSeq).addString(b, sep)
(transform: NodeSeq).addString(b, start, sep, end)
(transform: Iterable[Node]).aggregate(z)(seqop, combop)
(transform: NodeSeq).aggregate(z)(seqop, combop)
(transform: NodeSeq).aggregate(z)(seqop, combop)
(transform: NodeSeq).andThen(k)
(transform: NodeSeq).andThen(k)
(transform: NodeSeq).apply(f)
(transform: NodeSeq).apply(i)
(transform: NodeSeq).apply(f)
(transform: NodeSeq).apply(i)
(transform: Iterable[Node]).canEqual(that)
(transform: NodeSeq).canEqual(other)
(transform: NodeSeq).canEqual(other)
(transform: Iterable[Node]).collect(pf)(bf)
(transform: NodeSeq).collect(pf)(bf)
(transform: NodeSeq).collect(pf)(bf)
(transform: Iterable[Node]).collectFirst(pf)
(transform: NodeSeq).collectFirst(pf)
(transform: NodeSeq).collectFirst(pf)
(transform: NodeSeq).combinations(n)
(transform: NodeSeq).combinations(n)
(transform: Iterable[Node]).companion
(transform: NodeSeq).companion
(transform: NodeSeq).companion
(transform: NodeSeq).compose(g)
(transform: NodeSeq).compose(g)
(transform: NodeSeq).containsSlice(that)
(transform: NodeSeq).containsSlice(that)
(transform: NodeSeq).corresponds(that)(p)
(transform: NodeSeq).corresponds(that)(p)
(transform: Iterable[Node]).count(p)
(transform: NodeSeq).count(p)
(transform: NodeSeq).count(p)
(transform: NodeSeq).distinct
(transform: NodeSeq).distinct
(transform: Iterable[Node]).drop(n)
(transform: NodeSeq).drop(n)
(transform: NodeSeq).drop(n)
(transform: Iterable[Node]).dropRight(n)
(transform: NodeSeq).dropRight(n)
(transform: NodeSeq).dropRight(n)
(transform: Iterable[Node]).dropWhile(p)
(transform: NodeSeq).dropWhile(p)
(transform: NodeSeq).dropWhile(p)
(transform: NodeSeq).endsWith(that)
(transform: NodeSeq).endsWith(that)
(transform: NodeSeq).equals(other)
(transform: NodeSeq).equals(other)
(transform: Iterable[Node]).exists(p)
(transform: NodeSeq).exists(p)
(transform: NodeSeq).exists(p)
(transform: Iterable[Node]).filter(p)
(transform: NodeSeq).filter(p)
(transform: NodeSeq).filter(p)
(transform: Iterable[Node]).filterNot(p)
(transform: NodeSeq).filterNot(p)
(transform: NodeSeq).filterNot(p)
(transform: Iterable[Node]).find(p)
(transform: NodeSeq).find(p)
(transform: NodeSeq).find(p)
(transform: Iterable[Node]).flatMap(f)(bf)
(transform: NodeSeq).flatMap(f)(bf)
(transform: NodeSeq).flatMap(f)(bf)
(transform: Iterable[Node]).flatten(asTraversable)
(transform: NodeSeq).flatten(asTraversable)
(transform: NodeSeq).flatten(asTraversable)
(transform: Iterable[Node]).foldLeft(z)(op)
(transform: NodeSeq).foldLeft(z)(op)
(transform: NodeSeq).foldLeft(z)(op)
(transform: Iterable[Node]).foldRight(z)(op)
(transform: NodeSeq).foldRight(z)(op)
(transform: NodeSeq).foldRight(z)(op)
(transform: Iterable[Node]).forall(p)
(transform: NodeSeq).forall(p)
(transform: NodeSeq).forall(p)
(transform: Iterable[Node]).foreach(f)
(transform: NodeSeq).foreach(f)
(transform: NodeSeq).foreach(f)
(transform: Iterable[Node]).genericBuilder
(transform: NodeSeq).genericBuilder
(transform: NodeSeq).genericBuilder
(transform: Iterable[Node]).groupBy(f)
(transform: NodeSeq).groupBy(f)
(transform: NodeSeq).groupBy(f)
(transform: Iterable[Node]).grouped(size)
(transform: NodeSeq).grouped(size)
(transform: NodeSeq).grouped(size)
(transform: Iterable[Node]).hasDefiniteSize
(transform: NodeSeq).hasDefiniteSize
(transform: NodeSeq).hasDefiniteSize
(transform: NodeSeq).hashCode()
(transform: NodeSeq).hashCode()
(transform: Iterable[Node]).head
(transform: NodeSeq).head
(transform: NodeSeq).head
(transform: Iterable[Node]).headOption
(transform: NodeSeq).headOption
(transform: NodeSeq).headOption
(transform: NodeSeq).indexWhere(p, from)
(transform: NodeSeq).indexWhere(p)
(transform: NodeSeq).indexWhere(p, from)
(transform: NodeSeq).indexWhere(p)
(transform: NodeSeq).indices
(transform: NodeSeq).indices
(transform: Iterable[Node]).init
(transform: NodeSeq).init
(transform: NodeSeq).init
(transform: Iterable[Node]).inits
(transform: NodeSeq).inits
(transform: NodeSeq).inits
(transform: NodeSeq).isDefinedAt(idx)
(transform: NodeSeq).isDefinedAt(idx)
(transform: Iterable[Node]).isEmpty
(transform: NodeSeq).isEmpty
(transform: NodeSeq).isEmpty
(transform: Iterable[Node]).isTraversableAgain
(transform: NodeSeq).isTraversableAgain
(transform: NodeSeq).isTraversableAgain
(transform: Iterable[Node]).iterator
(transform: NodeSeq).iterator
(transform: NodeSeq).iterator
(transform: Iterable[Node]).last
(transform: NodeSeq).last
(transform: NodeSeq).last
(transform: NodeSeq).lastIndexWhere(p, end)
(transform: NodeSeq).lastIndexWhere(p)
(transform: NodeSeq).lastIndexWhere(p, end)
(transform: NodeSeq).lastIndexWhere(p)
(transform: Iterable[Node]).lastOption
(transform: NodeSeq).lastOption
(transform: NodeSeq).lastOption
(transform: NodeSeq).length
(transform: NodeSeq).length
(transform: NodeSeq).lengthCompare(len)
(transform: NodeSeq).lengthCompare(len)
(transform: NodeSeq).lift
(transform: NodeSeq).lift
(transform: Iterable[Node]).map(f)(bf)
(transform: NodeSeq).map(f)(bf)
(transform: NodeSeq).map(f)(bf)
(transform: Iterable[Node]).maxBy(f)(cmp)
(transform: NodeSeq).maxBy(f)(cmp)
(transform: NodeSeq).maxBy(f)(cmp)
(transform: Iterable[Node]).minBy(f)(cmp)
(transform: NodeSeq).minBy(f)(cmp)
(transform: NodeSeq).minBy(f)(cmp)
(transform: Iterable[Node]).mkString
(transform: Iterable[Node]).mkString(sep)
(transform: Iterable[Node]).mkString(start, sep, end)
(transform: NodeSeq).mkString
(transform: NodeSeq).mkString(sep)
(transform: NodeSeq).mkString(start, sep, end)
(transform: NodeSeq).mkString
(transform: NodeSeq).mkString(sep)
(transform: NodeSeq).mkString(start, sep, end)
(transform: Iterable[Node]).nonEmpty
(transform: NodeSeq).nonEmpty
(transform: NodeSeq).nonEmpty
(transform: Iterable[Node]).par
(transform: NodeSeq).par
(transform: NodeSeq).par
(transform: Iterable[Node]).partition(p)
(transform: NodeSeq).partition(p)
(transform: NodeSeq).partition(p)
(transform: NodeSeq).permutations
(transform: NodeSeq).permutations
(transform: NodeSeq).prefixLength(p)
(transform: NodeSeq).prefixLength(p)
(transform: Iterable[Node]).repr
(transform: NodeSeq).repr
(transform: NodeSeq).repr
(transform: NodeSeq).reverse
(transform: NodeSeq).reverse
(transform: NodeSeq).reverseIterator
(transform: NodeSeq).reverseIterator
(transform: NodeSeq).reverseMap(f)(bf)
(transform: NodeSeq).reverseMap(f)(bf)
(transform: NodeSeq).runWith(action)
(transform: NodeSeq).runWith(action)
(transform: Iterable[Node]).scanLeft(z)(op)(bf)
(transform: NodeSeq).scanLeft(z)(op)(bf)
(transform: NodeSeq).scanLeft(z)(op)(bf)
(transform: Iterable[Node]).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.
(transform: 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.
(transform: 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.
(transform: NodeSeq).segmentLength(p, from)
(transform: NodeSeq).segmentLength(p, from)
(transform: Iterable[Node]).seq
(transform: NodeSeq).seq
(transform: NodeSeq).seq
(transform: Iterable[Node]).size
(transform: NodeSeq).size
(transform: NodeSeq).size
(transform: Iterable[Node]).slice(from, until)
(transform: NodeSeq).slice(from, until)
(transform: NodeSeq).slice(from, until)
(transform: Iterable[Node]).sliding(size, step)
(transform: Iterable[Node]).sliding(size)
(transform: NodeSeq).sliding(size, step)
(transform: NodeSeq).sliding(size)
(transform: NodeSeq).sliding(size, step)
(transform: NodeSeq).sliding(size)
(transform: NodeSeq).sortBy(f)(ord)
(transform: NodeSeq).sortBy(f)(ord)
(transform: NodeSeq).sortWith(lt)
(transform: NodeSeq).sortWith(lt)
(transform: Iterable[Node]).span(p)
(transform: NodeSeq).span(p)
(transform: NodeSeq).span(p)
(transform: Iterable[Node]).splitAt(n)
(transform: NodeSeq).splitAt(n)
(transform: NodeSeq).splitAt(n)
(transform: NodeSeq).startsWith(that, offset)
(transform: NodeSeq).startsWith(that)
(transform: NodeSeq).startsWith(that, offset)
(transform: NodeSeq).startsWith(that)
(transform: NodeSeq).strict_!=(other)
(transform: NodeSeq).strict_!=(other)
(transform: NodeSeq).strict_==(other)
(transform: NodeSeq).strict_==(other)
(transform: Iterable[Node]).stringPrefix
(transform: NodeSeq).stringPrefix
(transform: NodeSeq).stringPrefix
(transform: Iterable[Node]).tail
(transform: NodeSeq).tail
(transform: NodeSeq).tail
(transform: Iterable[Node]).tails
(transform: NodeSeq).tails
(transform: NodeSeq).tails
(transform: Iterable[Node]).take(n)
(transform: NodeSeq).take(n)
(transform: NodeSeq).take(n)
(transform: Iterable[Node]).takeRight(n)
(transform: NodeSeq).takeRight(n)
(transform: NodeSeq).takeRight(n)
(transform: Iterable[Node]).takeWhile(p)
(transform: NodeSeq).takeWhile(p)
(transform: NodeSeq).takeWhile(p)
(transform: NodeSeq).text
(transform: NodeSeq).text
(transform: NodeSeq).theSeq
(transform: NodeSeq).theSeq
(transform: Iterable[Node]).to(cbf)
(transform: NodeSeq).to(cbf)
(transform: NodeSeq).to(cbf)
(transform: Iterable[Node]).toBuffer
(transform: NodeSeq).toBuffer
(transform: NodeSeq).toBuffer
(transform: Iterable[Node]).toIndexedSeq
(transform: NodeSeq).toIndexedSeq
(transform: NodeSeq).toIndexedSeq
(transform: Iterable[Node]).toIterable
(transform: NodeSeq).toIterable
(transform: NodeSeq).toIterable
(transform: Iterable[Node]).toIterator
(transform: NodeSeq).toIterator
(transform: NodeSeq).toIterator
(transform: Iterable[Node]).toList
(transform: NodeSeq).toList
(transform: NodeSeq).toList
(transform: Iterable[Node]).toMap(ev)
(transform: NodeSeq).toMap(ev)
(transform: NodeSeq).toMap(ev)
(transform: Iterable[Node]).toSeq
(transform: NodeSeq).toSeq
(transform: NodeSeq).toSeq
(transform: Iterable[Node]).toSet
(transform: NodeSeq).toSet
(transform: NodeSeq).toSet
(transform: Iterable[Node]).toStream
(transform: NodeSeq).toStream
(transform: NodeSeq).toStream
(transform: Iterable[Node]).toString()
(transform: NodeSeq).toString()
(transform: NodeSeq).toString()
(transform: Iterable[Node]).toTraversable
(transform: NodeSeq).toTraversable
(transform: NodeSeq).toTraversable
(transform: Iterable[Node]).toVector
(transform: NodeSeq).toVector
(transform: NodeSeq).toVector
(transform: Iterable[Node]).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(transform: NodeSeq).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(transform: NodeSeq).transpose(asTraversable)
(Changed in version 2.9.0) transpose
throws an IllegalArgumentException
if collections are not uniformly sized.
(transform: Iterable[Node]).unzip(asPair)
(transform: NodeSeq).unzip(asPair)
(transform: NodeSeq).unzip(asPair)
(transform: Iterable[Node]).unzip3(asTriple)
(transform: NodeSeq).unzip3(asTriple)
(transform: NodeSeq).unzip3(asTriple)
(transform: Iterable[Node]).view(from, until)
(transform: Iterable[Node]).view
(transform: NodeSeq).view(from, until)
(transform: NodeSeq).view
(transform: NodeSeq).view(from, until)
(transform: NodeSeq).view
(transform: Iterable[Node]).withFilter(p)
(transform: NodeSeq).withFilter(p)
(transform: NodeSeq).withFilter(p)
(transform: NodeSeq).xml_!=(other)
(transform: NodeSeq).xml_!=(other)
(transform: NodeSeq).xml_==(other)
(transform: NodeSeq).xml_==(other)
(transform: NodeSeq).xml_sameElements(that)
(transform: NodeSeq).xml_sameElements(that)
A helper class to make it easier to write new transformers within loops inside a ancestor transformer