bfs.git - Breadth-first version of find

	Commit message (Collapse)	Author	Age	Files	Lines
*	style: Use &array[i] rather than array + i	Tavian Barnes	2022-04-16	1	-3/+3
\|
*	util: New BFS_FLEX_SIZEOF() macro for more precise flexible array allocations	Tavian Barnes	2020-10-13	1	-2/+3
\| \| \| \| \|	See http://www.open-std.org/jtc1/sc22/wg14/www/docs/dr_282.htm for all the fun behind this.
*	trie: Make trie_remove() take a leaf instead of a key	Tavian Barnes	2019-04-20	1	-35/+16
\|
*	trie: Add a function to get an arbitrary leaf	Tavian Barnes	2019-03-06	1	-0/+4
\| \| \| \|	This is useful if the stored values need to be cleaned up.
*	trie: Fix jump node offsets	Tavian Barnes	2019-03-06	1	-1/+1
\|
*	trie: Minor optimization	Tavian Barnes	2019-03-05	1	-7/+6
\|
*	trie: Implement prefix/postfix search	Tavian Barnes	2019-03-04	1	-0/+82
\|
*	trie: Implement removal	Tavian Barnes	2019-03-04	1	-0/+124
\|
*	trie: Revamp the API to support mappings	Tavian Barnes	2019-03-04	1	-134/+83
\|
*	trie: Implement a QP trie	Tavian Barnes	2019-03-01	1	-0/+553