16. A dual hash method for use with a pattern search engine, comprising: using said pattern search engine comprising a programmable state machine comprising a balanced routing table search (BaRT)-based finite state machine (BFSM), said search engine comprising two engines: a transition side and a default side; said BFSM being implemented in hardware, or a combination of hardware and software; having an initial rule bank, a default rule bank and a transition rule bank, each said rule having a test portion to determine if there is a match to a current rule, and a result portion which defines the next state targeted by said rule to store default rules and dual hash rules that apply to a pattern context search in a said default rule bank; storing transition rules that apply to a pattern context search in a transition rule bank; and determining a winning rule by prioritizing between a dual hash rule read from said default rule bank and a transition rule read from said transition rule bank; said transition rules having a higher priority than the rules on said default side, which is used for said dual hash; and when there is no match on either one of said default rules or said transition rules, said search engine reverts to said initial state; said dual hash being used (1) for any state for which input values covered by said transition rules are a super-set of said input values covered by said default rules; (2) wherein previous coverage can also be enforced by adding the missing uncovered input values of one or more default rules to a given state; and (3) wherein dual hash can always be used for anchored matching after a first character.
16. A dual hash method for use with a pattern search engine, comprising: using said pattern search engine comprising a programmable state machine comprising a balanced routing table search (BaRT)-based finite state machine (BFSM), said search engine comprising two engines: a transition side and a default side; said BFSM being implemented in hardware, or a combination of hardware and software; having an initial rule bank, a default rule bank and a transition rule bank, each said rule having a test portion to determine if there is a match to a current rule, and a result portion which defines the next state targeted by said rule to store default rules and dual hash rules that apply to a pattern context search in a said default rule bank; storing transition rules that apply to a pattern context search in a transition rule bank; and determining a winning rule by prioritizing between a dual hash rule read from said default rule bank and a transition rule read from said transition rule bank; said transition rules having a higher priority than the rules on said default side, which is used for said dual hash; and when there is no match on either one of said default rules or said transition rules, said search engine reverts to said initial state; said dual hash being used (1) for any state for which input values covered by said transition rules are a super-set of said input values covered by said default rules; (2) wherein previous coverage can also be enforced by adding the missing uncovered input values of one or more default rules to a given state; and (3) wherein dual hash can always be used for anchored matching after a first character. 18. The method according to claim 16 , wherein said dual hash lookup is utilized for any state for which input values covered by transition rules are a super-set of input values covered by default rules.