Douglas Katzman 916b4d346b Put DEEP-SIZE into test-util and use it in a benchmark ... This shows a few things: * S-O lists are terribly wasteful of memory, using about 8 words per key though producing very little garbage during construction. * Balanced trees need about 3 words per key in the final tree, but produce lots of intermediate garbage. * Red/Black can be faster at lookup than brother trees, probably because the latter requires a test of each node type before descending.		2023-02-07 23:41:25 -05:00
..
bbtrees.lisp	Put DEEP-SIZE into test-util and use it in a benchmark	2023-02-07 23:41:25 -05:00
finalize.lisp	Speed up FINALIZE and CANCEL-FINALIZATION w/ many threads	2023-01-15 22:55:05 -05:00
find-symbol.lisp	Implement fastrem-32 vop for arm64 and ppc64	2022-12-07 15:30:19 -05:00
grab-mutex.lisp	Demonstrate some ways to improve WITH-MUTEX	2021-08-10 20:04:13 -04:00
threads-compile.lisp	Add some optional instrumentation to object creation	2021-08-18 20:27:41 -04:00