forked from mia/Aegisub
79 lines
2.7 KiB
C++
79 lines
2.7 KiB
C++
// Copyright (c) 2005, Niels Martin Hansen
|
|
// All rights reserved.
|
|
//
|
|
// Redistribution and use in source and binary forms, with or without
|
|
// modification, are permitted provided that the following conditions are met:
|
|
//
|
|
// * Redistributions of source code must retain the above copyright notice,
|
|
// this list of conditions and the following disclaimer.
|
|
// * Redistributions in binary form must reproduce the above copyright notice,
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
// and/or other materials provided with the distribution.
|
|
// * Neither the name of the Aegisub Group nor the names of its contributors
|
|
// may be used to endorse or promote products derived from this software
|
|
// without specific prior written permission.
|
|
//
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
|
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
|
|
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
|
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
|
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
|
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
|
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
|
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
// POSSIBILITY OF SUCH DAMAGE.
|
|
//
|
|
// -----------------------------------------------------------------------------
|
|
//
|
|
// AEGISUB
|
|
//
|
|
// Website: http://aegisub.cellosoft.com
|
|
// Contact: mailto:zeratul@cellosoft.com
|
|
//
|
|
|
|
// Functions for inline string encoding.
|
|
// See header file for details.
|
|
|
|
#include "string_codec.h"
|
|
|
|
wxString inline_string_encode(const wxString &input)
|
|
{
|
|
const size_t inlen = input.length();
|
|
wxString output(_T(""));
|
|
output.Alloc(inlen);
|
|
for (size_t i = 0; i < inlen; i++) {
|
|
wxChar c = input[i];
|
|
if (c <= 0x1F || c == 0x23 || c == 0x2C || c == 0x3A || c == 0x7C) {
|
|
output << wxString::Format(_T("#%02X"), c);
|
|
} else {
|
|
output << c;
|
|
}
|
|
}
|
|
return output;
|
|
}
|
|
|
|
wxString inline_string_decode(const wxString &input)
|
|
{
|
|
const size_t inlen = input.length();
|
|
wxString output(_T(""));
|
|
output.Alloc(inlen);
|
|
size_t i = 0;
|
|
while (i < inlen) {
|
|
if (input[i] == _T('#')) {
|
|
// check if there's actually enough extra characters at the end of the string
|
|
if (inlen - i < 3)
|
|
break;
|
|
wxString charcode = input.Mid(i+1, 2);
|
|
long c;
|
|
if (charcode.ToLong(&c, 16)) {
|
|
output << (wchar_t)c;
|
|
}
|
|
i += 3;
|
|
} else {
|
|
output << input[i++];
|
|
}
|
|
}
|
|
return output;
|
|
}
|