{'fraction_non_alphanumeric': 0.020560747663551402, 'fraction_numerical': 0.0, 'mean_word_length': 5.305882352941176, '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': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Algorithm Description of Generalized Binary Linked List

Based on the ADT (abstract data type) definition, characteristics and storage structure of generalized list a new representation called GBLL (generalized binary linked list) is proposed. The purpose of GBLL is to improve generalized list in its application areas. A few algorithms of GBLL and the analyses of their complexities are provided. In order to reduce the runtime memory consumption and increase the execution efficiency, non-recursive algorithms are used most of time.