As the data is similar, we will have greater memory savings. Why Trie? As in real life scenarios there will be millions of rules and there is little difference between two IP addresses if they are near.insert(String word): This methods is used to add the string in the Trie.searchNode(String str): This methods is used to search if the string is present in the Trie.It implements trie data structure using HashMap of character at each node. This class was implemented by me before starting this project. This is a utility class which implements trie data structure. Package 3: test: contains junit test cases for testing of the implementation.ĭependency: This project requires junit-4.10.jar to run the application. Package 2: hostbasedfirewall: contains actual implementation. Package 1: utility: contains two helper classes.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |