{'fraction_non_alphanumeric': 0.02467343976777939, 'fraction_numerical': 0.0, 'mean_word_length': 4.8474576271186445, '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}}
Data structures through plan instantiation

Of course, there may be many successive implementations or mappings of one data structure into another. In practice, however, at the level of a Data Structures course, one or two such mappings is all that is required. Essentially, the sequence of mappings is bounded at both ends. Students in such a course need not consider, or can take as given, the mapplng(s) from constructs available in an algorithm design language or high level programming language down to the level of the machine. At the other end, students, predictably, have not yet been exposed to data structures more abstract than those that are presented explicitly in the course.