avail/avail.descriptor.sets/A_SetBin/Companion

Companion

object Companion
Content copied to clipboard

Functions

Link copied to clipboard
fun A_SetBin.binElementAt(index: Int): AvailObject
Content copied to clipboard
Link copied to clipboard
fun A_SetBin.binElementsAreAllInstancesOfKind(kind: A_Type): Boolean
Content copied to clipboard

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.

Link copied to clipboard
fun A_SetBin.binHasElementWithHash(elementObject: A_BasicObject, elementObjectHash: Int): Boolean
Content copied to clipboard
Link copied to clipboard
fun A_SetBin.binRemoveElementHashLevelCanDestroy(    elementObject: A_BasicObject,     elementObjectHash: Int,     myLevel: Int,     canDestroy: Boolean): A_SetBin
Content copied to clipboard
Link copied to clipboard
fun A_SetBin.isBinSubsetOf(potentialSuperset: A_Set): Boolean
Content copied to clipboard
Link copied to clipboard
fun A_SetBin.setBinAddingElementHashLevelCanDestroy(    elementObject: A_BasicObject,     elementObjectHash: Int,     myLevel: Int,     canDestroy: Boolean): A_SetBin
Content copied to clipboard

Properties

Link copied to clipboard
val A_SetBin.binUnionKind: A_Type
Content copied to clipboard
Link copied to clipboard
val A_SetBin.isSetBin: Boolean
Content copied to clipboard
Link copied to clipboard
val A_SetBin.setBinHash: Int
Content copied to clipboard
Link copied to clipboard
val A_SetBin.setBinIterator: SetDescriptor.SetIterator
Content copied to clipboard
Link copied to clipboard
val A_SetBin.setBinSize: Int
Content copied to clipboard