]> git.ipfire.org Git - thirdparty/rspamd.git/commit
projects / thirdparty / rspamd.git / commit
? search:
summary | shortlog | log | commit | commitdiff | tree
(parent: 597b386) | patch
[Minor] Replace hash table with linear search for class deduplication 5900/head
authorAlexander Moisseev <moiseev@mezonplus.ru>
Sun, 22 Feb 2026 15:45:03 +0000 (18:45 +0300)
committerAlexander Moisseev <moiseev@mezonplus.ru>
Sun, 22 Feb 2026 15:45:03 +0000 (18:45 +0300)
commitd2ff70152a567eb44e2d8bda577fba85668515ae
tree172be23ea80fbcdc010a072885faba710fa1efe3tree | snapshot
parent597b38601861f538a3ebba2f09ac492ed47b8171commit | diff
[Minor] Replace hash table with linear search for class deduplication

Number of classes per classifier is always small (N < 10 in practice),
so hash table overhead outweighs its O(1) lookup benefit. Linear search
over the already-built UCL array is simpler and faster here.
src/controller.c diff | blob | blame | history
Mirror of https://github.com/rspamd/rspamd.git