11 March 2016 - Forum Rules
Started by abw, May 15, 2011, 05:56:11 PM
Quote from: Nightcrawler on March 13, 2012, 03:25:23 PMHow is this different from what some of these guys do?
Quote from: Nightcrawler on March 13, 2012, 03:25:23 PMIs defining creation of the map part of defining the map?
Quote from: Nightcrawler on March 13, 2012, 03:25:23 PMHow do you propose something like this be implemented code wise?
init list storageinit removal listmain loop: read line if (line is a character map support) parse starting byte parse length of character map //if it is custom, otherwise we will have the length builtin save rest of line and parses into list storage continue end if **process line like normal** if (line identifies hex code) if (hex code is in the range of one of list storages) // requires looking through all of list storage add hex code to removal list end if end ifend main loopforeach list storage add new printable characters from maps // like it was in the format: hexadecimal sequence=text sequence in list storage minus what is in removal listend foreach
QuoteThis utility implements a Longest Prefix insertion algorithm, which guarantees correct text-to-hex translation based on the provided table files as long as the following conditions are satisfied: - all table entries are contained in a single table; and - no table entry's hex sequence is a prefix of any other table entry's hex sequence; and - for each character used in normal table entries, a table entry exists which maps some hex sequence to that single character;and at least one of the following conditions is satisfied: - the text to be translated does not contain raw hex bytes; or - the hex sequence of every table entry represents a single byte.It also guarantees the smallest possible hex length of any correct text-to-hex translation as long as the following additional conditions are satisfied: - the hex sequence of every table entry is the same length; and - the text sequence of every normal table entry is no more than 2 characters long.
QuoteThis utility implements an A* path-finding insertion algorithm, which guarantees correct text-to-hex translation based on the provided table files and guarantees the smallest possible hex length of any correct text-to-hex translation.
Quote0x23 in NORMAL: switch to Kanji for 2 matches0x7F in Kanji, match #1: switch to Dakuten until 0x7F0x02 in Dakuten: "baz"0x7F in Dakuten: fall back to Kanji0x01 in Kanji, match #2: "bar"result: "bazbar"
Quote0x23 in NORMAL: switch to Kanji for 2 matches0x7F in Kanji, match #1: switch to Dakuten until 0x7F0x02 in Dakuten: "baz"no match in Dakuten: fall back to Kanji0x7F in Kanji, match #2: returning from Dakutenmade 2 matches in Kanji: fall back to NORMAL0x01 in NORMAL: "foo"result: "bazfoo"
Page created in 0.047 seconds with 19 queries.