weight-balanced-trees - Purely functional weight-balanced trees

	Commit message (Collapse)	Author	Age	Files	Lines
*	add bulk list operations for set-set operatoins	Peter McGoron	2025-02-18	1	-3/+3
\|
*	more set-intersection tests	Peter McGoron	2025-02-17	1	-6/+32
\|
*	add superset tests	Peter McGoron	2025-02-17	1	-0/+75
\|
*	reorganized srfi 113 sets tests	Peter McGoron	2025-02-17	1	-69/+107
\|
*	more tests of subset and set equality predicates	Peter McGoron	2025-02-17	1	-10/+70
\|
*	test set<?	Peter McGoron	2025-02-17	1	-1/+24
\|
*	test set<=?	Peter McGoron	2025-02-17	1	-1/+23
\|
*	more set=? tests	Peter McGoron	2025-02-17	1	-5/+20
\|
*	more tests for set-delete, more efficient implementation	Peter McGoron	2025-02-17	1	-4/+38
\|
*	test set-every, set-delete, and set=?	Peter McGoron	2025-02-17	1	-6/+88
\|
*	change set-disjoint?, test set-intersection	Peter McGoron	2025-02-17	1	-21/+67
\|
*	member, adjoin and find tests	Peter McGoron	2025-02-16	1	-9/+76
\|
*	set-disjoint tests	Peter McGoron	2025-02-16	1	-4/+60
\|
*	test set-contains?	Peter McGoron	2025-02-16	1	-39/+55
\|
*	add set-contains? test, remove NaNs because they cannot be used in the ↵	Peter McGoron	2025-02-16	1	-43/+62
\| \| \| \|	default comparator
*	use vectors instead of lists in srfi-113 tests	Peter McGoron	2025-02-16	1	-23/+36
\|
*	use test-call	Peter McGoron	2025-02-16	1	-24/+20
\|
*	tests for different constructors	Peter McGoron	2025-02-16	1	-29/+97
\|
*	start testing SRFI 113 tests	Peter McGoron	2025-02-15	1	-0/+71