{'fraction_non_alphanumeric': 0.027093596059113302, 'fraction_numerical': 0.0, 'mean_word_length': 4.985294117647059, '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}}
A note on loop "optimization"

The well-known execution-time reduction by moving invariant code out of a loop can be applied to an unconditional jump. Yet, this simple "optimization" is overlooked by most programmers and compiler designers. This paper reveals the overlooked unconditional jump and shows how moving it can not only reduce execution time, but can standardize and simplify the prototype loop.