scala.meta

tql

package tql

Linear Supertypes
CollectionLikeUI[Tree], SyntaxEnhancer[Tree], Combinators[Tree], Traverser[Tree], AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. tql
  2. CollectionLikeUI
  3. SyntaxEnhancer
  4. Combinators
  5. Traverser
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Type Members

  1. implicit class CTWithResult[U <: T] extends AnyRef

    Definition Classes
    Combinators

  2. abstract class CollectInType[C[_]] extends AnyRef

    Definition Classes
    Combinators

  3. trait Collector[C, A, R] extends AnyRef

    Definition Classes
    Combinators

  4. abstract class DelayedMeta extends AnyRef

    Definition Classes
    CollectionLikeUI

  5. class Evaluator[V] extends AnyRef

    Definition Classes
    CollectionLikeUI

  6. class EvaluatorAndThen[V, +A] extends AnyRef

    Definition Classes
    CollectionLikeUI

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

    Definition Classes
    CollectionLikeUI

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

    Definition Classes
    CollectionLikeUI

  9. class EvaluatorMeta[V] extends AnyRef

    Definition Classes
    CollectionLikeUI

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

    Definition Classes
    CollectionLikeUI

  11. class ForceResult[V, A, R] extends AnyRef

    Definition Classes
    CollectionLikeUI

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

    Definition Classes
    Traverser

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

    Definition Classes
    Traverser

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

    Definition Classes
    CollectionLikeUI

  15. implicit class MatcherResultEnhancer[A] extends AnyRef

    Definition Classes
    SyntaxEnhancer

  16. implicit class MatcherXPath[A] extends AnyRef

    Definition Classes
    SyntaxEnhancer

  17. implicit class TEnhancer extends AnyRef

    Definition Classes
    SyntaxEnhancer

  18. trait TransformResultTr[A, R] extends AnyRef

    Definition Classes
    CollectionLikeUI

  19. implicit class TreeMapperEnhancer[A] extends AnyRef

    Definition Classes
    SyntaxEnhancer

Abstract Value Members

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

    Definition Classes
    Traverser

Concrete Value Members

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

    Definition Classes
    Combinators

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

    Definition Classes
    Traverser

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    Combinators

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    Combinators

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    Combinators

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    Combinators

  12. 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

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

    Definition Classes
    Combinators

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

    Definition Classes
    Combinators

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

    Definition Classes
    Combinators

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

    Definition Classes
    Combinators

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

    Definition Classes
    Combinators

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

    Definition Classes
    Combinators

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

    Definition Classes
    Combinators

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    Combinators

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

    Definition Classes
    SyntaxEnhancer

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

    Definition Classes
    Combinators

  24. 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

  25. 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

  26. 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

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

    Definition Classes
    Combinators

Inherited from CollectionLikeUI[Tree]

Inherited from SyntaxEnhancer[Tree]

Inherited from Combinators[Tree]

Inherited from Traverser[Tree]

Inherited from AnyRef

Inherited from Any

Ungrouped