public id next;
_builtin_.Any member All key pre key != nil;
key
, asking the next
element if this element does not match.
The implementation by BucketElement
considers itself to be both the
key and the value.
_builtin_.Any member All key equal selector cmp pre key != nil;
cmp
to have the objects
compare themselves.
_builtin_.Any memq All key pre key != nil;
member
, but use reference equality instead of the equal
method.
int addElement id elt;
elt
to this bucket, if it is not already present. Return
the number by which this bucket's length has increased.
int addqElement id elt;
elt
to this bucket, if it is not already present. Return
the number by which this bucket's length has increased.
(id, int) (replacement, decrease) remove id elt post !decrease -> replacement == self;
elt
from this bucket, if present. Return the number by
which the length of this bucket has decreased, and the replacement
remainder of the bucket list.
(id, int) (replacement, decrease) removeq id elt post !decrease -> replacement == self;
elt
from this bucket, if present. Return the number by
which the length of this bucket has decreased, and the replacement
remainder of the bucket list.
void resizing_feed HashTable ht;
resizing_add
.
void resizing_add id n;
next
.
int rehash;
int rehashq;
void encodeUsingCoder Encoder coder;
void initWithCoder Decoder coder;
(id, int) gc_mark_values;
gc_dead
. Return the replacement for this
element, and the number of bucket elements that were removed from this
bucket list.