{'fraction_non_alphanumeric': 0.010071942446043165, 'fraction_numerical': 0.0, 'mean_word_length': 5.327272727272727, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A REVIEW ON JAVA HASHMAP AND TREEMAP

Developing robust, efficient software applications is complicated a task. In built collections available in programming languages are of great value for developing efficient and robust software applications. Java inbuilt collections HashMap and TreeMap are very efficient tools for improving search time in the programs and having understanding about the underlying data structures of these collections is of great value. HashMap is based on the concept of hashing and TreeMap based on Red-Black tree. This article provides basic understanding about HashMap and TreeMap and highlights the situations where HashMap should be used and where TreeMap should be.