Unified identifier index

A

A		app		`array, MONO_DYNAMIC_ARRAY`
	`BSearchFn`		`FIFO`	`ARRAY_SORT`
	`MONO_ARRAY_SORT`		`MATCH_TREE`	`ArrayQSort`
`add, ORD_SET`			`ORD_MAP`	`ArrayQSortFn`
`add', ORD_SET`			`ORD_SET`	`AwkSyntax`
`addList, ORD_SET`			`QUEUE`
`addRange, REGEXP_SYNTAX`		`appi, ORD_MAP`
`allChars, REGEXP_SYNTAX`		`appX, LIST_XPROD`
`Alt, REGEXP_SYNTAX`		array
andb			`ARRAY_SORT`
	`BIT_ARRAY`		`MONO_DYNAMIC_ARRAY`
	`BIT_VECTOR`

B

`BackTrackEngine`		`BIT_ARRAY`		`BitVector`
`banner, LIB_BASE`		`BIT_VECTOR`		`bound, MONO_DYNAMIC_ARRAY`
`Begin, REGEXP_SYNTAX`		`BitArray`		`bsearch, BSearchFn`
`BinaryMapFn`		bits		`BSearchFn`
`BinarySetFn`			`BIT_ARRAY`
			`BIT_VECTOR`

C

`CannotCompile, REGEXP_SYNTAX`		`clrBit, BIT_ARRAY`		`compileString, REGEXP`
`CannotParse, REGEXP_SYNTAX`		`collate, ORD_MAP`		`complement, BIT_ARRAY`
`Char, REGEXP_SYNTAX`		compare		`Concat, REGEXP_SYNTAX`
`CHAR_MAP`			`ORD_KEY`	contents
`char_map, CHAR_MAP`			`ORD_SET`		`FIFO`
`CharMap`		compile			`QUEUE`
`CharSet, REGEXP_SYNTAX`			`REGEXP`
`clear, QUEUE`			`REGEXP_ENGINE`

D

`default, MONO_DYNAMIC_ARRAY`		Dequeue		`DfaEngine`
delete			`FIFO`	`difference, ORD_SET`
	`FIFO`		`QUEUE`	`DynamicArrayFn`
	`ORD_SET`	dequeue
	`QUEUE`		`FIFO`
			`QUEUE`

E

`E, RegExpFn`		eqBits		extend0
`elem, MONO_DYNAMIC_ARRAY`			`BIT_ARRAY`		`BIT_ARRAY`
empty			`BIT_VECTOR`		`BIT_VECTOR`
	`FIFO`	equal		extend1
	`ORD_MAP`		`BIT_ARRAY`		`BIT_ARRAY`
	`ORD_SET`		`BIT_VECTOR`		`BIT_VECTOR`
`End, REGEXP_SYNTAX`			`ORD_SET`
enqueue		`exists, ORD_SET`
	`FIFO`
	`QUEUE`

F

`failure, LIB_BASE`		`fmt, LIST_FORMAT`		`foldri, ORD_MAP`
`FIFO`		foldl		`foldX, LIST_XPROD`
`Fifo`			`FIFO`	`for, ITERATE`
`fifo, FIFO`			`ORD_MAP`	`fromList, MONO_DYNAMIC_ARRAY`
filter			`ORD_SET`	fromString
	`ORD_MAP`		`QUEUE`		`BIT_ARRAY`
	`ORD_SET`	`foldli, ORD_MAP`			`BIT_VECTOR`
`filteri, ORD_MAP`		foldr			`RANDOM`
find			`FIFO`
	`MATCH_TREE`		`ORD_MAP`
	`ORD_MAP`		`ORD_SET`
	`ORD_SET`		`QUEUE`
	`REGEXP`
	`REGEXP_ENGINE`

G

getBits		`Group, REGEXP_SYNTAX`
	`BIT_ARRAY`
	`BIT_VECTOR`

H

head
	`FIFO`
	`QUEUE`

I

`Impossible, LIB_BASE`		`intersectWithi, ORD_MAP`		isZero
`insert, ORD_MAP`		`Interval, REGEXP_SYNTAX`			`BIT_ARRAY`
`insert', ORD_MAP`		`IntListMap`			`BIT_VECTOR`
`IntBinaryMap`		`IntListSet`		`item, ORD_SET`
`IntBinarySet`		isEmpty		`ITERATE`
intersection			`FIFO`	`Iterate`
	`BIT_ARRAY`		`ORD_SET`	`iterate, ITERATE`
	`ORD_SET`		`QUEUE`
