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:

QOM

public static interface QOM.WidthBucket<T extends Number>
extends Field<T>

The WIDTH BUCKET function.

Divide a range into buckets of equal size.

Method Summary

Modifier and Type	Method	Description
Field<T>	$arg1()
default QOM.WidthBucket<T>	$arg1(Field<T> newArg1)
Field<T>	$arg2()
default QOM.WidthBucket<T>	$arg2(Field<T> newArg2)
Field<T>	$arg3()
default QOM.WidthBucket<T>	$arg3(Field<T> newArg3)
Field<Integer>	$arg4()
default QOM.WidthBucket<T>	$arg4(Field<Integer> newArg4)
default @NotNull List<?>	$args()
default @NotNull Field<Integer>	$buckets()	The number of buckets to produce.
default @NotNull QOM.WidthBucket<T>	$buckets(Field<Integer> newBuckets)	The number of buckets to produce.
@NotNull Function4<? super Field<T>,? super Field<T>,? super Field<T>,? super Field<Integer>,? extends QOM.WidthBucket<T>>	$constructor()
default @NotNull Field<T>	$field()	The value to divide into the range.
default @NotNull QOM.WidthBucket<T>	$field(Field<T> newField)	The value to divide into the range.
default @NotNull Field<T>	$high()	The upper bound of the range.
default @NotNull QOM.WidthBucket<T>	$high(Field<T> newHigh)	The upper bound of the range.
default @NotNull Field<T>	$low()	The lower bound of the range.
default @NotNull QOM.WidthBucket<T>	$low(Field<T> newLow)	The lower bound of the range.
default QueryPart	$replace(Replacer replacer)	Traverse a QueryPart hierarchy and recursively replace its elements by alternatives.
default <T> T	$traverse(Traverser<?,T> traverser)	Traverser this QueryPart expression tree using a composable Traverser, producing a result.

Methods inherited from interface org.jooq.Field

abs, acos, add, add, as, as, as, as, asc, ascii, asin, atan, atan2, atan2, avg, avgOver, between, between, between, between, betweenSymmetric, betweenSymmetric, betweenSymmetric, betweenSymmetric, bitAnd, bitAnd, bitLength, bitNand, bitNand, bitNor, bitNor, bitNot, bitOr, bitOr, bitXNor, bitXNor, bitXor, bitXor, cast, cast, cast, ceil, changed, charLength, coalesce, coalesce, coerce, coerce, coerce, collate, collate, collate, comment, comment, compare, compare, compare, compare, concat, concat, concat, contains, contains, containsIgnoreCase, containsIgnoreCase, convert, convert, convert, convertFrom, convertFrom, convertTo, convertTo, cos, cosh, cot, coth, count, countDistinct, countOver, decode, decode, decode, decode, deg, desc, div, div, divide, divide, endsWith, endsWith, endsWithIgnoreCase, endsWithIgnoreCase, eq, eq, eq, eq, equal, equal, equal, equal, equalIgnoreCase, equalIgnoreCase, equals, exp, extract, field, firstValue, floor, from, ge, ge, ge, ge, get, getComment, getName, getValue, greaterOrEqual, greaterOrEqual, greaterOrEqual, greaterOrEqual, greaterThan, greaterThan, greaterThan, greaterThan, greatest, greatest, gt, gt, gt, gt, in, in, in, in, in, isDistinctFrom, isDistinctFrom, isDistinctFrom, isDocument, isFalse, isJson, isNotDistinctFrom, isNotDistinctFrom, isNotDistinctFrom, isNotDocument, isNotJson, isNotNull, isNull, isTrue, lag, lag, lag, lag, lastValue, le, le, le, le, lead, lead, lead, lead, least, least, length, lessOrEqual, lessOrEqual, lessOrEqual, lessOrEqual, lessThan, lessThan, lessThan, lessThan, like, like, like, like, like, likeIgnoreCase, likeIgnoreCase, likeIgnoreCase, likeIgnoreCase, likeRegex, likeRegex, ln, log, lower, lpad, lpad, lpad, lpad, lt, lt, lt, lt, ltrim, max, maxOver, median, min, minOver, minus, minus, mod, mod, modulo, modulo, mul, mul, multiply, multiply, ne, ne, ne, ne, neg, notBetween, notBetween, notBetween, notBetween, notBetweenSymmetric, notBetweenSymmetric, notBetweenSymmetric, notBetweenSymmetric, notContains, notContains, notContainsIgnoreCase, notContainsIgnoreCase, notEqual, notEqual, notEqual, notEqual, notEqualIgnoreCase, notEqualIgnoreCase, notIn, notIn, notIn, notIn, notIn, notLike, notLike, notLike, notLike, notLike, notLikeIgnoreCase, notLikeIgnoreCase, notLikeIgnoreCase, notLikeIgnoreCase, notLikeRegex, notLikeRegex, notSimilarTo, notSimilarTo, notSimilarTo, notSimilarTo, notSimilarTo, nullif, nullif, nullsFirst, nullsLast, nvl, nvl, nvl2, nvl2, octetLength, original, plus, plus, plus, position, position, pow, pow, power, power, rad, rem, rem, repeat, repeat, replace, replace, replace, replace, reset, round, round, rpad, rpad, rpad, rpad, rtrim, shl, shl, shr, shr, sign, similarTo, similarTo, similarTo, similarTo, similarTo, sin, sinh, sort, sort, sortAsc, sortAsc, sortDefault, sortDesc, sortDesc, sqrt, startsWith, startsWith, startsWithIgnoreCase, startsWithIgnoreCase, stddevPop, stddevPopOver, stddevSamp, stddevSampOver, sub, sub, substring, substring, substring, substring, subtract, subtract, sum, sumOver, tan, tanh, times, times, trim, unaryMinus, unaryPlus, upper, varPop, varPopOver, varSamp, varSampOver

