avail/avail.descriptor.sets/A_SetBin/Companion

Companion

object Companion

Properties

val A_SetBin.binUnionKind: A_Type

val A_SetBin.isSetBin: Boolean

val A_SetBin.setBinHash: Int

val A_SetBin.setBinIterator: SetDescriptor.SetIterator

val A_SetBin.setBinSize: Int

Functions

fun A_SetBin.binElementAt(index: Int): AvailObject

binElementsAreAllInstancesOfKind

fun A_SetBin.binElementsAreAllInstancesOfKind(kind: A_Type): Boolean

Asked of the top bin of a set. If the set is large enough to be hashed then compute/cache the union's nearest kind, otherwise just answer nil.

binHasElementWithHash

fun A_SetBin.binHasElementWithHash(elementObject: A_BasicObject, elementObjectHash: Int): Boolean

binRemoveElementHashLevelCanDestroy

fun A_SetBin.binRemoveElementHashLevelCanDestroy(elementObject: A_BasicObject, elementObjectHash: Int, myLevel: Int, canDestroy: Boolean): A_SetBin

fun A_SetBin.isBinSubsetOf(potentialSuperset: A_Set): Boolean

setBinAddingElementHashLevelCanDestroy

fun A_SetBin.setBinAddingElementHashLevelCanDestroy(elementObject: A_BasicObject, elementObjectHash: Int, myLevel: Int, canDestroy: Boolean): A_SetBin

fun A_SetBin.setBinUnion(otherBin: A_SetBin, level: Int): A_SetBin

Construct a bin containing the union of the receiver and otherBin, recycling or destroying either or both if they're mutable.

setBinUnionWithHashedBin

fun A_SetBin.setBinUnionWithHashedBin(hashedBin: AvailObject, level: Int): A_SetBin

Construct a bin containing the union of the receiver and hashedBin, which is known to be a hashed set bin.

setBinUnionWithLinearBin

fun A_SetBin.setBinUnionWithLinearBin(linearBin: AvailObject, level: Int): A_SetBin

Construct a bin containing the union of the receiver and linearBin, which is known to be a linear set bin.