Module org.jooq
Package org.jooq.impl

Interface QOM.SimilarTo

All Superinterfaces:
Condition, QueryPart, Serializable
Enclosing class:
QOM

public static interface QOM.SimilarTo extends Condition
The SIMILAR TO operator.
  • Method Details

    • $value

      @NotNull default @NotNull Field<?> $value()
    • $pattern

      @NotNull default @NotNull Field<String> $pattern()
    • $escape

      @Nullable default @Nullable Character $escape()
    • $arg1

      Field<?> $arg1()
    • $arg2

      Field<String> $arg2()
    • $arg3

      Character $arg3()
    • $arg1

      @NotNull default Condition $arg1(Field<?> newArg1)
    • $arg2

      @NotNull default Condition $arg2(Field<String> newArg2)
    • $arg3

      @NotNull default Condition $arg3(Character newArg3)
    • constructor

      @NotNull @NotNull Function3<? super Field<?>,​? super Field<String>,​? super Character,​? extends Condition> constructor()
    • transform

      default <T> T transform(Function3<? super Field<?>,​? super Field<String>,​? super Character,​? extends T> function)
    • $traverse

      default <T> T $traverse(Traverser<?,​T> traverser)
      Description copied from interface: QueryPart
      Traverser this QueryPart expression tree using a composable Traverser, producing a result.

      This offers a generic way to traverse expression trees to translate the tree to arbitrary other data structures. The simplest traversal would just count all the tree elements:

       int count = CUSTOMER.NAME.eq(1).$traverse(0, (i, p) -> i + 1);
       

      The same can be achieved by translating the JDK Collector API to the Traverser API using Traversers.collecting(Collector).

       CUSTOMER.NAME.eq(1).$traverse(Traversers.collecting(Collectors.counting()));
       

      Unlike a Collector, a Traverser is optimised for tree traversal, not stream traversal:

      • Is not designed for parallelism
      • It can Traverser.abort() traversal early when the result can be produced early (e.g. when running Traversers.containing(QueryPart), and a result has been found).
      • It can decide whether to Traverser.recurse() into a QueryPart subtree, or whether that is not necessary or even undesirable, e.g. to prevent entering new subquery scopes.
      • Unlike a Collector, which can use its Collector.accumulator() to accumulate each element only once, in tree traversal, it's desirable to be able to distinguish between accumulating an item Traverser.before() or Traverser.after() recursing into it. This is useful e.g. to wrap each tree node in XML opening and closing tags.
      Specified by:
      $traverse in interface QueryPart
    • $replace

      @NotNull default QueryPart $replace(Predicate<? super QueryPart> recurse, Function1<? super QueryPart,​? extends QueryPart> replacement)
      Description copied from interface: QueryPart
      Traverse a QueryPart hierarchy and recursively replace its elements by alternatives.
      Specified by:
      $replace in interface QueryPart
      Parameters:
      recurse - A predicate to decide whether to recurse into a QueryPart subtree.
      replacement - The replacement function. Replacement continues recursively until the function returns null or its input for any given input.