tql

Type Members

implicit class CTWithResult[U <: T] extends AnyRef

Definition Classes
Combinators
abstract class CollectInType[C[_]] extends AnyRef

Definition Classes
Combinators
trait Collector[C, A, R] extends AnyRef

Definition Classes
Combinators
abstract class DelayedMeta extends AnyRef

Definition Classes
CollectionLikeUI
class Evaluator[V] extends AnyRef

Definition Classes
CollectionLikeUI
class EvaluatorAndThen[V, +A] extends AnyRef

Definition Classes
CollectionLikeUI
class EvaluatorAndThenCollector[V, C[_]] extends AnyRef

Definition Classes
CollectionLikeUI
class EvaluatorCollector[V, C[_]] extends AnyRef

Definition Classes
CollectionLikeUI
class EvaluatorMeta[V] extends AnyRef

Definition Classes
CollectionLikeUI
class EvaluatorMetaCollector[V, C[_]] extends AnyRef

Definition Classes
CollectionLikeUI
class ForceResult[V, A, R] extends AnyRef

Definition Classes
CollectionLikeUI
type MatchResult[A] = Option[(T, A)]

Definition Classes
Traverser
abstract class Matcher[+A] extends (T) ⇒ MatchResult[A]

Definition Classes
Traverser
trait MatcherApply[A, R, V, L] extends AnyRef

Definition Classes
CollectionLikeUI
implicit class MatcherResultEnhancer[A] extends AnyRef

Definition Classes
SyntaxEnhancer
implicit class MatcherXPath[A] extends AnyRef

Definition Classes
SyntaxEnhancer
implicit class TEnhancer extends AnyRef

Definition Classes
SyntaxEnhancer
trait TransformResultTr[A, R] extends AnyRef

Definition Classes
CollectionLikeUI
implicit class TreeMapperEnhancer[A] extends AnyRef

Definition Classes
SyntaxEnhancer

Abstract Value Members

abstract def traverse[A](tree: T, f: Matcher[A])(implicit arg0: Monoid[A]): MatchResult[A]

Definition Classes
Traverser

Concrete Value Members

def @@[U <: T](implicit arg0: ClassTag[U]): (Combinators.this)#Matcher[U]

Definition Classes
Combinators
object Collector

Definition Classes
Combinators
def Matcher[A](f: (T) ⇒ MatchResult[A]): Matcher[A]

Definition Classes
Traverser
object MatcherApply

