https://git.dkl9.net/dost/tree/fd1af194b40b6e25b4aa50f9d7c60696ad543859 Recent commits to dost (fd1af194b40b6e25b4aa50f9d7c60696ad543859) 2025-07-22T20:54:00-04:00 tag:gitlist.org,2012:commit/fd1af194b40b6e25b4aa50f9d7c60696ad543859 Make trie method way faster via "caching" 2025-07-22T20:54:00-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/3d916e3482a0da879ff9a3da34ec346f149fa720 Remake trie.py using tokens instead of substrings 2025-07-21T00:09:44-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/d6c605cc6ef8385bc7e6ecc3344970fbfdcd07cb Refine trie.py by advice of GPT 2025-07-16T02:16:19-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/d86250a5a63b4c470db9bee306647a9932f3dac8 Refine trie method into a basic tool 2025-07-16T01:42:57-04:00 dkl9 contact@dkl9.net <pre>trie.py is faster than all methods in main.py on large inputs, and is about O(n log n) overall. &lt;/pre&gt; tag:gitlist.org,2012:commit/0f4f8f802240ca6459a121afd8eaf77ddcc4561d Implement trie-based method that may be very fast 2025-07-15T22:52:18-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/8495c0a53c3cdcb622f1fecad899e751a2f7349c Trivially improve distance_hierarchy 2025-07-10T04:12:28-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/cf8eb64dbed0ed84cb41dbfc48ae3775f6fdf0d9 Frantically optimise cachey_nearest 2025-07-10T03:40:56-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/60a2e889e233eba1dca72fbab2cc16fda0a37e4b Cull to three good methods, now more efficient 2025-07-10T03:05:41-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/79b55474a5db26de967083e7ca3a723d74cadea8 String mode with Levenshtein distance 2025-07-07T00:48:17-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt; tag:gitlist.org,2012:commit/fed0202573498bc9823d7ca0be080e23e843de5f Maximin method, analyse results harder 2025-07-06T01:56:15-04:00 dkl9 contact@dkl9.net <pre>&lt;/pre&gt;