Package com.ibm.wala.util.intset
@NullMarked
package com.ibm.wala.util.intset
BitVector and vector utilities
-
ClassDescriptionA relation between non-negative integersAn implementation of
MutableIntSetthat delegates to either aMutableSparseIntSetor aBitVectorIntSetAn object that creates some bimodal mutable int sets.utilities for manipulating values at the bit-level.BitSet<T>A bit set is a set of elements, each of which corresponds to a unique integer from [0,MAX].BitVectorBase<T extends BitVectorBase>Abstract base class for implementations of bitvectorsABitVectorimplementation ofMutableIntSet.A repository for shared bit vectors as described by HeintzeA debugging factory that creates debugging bitsets that are implemented as two bitsets that perform consistency checks for every operation.a relation R(x,y) where x >= 0An implementation of Tarjan's union-find, using path compression and balancing, for non-negative integersa more efficient iterator for sets of integersA pair of ints.Set of integers; not necessary mutable TODO: extract a smaller interface?Utilities for dealing withIntSetsinterface for array of integera more efficient iterator for sets of longsSet of longs; not necessary mutable TODO: extract a smaller interface?Utilities for dealing with LongSetsan implementation ofIntVectorthat uses a mix of backing arrays of type int, char, and byte array, in an attempt to save space for common data structures.AnIntSetthat can be changed.MutableIntSetFactory<T extends MutableIntSet>An object that creates some flavor of mutable int set.An object that creates some flavor of mutable int set.MutableMapping<T extends @Nullable Object>A bit set mapping based on an object array.The shared bit vector implementation described by [Heintze 1999] TODO: much optimization possible.A factory for mutable shared bit vector int setsA sparse ordered, mutable duplicate-free, fully-encapsulated set of integers.An object that creates mutable sparse int sets.A sparse ordered, mutable duplicate-free, fully-encapsulated set of longs.An object that creates mutable sparse int sets.An ordinal set mapping, backed a delegate, but adding an offset to each index.OrdinalSet<T>A Set backed by a set of integers.OrdinalSetMapping<T extends @Nullable Object>An object that implements a bijection between whole numbers and objects.simple implementation of IntVectorA sparse ordered, duplicate-free, fully-encapsulated set of integers; not necessary mutablean int vector implementation designed for low occupancy.an int vector implementation designed for low occupancy.A sparse ordered, duplicate-free, fully-encapsulated set of longs; not necessary mutableAMutableSparseIntSetthat allows for tuning of its initial size and expansion factor.a simple implementation of int vector that can be tuned to control space usagean int vector implementation which delegates to pages of int vectors.