`intersectWith, ORD_MAP`		`isSubset, ORD_SET`

J

join, SPLAY_TREE

K

Key
	`ORD_MAP`
	`ORD_SET`

L

length		`LIST_XPROD`		`ListMergeSort`
	`FIFO`	`ListFormat`		`ListSetFn`
	`QUEUE`	listItems		`listToString, LIST_FORMAT`
`LIB_BASE`			`ORD_MAP`	`ListXProd`
`LibBase`			`ORD_SET`	lshift
`LIST_FORMAT`		`listItemsi, ORD_MAP`			`BIT_ARRAY`
`LIST_SORT`		`ListMapFn`			`BIT_VECTOR`

M

`map, ORD_MAP`		`mapPartial, ORD_MAP`		`match_tree, MATCH_TREE`
map		`mapPartiali, ORD_MAP`		`MatchSet, REGEXP_SYNTAX`
	`FIFO`	`mapStrChr, CHAR_MAP`		`MatchTree`
	`MATCH_TREE`	`mapX, LIST_XPROD`		`member, ORD_SET`
	`ORD_MAP`	`Match, MATCH_TREE`		`mkCharMap, CHAR_MAP`
	`ORD_SET`	match		`mkQueue, QUEUE`
	`QUEUE`		`REGEXP`	`mkRandom, RAND`
`mapChr, CHAR_MAP`			`REGEXP_ENGINE`	`MONO_ARRAY_SORT`
`mapi, ORD_MAP`		`MATCH_TREE`		`MONO_DYNAMIC_ARRAY`

N

`NonmatchSet, REGEXP_SYNTAX`		`NotFound, LIB_BASE`
`norm, RAND`		`nth, MATCH_TREE`
notb		`num, MATCH_TREE`
	`BIT_ARRAY`	numItems
	`BIT_VECTOR`		`ORD_MAP`
			`ORD_SET`

O

`Option, REGEXP_SYNTAX`		`ORD_KEY`		`ORD_SET`
orb		`ord_key, ORD_KEY`
	`BIT_ARRAY`	`ORD_MAP`
	`BIT_VECTOR`

P

`P, RegExpFn`		`Plus, REGEXP_SYNTAX`
peek		prefix
	`FIFO`		`REGEXP`
	`QUEUE`		`REGEXP_ENGINE`

Q

R

`RAND`		`Random`		`REGEXP_SYNTAX`
`Rand`		`random, RAND`		`RegExpFn`
rand		`randRange, RANDOM`		`RegExpSyntax`
	`RAND`	`randReal, RANDOM`		`remove, ORD_MAP`
	`RANDOM`	`range, RAND`		`repeat, ITERATE`
`rand, RANDOM`		`REGEXP`		`root, MATCH_TREE`
`randInt, RANDOM`		regexp		rshift
`randMax, RAND`			`REGEXP`		`BIT_ARRAY`
`randMin, RAND`			`REGEXP_ENGINE`		`BIT_VECTOR`
`randNat, RANDOM`		`REGEXP_ENGINE`
`RANDOM`		`REGEXP_PARSER`

S

scan		sorted		`SplayObj, SPLAY_TREE`
	`LIST_FORMAT`		`ARRAY_SORT`	`SplaySetFn`
	`REGEXP_PARSER`		`LIST_SORT`	`SplayTree`
`set, ORD_SET`			`MONO_ARRAY_SORT`	`Star, REGEXP_SYNTAX`
`setBit, BIT_ARRAY`		`splay, SPLAY_TREE`		`sub, MONO_DYNAMIC_ARRAY`
`singleton, ORD_SET`		`splay, SPLAY_TREE`		`subArray, MONO_DYNAMIC_ARRAY`
sort		`SPLAY_TREE`		`syntax, REGEXP_SYNTAX`
	`ARRAY_SORT`	`SplayMapFn`
	`LIST_SORT`	`SplayNil, SPLAY_TREE`
	`MONO_ARRAY_SORT`

T

`tabulate, MONO_DYNAMIC_ARRAY`		`truncate, MONO_DYNAMIC_ARRAY`
toString
	`BIT_ARRAY`
	`BIT_VECTOR`
	`RANDOM`

U

`Unimplemented, LIB_BASE`		`unionWith, ORD_MAP`		`update, MONO_DYNAMIC_ARRAY`
union		`unionWithi, ORD_MAP`
	`BIT_ARRAY`	`uniqueSort, LIST_SORT`
	`ORD_SET`

V

version, LIB_BASE

X

xorb
	`BIT_ARRAY`
	`BIT_VECTOR`