Documentation
Table of Contents
This library implements the fastset object. It uses red-black binary trees to provide a set implementation that can be used in place of the internal set type if the functionality required (string sorting of complex objects) is required.
Objects of type fastset have no value, and it is an error to try to get or set this value.
| Property | Type | Description |
|---|---|---|
| _private | fastsetprivate | |
| add | function | |
| addelement | function | |
| clear | function | |
| compare | function | |
| count | integer | |
| delete | function | |
| deleteelement | function | |
| difference | function | |
| distinct | boolean | |
| find | function | |
| findelementbykey | function | |
| getcount | function | |
| getfirst | function | |
| getlast | function | |
| getmaxdepth | function | |
| insert | function | |
| intersect | function | |
| setdistinct | function | |
| totalcount | integer | |
| type | type | |
| unite | function |



