Constant summary | |
---|---|
+probe-depth+ | 3 |
Structure summary | |
---|---|
charset |
Method summary | |
---|---|
make-load-form | (set charset) &optional environment |
Function summary | |
---|---|
add-to-charset | char set |
all-characters | set |
charset-count | charset |
charset-depth | charset |
charset-p | object |
charset-vector | charset |
compute-index | hash vector |
copy-charset | charset |
in-charset-p | char set |
make-char-vector | size |
make-charset | &key (depth +probe-depth+) (count 0) (vector (make-char-vector 12)) |
merge-set | set1 set2 &optional invertedp |
mix | code hash |
%add-to-charset | char set |
%add-to-charset/expand | char set |
Returns and (with setf) changes the vector of the specified charset
Maximum number of collisions (for any element) we accept before we allocate more storage. This is now fixed, but could be made to vary depending on the size of the storage vector (e.g. in the range of 1-4). Larger probe-depths mean more collisions are tolerated before the table grows, but increase the constant factor.
Returns a vector of size SIZE to hold characters. All elements are initialized to #Null except for the first one which is initialized to #?.
Given a character code CODE and a hash code HASH, computes and returns the "next" hash code. See comments below.
Computes and returns the index into the vector VECTOR corresponding to the hash code HASH.
Adds the character CHAR to the charset SET, extending SET if necessary. Returns CHAR.
Tries to add the character CHAR to the charset SET without extending it. Returns NIL if this fails.
Extends the charset SET and then adds the character CHAR to it.