This page contains the J_History_Fa Package documentation.
Module for pattern match: History based Finite Automaton algorithm.
Bases: netbench.pattern_match.b_dfa.b_dfa
Class for History based Finite Automaton.
Fuction for make History based FA from RE in file_name.
Parameter: | file_name (string) – Name of input file |
---|
Report consumed memory in bytes. Naive mapping algorithm is used (2D array). Basic algorithm for this variant of mapping is: M = |states| * |alphabet| * ceil(log(|states| + 1, 2) / 8) For History is: basic + Mem(Flags) + (State * Sym * Flags * 2)
Returns: | Returns number of bytes. |
---|---|
Return type: | int |
Report consumed memory in bytes. Optimal mapping algorithm is used (with oracle). Basic algorithm for this variant of mapping is: M = |transitions| * ceil(log(|states|, 2) / 8). For History is: basic + Mem(Flags) + (Tran*Flags*2).
Returns: | Returns number of bytes. |
---|---|
Return type: | int |
Make file which represent the History automat. This file will be input into algorithm written in C language.
Parameter: | file_name (string) – Name of output file |
---|
Bases: unittest.TestCase
Test module for History FA.