https://git.dkl9.net/dost/tree/3d916e3482a0da879ff9a3da34ec346f149fa720Recent commits to dost (3d916e3482a0da879ff9a3da34ec346f149fa720)2025-07-21T00:09:44-04:00tag:gitlist.org,2012:commit/3d916e3482a0da879ff9a3da34ec346f149fa720Remake trie.py using tokens instead of substrings2025-07-21T00:09:44-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/d6c605cc6ef8385bc7e6ecc3344970fbfdcd07cbRefine trie.py by advice of GPT2025-07-16T02:16:19-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/d86250a5a63b4c470db9bee306647a9932f3dac8Refine trie method into a basic tool2025-07-16T01:42:57-04:00dkl9contact@dkl9.net
<pre>trie.py is faster than all methods in main.py on large inputs,
and is about O(n log n) overall.
</pre>
tag:gitlist.org,2012:commit/0f4f8f802240ca6459a121afd8eaf77ddcc4561dImplement trie-based method that may be very fast2025-07-15T22:52:18-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/8495c0a53c3cdcb622f1fecad899e751a2f7349cTrivially improve distance_hierarchy2025-07-10T04:12:28-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/cf8eb64dbed0ed84cb41dbfc48ae3775f6fdf0d9Frantically optimise cachey_nearest2025-07-10T03:40:56-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/60a2e889e233eba1dca72fbab2cc16fda0a37e4bCull to three good methods, now more efficient2025-07-10T03:05:41-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/79b55474a5db26de967083e7ca3a723d74cadea8String mode with Levenshtein distance2025-07-07T00:48:17-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/fed0202573498bc9823d7ca0be080e23e843de5fMaximin method, analyse results harder2025-07-06T01:56:15-04:00dkl9contact@dkl9.net
<pre></pre>
tag:gitlist.org,2012:commit/329f839b85db6694147e8d0344fde878173645c8Sample-spreading method, present better2025-07-06T00:19:25-04:00dkl9contact@dkl9.net
<pre></pre>