Package-level declarations
Types
Represents a directed acyclic graph (DAG) of generic type T.
Type alias for a function representing a reduction over a sequence of values trying to find the "best" value.
Properties
Returns the column name for this callable. If the callable contains the ColumnName annotation, its ColumnName.name is returned. Otherwise, the name of the callable is returned with proper getter-trimming if it's a KFunction.
Returns the getter name for this callable. The name of the callable is returned with proper getter-trimming if it's a KFunction.
Returns true if this object is an array, either a primitive array like XArray or Array<>.
Returns true if this class is an array, either a primitive array like XArray or Array<>.
Returns true if this type is of an array, either a primitive array like XArray or Array<>.
Returns true if this class is a Java record.
Returns true if this object is a primitive array like XArray.
Returns true if this class is a primitive array class like XArray.
Returns true if this type is of a primitive array like XArray.
Functions
If this is an array of any kind, the function returns it as a list of values, else it returns null.
Builds a new DirectedAcyclicGraph using the provided builder function.
Returns the common type of the given types including "listify" behaviour. Values and nulls will be wrapped in a list if they appear among other lists. For example: [Int, Nothing?, List<Int>] will become List<Int> instead of Any?. If there is another collection in there, it will become Any? anyway.
Converts the elements of the given iterable of numbers into a common numeric type based on complexity. The common numeric type is determined using the provided commonNumberType parameter or calculated with Iterable.unifiedNumberTypeOrNull from the iterable's elements if not explicitly specified.
Builds a new DirectedAcyclicGraph using the provided edges.
Number type graph, structured in terms of number complexity. A number can always be expressed losslessly by a number of a more complex type (any of its parents).
Determines the nearest common numeric type, in terms of complexity, between two given classes/types.
Number type graph, structured in terms of number complexity. A number can always be expressed losslessly by a number of a more complex type (any of its parents).
Determines the nearest common numeric type, in terms of complexity, between two given classes/types.
Returns the index of the first element in this sequence that is better than all previous elements.
Returns the index of the first element in this sequence that is not NA (null or NaN) and is better than all previous elements.
Returns the index of the first element in this sequence that is not null and is better than all previous elements.
Returns true if this callable is a getter-like function.
Checks whether this KType adheres to T : Comparable<T & Any>?, aka, it is mutually comparable with itself.
Returns true only when this type is exactly Number or Number?.
Checks if the string can be parsed as a java duration without throwing an exception.
Changes generic type parameters to its upperbound, like List<T> -> List<Any?> and Comparable<T> -> Comparable<Nothing>. Works recursively as well.
Converts a string into lowerCamelCase using delimiters.
Determines the nearest common numeric type, in terms of complexity, all types in this.
Determines the nearest common numeric type, in terms of complexity, all types in this.