| Commit message (Collapse) | Author | Age | Files | Lines |
|
|
|
|
| |
Add apache license for regexp that were delivered from SpamAssassin project.
Fix debian/copyright for src/dns.c.
|
| |
|
|
|
|
|
|
| |
Now learning increments version of a statfile.
Avoid learning and classifying of similar text parts if a message has 2 text parts.
Several fixes to statistics.
|
| |
|
| |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| |
Uncompatible changes:
- Statistics is uncompatible in utf8 mode
Major changes:
- Improved utf8 mode
- Convert all characters to lowercase in statistics
- Skip URL's in statistics
- Improve speed of bayes classifier by using integer arithmetics
- Fixed statfiles synchronization that was broken for a long time
- Synchronization is now configurable
Minor changes:
- Bugfixes
- Removed some of legacy code
- Types polishing
|
| |
|
|
|
|
|
|
|
|
|
|
| |
- add librspamdserver
- link this library to all daemons and utils of rspamd
- use subdirectories more often
* Rework global variables logic - move them to the main process
* Fix logging to handle utf-8 correctly
* Add statshow utility and make it working
* Move printf functions to separate source file
|
|
|
|
|
|
| |
* Add initial version of statshow utility for statfiles debugging
* Add debugging for statistics
* Remove unused utilities
|
|
|
|
| |
while learning messages
|
|
|
|
|
|
|
|
|
| |
- independent and customizeable buffering
- line buffering
- errors handling support
- custom (ip based) debug
- append function name automaticaly (based on __FUNCTION__)
- add some logic to logs system
|
| |
|
| |
|
| |
|
|
|
|
|
|
|
|
| |
working with XS implicitly)
* Move all system includes to one file where we detect availability of all that includes
* Fix license misprint
* Fix some issues with perl initializing
|
| |
|
|
|
|
|
|
| |
* Change mime parts storage
* Add html tags striping (ported from php code)
* Rework learning to process only text and striped html parts
|
|
|
|
|
|
| |
control interfaces
* Fix small errors in tokenizer and controller interface
|
| |
|
|
|
|
| |
unique tokens and have O(log n) difficulty
|
| |
|
|
|