| Home | Trees | Indices | Help |
|
|---|
|
|
Bounce analysis module for Lamson. It uses an algorithm that tries to simply collect the headers that are most likely found in a bounce message, and then determine a probability based on what it finds.
|
|||
|
BounceAnalyzer BounceAnalyzer collects up the score and the headers and gives more meaningful interaction with them. |
|||
|
bounce_to Used to route bounce messages to a handler for either soft or hard bounces. |
|||
|
|||
|
|||
|
|||
|
|||
BOUNCE_MATCHERS =
|
|||
BOUNCE_MAX = 16.0
|
|||
PRIMARY_STATUS_CODES =
|
|||
SECONDARY_STATUS_CODES =
|
|||
COMBINED_STATUS_CODES =
|
|||
__package__ =
|
|||
|
|||
Goes through the headers in a potential bounce message recursively and collects all the answers for the usual bounce headers. |
Given a message, this will calculate a probability score based on possible bounce headers it finds and return a lamson.bounce.BounceAnalyzer object for further analysis. The detection algorithm is very simple but still accurate. For each header it finds it adds a point to the score. It then uses the regex in BOUNCE_MATCHERS to see if the value of that header is parseable, and if it is it adds another point to the score. The final probability is based on how many headers and matchers were found out of the total possible. Finally, a header will be included in the score if it doesn't match in value, but it WILL NOT be included in the headers used by BounceAnalyzer to give you meanings like remote_mta and such. Because this algorithm is very dumb, you are free to add to BOUNCE_MATCHERS in your boot files if there's special headers you need to detect in your own code. |
|
|||
BOUNCE_MATCHERS
|
BOUNCE_MAX
|
PRIMARY_STATUS_CODES
|
SECONDARY_STATUS_CODES
|
COMBINED_STATUS_CODES
|
__package__
|
| Home | Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Wed Jul 7 07:32:49 2010 | http://epydoc.sourceforge.net |