Methods inherited from interface org.jooq.Named

$name, getCommentPart, getQualifiedName, getUnqualifiedName

Methods inherited from interface org.jooq.QueryPart

$replace, $traverse, hashCode, toString

Methods inherited from interface org.jooq.Typed

$dataType, getBinding, getConverter, getDataType, getDataType, getType

Method Details

$field

@NotNull
default @NotNull Field<T> $field()

The value to divide into the range.

$field

@CheckReturnValue
@NotNull
default @NotNull QOM.WidthBucket<T> $field(Field<T> newField)

The value to divide into the range.

$low

@NotNull
default @NotNull Field<T> $low()

The lower bound of the range.

$low

@CheckReturnValue
@NotNull
default @NotNull QOM.WidthBucket<T> $low(Field<T> newLow)

The lower bound of the range.

$high

@NotNull
default @NotNull Field<T> $high()

The upper bound of the range.

$high

@CheckReturnValue
@NotNull
default @NotNull QOM.WidthBucket<T> $high(Field<T> newHigh)

The upper bound of the range.

$buckets

@NotNull
default @NotNull Field<Integer> $buckets()

The number of buckets to produce.

$buckets

@CheckReturnValue
@NotNull
default @NotNull QOM.WidthBucket<T> $buckets(Field<Integer> newBuckets)

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 QOM.WidthBucket<T> $arg1(Field<T> newArg1)

$arg2

@CheckReturnValue
@NotNull
default QOM.WidthBucket<T> $arg2(Field<T> newArg2)

$arg3

@CheckReturnValue
@NotNull
default QOM.WidthBucket<T> $arg3(Field<T> newArg3)

$arg4

@CheckReturnValue
@NotNull
default QOM.WidthBucket<T> $arg4(Field<Integer> newArg4)

$constructor

@NotNull
@NotNull Function4<? super Field<T>,? super Field<T>,? super Field<T>,? super Field<Integer>,? extends QOM.WidthBucket<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).

 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.

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