Expect a 20x - 100x speed increase from the original project. NOTE: Runs much better on a compiler (for example, the first 255 characters get fetched 2m+ times a second on average on turbowarp) To get character of an index in Unicode, use "item (n) of [Unicode: unicode]". Current optimizations: - More costumes + lists for faster case detection - Precalculated/predetected case to not spend time casing the same character - Implemented binary search for unicode list, both 1-255 and 1-65535 - Letters list truncated down to 1441 items, in other words removed useless items - Prefetched unicode values for all 1441 letters, both upper and lower cases - Implemented binary search for letters list, only from 1 to 1441 Pros: - Very fast - Very cool Cons: - Big size (~300kb project and about 400 blocks) - Not so simple code - A little complex, but not too hard to use - Mostly compiler (ex. Turbowarp) dependent
