Module org.jooq
Package org.jooq.impl

Interface QOM.WidthBucket<T extends Number>

All Superinterfaces:
Field<T>, FieldOrConstraint, FieldOrRow, FieldOrRowOrSelect, GroupField, Named, OrderField<T>, QueryPart, SelectField<T>, SelectFieldOrAsterisk, Serializable, TableElement, Typed<T>
Enclosing class:

public static interface QOM.WidthBucket<T extends Number> extends Field<T>
The WIDTH BUCKET function.

Divide a range into buckets of equal size.

  • Method Details

    • $field

      @NotNull default @NotNull Field<T> $field()
      The value to divide into the range.
    • $low

      @NotNull default @NotNull Field<T> $low()
      The lower bound of the range.
    • $high

      @NotNull default @NotNull Field<T> $high()
      The upper bound of the range.
    • $buckets

      @NotNull default @NotNull Field<Integer> $buckets()
      The number of buckets to produce.
    • $arg1

      Field<T> $arg1()
    • $arg2

      Field<T> $arg2()
    • $arg3

      Field<T> $arg3()
    • $arg4

      Field<Integer> $arg4()
    • $arg1

      @CheckReturnValue @NotNull default Field<T> $arg1(Field<T> newArg1)
    • $arg2

      @CheckReturnValue @NotNull default Field<T> $arg2(Field<T> newArg2)
    • $arg3

      @CheckReturnValue @NotNull default Field<T> $arg3(Field<T> newArg3)
    • $arg4

      @CheckReturnValue @NotNull default Field<T> $arg4(Field<Integer> newArg4)
    • $constructor

      @NotNull @NotNull Function4<? super Field<T>,? super Field<T>,? super Field<T>,? super Field<Integer>,? extends Field<T>> $constructor()
    • $args

      @NotNull default @NotNull List<?> $args()
    • $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).


      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.

      This is a commercial jOOQ edition only feature.

      Specified by:
      $traverse in interface QueryPart
    • $replace

      @NotNull default QueryPart $replace(Replacer replacer)
      Description copied from interface: QueryPart
      Traverse a QueryPart hierarchy and recursively replace its elements by alternatives.

      While replacing contents, this QueryPart isn't modified. Instead, a new object is returned.

      This is a commercial jOOQ edition only feature.

      Specified by:
      $replace in interface QueryPart