// Written in the D programming language. /** Classes and functions for handling and transcoding between various encodings. For cases where the encoding is known at compile-time, functions are provided for arbitrary encoding and decoding of characters, arbitrary transcoding between strings of different type, as well as validation and sanitization. Encodings currently supported are UTF-8, UTF-16, UTF-32, ASCII, ISO-8859-1 (also known as LATIN-1), and WINDOWS-1252. The type EString!(Ascii) represents an ASCII string; the type EString!(Latin1) represents an ISO-8859-1 string, and so on. In general, EString!(E) is the string type for encoding E, and EString(Utf8), EString(Utf16) and EString(Utf32) are aliases for string, wstring and dstring respectively. For cases where the encoding is not known at compile-time, but is known at run-time, we provide the abstract class EncodingScheme and its subclasses. To construct a run-time encoder/decoder, one does e.g. ---------------------------------------------------- auto e = EncodingScheme.create("utf-8"); ---------------------------------------------------- This library supplies EncodingScheme subclasses for ASCII, ISO-8859-1 (also known as LATIN-1), WINDOWS-1252, UTF-8, and (on little-endian architectures) UTF-16LE and UTF-32LE; or (on big-endian architectures) UTF-16BE and UTF-32BE. This library provides a mechanism whereby other modules may add EncodingScheme subclasses for any other encoding. Authors: Janice Caron Date: 2008.02.27 - 2008.03.23 License: Public Domain Macros: WIKI=Phobos/StdEncoding */ module std.encoding; import std.string; import std.traits; unittest { ubyte[][] validStrings = [ // Plain ASCII cast(ubyte[])"hello", // The Greek word 'kosme' cast(ubyte[])"κόσμε", // First possible sequence of a certain length [ 0x00 ], // U+00000000 one byte [ 0xC2, 0x80 ], // U+00000080 two bytes [ 0xE0, 0xA0, 0x80 ], // U+00000800 three bytes [ 0xF0, 0x90, 0x80, 0x80 ], // U+00010000 three bytes // Last possible sequence of a certain length [ 0x7F ], // U+0000007F one byte [ 0xDF, 0xBF ], // U+000007FF two bytes [ 0xEF, 0xBF, 0xBF ], // U+0000FFFF three bytes // Other boundary conditions [ 0xED, 0x9F, 0xBF ], // U+0000D7FF Last character before surrogates [ 0xEE, 0x80, 0x80 ], // U+0000E000 First character after surrogates [ 0xEF, 0xBF, 0xBD ], // U+0000FFFD Unicode replacement character [ 0xF4, 0x8F, 0xBF, 0xBF ], // U+0010FFFF Very last character // Non-character code points /* NOTE: These are legal in UTF, and may be converted from one UTF to another, however they do not represent Unicode characters. These code points have been reserved by Unicode as non-character code points. They are permissible for data exchange within an application, but they are are not permitted to be used as characters. Since this module deals with UTF, and not with Unicode per se, we choose to accept them here. */ [ 0xDF, 0xBE ], // U+0000FFFE [ 0xDF, 0xBF ], // U+0000FFFF ]; ubyte[][] invalidStrings = [ // First possible sequence of a certain length, but greater than U+10FFFF [ 0xF8, 0x88, 0x80, 0x80, 0x80 ], // U+00200000 five bytes [ 0xFC, 0x84, 0x80, 0x80, 0x80, 0x80 ], // U+04000000 six bytes // Last possible sequence of a certain length, but greater than U+10FFFF [ 0xF7, 0xBF, 0xBF, 0xBF ], // U+001FFFFF four bytes [ 0xFB, 0xBF, 0xBF, 0xBF, 0xBF ], // U+03FFFFFF five bytes [ 0xFD, 0xBF, 0xBF, 0xBF, 0xBF, 0xBF ], // U+7FFFFFFF six bytes // Other boundary conditions [ 0xF4, 0x90, 0x80, 0x80 ], // U+00110000 First code // point after last character // Unexpected continuation bytes [ 0x80 ], [ 0xBF ], [ 0x20, 0x80, 0x20 ], [ 0x20, 0xBF, 0x20 ], [ 0x80, 0x9F, 0xA0 ], // Lonely start bytes [ 0xC0 ], [ 0xCF ], [ 0x20, 0xC0, 0x20 ], [ 0x20, 0xCF, 0x20 ], [ 0xD0 ], [ 0xDF ], [ 0x20, 0xD0, 0x20 ], [ 0x20, 0xDF, 0x20 ], [ 0xE0 ], [ 0xEF ], [ 0x20, 0xE0, 0x20 ], [ 0x20, 0xEF, 0x20 ], [ 0xF0 ], [ 0xF1 ], [ 0xF2 ], [ 0xF3 ], [ 0xF4 ], [ 0xF5 ], // If this were legal it would start a character > U+10FFFF [ 0xF6 ], // If this were legal it would start a character > U+10FFFF [ 0xF7 ], // If this were legal it would start a character > U+10FFFF [ 0xEF, 0xBF ], // Three byte sequence with third byte missing [ 0xF7, 0xBF, 0xBF ], // Four byte sequence with fourth byte missing [ 0xEF, 0xBF, 0xF7, 0xBF, 0xBF ], // Concatenation of the above // Impossible bytes [ 0xF8 ], [ 0xF9 ], [ 0xFA ], [ 0xFB ], [ 0xFC ], [ 0xFD ], [ 0xFE ], [ 0xFF ], [ 0x20, 0xF8, 0x20 ], [ 0x20, 0xF9, 0x20 ], [ 0x20, 0xFA, 0x20 ], [ 0x20, 0xFB, 0x20 ], [ 0x20, 0xFC, 0x20 ], [ 0x20, 0xFD, 0x20 ], [ 0x20, 0xFE, 0x20 ], [ 0x20, 0xFF, 0x20 ], // Overlong sequences, all representing U+002F /* With a safe UTF-8 decoder, all of the following five overlong representations of the ASCII character slash ("/") should be rejected like a malformed UTF-8 sequence */ [ 0xC0, 0xAF ], [ 0xE0, 0x80, 0xAF ], [ 0xF0, 0x80, 0x80, 0xAF ], [ 0xF8, 0x80, 0x80, 0x80, 0xAF ], [ 0xFC, 0x80, 0x80, 0x80, 0x80, 0xAF ], // Maximum overlong sequences /* Below you see the highest Unicode value that is still resulting in an overlong sequence if represented with the given number of bytes. This is a boundary test for safe UTF-8 decoders. All five characters should be rejected like malformed UTF-8 sequences. */ [ 0xC1, 0xBF ], // U+0000007F [ 0xE0, 0x9F, 0xBF ], // U+000007FF [ 0xF0, 0x8F, 0xBF, 0xBF ], // U+0000FFFF [ 0xF8, 0x87, 0xBF, 0xBF, 0xBF ], // U+001FFFFF [ 0xFC, 0x83, 0xBF, 0xBF, 0xBF, 0xBF ], // U+03FFFFFF // Overlong representation of the NUL character /* The following five sequences should also be rejected like malformed UTF-8 sequences and should not be treated like the ASCII NUL character. */ [ 0xC0, 0x80 ], [ 0xE0, 0x80, 0x80 ], [ 0xF0, 0x80, 0x80, 0x80 ], [ 0xF8, 0x80, 0x80, 0x80, 0x80 ], [ 0xFC, 0x80, 0x80, 0x80, 0x80, 0x80 ], // Illegal code positions /* The following UTF-8 sequences should be rejected like malformed sequences, because they never represent valid ISO 10646 characters and a UTF-8 decoder that accepts them might introduce security problems comparable to overlong UTF-8 sequences. */ [ 0xED, 0xA0, 0x80 ], // U+D800 [ 0xED, 0xAD, 0xBF ], // U+DB7F [ 0xED, 0xAE, 0x80 ], // U+DB80 [ 0xED, 0xAF, 0xBF ], // U+DBFF [ 0xED, 0xB0, 0x80 ], // U+DC00 [ 0xED, 0xBE, 0x80 ], // U+DF80 [ 0xED, 0xBF, 0xBF ], // U+DFFF ]; string[] sanitizedStrings = [ "\uFFFD","\uFFFD", "\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD"," \uFFFD ", " \uFFFD ","\uFFFD\uFFFD\uFFFD","\uFFFD","\uFFFD"," \uFFFD "," \uFFFD ", "\uFFFD","\uFFFD"," \uFFFD "," \uFFFD ","\uFFFD","\uFFFD"," \uFFFD ", " \uFFFD ","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD", "\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD\uFFFD","\uFFFD","\uFFFD", "\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD"," \uFFFD ", " \uFFFD "," \uFFFD "," \uFFFD "," \uFFFD "," \uFFFD "," \uFFFD ", " \uFFFD ","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD", "\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD", "\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD","\uFFFD", ]; // Make sure everything that should be valid, is foreach(a;validStrings) { string s = cast(string)a; assert(isValid(s),"Failed to validate: "~makeReadable(s)); } // Make sure everything that shouldn't be valid, isn't foreach(a;invalidStrings) { string s = cast(string)a; assert(!isValid(s),"Incorrectly validated: "~makeReadable(s)); } // Make sure we can sanitize everything bad assert(invalidStrings.length == sanitizedStrings.length); for(int i=0; i= 0xA0 && c <0x100)) return true; if (c >= 0xFFFD) return false; foreach(wchar d;charMap) { if (c == d) return true; } return false; } bool isValidCodeUnit(Windows1252 c) { if (c < 0x80 || c >= 0xA0) return true; return (charMap[c-0x80] != 0xFFFD); } void encodeViaWrite()(dchar c) { if (c < 0x80 || (c >= 0xA0 && c <0x100)) {} else if (c >= 0xFFFD) { c = '?'; } else { int n = -1; foreach(i,wchar d;charMap) { if (c == d) { n = i; break; } } c = n == -1 ? '?' : 0x80 + n; } write(cast(Windows1252)c); } void skipViaRead()() { read(); } dchar decodeViaRead()() { Windows1252 c = read; return (c >= 0x80 && c < 0xA0) ? charMap[c-0x80] : c; } dchar safeDecodeViaRead()() { Windows1252 c = read; dchar d = (c >= 0x80 && c < 0xA0) ? charMap[c-0x80] : c; return d == 0xFFFD ? INVALID_SEQUENCE : d; } dchar decodeReverseViaRead()() { Windows1252 c = read; return (c >= 0x80 && c < 0xA0) ? charMap[c-0x80] : c; } EString replacementSequence() { return cast(EString)("?"); } mixin EncoderFunctions; } //============================================================================= // UTF-8 //============================================================================= alias char Utf8; template EncoderInstance(E:Utf8) { alias invariant(Utf8)[] EString; alias Buffer!(Utf8) EBuffer; string encodingName() { return "UTF-8"; } bool canEncode(dchar c) { return isValidCodePoint(c); } bool isValidCodeUnit(Utf8 c) { return (c < 0xC0 || (c >= 0xC2 && c < 0xF5)); } byte[128] tailTable = [ 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, 3,3,3,3,3,3,3,3,4,4,4,4,5,5,6,0, ]; private int tails(Utf8 c) in { assert(c >= 0x80); } body { return tailTable[c-0x80]; } void encodeViaWrite()(dchar c) { if (c < 0x80) { write(cast(Utf8)c); } else if (c < 0x800) { write(cast(Utf8)((c >> 6) + 0xC0)); write(cast(Utf8)((c & 0x3F) + 0x80)); } else if (c < 0x10000) { write(cast(Utf8)((c >> 12) + 0xE0)); write(cast(Utf8)(((c >> 6) & 0x3F) + 0x80)); write(cast(Utf8)((c & 0x3F) + 0x80)); } else { write(cast(Utf8)((c >> 18) + 0xF0)); write(cast(Utf8)(((c >> 12) & 0x3F) + 0x80)); write(cast(Utf8)(((c >> 6) & 0x3F) + 0x80)); write(cast(Utf8)((c & 0x3F) + 0x80)); } } void skipViaRead()() { uint c = read; if (c < 0xC0) return; int n = tails(c); for (uint i=0; i 0xF4) // fail overlong 4-6-byte sequences || (c == 0xE0 && ((d & 0xE0) == 0x80)) // fail overlong 3-byte sequences || (c == 0xED && ((d & 0xE0) == 0xA0)) // fail surrogates || (c == 0xF0 && ((d & 0xF0) == 0x80)) // fail overlong 4-byte sequences || (c == 0xF4 && ((d & 0xF0) >= 0x90)) // fail code points > 0x10FFFF ); c &= (1 << (6 - n)) - 1; for (uint i=0; i> 10))); write(cast(Utf16)(0xDC00 + (n & 0x3FF))); } } void skipViaRead()() { Utf16 c = read; if (c < 0xD800 || c >= 0xE000) return; read(); } dchar decodeViaRead()() { Utf16 c = read; if (c < 0xD800 || c >= 0xE000) return cast(dchar)c; Utf16 d = read; c &= 0x3FF; d &= 0x3FF; return 0x10000 + (c << 10) + d; } dchar safeDecodeViaRead()() { Utf16 c = read; if (c < 0xD800 || c >= 0xE000) return cast(dchar)c; if (c >= 0xDC00) return INVALID_SEQUENCE; if (!canRead) return INVALID_SEQUENCE; Utf16 d = peek; if (d < 0xDC00 || d >= 0xE000) return INVALID_SEQUENCE; d = read; c &= 0x3FF; d &= 0x3FF; return 0x10000 + (c << 10) + d; } dchar decodeReverseViaRead()() { Utf16 c = read; if (c < 0xD800 || c >= 0xE000) return cast(dchar)c; Utf16 d = read; c &= 0x3FF; d &= 0x3FF; return 0x10000 + (d << 10) + c; } EString replacementSequence() { return "\uFFFD"w; } mixin EncoderFunctions; } //============================================================================= // UTF-32 //============================================================================= alias dchar Utf32; template EncoderInstance(E:Utf32) { alias invariant(Utf32)[] EString; alias Buffer!(Utf32) EBuffer; string encodingName() { return "UTF-32"; } bool canEncode(dchar c) { return isValidCodePoint(c); } bool isValidCodeUnit(Utf16 c) { return isValidCodePoint(c); } void encodeViaWrite()(dchar c) { write(cast(Utf32)c); } void skipViaRead()() { read(); } dchar decodeViaRead()() { return cast(dchar)read; } dchar safeDecodeViaRead()() { dchar c = read; return isValidCodePoint(c) ? c : INVALID_SEQUENCE; } dchar decodeReverseViaRead()() { return cast(dchar)read; } EString replacementSequence() { return "\uFFFD"d; } mixin EncoderFunctions; } //============================================================================= // Below are forwarding functions which expose the function to the user /** * Returns true if c is a valid code point * * Note that this includes the non-character code points U+FFFE and U+FFFF, * since these are valid code points (even though they are not valid * characters). * * Supercedes: * This function supercedes std.utf.startsValidDchar(). * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * c = the code point to be tested */ bool isValidCodePoint(dchar c) { return c < 0xD800 || (c >= 0xE000 && c < 0x110000); } /** * Returns the name of an encoding. * * The type of encoding cannot be deduced. Therefore, it is necessary to * explicitly specify the encoding type. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Examples: * ----------------------------------- * writefln(encodingName!(Latin1)); * // writes ISO-8859-1 * ----------------------------------- */ string encodingName(T)() { return EncoderInstance!(T).encodingName; } unittest { assert(encodingName!(Utf8) == "UTF-8"); assert(encodingName!(Utf16) == "UTF-16"); assert(encodingName!(Utf32) == "UTF-32"); assert(encodingName!(Ascii) == "ASCII"); assert(encodingName!(Latin1) == "ISO-8859-1"); assert(encodingName!(Windows1252) == "windows-1252"); } /** * Returns true iff it is possible to represent the specifed codepoint * in the encoding. * * The type of encoding cannot be deduced. Therefore, it is necessary to * explicitly specify the encoding type. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Examples: * ----------------------------------- * writefln(canEncode!(Latin1)('A')); * // writes true * ----------------------------------- */ bool canEncode(E)(dchar c) { return EncoderInstance!(E).canEncode(c); } unittest { assert(!canEncode!(Ascii)('\u00A0')); assert(canEncode!(Latin1)('\u00A0')); assert(canEncode!(Windows1252)('\u20AC')); assert(!canEncode!(Windows1252)('\u20AD')); assert(!canEncode!(Windows1252)('\uFFFD')); assert(!canEncode!(Utf8)(cast(dchar)0x110000)); } /** * Returns true if the code unit is legal. For example, the byte 0x80 would * not be legal in ASCII, because ASCII code units must always be in the range * 0x00 to 0x7F. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * c = the code unit to be tested */ bool isValidCodeUnit(E)(E c) { return EncoderInstance!(E).isValidCodeUnit(c); } unittest { assert(!isValidCodeUnit(cast(Ascii)0xA0)); assert( isValidCodeUnit(cast(Windows1252)0x80)); assert(!isValidCodeUnit(cast(Windows1252)0x81)); assert(!isValidCodeUnit(cast(Utf8)0xC0)); assert(!isValidCodeUnit(cast(Utf8)0xFF)); assert( isValidCodeUnit(cast(Utf16)0xD800)); assert(!isValidCodeUnit(cast(Utf32)0xD800)); } /** * Returns true if the string is encoded correctly * * Supercedes: * This function supercedes std.utf.validate(), however note that this * function returns a bool indicating whether the input was valid or not, * wheras the older funtion would throw an exception. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be tested */ bool isValid(E)(const(E)[] s) { while (s.length != 0) { dchar d = EncoderInstance!(E).safeDecode(s); if (d == INVALID_SEQUENCE) return false; } return true; } unittest { assert(isValid("\u20AC100")); } /** * Returns the length of the longest possible substring, starting from * the first code unit, which is validly encoded. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be tested */ uint validLength(E)(const(E)[] s) { const(E)[] r = s; const(E)[] t = s; while (s.length != 0) { if (EncoderInstance!(E).safeDecode(s) == INVALID_SEQUENCE) break; t = s; } return r.length - t.length; } /** * Sanitizes a string by replacing malformed code unit sequences with valid * code unit sequences. The result is guaranteed to be valid for this encoding. * * If the input string is already valid, this function returns the original, * otherwise it constructs a new string by replacing all illegal code unit * sequences with the encoding's replacement character, Invalid sequences will * be replaced with the Unicode replacement character (U+FFFD) if the * character repertoire contains it, otherwise invalid sequences will be * replaced with '?'. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be sanitized */ invariant(E)[] sanitize(E)(invariant(E)[] s) { uint n = validLength(s); if (n == s.length) return s; Buffer!(E) r; r ~= s[0..n]; const(E)[] t = s[n..$]; while (t.length != 0) { const(E)[] tt = t; dchar c = EncoderInstance!(E).safeDecode(t); if (c == INVALID_SEQUENCE) { r ~= EncoderInstance!(E).replacementSequence; } else { r ~= tt[0..$-t.length]; } n = validLength(t); r ~= t[0..n]; t = t[n..$]; } return r.toIArray; } unittest { assert(sanitize("hello \xF0\x80world") == "hello \xEF\xBF\xBDworld"); } /** * Returns the length of the first encoded sequence. * * The input to this function MUST be validly encoded. * This is enforced by the function's in-contract. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be sliced */ uint firstSequence(E)(const(E)[] s) /// ditto in { assert(s.length != 0); const(E)[] u = s; assert(safeDecode(u) != INVALID_SEQUENCE); } body { const(E)[] t = s; EncoderInstance!(E).skip(s); return t.length - s.length; } unittest { assert(firstSequence("\u20AC1000") == "\u20AC".length); } /** * Returns the length the last encoded sequence. * * The input to this function MUST be validly encoded. * This is enforced by the function's in-contract. * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be sliced */ uint lastSequence(E)(const(E)[] s) /// ditto in { assert(s.length != 0); assert(isValid(s)); } body { const(E)[] t = s; EncoderInstance!(E).decodeReverse(s); return t.length - s.length; } unittest { assert(lastSequence("1000\u20AC") == "\u20AC".length); } /** * Returns the total number of code points encoded in a string. * * The input to this function MUST be validly encoded. * This is enforced by the function's in-contract. * * Supercedes: * This function supercedes std.utf.toUCSindex(). * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be counted */ uint count(E)(const(E)[] s) in { assert(isValid(s)); } body { uint n = 0; while (s.length != 0) { EncoderInstance!(E).skip(s); ++n; } return n; } unittest { assert(count("\u20AC100") == 4); } /** * Returns the array index at which the (n+1)th code point begins. * * The input to this function MUST be validly encoded. * This is enforced by the function's in-contract. * * Supercedes: * This function supercedes std.utf.toUTFindex(). * * Standards: Unicode 5.0, ASCII, ISO-8859-1, WINDOWS-1252 * * Params: * s = the string to be counted */ int index(E)(const(E)[] s,int n) in { assert(isValid(s)); assert(n >= 0); } body { const(E)[] t = s; for (uint i=0; i= 0); } body { const(ubyte)[] t = s; for (uint i=0; i= 0x20 && c < 0x80) { r ~= c; } else { r ~= "\\x"; r ~= toHexDigit(c >> 4); r ~= toHexDigit(c); } } r ~= "\""; return r; } string makeReadable(wstring s) { string r = "\""; foreach(wchar c;s) { if (c >= 0x20 && c < 0x80) { r ~= c; } else { r ~= "\\u"; r ~= toHexDigit(c >> 12); r ~= toHexDigit(c >> 8); r ~= toHexDigit(c >> 4); r ~= toHexDigit(c); } } r ~= "\"w"; return r; } string makeReadable(dstring s) { string r = "\""; foreach(dchar c;s) { if (c >= 0x20 && c < 0x80) { r ~= c; } else if (c < 0x10000) { r ~= "\\u"; r ~= toHexDigit(c >> 12); r ~= toHexDigit(c >> 8); r ~= toHexDigit(c >> 4); r ~= toHexDigit(c); } else { r ~= "\\U00"; r ~= toHexDigit(c >> 20); r ~= toHexDigit(c >> 16); r ~= toHexDigit(c >> 12); r ~= toHexDigit(c >> 8); r ~= toHexDigit(c >> 4); r ~= toHexDigit(c); } } r ~= "\"d"; return r; } char toHexDigit(int n) { return "0123456789ABCDEF"[n & 0xF]; } }