korge-foundation/korlibs.datastructure/BitArray

BitArray

class BitArray : AbstractList<Boolean> , Collection<Boolean>

Equivalent to BooleanArray but tightly packed to consume less memory, at the cost of being ~3-4x slower.

Constructors

constructor(size: Int)

Types

object Companion

Properties

val data: ByteArray

open override val size: Int

unhexIgnoreSpaces

val List<String>.unhexIgnoreSpaces: ByteArray

Functions

fun <K> Collection<K>.asFakeMutable(): FakeMutableCollection<K>

fun <T> Iterable<T>.associateByInt(block: (index: Int, value: T) -> Int): IntMap<T>

fun Iterable<Rectangle>.bounds(): Rectangle

fun Iterable<Point>.bounds(): Rectangle

fun List<Point>.bounds(): Rectangle

fun Iterable<MRectangle>.bounds(target: MRectangle = MRectangle()): MRectangle

fun Iterable<MPoint>.bounds(out: MRectangle = MRectangle(), bb: MBoundsBuilder = MBoundsBuilder()): MRectangle

fun List<MPoint>.bounds(out: MRectangle = MRectangle(), bb: MBoundsBuilder = MBoundsBuilder()): MRectangle

open operator override fun contains(element: Boolean): Boolean

open override fun containsAll(elements: Collection<Boolean>): Boolean

fun List<MPoint>.containsPoint(x: Double, y: Double): Boolean

fun <T> List<T>.countMap(): Map<T, Int>

fun <T> List<T>.ensureFastList(): FastArrayList<T>

open operator override fun equals(other: Any?): Boolean

inline fun <T> List<T>.fastForEach(callback: (T) -> Unit)

fastForEachBezier

inline fun List<Curves>.fastForEachBezier(block: (Bezier) -> Unit)

fastForEachReverse

inline fun <T> List<T>.fastForEachReverse(callback: (T) -> Unit)

fastForEachWithIndex

inline fun <T> List<T>.fastForEachWithIndex(callback: (index: Int, value: T) -> Unit)

fastForEachWithTemp

inline fun <T> List<T>.fastForEachWithTemp(temp: FastArrayList<T>, callback: (T) -> Unit)

inline fun <T> Collection<T>.fastRandom(): T

fun List<PointList>.flatten(): PointList

fun <T : Comparable<T>> List<T>.genericSorted(left: Int = 0, right: Int = size - 1): List<T>

open operator override fun get(index: Int): Boolean

fun <T> List<T>.getCyclic(index: Int): T

getCyclicOrNull

fun <T> List<T>.getCyclicOrNull(index: Int): T?

getPolylineLength

fun List<MPoint>.getPolylineLength(): Double

fun List<Point>.getPolylineLength(): Double

open override fun hashCode(): Int

open override fun indexOf(element: Boolean): Int

open override fun isEmpty(): Boolean

open operator override fun iterator(): Iterator<Boolean>

open override fun lastIndexOf(element: Boolean): Int

open override fun listIterator(): ListIterator<Boolean>

open override fun listIterator(index: Int): ListIterator<Boolean>

inline fun <T> Iterable<T>.mapDouble(callback: (T) -> Double): DoubleArrayList

inline fun <T> Iterable<T>.mapFloat(callback: (T) -> Float): FloatArrayList

inline fun <T> Iterable<T>.mapInt(callback: (T) -> Int): IntArrayList

fun <T> Iterable<T>.multisorted(vararg props: KProperty1<T, Comparable<*>>): List<T>

inline fun <T, R> List<T>.parallelMap(crossinline transform: (T) -> R): List<R>

inline fun <T> List<T>.parallelMapInt(crossinline transform: (T) -> Int): IntArray

fun List<TrapezoidInt>.pointInside(x: Int, y: Int, assumeSorted: Boolean = false): TrapezoidInt?

fun <T> List<T>.random(random: Random = Random): T

randomWithWeights

fun <T> List<T>.randomWithWeights(weights: List<Double>, random: Random = Random): T

fun <T> List<T>.reader(): ListReader<T>

fun <T> List<T>.rotated(offset: Int): List<T>

fun <T> List<T>.rotatedLeft(offset: Int = +1): List<T>

fun <T> List<T>.rotatedRight(offset: Int = +1): List<T>

operator fun set(index: Int, value: Boolean)

open override fun subList(fromIndex: Int, toIndex: Int): List<Boolean>

@JvmName(name = "sumOfFloat")

inline fun <T> Iterable<T>.sumOfDouble(selector: (T) -> Double): Double

@JvmName(name = "sumOfFloat")

inline fun <T> Iterable<T>.sumOfFloat(selector: (T) -> Float): Float

fun <T : Comparable<T>> List<T>.timSorted(): List<T>

@JvmName(name = "ListCurve_toCurves")

fun List<Bezier>.toCurves(closed: Boolean): Curves

@JvmName(name = "ListCurves_toCurves")

fun List<Curves>.toCurves(closed: Boolean = this.last().closed): Curves

fun <T> Collection<T>.toDeque(): Deque<T>

inline fun Iterable<Double>.toDoubleList(): DoubleArrayList

fun <T> List<T>.toFastList(): List<T>

fun <T> List<T>.toFastList(out: FastArrayList<T> = FastArrayList()): FastArrayList<T>

inline fun Iterable<Float>.toFloatList(): FloatArrayList

fun List<MSegmentInt>.toFSegmentsInt(): FSegmentsInt

toFTrapezoidsInt

fun List<TrapezoidInt>.toFTrapezoidsInt(): FTrapezoidsInt

toFTrianglesInt

fun List<MTriangleInt>.toFTrianglesInt(): FTrianglesInt

fun List<HitTestable>.toHitTestable(): HitTestable

inline fun Iterable<Int>.toIntList(): IntArrayList

fun <T> Collection<Pair<Int, T>>.toIntMap(): IntMap<T>

fun <K, V> Iterable<Pair<K, V>>.toLinkedMap(): LinkedHashMap<K, V>

toPointArrayList

fun List<Point>.toPointArrayList(): PointArrayList

fun Iterable<DateTimeRange>.toRangeSet(): DateTimeRangeSet

fun List<Shape2D>.toShape2D(): Shape2D

fun List<Shape2D>.~~toShape2d~~(): Shape2D

open override fun toString(): String

fun List<DateTimeRange>.toStringLongs(): String

toStrokePointsList

fun List<Curves>.toStrokePointsList(info: StrokeInfo, mode: StrokePointsMode = StrokePointsMode.NON_SCALABLE_POS, generateDebug: Boolean = false, forceClosed: Boolean? = null): List<StrokePoints>

fun List<Curves>.toStrokePointsList(width: Double, join: LineJoin = LineJoin.MITER, startCap: LineCap = LineCap.BUTT, endCap: LineCap = LineCap.BUTT, miterLimit: Double = 10.0, mode: StrokePointsMode = StrokePointsMode.NON_SCALABLE_POS, lineDash: DoubleList? = null, lineDashOffset: Double = 0.0, generateDebug: Boolean = false, forceClosed: Boolean? = null): List<StrokePoints>

fun List<Curve>.toVectorPath(out: VectorPath = VectorPath()): VectorPath

fun List<TrapezoidInt>.triangulate(out: FTrianglesInt = FTrianglesInt()): FTrianglesInt

withoutSortedDuplicates

fun <T> List<T>.withoutSortedDuplicates(out: ArrayList<T> = arrayListOf()): List<T>