Definition Classes
CollectionLikeUI
implicit def MatcherResultToResult[A](a: (SyntaxEnhancer.this)#MatchResult[A])(implicit arg0: Monoid[A]): A

Definition Classes
SyntaxEnhancer
implicit def MatcherResultToTree(a: (SyntaxEnhancer.this)#MatchResult[_]): Option[T]

Definition Classes
SyntaxEnhancer
def bottomUp[A](m: ⇒ (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def bottomUpAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

Definition Classes
SyntaxEnhancer
def bottomUpBreak[A](m: (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def bottomUpBreakAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

Definition Classes
SyntaxEnhancer
def children[A](f: ⇒ (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def childrenAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

Definition Classes
SyntaxEnhancer
def collect[C[_]]: (Combinators.this)#CollectInType[C]

Definition Classes
Combinators
def collect2[V[_, _]]: AnyRef { def apply[A, B](f: PartialFunction[T,(A, B)])(implicit x: scala.reflect.ClassTag[T],implicit y: scala.collection.generic.CanBuildFrom[V[A,B],(A, B),V[A,B]]): Combinators.this.Matcher[V[A,B]] }

Definition Classes
Combinators
implicit def collectionLikeUIForTree[V <: Tree](v: V): Evaluator[V]

Definition Classes
Api
implicit def collectionLikeUIForTreeopt[V <: Tree](v: Option[V]): Evaluator[Option[V]]

Definition Classes
Api
implicit def collectionLikeUIForTrees[V <: Tree](v: collection.immutable.Seq[V]): Evaluator[collection.immutable.Seq[V]]

Definition Classes
Api
implicit def collectionLikeUIForTreess[V <: Tree](v: collection.immutable.Seq[collection.immutable.Seq[V]]): Evaluator[collection.immutable.Seq[collection.immutable.Seq[V]]]

Definition Classes
Api
def fix[A](f: ((Combinators.this)#Matcher[A]) ⇒ (Combinators.this)#Matcher[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
macro def focus(f: PartialFunction[T, Boolean]): (Combinators.this)#Matcher[T]

Definition Classes
Combinators
implicit def forceResultUI[V, A, R](x: EvaluatorAndThen[V, A])(implicit arg0: Monoid[A]): ForceResult[V, A, R]

Definition Classes
Api
def guard[U <: T](f: PartialFunction[U, Boolean])(implicit arg0: ClassTag[U]): (Combinators.this)#Matcher[U]

Definition Classes
Combinators
def identity[A](implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def oneOfChildren[A](m: ⇒ (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def select[U <: T](implicit arg0: ClassTag[U]): (Combinators.this)#Matcher[U]

Definition Classes
Combinators
def topDown[A](m: (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def topDownAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

Definition Classes
SyntaxEnhancer
def topDownBreak[A](m: (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def topDownBreakAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

Definition Classes
SyntaxEnhancer
macro def transform(f: PartialFunction[T, Any]): (Combinators.this)#Matcher[Any]

Definition Classes
Combinators
def transformWithResult[I <: T, O <: T, A](f: PartialFunction[I, (O, A)])(implicit arg0: ClassTag[I], x: AllowedTransformation[I, O]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def tupledUntil[A, B](m1: (Combinators.this)#Matcher[A], m2: (Combinators.this)#Matcher[B])(implicit arg0: Monoid[A], arg1: Monoid[B]): (Combinators.this)#Matcher[(A, B)]

Definition Classes
Combinators
def until[A, B](m1: ⇒ (Combinators.this)#Matcher[A], m2: (Combinators.this)#Matcher[B])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators
def visit[A](f: PartialFunction[T, A])(implicit x: ClassTag[T]): (Combinators.this)#Matcher[A]

Definition Classes
Combinators

package tql

Type Members

implicit class CTWithResult[U <: T] extends AnyRef

abstract class CollectInType[C[_]] extends AnyRef

trait Collector[C, A, R] extends AnyRef

abstract class DelayedMeta extends AnyRef

class Evaluator[V] extends AnyRef

class EvaluatorAndThen[V, +A] extends AnyRef

class EvaluatorAndThenCollector[V, C[_]] extends AnyRef

class EvaluatorCollector[V, C[_]] extends AnyRef

class EvaluatorMeta[V] extends AnyRef

class EvaluatorMetaCollector[V, C[_]] extends AnyRef

class ForceResult[V, A, R] extends AnyRef

type MatchResult[A] = Option[(T, A)]

abstract class Matcher[+A] extends (T) ⇒ MatchResult[A]

trait MatcherApply[A, R, V, L] extends AnyRef

implicit class MatcherResultEnhancer[A] extends AnyRef

implicit class MatcherXPath[A] extends AnyRef

implicit class TEnhancer extends AnyRef

trait TransformResultTr[A, R] extends AnyRef

implicit class TreeMapperEnhancer[A] extends AnyRef

Abstract Value Members

abstract def traverse[A](tree: T, f: Matcher[A])(implicit arg0: Monoid[A]): MatchResult[A]

Concrete Value Members

def @@[U <: T](implicit arg0: ClassTag[U]): (Combinators.this)#Matcher[U]

object Collector

def Matcher[A](f: (T) ⇒ MatchResult[A]): Matcher[A]

object MatcherApply

implicit def MatcherResultToResult[A](a: (SyntaxEnhancer.this)#MatchResult[A])(implicit arg0: Monoid[A]): A

implicit def MatcherResultToTree(a: (SyntaxEnhancer.this)#MatchResult[_]): Option[T]

def bottomUp[A](m: ⇒ (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def bottomUpAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

def bottomUpBreak[A](m: (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def bottomUpBreakAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

def children[A](f: ⇒ (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def childrenAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

def collect[C[_]]: (Combinators.this)#CollectInType[C]

def collect2[V[_, _]]: AnyRef { def apply[A, B](f: PartialFunction[T,(A, B)])(implicit x: scala.reflect.ClassTag[T],implicit y: scala.collection.generic.CanBuildFrom[V[A,B],(A, B),V[A,B]]): Combinators.this.Matcher[V[A,B]] }

implicit def collectionLikeUIForTree[V <: Tree](v: V): Evaluator[V]

implicit def collectionLikeUIForTreeopt[V <: Tree](v: Option[V]): Evaluator[Option[V]]

implicit def collectionLikeUIForTrees[V <: Tree](v: collection.immutable.Seq[V]): Evaluator[collection.immutable.Seq[V]]

implicit def collectionLikeUIForTreess[V <: Tree](v: collection.immutable.Seq[collection.immutable.Seq[V]]): Evaluator[collection.immutable.Seq[collection.immutable.Seq[V]]]

def fix[A](f: ((Combinators.this)#Matcher[A]) ⇒ (Combinators.this)#Matcher[A]): (Combinators.this)#Matcher[A]

macro def focus(f: PartialFunction[T, Boolean]): (Combinators.this)#Matcher[T]

implicit def forceResultUI[V, A, R](x: EvaluatorAndThen[V, A])(implicit arg0: Monoid[A]): ForceResult[V, A, R]

def guard[U <: T](f: PartialFunction[U, Boolean])(implicit arg0: ClassTag[U]): (Combinators.this)#Matcher[U]

def identity[A](implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def oneOfChildren[A](m: ⇒ (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def select[U <: T](implicit arg0: ClassTag[U]): (Combinators.this)#Matcher[U]

def topDown[A](m: (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def topDownAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

def topDownBreak[A](m: (Combinators.this)#Matcher[A])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def topDownBreakAlias[A](m: (SyntaxEnhancer.this)#Matcher[A])(implicit arg0: Monoid[A]): (SyntaxEnhancer.this)#Matcher[A]

macro def transform(f: PartialFunction[T, Any]): (Combinators.this)#Matcher[Any]

def transformWithResult[I <: T, O <: T, A](f: PartialFunction[I, (O, A)])(implicit arg0: ClassTag[I], x: AllowedTransformation[I, O]): (Combinators.this)#Matcher[A]

def tupledUntil[A, B](m1: (Combinators.this)#Matcher[A], m2: (Combinators.this)#Matcher[B])(implicit arg0: Monoid[A], arg1: Monoid[B]): (Combinators.this)#Matcher[(A, B)]

def until[A, B](m1: ⇒ (Combinators.this)#Matcher[A], m2: (Combinators.this)#Matcher[B])(implicit arg0: Monoid[A]): (Combinators.this)#Matcher[A]

def visit[A](f: PartialFunction[T, A])(implicit x: ClassTag[T]): (Combinators.this)#Matcher[A]

Inherited from Api

Inherited from CollectionLikeUI[Tree]

Inherited from SyntaxEnhancer[Tree]

Inherited from Combinators[Tree]

Inherited from Traverser[Tree]

Inherited from AnyRef

Inherited from Any

Ungrouped