Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $
You can buy this project and download/modify it how often you want.
com.crobox.clickhouse.dsl.column.ArrayFunctions.scala Maven / Gradle / Ivy
package com.crobox.clickhouse.dsl.column
import com.crobox.clickhouse.dsl._
import org.joda.time.{DateTime, LocalDate}
trait ArrayFunctions { this: Magnets =>
sealed trait ArrayFunction
abstract class ArrayFunctionOp[V] extends ExpressionColumn[V](EmptyColumn) with ArrayFunction
abstract class ArrayFunctionConst[V] extends ExpressionColumn[Iterable[V]](EmptyColumn) with ArrayFunction
case class EmptyArrayUInt8() extends ArrayFunctionConst[Boolean]
case class EmptyArrayUInt16() extends ArrayFunctionConst[Short]
case class EmptyArrayUInt32() extends ArrayFunctionConst[Int]
case class EmptyArrayUInt64() extends ArrayFunctionConst[Long]
case class EmptyArrayInt8() extends ArrayFunctionConst[Boolean]
case class EmptyArrayInt16() extends ArrayFunctionConst[Short]
case class EmptyArrayInt32() extends ArrayFunctionConst[Int]
case class EmptyArrayInt64() extends ArrayFunctionConst[Long]
case class EmptyArrayFloat32() extends ArrayFunctionConst[Float]
case class EmptyArrayFloat64() extends ArrayFunctionConst[Double]
case class EmptyArrayDate() extends ArrayFunctionConst[LocalDate]
case class EmptyArrayDateTime() extends ArrayFunctionConst[DateTime]
case class EmptyArrayString() extends ArrayFunctionConst[String]
case class Range(n: NumericCol[_]) extends ArrayFunctionConst[Long]
case class EmptyArrayToSingle[V](col: ArrayColMagnet[V]) extends ArrayFunctionOp[V]
case class Array[V](columns: ConstOrColMagnet[V]*) extends ArrayFunctionOp[Iterable[V]]
case class ArrayConcat[V](col1: ArrayColMagnet[V], columns: ArrayColMagnet[V]*) extends ArrayFunctionOp[Iterable[V]]
case class ArrayElement[V](col: ArrayColMagnet[_ <: Iterable[V]], n: NumericCol[_]) extends ArrayFunctionOp[V]
case class Has[V](col: ArrayColMagnet[V], elm: Magnet[V]) extends ArrayFunctionOp[Boolean]
case class HasAll[V](col: ArrayColMagnet[V], elm: Magnet[V]) extends ArrayFunctionOp[Boolean]
case class HasAny[V](col: ArrayColMagnet[V], elm: Magnet[V]) extends ArrayFunctionOp[Boolean]
case class IndexOf[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V]) extends ArrayFunctionOp[Long]
case class CountEqual[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V])
extends ArrayFunctionOp[Long]
case class ArrayEnumerate[V](col: ArrayColMagnet[V]) extends ArrayFunctionOp[Iterable[Long]]
case class ArrayEnumerateUniq[V](col1: ArrayColMagnet[_ <: Iterable[V]], columns: ArrayColMagnet[_ <: Iterable[V]]*)
extends ArrayFunctionOp[Iterable[Long]]
case class ArrayPopBack[V](col: ArrayColMagnet[_ <: Iterable[V]]) extends ArrayFunctionOp[Iterable[V]]
case class ArrayPopFront[V](col: ArrayColMagnet[_ <: Iterable[V]]) extends ArrayFunctionOp[Iterable[V]]
case class ArrayPushBack[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V])
extends ArrayFunctionOp[Iterable[V]]
case class ArrayPushFront[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V])
extends ArrayFunctionOp[Iterable[V]]
case class ArrayResize[V](col: ArrayColMagnet[_ <: Iterable[V]], size: NumericCol[_], extender: ConstOrColMagnet[V])
extends ArrayFunctionOp[Iterable[V]]
case class ArraySlice[V](col: ArrayColMagnet[_ <: Iterable[V]], offset: NumericCol[_], length: NumericCol[_] = 0)
extends ArrayFunctionOp[Iterable[V]]
case class ArrayUniq[V](col1: ArrayColMagnet[_ <: Iterable[V]], columns: ArrayColMagnet[_ <: Iterable[V]]*)
extends ArrayFunctionOp[Long]
case class ArrayJoin[V](col: ArrayColMagnet[_ <: Iterable[V]]) extends ArrayFunctionOp[V]
// new 21-04-02
case class ArrayDifference[V](col: ArrayColMagnet[_ <: Iterable[V]]) extends ArrayFunctionOp[Iterable[V]]
case class ArrayDistinct[V](col: ArrayColMagnet[_ <: Iterable[V]]) extends ArrayFunctionOp[Iterable[V]]
case class ArrayIntersect[V](col: ArrayColMagnet[_ <: Iterable[V]], columns: ArrayColMagnet[_ <: Iterable[V]]*)
extends ArrayFunctionOp[Iterable[V]]
case class ArrayReduce[V](function: String,
col: ArrayColMagnet[_ <: Iterable[V]],
columns: ArrayColMagnet[_ <: Iterable[V]]*)
extends ArrayFunctionOp[V]
case class ArrayReverse[V](col: ArrayColMagnet[_ <: Iterable[V]]) extends ArrayFunctionOp[Iterable[V]]
// new 22-07-15
case class ArrayEmpty(col: ArrayColMagnet[_]) extends ArrayFunctionOp[Boolean]
case class ArrayNotEmpty(col: ArrayColMagnet[_]) extends ArrayFunctionOp[Boolean]
case class ArrayLength(col: ArrayColMagnet[_]) extends ArrayFunctionOp[Long]
// now 23-08-29
case class ArrayFlatten[V](col1: ArrayColMagnet[V]) extends ArrayFunctionOp[Iterable[V]]
def emptyArrayUInt8: EmptyArrayUInt8 = EmptyArrayUInt8()
def emptyArrayUInt16: EmptyArrayUInt16 = EmptyArrayUInt16()
def emptyArrayUInt32: EmptyArrayUInt32 = EmptyArrayUInt32()
def emptyArrayUInt64: EmptyArrayUInt64 = EmptyArrayUInt64()
def emptyArrayInt8: EmptyArrayInt8 = EmptyArrayInt8()
def emptyArrayInt16: EmptyArrayInt16 = EmptyArrayInt16()
def emptyArrayInt32: EmptyArrayInt32 = EmptyArrayInt32()
def emptyArrayInt64: EmptyArrayInt64 = EmptyArrayInt64()
def emptyArrayFloat32: EmptyArrayFloat32 = EmptyArrayFloat32()
def emptyArrayFloat64: EmptyArrayFloat64 = EmptyArrayFloat64()
def emptyArrayDate: EmptyArrayDate = EmptyArrayDate()
def emptyArrayDateTime: EmptyArrayDateTime = EmptyArrayDateTime()
def emptyArrayString: EmptyArrayString = EmptyArrayString()
def emptyArrayToSingle[V](col: ArrayColMagnet[V]): EmptyArrayToSingle[V] = EmptyArrayToSingle[V](col)
def range(n: NumericCol[_]): Range = Range(n)
def arrayConcat[V](col1: ArrayColMagnet[V], columns: ArrayColMagnet[V]*): ArrayConcat[V] =
ArrayConcat(col1, columns: _*)
def arrayElement[V](col: ArrayColMagnet[_ <: Iterable[V]], n: NumericCol[_]): ArrayElement[V] = ArrayElement(col, n)
def has[V](col: ArrayColMagnet[V], elm: ConstOrColMagnet[V]): Has[V] = Has(col, elm)
def hasAll[V](col: ArrayColMagnet[V], elm: ArrayColMagnet[V]): HasAll[V] = HasAll(col, elm)
def hasAny[V](col: ArrayColMagnet[V], elm: ArrayColMagnet[V]): HasAny[V] = HasAny(col, elm)
def indexOf[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V]): IndexOf[V] = IndexOf[V](col, elm)
def countEqual[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V]): CountEqual[V] =
CountEqual[V](col, elm)
def arrayEnumerate[V](col: ArrayColMagnet[V]): ArrayEnumerate[V] = ArrayEnumerate(col)
def arrayEnumerateUniq[V](col1: ArrayColMagnet[_ <: Iterable[V]],
coln: ArrayColMagnet[_ <: Iterable[V]]*): ArrayEnumerateUniq[V] =
ArrayEnumerateUniq[V](col1, coln: _*)
def arrayPopBack[V](col: ArrayColMagnet[_ <: Iterable[V]]): ArrayPopBack[V] = ArrayPopBack[V](col)
def arrayPopFront[V](col: ArrayColMagnet[_ <: Iterable[V]]): ArrayPopFront[V] = ArrayPopFront[V](col)
def arrayPushBack[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V]): ArrayPushBack[V] =
ArrayPushBack[V](col, elm)
def arrayPushFront[V](col: ArrayColMagnet[_ <: Iterable[V]], elm: ConstOrColMagnet[V]): ArrayPushFront[V] =
ArrayPushFront[V](col, elm)
def arrayResize[V](col: ArrayColMagnet[_ <: Iterable[V]],
size: NumericCol[_],
extender: ConstOrColMagnet[V]): ArrayResize[V] =
ArrayResize[V](col, size, extender)
def arraySlice[V](col: ArrayColMagnet[_ <: Iterable[V]],
offset: NumericCol[_],
length: NumericCol[_] = 0): ArraySlice[V] =
ArraySlice[V](col, offset, length)
def arrayUniq[V](col1: ArrayColMagnet[_ <: Iterable[V]], coln: ArrayColMagnet[_ <: Iterable[V]]*): ArrayUniq[V] =
ArrayUniq[V](col1, coln: _*)
def arrayJoin[V](col: ArrayColMagnet[_ <: Iterable[V]]): ArrayJoin[V] = ArrayJoin[V](col)
// new 21-04-02
def arrayDifference[V](col: ArrayColMagnet[_ <: Iterable[V]]): ArrayDifference[V] = ArrayDifference[V](col)
def arrayDistinct[V](col: ArrayColMagnet[_ <: Iterable[V]]): ArrayDistinct[V] = ArrayDistinct[V](col)
def arrayIntersect[V](col1: ArrayColMagnet[_ <: Iterable[V]],
col2: ArrayColMagnet[_ <: Iterable[V]],
columns: ArrayColMagnet[_ <: Iterable[V]]*): ArrayIntersect[V] =
ArrayIntersect[V](col1, Seq(col2) ++ columns: _*)
def arrayReduce[V](function: String,
col: ArrayColMagnet[_ <: Iterable[V]],
columns: ArrayColMagnet[_ <: Iterable[V]]*): ArrayReduce[V] =
ArrayReduce[V](function, col, columns: _*)
def arrayReverse[V](col: ArrayColMagnet[_ <: Iterable[V]]): ArrayReverse[V] = ArrayReverse[V](col)
/**
* Special function that checks if given arrays 'share' at least one element.
* Basically it's a wrapper around arrayIntersect (by using notEmpty)
* @param col1
* @param col2
* @param columns
* @tparam V
* @return
*/
def arrayMatch[V](col1: ArrayColMagnet[_ <: Iterable[V]],
col2: ArrayColMagnet[_ <: Iterable[V]],
columns: ArrayColMagnet[_ <: Iterable[V]]*): ExpressionColumn[Boolean] =
notEmpty(arrayIntersect(col1, col2, columns: _*))
def arrayEmpty(col: ArrayColMagnet[_]): ArrayEmpty = ArrayEmpty(col)
def empty(col: ArrayColMagnet[_]): ArrayEmpty = ArrayEmpty(col)
def arrayNotEmpty(col: ArrayColMagnet[_]): ArrayNotEmpty = ArrayNotEmpty(col)
def notEmpty(col: ArrayColMagnet[_]): ArrayNotEmpty = ArrayNotEmpty(col)
def arrayLength(col: ArrayColMagnet[_]): ArrayLength = ArrayLength(col)
def length(col: ArrayColMagnet[_]): ArrayLength = ArrayLength(col)
def arrayFlatten[V](col: ArrayColMagnet[V]): ArrayFlatten[V] = ArrayFlatten(col)
def flatten[V](col: ArrayColMagnet[V]): ArrayFlatten[V] = ArrayFlatten(col)
}
