Trees | Indices | Help |
---|
|
A byte based decision tree which uses all the RAMs but is really fast....
Signatures consist of a byte sequence and an optional mask sequence. If present each mask byte is used to logical and the byte being compared before comparison. This allows the creation of signatures which have parts of the sig generalized.
FIXME allow sigs to have a reliability rating FIXME allow sig nodes to store depth and truncate the tree early (and then mask the rest)
|
|||
|
|||
|
|||
|
|||
|
|||
|
|||
|
|
Add a signature to the search tree. If masks goes unspecified, it will be assumed to be all ones (\xff * len(bytes)). Additionally, you may specify "val" as the object to get back with getSignature(). |
Trees | Indices | Help |
---|
Generated by Epydoc 3.0.1 on Fri Nov 16 18:22:12 2012 | http://epydoc.sourceforge.net |