]> source.dussan.org Git - rspamd.git/commit
projects / rspamd.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 42b8171) | patch
* Use binary tree in tokenizers, that would provide us fast checking for unique token...
authorVsevolod Stakhov <vsevolod@rambler-co.ru>
Thu, 4 Dec 2008 15:41:00 +0000 (18:41 +0300)
committerVsevolod Stakhov <vsevolod@rambler-co.ru>
Thu, 4 Dec 2008 15:41:00 +0000 (18:41 +0300)
commit249c0583d2a12ddde67e05251e47f256a58cfd05
tree97c1db6e72d4bec5a2640425127c2d094fadea86tree | snapshot
parent42b81716ece887b0011b1e40b0101ad37598997ecommit | diff
* Use binary tree in tokenizers, that would provide us fast checking for unique tokens and have O(log n) difficulty
src/tokenizers/osb.c diff | blob | history
src/tokenizers/tokenizers.c diff | blob | history
src/tokenizers/tokenizers.h diff | blob | history
Rapid spam filtering system: https://github.com/rspamd/rspamd