First Commit
This commit is contained in:
Legaeli
@@ -0,0 +1,226 @@
|
||||
/*
|
||||
==============================================================================
|
||||
|
||||
This file is part of the JUCE framework.
|
||||
Copyright (c) Raw Material Software Limited
|
||||
|
||||
JUCE is an open source framework subject to commercial or open source
|
||||
licensing.
|
||||
|
||||
By downloading, installing, or using the JUCE framework, or combining the
|
||||
JUCE framework with any other source code, object code, content or any other
|
||||
copyrightable work, you agree to the terms of the JUCE End User Licence
|
||||
Agreement, and all incorporated terms including the JUCE Privacy Policy and
|
||||
the JUCE Website Terms of Service, as applicable, which will bind you. If you
|
||||
do not agree to the terms of these agreements, we will not license the JUCE
|
||||
framework to you, and you must discontinue the installation or download
|
||||
process and cease use of the JUCE framework.
|
||||
|
||||
JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/
|
||||
JUCE Privacy Policy: https://juce.com/juce-privacy-policy
|
||||
JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/
|
||||
|
||||
Or:
|
||||
|
||||
You may also use this code under the terms of the AGPLv3:
|
||||
https://www.gnu.org/licenses/agpl-3.0.en.html
|
||||
|
||||
THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL
|
||||
WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF
|
||||
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
|
||||
|
||||
==============================================================================
|
||||
*/
|
||||
|
||||
namespace juce
|
||||
{
|
||||
|
||||
//==============================================================================
|
||||
/*
|
||||
A collection of methods and types for breaking down text into a unicode representation.
|
||||
*/
|
||||
class Unicode
|
||||
{
|
||||
using Key = String;
|
||||
|
||||
public:
|
||||
Unicode() = delete;
|
||||
|
||||
//==============================================================================
|
||||
/* A unicode Codepoint, from this you can infer various Unicode properties such
|
||||
as direction, logical string index and breaking type, etc.
|
||||
*/
|
||||
struct Codepoint
|
||||
{
|
||||
uint32_t codepoint;
|
||||
|
||||
TextBreakType breaking; // Breaking characteristics of this codepoint
|
||||
|
||||
TextScript script; // Script class for this codepoint
|
||||
};
|
||||
|
||||
template <typename Value>
|
||||
static auto prefix (Span<Value> v, size_t num)
|
||||
{
|
||||
return Span { v.data(), std::min (v.size(), num) };
|
||||
}
|
||||
|
||||
template <typename Value>
|
||||
static auto removePrefix (Span<Value> v, size_t num)
|
||||
{
|
||||
const auto increment = std::min (v.size(), num);
|
||||
return Span { v.data() + increment, v.size() - increment };
|
||||
}
|
||||
|
||||
//==============================================================================
|
||||
/* Performs unicode analysis on a piece of text and returns an array of Codepoints
|
||||
in logical order.
|
||||
*/
|
||||
static Array<Codepoint> performAnalysis (const String& string)
|
||||
{
|
||||
if (string.isEmpty())
|
||||
return {};
|
||||
|
||||
thread_local LruCache<Key, Array<Unicode::Codepoint>> cache;
|
||||
|
||||
return cache.get (string, analysisCallback);
|
||||
}
|
||||
|
||||
//==============================================================================
|
||||
template <typename Traits>
|
||||
struct Iterator
|
||||
{
|
||||
using ValueType = typename Traits::ValueType;
|
||||
|
||||
Iterator() = default;
|
||||
explicit Iterator (Span<ValueType> s) : data (s) {}
|
||||
|
||||
std::optional<Span<ValueType>> next()
|
||||
{
|
||||
if (data.empty())
|
||||
return {};
|
||||
|
||||
const auto breakpoint = std::find_if (data.begin(), data.end(), [&] (const auto& i)
|
||||
{
|
||||
return ! Traits::compare (i, data.front());
|
||||
});
|
||||
const auto lengthToBreak = (size_t) std::distance (data.begin(), breakpoint) + (Traits::includeBreakingIndex() ? 1 : 0);
|
||||
const ScopeGuard scope { [&] { data = removePrefix (data, lengthToBreak); } };
|
||||
return prefix (data, lengthToBreak);
|
||||
}
|
||||
|
||||
private:
|
||||
Span<ValueType> data;
|
||||
};
|
||||
|
||||
struct LineTraits
|
||||
{
|
||||
using ValueType = const Codepoint;
|
||||
|
||||
static bool compare (const Codepoint& t1, const Codepoint&)
|
||||
{
|
||||
return t1.breaking != TextBreakType::hard;
|
||||
}
|
||||
|
||||
static bool includeBreakingIndex() { return true; }
|
||||
};
|
||||
|
||||
using LineBreakIterator = Iterator<LineTraits>;
|
||||
|
||||
struct WordTraits
|
||||
{
|
||||
using ValueType = const Codepoint;
|
||||
|
||||
static bool compare (const Codepoint& t1, const Codepoint&)
|
||||
{
|
||||
return t1.breaking != TextBreakType::soft;
|
||||
}
|
||||
|
||||
static bool includeBreakingIndex() { return false; }
|
||||
};
|
||||
|
||||
using WordBreakIterator = Iterator<WordTraits>;
|
||||
|
||||
struct ScriptTraits
|
||||
{
|
||||
using ValueType = const Codepoint;
|
||||
|
||||
static bool compare (const Codepoint& t1, const Codepoint& t2)
|
||||
{
|
||||
return t1.script == t2.script;
|
||||
}
|
||||
|
||||
static bool includeBreakingIndex() { return false; }
|
||||
};
|
||||
|
||||
using ScriptRunIterator = Iterator<ScriptTraits>;
|
||||
|
||||
private:
|
||||
static Array<Unicode::Codepoint> analysisCallback (const Key& key)
|
||||
{
|
||||
auto analysisBuffer = [&key]
|
||||
{
|
||||
std::vector<UnicodeAnalysisPoint> points;
|
||||
|
||||
const auto data = key.toUTF32();
|
||||
const auto length = data.length();
|
||||
|
||||
points.reserve (length);
|
||||
|
||||
std::transform (data.getAddress(), data.getAddress() + length, std::back_inserter (points), [] (uint32_t cp)
|
||||
{
|
||||
UnicodeAnalysisPoint p { cp, UnicodeDataTable::getDataForCodepoint (cp) };
|
||||
|
||||
// Define this to enable TR9 debugging. All upper case
|
||||
// characters will be interpreted as right-to-left.
|
||||
#if defined (JUCE_TR9_UPPERCASE_IS_RTL)
|
||||
if (65 <= cp && cp <= 90)
|
||||
p.data.bidi = BidiType::al;
|
||||
#endif
|
||||
|
||||
return p;
|
||||
});
|
||||
|
||||
return points;
|
||||
}();
|
||||
|
||||
Array<Unicode::Codepoint> result;
|
||||
result.resize ((int) analysisBuffer.size());
|
||||
|
||||
for (size_t i = 0; i < analysisBuffer.size(); i++)
|
||||
result.getReference ((int) i).codepoint = analysisBuffer[i].character;
|
||||
|
||||
TR24::analyseScripts (analysisBuffer, [&result] (int index, TextScript script)
|
||||
{
|
||||
result.getReference (index).script = script;
|
||||
});
|
||||
|
||||
TR14::analyseLineBreaks (analysisBuffer, [&result] (int index, TextBreakType type)
|
||||
{
|
||||
result.getReference (index).breaking = type;
|
||||
});
|
||||
|
||||
return result;
|
||||
}
|
||||
};
|
||||
|
||||
namespace detail
|
||||
{
|
||||
|
||||
std::vector<int> UnicodeHelpers::getLineBreaks (const String& data)
|
||||
{
|
||||
std::vector<int> lineBreaks;
|
||||
const auto analysis = Unicode::performAnalysis (data);
|
||||
|
||||
for (const auto [index, codepoint] : enumerate (analysis, int{}))
|
||||
{
|
||||
if (codepoint.breaking == TextBreakType::hard)
|
||||
lineBreaks.push_back (index);
|
||||
}
|
||||
|
||||
return lineBreaks;
|
||||
}
|
||||
|
||||
} // namespace detail
|
||||
|
||||
} // namespace juce
|
||||
@@ -0,0 +1,315 @@
|
||||
/*
|
||||
==============================================================================
|
||||
|
||||
This file is part of the JUCE framework.
|
||||
Copyright (c) Raw Material Software Limited
|
||||
|
||||
JUCE is an open source framework subject to commercial or open source
|
||||
licensing.
|
||||
|
||||
By downloading, installing, or using the JUCE framework, or combining the
|
||||
JUCE framework with any other source code, object code, content or any other
|
||||
copyrightable work, you agree to the terms of the JUCE End User Licence
|
||||
Agreement, and all incorporated terms including the JUCE Privacy Policy and
|
||||
the JUCE Website Terms of Service, as applicable, which will bind you. If you
|
||||
do not agree to the terms of these agreements, we will not license the JUCE
|
||||
framework to you, and you must discontinue the installation or download
|
||||
process and cease use of the JUCE framework.
|
||||
|
||||
JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/
|
||||
JUCE Privacy Policy: https://juce.com/juce-privacy-policy
|
||||
JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/
|
||||
|
||||
Or:
|
||||
|
||||
You may also use this code under the terms of the AGPLv3:
|
||||
https://www.gnu.org/licenses/agpl-3.0.en.html
|
||||
|
||||
THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL
|
||||
WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF
|
||||
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
|
||||
|
||||
==============================================================================
|
||||
*/
|
||||
|
||||
namespace juce
|
||||
{
|
||||
|
||||
class BidiLine
|
||||
{
|
||||
public:
|
||||
using ParagraphPtr = std::unique_ptr<std::remove_pointer_t<SBParagraphRef>, FunctionPointerDestructor<SBParagraphRelease>>;
|
||||
using LinePtr = std::unique_ptr<std::remove_pointer_t<SBLineRef>, FunctionPointerDestructor<SBLineRelease>>;
|
||||
|
||||
explicit BidiLine (ParagraphPtr p, LinePtr l) : paragraph (std::move (p)), line (std::move (l)) {}
|
||||
|
||||
Span<const SBRun> getRuns() const
|
||||
{
|
||||
return { SBLineGetRunsPtr (line.get()), SBLineGetRunCount (line.get()) };
|
||||
}
|
||||
|
||||
void computeVisualOrder (std::vector<size_t>& result) const
|
||||
{
|
||||
result.clear();
|
||||
|
||||
const auto runs = getRuns();
|
||||
|
||||
if (runs.empty())
|
||||
return;
|
||||
|
||||
return computeResultVector (SBLineGetOffset (line.get()),
|
||||
SBLineGetLength (line.get()),
|
||||
SBParagraphGetBaseLevel (paragraph.get()),
|
||||
runs,
|
||||
result);
|
||||
}
|
||||
|
||||
static void computeResultVector (SBUInteger offset,
|
||||
SBUInteger length,
|
||||
SBLevel baseLevel,
|
||||
Span<const SBRun> runs,
|
||||
std::vector<size_t>& result)
|
||||
{
|
||||
const auto level = [] (const SBRun& x)
|
||||
{
|
||||
return x.level;
|
||||
};
|
||||
|
||||
const auto high = level (*std::max_element (runs.begin(), runs.end(), [&] (const auto& a, const auto& b)
|
||||
{
|
||||
return level (a) < level (b);
|
||||
}));
|
||||
|
||||
const auto pseudoLevel = [] (const SBRun& x)
|
||||
{
|
||||
const auto l = x.level;
|
||||
return (l % 2) == 1 ? l : 0xff;
|
||||
};
|
||||
|
||||
const auto low = pseudoLevel (*std::min_element (runs.begin(), runs.end(), [&] (const auto& a, const auto& b)
|
||||
{
|
||||
return pseudoLevel (a) < pseudoLevel (b);
|
||||
}));
|
||||
|
||||
result.resize (length);
|
||||
std::iota (result.begin(), result.end(), offset);
|
||||
|
||||
for (auto currentLevel = high; currentLevel >= low; --currentLevel)
|
||||
{
|
||||
const auto doFlip = [&] (auto beginRuns, auto endRuns)
|
||||
{
|
||||
const auto getStartOfRunInResult = [&] (const auto runIterator)
|
||||
{
|
||||
return runIterator == endRuns ? result.end()
|
||||
: result.begin() + (ptrdiff_t) (runIterator->offset - offset);
|
||||
};
|
||||
|
||||
for (auto it = beginRuns; it != endRuns;)
|
||||
{
|
||||
const auto begin = std::find_if (it, endRuns, [&] (const SBRun& x) { return currentLevel <= x.level; });
|
||||
it = std::find_if (begin, endRuns, [&] (const SBRun& x) { return x.level < currentLevel; });
|
||||
|
||||
std::reverse (getStartOfRunInResult (begin), getStartOfRunInResult (it));
|
||||
}
|
||||
};
|
||||
|
||||
if (baseLevel % 2 == 0)
|
||||
doFlip (runs.begin(), runs.end());
|
||||
else
|
||||
doFlip (std::make_reverse_iterator (runs.end()), std::make_reverse_iterator (runs.begin()));
|
||||
}
|
||||
}
|
||||
|
||||
private:
|
||||
ParagraphPtr paragraph;
|
||||
LinePtr line;
|
||||
};
|
||||
|
||||
class BidiParagraph
|
||||
{
|
||||
public:
|
||||
using ParagraphPtr = BidiLine::ParagraphPtr;
|
||||
|
||||
explicit BidiParagraph (ParagraphPtr p)
|
||||
: paragraph (std::move (p))
|
||||
{
|
||||
}
|
||||
|
||||
size_t getOffset() const
|
||||
{
|
||||
return SBParagraphGetOffset (paragraph.get());
|
||||
}
|
||||
|
||||
size_t getLength() const
|
||||
{
|
||||
return SBParagraphGetLength (paragraph.get());
|
||||
}
|
||||
|
||||
Span<const SBLevel> getResolvedLevels() const
|
||||
{
|
||||
return { SBParagraphGetLevelsPtr (paragraph.get()), getLength() };
|
||||
}
|
||||
|
||||
BidiLine createLine (size_t offset, size_t length) const
|
||||
{
|
||||
jassert (getOffset() <= offset);
|
||||
jassert (length <= getLength());
|
||||
return BidiLine { ParagraphPtr { SBParagraphRetain (paragraph.get()) },
|
||||
BidiLine::LinePtr { SBParagraphCreateLine (paragraph.get(), offset, length) } };
|
||||
}
|
||||
|
||||
private:
|
||||
ParagraphPtr paragraph;
|
||||
};
|
||||
|
||||
class BidiAlgorithm
|
||||
{
|
||||
public:
|
||||
using AlgorithmPtr = std::unique_ptr<std::remove_pointer_t<SBAlgorithmRef>, FunctionPointerDestructor<SBAlgorithmRelease>>;
|
||||
|
||||
explicit BidiAlgorithm (Span<const juce_wchar> t)
|
||||
: text (t.begin(), t.end())
|
||||
{
|
||||
}
|
||||
|
||||
size_t getLength() const
|
||||
{
|
||||
return text.size();
|
||||
}
|
||||
|
||||
BidiParagraph createParagraph (size_t offset, std::optional<detail::TextDirection> d = {}) const
|
||||
{
|
||||
BidiParagraph::ParagraphPtr result { SBAlgorithmCreateParagraph (algorithm.get(), offset, text.size() - offset, [&]() -> SBLevel
|
||||
{
|
||||
if (! d.has_value())
|
||||
return SBLevelDefaultLTR;
|
||||
return *d == detail::TextDirection::rtl ? 1 : 0;
|
||||
}()) };
|
||||
|
||||
jassert (result != nullptr);
|
||||
|
||||
return BidiParagraph { std::move (result) };
|
||||
}
|
||||
|
||||
template <typename Fn>
|
||||
void forEachParagraph (Fn&& callback, std::optional<detail::TextDirection> dir = {}) const
|
||||
{
|
||||
for (size_t i = 0; i < text.size();)
|
||||
{
|
||||
const auto paragraph = createParagraph (i, dir);
|
||||
callback (paragraph);
|
||||
i += paragraph.getLength();
|
||||
}
|
||||
}
|
||||
|
||||
private:
|
||||
std::vector<juce_wchar> text;
|
||||
AlgorithmPtr algorithm { [&]
|
||||
{
|
||||
SBCodepointSequence sequence { SBStringEncodingUTF32, text.data(), text.size() };
|
||||
return SBAlgorithmCreate (&sequence);
|
||||
}() };
|
||||
};
|
||||
|
||||
//==============================================================================
|
||||
//==============================================================================
|
||||
|
||||
#if JUCE_UNIT_TESTS
|
||||
|
||||
class BidiTests : public UnitTest
|
||||
{
|
||||
public:
|
||||
BidiTests() : UnitTest ("Unicode Bidi", UnitTestCategories::text) {}
|
||||
|
||||
void runTest() override
|
||||
{
|
||||
beginTest ("visual order rtl");
|
||||
{
|
||||
const CharPointer_UTF8 text ("\xd9\x85\xd9\x85\xd9\x85 colour "
|
||||
"\xd9\x85\xd9\x85\xd9\x85\xd9\x85\xd9\x85\xd9\x85\xd9\x85\xd9\x85\n");
|
||||
const std::vector<size_t> result { 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 4, 5, 6, 7, 8, 9, 3, 2, 1, 0 };
|
||||
expect (computeVisualOrder (text) == result);
|
||||
}
|
||||
|
||||
beginTest ("visual order ltr");
|
||||
{
|
||||
const CharPointer_UTF8 text ("hello \xd9\x85\xd9\x85\xd9\x85 world\n");
|
||||
const std::vector<size_t> result { 0, 1, 2, 3, 4, 5, 8, 7, 6, 9, 10, 11, 12, 13, 14, 15 };
|
||||
expect (computeVisualOrder (text) == result);
|
||||
}
|
||||
|
||||
beginTest ("visual order core algorithm");
|
||||
{
|
||||
const char testInput[] { "DID YOU SAY 'he said \"car MEANS CAR\"'?" };
|
||||
const int testLevels[] { 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1 };
|
||||
const char expectedOutput[] { "?'he said \"RAC SNAEM car\"' YAS UOY DID" };
|
||||
|
||||
static_assert (std::size (testInput) == std::size (expectedOutput));
|
||||
static_assert (std::size (testInput) - 1 == std::size (testLevels)); // ignore null terminator
|
||||
|
||||
const auto [baseLevel, runs] = createRunsFromLevels (testLevels);
|
||||
|
||||
std::vector<size_t> result;
|
||||
BidiLine::computeResultVector (0, std::size (testLevels), baseLevel, runs, result);
|
||||
|
||||
std::vector<char> output;
|
||||
|
||||
for (auto i : result)
|
||||
output.push_back (testInput[i]);
|
||||
|
||||
expect (std::equal (output.begin(), output.end(), expectedOutput));
|
||||
}
|
||||
}
|
||||
|
||||
static std::vector<size_t> computeVisualOrder (const String& text)
|
||||
{
|
||||
std::vector<juce_wchar> chars;
|
||||
|
||||
for (const auto t : text)
|
||||
chars.push_back (t);
|
||||
|
||||
BidiAlgorithm algorithm { chars };
|
||||
auto paragraph = algorithm.createParagraph (0);
|
||||
auto line = paragraph.createLine (0, paragraph.getLength());
|
||||
|
||||
std::vector<size_t> order;
|
||||
line.computeVisualOrder (order);
|
||||
return order;
|
||||
}
|
||||
|
||||
static std::pair<SBLevel, std::vector<SBRun>> createRunsFromLevels (Span<const int> levels)
|
||||
{
|
||||
std::vector<SBRun> runs;
|
||||
|
||||
for (size_t i = 0; i < levels.size();)
|
||||
{
|
||||
const auto level = levels[i];
|
||||
|
||||
for (size_t j = i + 1; j < levels.size(); ++j)
|
||||
{
|
||||
const auto lastElement = j == levels.size() - 1;
|
||||
const auto endIndex = lastElement ? j + 1 : j;
|
||||
|
||||
if (levels[j] != level || lastElement)
|
||||
{
|
||||
runs.push_back ({ (SBUInteger) i, (SBUInteger) (endIndex - i), (SBLevel) level });
|
||||
i = endIndex;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
const auto baseLevel = std::size (levels) == 0 ? 0 : *std::min_element (std::begin (levels), std::end (levels));
|
||||
|
||||
if (baseLevel % 2 != 0)
|
||||
std::reverse (runs.begin(), runs.end());
|
||||
|
||||
return { (SBLevel) baseLevel, runs };
|
||||
}
|
||||
};
|
||||
|
||||
static BidiTests bidiTests;
|
||||
|
||||
#endif
|
||||
|
||||
} // namespace juce
|
||||
@@ -0,0 +1,565 @@
|
||||
/*
|
||||
==============================================================================
|
||||
|
||||
This file is part of the JUCE framework.
|
||||
Copyright (c) Raw Material Software Limited
|
||||
|
||||
JUCE is an open source framework subject to commercial or open source
|
||||
licensing.
|
||||
|
||||
By downloading, installing, or using the JUCE framework, or combining the
|
||||
JUCE framework with any other source code, object code, content or any other
|
||||
copyrightable work, you agree to the terms of the JUCE End User Licence
|
||||
Agreement, and all incorporated terms including the JUCE Privacy Policy and
|
||||
the JUCE Website Terms of Service, as applicable, which will bind you. If you
|
||||
do not agree to the terms of these agreements, we will not license the JUCE
|
||||
framework to you, and you must discontinue the installation or download
|
||||
process and cease use of the JUCE framework.
|
||||
|
||||
JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/
|
||||
JUCE Privacy Policy: https://juce.com/juce-privacy-policy
|
||||
JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/
|
||||
|
||||
Or:
|
||||
|
||||
You may also use this code under the terms of the AGPLv3:
|
||||
https://www.gnu.org/licenses/agpl-3.0.en.html
|
||||
|
||||
THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL
|
||||
WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF
|
||||
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
|
||||
|
||||
==============================================================================
|
||||
*/
|
||||
|
||||
/* This file was generated with JUCE-Utils/Unicode/generate_unicode_blob.py */
|
||||
namespace juce
|
||||
{
|
||||
enum class LineBreakType : uint8_t
|
||||
{
|
||||
al, bk, cm, cr, gl, lf, nl, sp, wj, zw, zwj, ai, b2, ba, bb, cb, cj, cl, cp, eb, em, ex, h2, h3, hl, hy, in, is, jl, id, jt, jv, ns, nu, op, po, pr, qu, ri, sa, sg, sy, xx, opw
|
||||
};
|
||||
|
||||
enum class EastAsianWidthType : uint8_t
|
||||
{
|
||||
neutral, narrow, ambiguous, full, half, wide
|
||||
};
|
||||
|
||||
enum class VerticalTransformType : uint8_t
|
||||
{
|
||||
r, u, tr, tu
|
||||
};
|
||||
|
||||
enum class EmojiType : uint8_t
|
||||
{
|
||||
yes, presentation, modifier, modifierBase, component, extended, no
|
||||
};
|
||||
|
||||
enum class BreakOpportunity : uint8_t
|
||||
{
|
||||
direct, indirect, prohibited, combinedIndirect, combinedProhibited
|
||||
};
|
||||
|
||||
struct UnicodeEntry
|
||||
{
|
||||
LineBreakType bt;
|
||||
EastAsianWidthType asian;
|
||||
VerticalTransformType vertical;
|
||||
EmojiType emoji;
|
||||
};
|
||||
|
||||
class UnicodeDataTable
|
||||
{
|
||||
static auto computeHash()
|
||||
{
|
||||
uint32_t v = 5381;
|
||||
|
||||
for (auto c : compressedData)
|
||||
v = ((v << 5) + v) + (uint32_t) c;
|
||||
|
||||
return v;
|
||||
}
|
||||
|
||||
public:
|
||||
UnicodeDataTable() = delete;
|
||||
|
||||
static UnicodeEntry getDataForCodepoint (uint32_t codepoint)
|
||||
{
|
||||
static const auto data = []
|
||||
{
|
||||
jassert (computeHash() == 0x58aac9b4);
|
||||
|
||||
MemoryInputStream mStream { compressedData, std::size (compressedData), false };
|
||||
GZIPDecompressorInputStream zStream { &mStream, false };
|
||||
|
||||
Array<UnicodeEntry> arr;
|
||||
arr.resize (uncompressedSize / sizeof (UnicodeEntry));
|
||||
[[maybe_unused]] const auto r = zStream.read (arr.getRawDataPointer(), uncompressedSize);
|
||||
jassert (r == uncompressedSize);
|
||||
|
||||
return arr;
|
||||
}();
|
||||
|
||||
jassert (isPositiveAndBelow (codepoint, data.size()));
|
||||
return data[(int) codepoint];
|
||||
}
|
||||
|
||||
private:
|
||||
static constexpr auto uncompressedSize = 4456444;
|
||||
static constexpr uint8_t compressedData[]
|
||||
{
|
||||
0x78,0x9c,0xec,0xdd,0x0b,0x77,0xa3,0x48,0x7a,0x00,0x50,0xa4,0x36,0x9d,0x4d,0x7a,0xed,0xdd,0xce,0xc4,0xc9,0x66,0x66,0xbd,
|
||||
0xeb,0xb1,0xdd,0x99,0x44,0xff,0xff,0x07,0x46,0x58,0xd0,0xc6,0x65,0x1e,0xc5,0xb3,0x40,0xbe,0xc7,0xe7,0x1e,0x49,0x08,0xf8,
|
||||
0xea,0x4d,0x81,0xb0,0x74,0xcc,0xb2,0xaf,0xc7,0x1e,0xb7,0x67,0xf9,0xd9,0xa1,0xf4,0x25,0x62,0x9b,0x58,0xff,0x72,0xc8,0xbe,
|
||||
0xde,0x9f,0xfd,0x38,0xcb,0x0e,0xd9,0xcd,0xcb,0xf9,0xf1,0xf9,0xf2,0xfc,0x75,0xd9,0xd3,0xd9,0xbf,0xd7,0xde,0xfb,0xed,0xec,
|
||||
0xbf,0xcb,0xc7,0xff,0x3b,0xfb,0xfd,0xbc,0x3c,0xc6,0x6f,0xe5,0x36,0x59,0xcd,0x7d,0xf0,0x7a,0x69,0x45,0x5e,0x5e,0xde,0xf2,
|
||||
0xb3,0xba,0x22,0xfe,0xed,0xd9,0xf7,0xf2,0x75,0x5b,0x9d,0x7c,0x9d,0xb1,0x7e,0xfb,0xdc,0x9c,0x3d,0x1d,0x2f,0x75,0x5e,0x94,
|
||||
0xcd,0xcb,0xf1,0xf2,0x58,0xa4,0xef,0xdb,0xf1,0x70,0x76,0x7e,0x9e,0x1d,0xf2,0xe2,0xf1,0x47,0x76,0x59,0x7e,0x5b,0x2c,0x3b,
|
||||
0x1e,0xf2,0xe2,0xf9,0x73,0xb1,0x7e,0xb9,0x5e,0xe1,0xee,0x75,0xfd,0xec,0xe7,0xeb,0xba,0x1f,0x59,0xb5,0xcf,0x8b,0xa7,0x72,
|
||||
0xdd,0x46,0x5d,0xef,0x45,0xae,0x57,0xc4,0x68,0x7d,0xff,0x18,0x68,0xdb,0x6f,0xb8,0x4e,0xb8,0x7e,0xdb,0xf2,0x7a,0xfc,0x70,
|
||||
0xfb,0x30,0xdd,0xb1,0x79,0xed,0x2b,0x83,0xbe,0xfd,0x0c,0x89,0xd3,0x54,0x2e,0x31,0x65,0x39,0x24,0x66,0x53,0x1d,0x34,0xc5,
|
||||
0xec,0x5b,0xa7,0x2d,0xbd,0x53,0xcb,0x34,0x36,0xff,0xac,0xaf,0xad,0x3f,0xc5,0x3e,0x72,0x3d,0xe6,0x1a,0x3f,0x49,0xaf,0x56,
|
||||
0x17,0xaf,0xf3,0x89,0xec,0xfd,0x1c,0xa2,0x7a,0x5d,0x5f,0xa7,0x6b,0x7f,0xe1,0x1c,0xa4,0xbe,0xcd,0xdd,0xa0,0x7a,0x3f,0x94,
|
||||
0xe6,0xcd,0xef,0xf1,0xc8,0x58,0x37,0x23,0xb7,0x69,0x33,0x26,0x0d,0x7d,0xf5,0x7b,0x2a,0x85,0xcb,0x7f,0x0b,0xde,0x6f,0x5b,
|
||||
0x2f,0xdc,0x57,0xd6,0xb4,0xde,0x71,0xba,0x53,0xdf,0x7e,0xfa,0xfa,0xec,0x54,0x53,0xe2,0xef,0xdd,0x94,0xfc,0xcd,0x51,0xf6,
|
||||
0x7b,0x36,0xb5,0xfc,0x36,0xa4,0xeb,0x3c,0x3d,0x75,0xda,0xa0,0x49,0xdf,0x31,0x2b,0x75,0xda,0xb6,0x9c,0xbe,0x58,0xc5,0x5c,
|
||||
0xe1,0xb6,0x21,0x3f,0x2f,0xe5,0xeb,0xb5,0xae,0x15,0xce,0xe9,0x36,0x7b,0x1b,0xd7,0x8e,0x0d,0xcf,0xef,0xcb,0xc7,0x70,0x7e,
|
||||
0x14,0xfa,0xdb,0x8a,0xfa,0x62,0x87,0xed,0x2e,0x46,0x4c,0xfd,0x3f,0xd7,0xfc,0x96,0xbd,0xcd,0x1d,0xeb,0xe5,0x15,0xe3,0xbe,
|
||||
0xf6,0x58,0x49,0xdd,0xb6,0x87,0x58,0xa2,0x1d,0xfe,0x1e,0xe9,0xb9,0xf6,0x3c,0x4c,0x53,0xea,0x72,0xe1,0x4d,0xd5,0xa6,0x63,
|
||||
0xe6,0x52,0xb1,0xef,0x37,0xad,0x5b,0xad,0x13,0xdb,0x7e,0xe6,0xce,0x67,0x7d,0xec,0x48,0xd9,0x06,0xd7,0x3c,0x66,0x5c,0xcb,
|
||||
0xf1,0x7c,0x0f,0x86,0xd4,0x4b,0xd5,0x1e,0xc7,0x48,0xd5,0x7f,0x96,0x2a,0x93,0x70,0x9b,0xe2,0x58,0x5d,0x8d,0x49,0x55,0x9e,
|
||||
0x8b,0xf5,0x5e,0x4a,0x6b,0xa5,0x75,0x48,0xfa,0x63,0xb6,0x9b,0xa3,0x2f,0xae,0xd5,0x97,0xdb,0xd2,0x3d,0x34,0xfe,0xd8,0xf9,
|
||||
0xdb,0x52,0x4e,0xc1,0xf3,0x26,0x43,0xdb,0xeb,0x56,0x2d,0x7d,0x6c,0x59,0x23,0xc6,0x98,0xf1,0xe3,0x5a,0x2c,0x55,0xd6,0x7d,
|
||||
0xfb,0x1a,0x9a,0xbe,0xdb,0xd2,0x9a,0xc7,0xa5,0x70,0x7c,0xea,0x5b,0x3f,0x1c,0x7b,0x96,0x1e,0x8b,0x86,0x7c,0x2e,0xd1,0x96,
|
||||
0x96,0xfa,0x78,0xd4,0x57,0x67,0xe1,0xd8,0xd5,0x34,0x96,0x85,0xf1,0xda,0xc6,0xbe,0xb6,0xf1,0x3a,0x4c,0x63,0x18,0x6b,0x68,
|
||||
0xfd,0x57,0xe7,0xe7,0x4d,0xe5,0x53,0x2d,0x7f,0x09,0xe2,0x35,0xe5,0xab,0xab,0xac,0xbb,0xf2,0xb2,0x85,0xfa,0xef,0x7b,0x5e,
|
||||
0xaf,0x93,0xae,0x7a,0x8f,0xa9,0xff,0xbe,0x7a,0xee,0x6b,0x8b,0x7d,0xed,0x27,0xb6,0xfe,0x9b,0xc6,0x99,0xd8,0xf6,0x39,0xb4,
|
||||
0xfe,0xbb,0xea,0x64,0x8b,0xf5,0x3f,0xb6,0xff,0x37,0xb5,0x91,0xb6,0xfa,0x1f,0x52,0xce,0x5d,0x6d,0x63,0x4a,0xff,0x7f,0x89,
|
||||
0x88,0x31,0x24,0x9f,0x31,0xf5,0xb1,0x87,0xfe,0x3f,0xb6,0xfe,0x87,0xf6,0xff,0xbe,0xfe,0xb4,0xc6,0xf8,0xdf,0x57,0x57,0x31,
|
||||
0x63,0x40,0x5f,0x59,0xb7,0x8d,0x69,0x6d,0x63,0x5c,0x5b,0x9e,0x9b,0xda,0x4e,0xdf,0xb2,0xae,0xe5,0xb1,0x6d,0xa8,0xad,0x8e,
|
||||
0xda,0xc6,0xf4,0xb6,0x3e,0x12,0xdb,0xff,0xfb,0xda,0x49,0x97,0x39,0xe7,0x7f,0xd5,0x71,0xbf,0xaf,0xad,0xc6,0xce,0x59,0xd7,
|
||||
0x1c,0xfb,0xe7,0xda,0xff,0xd0,0xfe,0x1f,0x5b,0xff,0x5d,0x65,0xda,0xd6,0x7e,0xc3,0xe7,0x53,0xfa,0x7f,0x57,0x3a,0xee,0x22,
|
||||
0xcb,0xa6,0x9e,0xaf,0x98,0x6d,0xb6,0x5c,0xff,0x73,0x8d,0xff,0x73,0xd5,0x7f,0x93,0xa6,0xb4,0x4e,0xa9,0xff,0x30,0x8f,0x43,
|
||||
0x0c,0xed,0xfb,0x29,0xea,0x7f,0x2e,0xf5,0x3c,0x4e,0xad,0xff,0xb6,0x32,0x0f,0xe3,0x0d,0x4d,0xdb,0x12,0xe3,0x7f,0xdb,0x79,
|
||||
0x61,0x95,0xfe,0xa1,0xf3,0xbf,0x21,0x7d,0x71,0xec,0xf1,0x7a,0x4c,0xac,0x21,0xeb,0xc5,0xa4,0xab,0xef,0x58,0xde,0xd7,0x7e,
|
||||
0xba,0xd6,0xe9,0x1b,0x23,0x86,0x8e,0xff,0xf5,0x76,0x39,0x74,0x0c,0xf8,0xe3,0x93,0x08,0xf3,0xfd,0x32,0x71,0x7f,0xd9,0x80,
|
||||
0x7a,0xaa,0xae,0xeb,0x8d,0x19,0xa3,0x97,0x56,0x2f,0x9f,0x3f,0x82,0x65,0x61,0xf9,0xad,0x51,0x47,0x6b,0xc4,0xea,0x6a,0xfb,
|
||||
0x31,0x69,0x18,0xdb,0x4f,0xfb,0xda,0xe4,0xda,0x8a,0x36,0x7c,0x17,0xa8,0x2f,0xbb,0xa9,0x3d,0xbf,0x2d,0x5f,0xdf,0x37,0xb8,
|
||||
0x29,0xb7,0x0b,0xef,0xe9,0xe9,0x9b,0x57,0xcc,0x7d,0x9d,0x3b,0xbc,0xaf,0xab,0x7a,0x7c,0x3a,0xfb,0x5e,0x7b,0x1c,0x7b,0xae,
|
||||
0xb3,0x05,0xb1,0xc7,0xa1,0x3e,0xb7,0x11,0xcb,0x9b,0xe2,0x0f,0x89,0x31,0x25,0x7d,0x4b,0x39,0x65,0x6f,0xe3,0x71,0x5b,0x19,
|
||||
0x77,0xb5,0x8d,0x7a,0x9b,0xa8,0xf7,0x8d,0xb6,0x73,0xa7,0x9b,0x52,0xea,0xbe,0xde,0x35,0xf6,0x7f,0x56,0x43,0x8f,0xdf,0x61,
|
||||
0xdd,0xa6,0x4e,0x7f,0x6a,0xb1,0xe5,0xd7,0xb6,0x7d,0xea,0xb1,0xb4,0xaf,0x8f,0xb7,0x1d,0x33,0xeb,0xcf,0xf7,0xec,0xef,0xf9,
|
||||
0x81,0x84,0xfe,0x99,0xd1,0xe5,0x1f,0x2c,0x2a,0xf5,0xf8,0xb3,0x07,0x4d,0xe3,0x7c,0xcc,0xf8,0x7f,0x9a,0xb8,0xfd,0x56,0x6c,
|
||||
0x3d,0xfd,0x5b,0xad,0x9f,0xad,0x94,0xcf,0x56,0xcb,0xff,0xb3,0x69,0x3a,0x5f,0x2f,0x96,0x77,0x9d,0x87,0x2e,0x99,0x8e,0x35,
|
||||
0xeb,0xa7,0xeb,0xfa,0x13,0xcb,0x95,0x77,0xdf,0xfb,0x97,0xb6,0x77,0x00,0x00,0xe0,0x93,0x58,0xf3,0xdc,0xa3,0xfa,0xec,0xd5,
|
||||
0xfc,0x7f,0x9c,0xdb,0xac,0xff,0x73,0xcb,0xae,0xb9,0xfe,0x92,0xe7,0x5f,0xb1,0xf7,0x35,0x2d,0x55,0xf7,0xe1,0xe7,0xd7,0xb1,
|
||||
0xf7,0xda,0xcc,0x1d,0x7f,0xe8,0xe7,0xaf,0x63,0x62,0x85,0xdb,0x9d,0x26,0xc4,0x4f,0xfd,0xf9,0xe1,0xb5,0xa9,0xda,0xde,0x63,
|
||||
0xed,0x75,0xd5,0x77,0xeb,0xf7,0x9b,0x55,0xe5,0x3f,0xf5,0x3e,0xef,0xa9,0x63,0x40,0xf5,0x7e,0x75,0x1f,0x4f,0x95,0xfe,0xbb,
|
||||
0x60,0x79,0xd8,0xc7,0x6e,0xca,0xc7,0xb5,0xd2,0xcf,0x78,0x43,0xc7,0x9f,0xd8,0x7b,0xa3,0xd6,0xd2,0x75,0x5f,0x6b,0xea,0xf9,
|
||||
0xd3,0x56,0x9d,0x22,0xa5,0x6e,0x97,0x63,0xee,0xdd,0xaa,0x9b,0xba,0x7d,0xd8,0xae,0xaa,0xf1,0x6e,0xea,0x7d,0x2d,0x4b,0xeb,
|
||||
0x3a,0x7e,0x5f,0xf3,0xf1,0x3f,0x55,0xfa,0xdb,0xca,0x6f,0x48,0x3b,0x69,0x4a,0x77,0xea,0xb1,0x75,0xe9,0x71,0xbb,0xad,0xff,
|
||||
0x55,0xeb,0xa4,0x6e,0x4f,0xa9,0xdb,0x72,0xca,0x3e,0x34,0xc7,0xfc,0x6d,0xea,0xf6,0x73,0xe4,0x21,0xe5,0x7d,0xc4,0x7b,0xd7,
|
||||
0x94,0xaf,0xd4,0xe3,0xc6,0xdc,0x63,0xce,0x50,0x31,0xf3,0x96,0xa1,0xed,0xbf,0x7e,0xdd,0xe6,0x36,0x1b,0x77,0x2d,0x67,0x8e,
|
||||
0xb4,0xd7,0xe3,0x87,0xf5,0xbf,0xa7,0x3a,0xab,0xb6,0x9d,0xfb,0xff,0x47,0xb6,0x62,0xa9,0x31,0x29,0x75,0xbe,0x96,0xca,0x77,
|
||||
0x4c,0x79,0x84,0xfd,0x6e,0xc8,0xf7,0x6c,0xb5,0x95,0xe1,0x5e,0xdb,0xdf,0x90,0xb1,0x67,0xcf,0xed,0xa9,0x29,0x1f,0x63,0xb6,
|
||||
0x89,0x39,0x7e,0x2e,0xd1,0x7e,0x9b,0xc6,0xe5,0xae,0xb1,0xfa,0x18,0x3c,0xaf,0xef,0x63,0xef,0xf5,0x07,0x73,0x5b,0xa2,0xbf,
|
||||
0xee,0x49,0xea,0xf2,0x07,0xae,0x4f,0xdf,0xfc,0x62,0xeb,0xf3,0x8f,0xb9,0xd2,0x7f,0xea,0x79,0xdc,0x6a,0xfe,0xf6,0x6c,0x6a,
|
||||
0xbe,0xa6,0x6c,0x1f,0xd3,0x6e,0x96,0xae,0xc7,0xbe,0x18,0x77,0xb5,0xf5,0x9a,0xce,0x89,0x2b,0x37,0xc1,0xeb,0x7f,0xcd,0x2e,
|
||||
0x73,0x86,0x7f,0xcb,0xb2,0x9b,0x6a,0xfe,0x50,0xfc,0x16,0xfb,0xcf,0xf5,0xce,0xcf,0xff,0x7c,0xac,0x7e,0xeb,0xf4,0xf2,0xd9,
|
||||
0xe2,0x8f,0xe3,0xc5,0x53,0x76,0xf9,0xfd,0xf5,0xf0,0x75,0xf5,0x5b,0xec,0xd5,0x6f,0xe8,0xfd,0x7a,0x7c,0x53,0xec,0xef,0x90,
|
||||
0x5d,0x34,0xcd,0x5d,0x8a,0xb8,0xcf,0xe7,0x6d,0x9f,0xb3,0xc3,0xeb,0xef,0xc0,0xbf,0xca,0x6a,0x8f,0x65,0x3e,0x7f,0xd4,0x62,
|
||||
0x3d,0x66,0x87,0xfc,0xb1,0x58,0xfe,0xe1,0x37,0xfb,0x2e,0xe9,0x2d,0x7e,0x2f,0xa1,0x48,0x5b,0x71,0x9f,0xda,0x79,0xdd,0x4a,
|
||||
0xde,0x5d,0x0f,0x1f,0x3f,0x47,0xed,0xba,0xd6,0x57,0x7f,0xfd,0xa7,0xc6,0x3a,0x3d,0x0c,0x9e,0xbf,0x55,0xed,0xa0,0xef,0xf7,
|
||||
0x68,0xb3,0x5a,0xfe,0xea,0xbf,0x47,0x1b,0xfe,0x46,0x6d,0xcc,0xf6,0x63,0xdb,0x72,0xfd,0xfc,0xf3,0xa5,0xc3,0x73,0xf5,0xfc,
|
||||
0xa6,0xb6,0xfc,0xd8,0xbd,0xcd,0x87,0x6d,0x5b,0x96,0x3d,0x77,0xac,0x37,0xc4,0xb8,0x79,0xf7,0x21,0xf0,0x73,0xd9,0xcd,0x71,
|
||||
0x40,0xdd,0x57,0xa6,0x5c,0xff,0x7f,0xbb,0x67,0xe0,0xd2,0x97,0x8a,0xe7,0xdf,0x8e,0xef,0xef,0x25,0x78,0x3e,0xb6,0xdd,0x27,
|
||||
0xf0,0x7e,0xf9,0xdb,0x76,0x45,0x3d,0x1d,0x3e,0xbc,0xff,0x71,0xdb,0xb7,0x78,0x67,0xf9,0xdb,0xfa,0xd5,0x78,0x70,0x78,0x17,
|
||||
0xe7,0x7d,0xdb,0x8c,0xdb,0x77,0x29,0x6f,0xbf,0x57,0x22,0x6a,0xfb,0x20,0x2d,0xe1,0xf3,0x52,0x39,0x96,0x7d,0x6b,0xd9,0xfe,
|
||||
0x32,0xce,0xbd,0xad,0x57,0xcb,0x7b,0xb4,0xa6,0x7d,0x8e,0xd9,0x6e,0x88,0x6f,0xb5,0xfa,0x0f,0xef,0x1f,0x09,0xc7,0x8e,0xb3,
|
||||
0xbc,0xc9,0xc4,0xe3,0x5c,0x5e,0x1a,0xbe,0xed,0x4a,0xbf,0xdf,0x1b,0xfe,0xb6,0xf7,0x2c,0x56,0x4e,0x77,0x98,0xf6,0x70,0x59,
|
||||
0xd3,0xfb,0xd5,0x63,0xfd,0xf7,0x84,0x9a,0xca,0x20,0xdc,0xcf,0xa5,0x5d,0x36,0xef,0xbf,0xed,0xb8,0xd4,0xf4,0x1b,0xea,0x1f,
|
||||
0xe3,0x1c,0x1a,0xf7,0xdd,0x96,0xa7,0xd8,0xf2,0x69,0x7b,0xdd,0xb7,0x3c,0x66,0xff,0x1f,0xcb,0xa6,0x7d,0xf9,0xd8,0x7c,0x8c,
|
||||
0x4d,0xc7,0x94,0x36,0x35,0xb6,0x6c,0x66,0xed,0x43,0x1b,0x88,0xb3,0x94,0x5f,0x67,0xd9,0x4f,0xf7,0xd8,0x5f,0xcd,0xf5,0xaa,
|
||||
0xc7,0xee,0x63,0x44,0xbb,0x87,0xfc,0x90,0x17,0xfa,0x8f,0xbf,0x1f,0x8f,0xdd,0x4f,0xf9,0xf1,0xeb,0xf7,0xb3,0xee,0x63,0x3e,
|
||||
0x73,0xd5,0x79,0xfc,0xdc,0x69,0xa8,0xd4,0xf9,0x1e,0x5d,0x06,0x2d,0x79,0xa9,0xce,0x0b,0xe7,0x28,0x83,0x8e,0x6d,0x8a,0x7e,
|
||||
0x53,0x97,0xbd,0x79,0xed,0x57,0x59,0xa9,0xb1,0x7f,0xbd,0x5b,0x7f,0xa6,0x7a,0x5c,0xca,0xfb,0x72,0x88,0xbd,0x87,0x79,0x8a,
|
||||
0x21,0xe9,0x5b,0x22,0xfe,0xd0,0xf9,0x3f,0x8b,0xc9,0x37,0x90,0x86,0x76,0x0b,0xb4,0x95,0xcb,0x79,0x68,0xfb,0x3c,0x9b,0xf6,
|
||||
0xf9,0x78,0x25,0x75,0x7a,0x3e,0x18,0x78,0x1c,0x9c,0xab,0x3c,0xfa,0xca,0xa9,0x3d,0x7e,0xd9,0x16,0x7b,0xda,0x77,0xdf,0x31,
|
||||
0xac,0xbe,0x9f,0xf2,0x75,0x5e,0x7f,0x3d,0x76,0xbd,0x60,0xdd,0xc6,0xf7,0x9b,0xb6,0x1f,0x6a,0xcc,0xfe,0x46,0xc4,0xbd,0x94,
|
||||
0xe1,0xdb,0x3c,0xe2,0xeb,0xcf,0xb9,0x43,0xa9,0x78,0xbf,0x56,0x26,0x3f,0x5f,0x07,0xf3,0x88,0x6a,0x9d,0x70,0xf9,0xcf,0x79,
|
||||
0xfe,0xb7,0xec,0xa2,0xda,0xe7,0x43,0x96,0x5d,0x1c,0xb3,0xfc,0x97,0xf2,0xf1,0xe1,0xf5,0x9a,0xce,0xc7,0x7d,0xcf,0x2d,0xcc,
|
||||
0x5f,0x98,0x8f,0xb6,0x3c,0xbe,0x2b,0xab,0x58,0x03,0xd3,0x56,0x2f,0xc7,0xea,0x79,0xfd,0xf5,0x43,0xc3,0xb2,0xde,0x34,0xc7,
|
||||
0x96,0x4b,0x77,0x7a,0x87,0xb5,0xa9,0xaa,0xac,0x46,0xe4,0x3b,0x6a,0xbb,0x91,0xe5,0xdb,0x96,0xef,0x57,0xc7,0xf7,0x6d,0xe3,
|
||||
0x21,0x7c,0x2f,0x28,0xff,0x4a,0xb1,0x2c,0x6b,0x58,0xe7,0xf5,0x79,0xfe,0x71,0xdd,0x87,0xe0,0x75,0xf8,0xde,0x43,0x47,0x7d,
|
||||
0xfe,0x5c,0x37,0xff,0x98,0x8e,0x6f,0x41,0xdc,0x9f,0xe9,0xce,0xdf,0xef,0xff,0x97,0x60,0xfb,0x77,0xf9,0x0b,0xf3,0xff,0x56,
|
||||
0x1f,0xaf,0xf5,0x5b,0x2d,0xfb,0x25,0x2f,0x65,0x17,0x1d,0x6d,0x26,0x7c,0x6c,0x6b,0x33,0x5d,0xaf,0xdf,0x34,0x9f,0xd3,0xf4,
|
||||
0xb5,0xc5,0xee,0xf5,0xba,0xc7,0xcd,0xbc,0xe5,0xf9,0xfb,0xf4,0x34,0xa5,0xeb,0xfd,0x38,0xf0,0xf5,0x5b,0xb0,0xce,0x8f,0x16,
|
||||
0xc5,0x7b,0xf7,0x17,0x1f,0xc6,0xa8,0xf0,0xfa,0x4b,0xec,0xe3,0xa0,0x79,0xe5,0x8c,0x5e,0x8f,0xeb,0x79,0xed,0x2f,0x6e,0x1e,
|
||||
0x10,0xbb,0xde,0x47,0xf1,0x31,0xa2,0xb7,0x7d,0xbb,0xd6,0x95,0xce,0xd3,0xe1,0x9c,0x86,0x43,0xc7,0xe3,0x06,0xd2,0x08,0xb0,
|
||||
0x31,0x79,0x36,0xe5,0x78,0xf2,0x89,0xfd,0x9c,0x43,0x04,0xc7,0x98,0xa9,0x8f,0xa9,0xf3,0xb5,0x89,0x32,0xdd,0x48,0x59,0x6c,
|
||||
0x25,0x1d,0xc0,0x66,0xe5,0xd9,0xe0,0xe3,0x68,0xc4,0xf9,0x79,0xfe,0xfe,0xda,0xc2,0x3c,0x12,0x97,0x55,0x43,0x7e,0xbe,0xe5,
|
||||
0x1f,0x3f,0x4b,0x5a,0x2b,0x3d,0x5b,0xb9,0xaf,0xff,0xed,0xde,0xd2,0xd4,0x69,0x99,0xb3,0xad,0xf5,0xb5,0xc3,0xb5,0xe2,0xcc,
|
||||
0x99,0xbf,0xd4,0xf5,0x03,0x8c,0xd1,0xf5,0x7f,0x20,0x75,0xf5,0xef,0xf5,0xac,0xfe,0x07,0xe5,0x3e,0x8b,0xff,0xfe,0x87,0x14,
|
||||
0xea,0xff,0x27,0xd7,0xf4,0x9d,0x05,0x5b,0x39,0xce,0xad,0x51,0x0e,0x5d,0xdf,0xbd,0x31,0xe5,0x37,0xc5,0x97,0xfe,0xff,0xef,
|
||||
0xb8,0xff,0x3f,0xe9,0x6f,0x03,0xd7,0xfc,0x7e,0xea,0xff,0xff,0xff,0x31,0x52,0xd7,0xff,0x0d,0xd6,0xff,0xcf,0xed,0x29,0x7b,
|
||||
0x3f,0xce,0x54,0xdb,0x87,0xaf,0xfb,0xae,0x21,0x85,0xfb,0xbf,0xaf,0xc5,0x08,0xff,0xaf,0xae,0xa9,0xac,0xff,0x5c,0x6a,0xfb,
|
||||
0x5f,0xbc,0xa7,0x86,0x18,0x6d,0x79,0x7a,0x1f,0xeb,0x6d,0x1e,0x55,0x7d,0x77,0x68,0x4c,0x5e,0xa6,0xfc,0xcf,0xd6,0x9c,0x1e,
|
||||
0xf2,0xc3,0x2a,0x8a,0x7b,0x1d,0xd7,0x8a,0xf5,0x99,0x0d,0xbd,0xff,0x34,0x75,0x7a,0xe1,0x1a,0xad,0x71,0xef,0xfa,0x98,0xfe,
|
||||
0x1b,0x6e,0x7f,0xfb,0xe5,0xf0,0xf5,0x7b,0xfe,0xe5,0x55,0xb5,0xce,0x63,0x6d,0xfd,0xea,0x7f,0x6f,0xfa,0x1e,0x63,0xd7,0x7f,
|
||||
0xac,0x3d,0xaf,0x6f,0xd7,0xe7,0xd8,0xe2,0x21,0x3f,0xe6,0x4d,0xeb,0x36,0xed,0xe3,0xf1,0x2d,0x6f,0x97,0x6d,0xca,0x32,0xf8,
|
||||
0x6b,0x99,0xf7,0xbe,0xc7,0xa5,0xad,0x15,0xa7,0x2f,0x7e,0x4c,0xbe,0xfb,0xde,0x2b,0x54,0x6d,0xac,0xaa,0xab,0xc7,0xf3,0xb2,
|
||||
0x8b,0xb7,0x36,0x56,0xb4,0x07,0xe5,0xbf,0x4c,0xf9,0x87,0xcb,0x1f,0x5f,0xdf,0x3b,0xbe,0x2b,0xff,0x6d,0xcf,0x09,0xfa,0xeb,
|
||||
0x63,0x5b,0xe9,0xfd,0x5c,0x94,0xfd,0x32,0x65,0x3a,0x44,0xd5,0xd7,0xc7,0x4a,0x9d,0xd7,0xd4,0xe5,0xdd,0xa7,0xef,0xfe,0xd9,
|
||||
0xd4,0xe9,0xdb,0xb8,0x3c,0x78,0x64,0x53,0xbe,0xb0,0xb8,0xd4,0x75,0xdc,0x57,0xdf,0xa9,0xd3,0x04,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xec,0xcd,0xdb,0xef,
|
||||
0xb7,0x7f,0x4e,0xa9,0xcb,0x1f,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80,0xf9,0x3c,0x6e,0x20,0x0d,0x00,0x00,0x00,0x00,
|
||||
0x8c,0x77,0xca,0xde,0xa4,0x4e,0xcb,0x5a,0xf9,0x6c,0x93,0x65,0xd9,0x2e,0xdd,0x96,0x52,0xa7,0x03,0xd8,0x97,0x62,0xdc,0xb8,
|
||||
0xcf,0xe6,0x19,0x3f,0x7e,0x8f,0x54,0xad,0x7f,0x9a,0x59,0xea,0xb2,0x9c,0xe2,0x18,0x68,0x5a,0xd6,0x66,0x2b,0x69,0x4f,0x9d,
|
||||
0x8e,0xbd,0xab,0x97,0xe3,0x6d,0x83,0x6b,0x6e,0xff,0xb0,0xa6,0xae,0xfe,0x73,0x0a,0x1e,0x63,0xb6,0xdd,0xd2,0x71,0x2c,0x1c,
|
||||
0x8b,0x9b,0xc6,0xe6,0xa5,0xc7,0xeb,0x98,0xe3,0xd4,0x71,0x60,0xbe,0x9f,0x7b,0xca,0x3f,0x75,0x9b,0x9a,0xdb,0x5d,0xe9,0xbe,
|
||||
0xd4,0xd7,0x6e,0xae,0xed,0x38,0x1c,0x3b,0xff,0xe9,0xd3,0x57,0x6e,0xd5,0xf1,0x35,0x76,0xfe,0xda,0x57,0xfe,0x53,0x0d,0x69,
|
||||
0x1f,0xf5,0xb2,0x1a,0x3a,0xff,0xde,0x4a,0x3d,0xae,0x71,0xfd,0x62,0x89,0x76,0x13,0x8e,0x3d,0x7f,0xcf,0x0f,0xab,0xab,0x5f,
|
||||
0xbf,0xda,0xda,0x79,0x41,0x8a,0xbe,0xdf,0xb6,0xbf,0xfa,0x3c,0x3a,0x7c,0xaf,0xaa,0xbf,0xb1,0xfd,0xbf,0xda,0xcf,0x1f,0x13,
|
||||
0xc5,0xc6,0x6f,0xda,0x76,0x2f,0xc7,0xbf,0xa5,0xc6,0xf0,0x30,0xff,0x31,0xed,0x3f,0xdc,0xf7,0xd0,0xfa,0x0f,0xdb,0xd5,0xd4,
|
||||
0xfa,0x67,0x3e,0x4b,0xcf,0xd1,0x9b,0x62,0x4e,0xed,0x07,0x4d,0xe3,0xd3,0xd0,0x63,0x51,0x5b,0xbc,0xb9,0xde,0x1f,0x7b,0xde,
|
||||
0x32,0xf5,0xfd,0x6b,0x74,0xed,0xe7,0x2f,0x9f,0x59,0xcc,0x9c,0x77,0xea,0xf1,0x27,0xf4,0x9f,0xe7,0xf9,0xe0,0x7f,0xad,0x48,
|
||||
0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,
|
||||
0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,
|
||||
0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,
|
||||
0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,
|
||||
0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,
|
||||
0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,
|
||||
0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,
|
||||
0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,
|
||||
0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0x4f,0x3c,0xf1,0xc4,0x13,0xef,0x5a,
|
||||
0xe2,0x9d,0xb2,0x61,0xfe,0xb9,0xa0,0x30,0xd6,0x3f,0xae,0x40,0x98,0xa7,0xff,0xcd,0x32,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x60,0xe7,0x4e,0xc7,0x03,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x30,0xd2,0x43,0x0e,0x00,0x7c,0x36,0x59,0x96,0xb5,0x3a,0x0d,0x14,0xbb,0x8f,0xbf,0x9d,0x1d,0xcb,
|
||||
0xc7,0x18,0xd9,0x80,0x75,0xeb,0x4e,0x3d,0xcb,0x4f,0x2d,0xeb,0xb6,0x6d,0xd7,0x96,0x36,0xae,0xc3,0xd0,0xf6,0x1e,0xd3,0xfe,
|
||||
0x01,0xd8,0x96,0xef,0x67,0x4f,0x1b,0x48,0xc7,0xde,0x5d,0xfb,0xb1,0xaf,0xef,0x78,0x3f,0x75,0xce,0xb0,0xf6,0x9c,0xe3,0x39,
|
||||
0x78,0x7d,0x3c,0x4e,0x72,0xf3,0xdb,0xf9,0x1c,0xe2,0x7b,0xe9,0xb7,0xd2,0x7d,0xe9,0xa9,0x5c,0xfe,0xeb,0xd9,0x29,0x6b,0x56,
|
||||
0x9c,0x07,0x4c,0xd1,0x74,0x4e,0x53,0xc5,0x1d,0xfb,0x18,0xee,0xe7,0x21,0xcf,0x5a,0x7d,0xcf,0xbf,0x9c,0x1f,0xbf,0xbc,0x3e,
|
||||
0x16,0xf9,0x79,0xcc,0x2f,0xaa,0x32,0x28,0xd6,0x79,0xca,0x8f,0xe7,0xf7,0x8f,0x1f,0x1e,0x3f,0xa6,0xfd,0xfd,0xbe,0x8b,0xfd,
|
||||
0x15,0xcb,0x5f,0xce,0x9e,0xcb,0x75,0xc2,0xf2,0x6b,0x6b,0xb3,0xa9,0xfb,0x0d,0xdb,0x55,0x8d,0x1d,0x7f,0x2a,0x1f,0xef,0xbf,
|
||||
0x9c,0xdb,0xf0,0x97,0xc3,0xab,0x97,0xb3,0xe7,0xf2,0x79,0xe1,0xe9,0xcb,0xb9,0xad,0x9e,0x55,0xaf,0xbf,0xbf,0xae,0x9b,0x95,
|
||||
0x8f,0x87,0x68,0x8f,0xe7,0x7d,0x3c,0xbe,0xee,0x27,0xfb,0xe9,0x7e,0xe0,0x3e,0xa6,0x7a,0x2a,0xf3,0xf1,0x96,0x9f,0x63,0x82,
|
||||
0xf8,0x55,0x79,0x1e,0x7f,0x96,0xed,0xf7,0x9b,0xf3,0x18,0x71,0xf6,0xbd,0xf4,0x78,0xf6,0x70,0xf6,0xd7,0x48,0x0f,0x3b,0xf4,
|
||||
0x58,0xcb,0x67,0x2a,0xf5,0xe3,0x68,0xdf,0x3a,0x73,0xbe,0x5f,0x8f,0xfb,0x5c,0xf6,0xb9,0x7a,0x7b,0x7c,0x29,0xbd,0x8e,0xef,
|
||||
0xe7,0xf5,0xdb,0x5c,0xf6,0xd1,0x7e,0x6c,0x6d,0x3a,0xc6,0xfe,0xe5,0xfc,0xfa,0x5b,0xf1,0xd9,0x5f,0x36,0xee,0x38,0xb1,0xe6,
|
||||
0xb1,0x65,0xee,0x58,0xa7,0x19,0xf7,0x3d,0x75,0xde,0x9b,0x7a,0xde,0x78,0xed,0xf3,0x76,0xe2,0xda,0xdc,0x6d,0xcd,0x35,0xb4,
|
||||
0x8d,0xbd,0xa7,0x7f,0x4f,0xc6,0x96,0xf1,0xd6,0xce,0xa1,0x3f,0xdb,0xf8,0x79,0xdc,0x40,0xb9,0xb1,0x0d,0xa9,0xc6,0x8d,0x94,
|
||||
0xf1,0x97,0xcc,0xcf,0x50,0xc7,0xc4,0x69,0x4d,0x5d,0x76,0x63,0xca,0x72,0x4b,0x69,0x4b,0x5d,0x5e,0x6d,0x9a,0xae,0x95,0x6e,
|
||||
0x29,0xfd,0x45,0xec,0xdb,0x0d,0x94,0x53,0x5f,0x1d,0xf7,0xad,0xdf,0x96,0x87,0xd4,0xe3,0xfa,0x96,0xc7,0x7f,0xa8,0xda,0xdf,
|
||||
0xef,0x91,0xf6,0xd2,0x7e,0xa5,0x6f,0xd9,0xf4,0xee,0x2d,0xfd,0x73,0xe7,0x77,0x4a,0xde,0xa7,0x96,0x57,0xdf,0xf6,0xa7,0x09,
|
||||
0xb1,0xd6,0x4e,0x1b,0xd7,0xd9,0x7f,0x00,0x0a,0x29,0xc7,0xbf,0xb9,0xc6,0xdf,0x54,0xe3,0xff,0x9e,0x8e,0x0d,0xb1,0x69,0x4d,
|
||||
0x7d,0xac,0xdd,0xa2,0xbe,0xb2,0xda,0x5b,0x5b,0x68,0x6a,0x13,0x61,0x7e,0xd7,0x98,0xfb,0x14,0xfb,0xdf,0xe2,0xf5,0xad,0x2d,
|
||||
0x99,0x63,0x6c,0x4e,0xdd,0x7f,0x96,0xea,0x7f,0x73,0xb6,0xf9,0x35,0xda,0xfb,0x98,0x3a,0x5f,0xb3,0x7f,0xb4,0x95,0x47,0xea,
|
||||
0xfa,0x4f,0x2d,0x7b,0xbd,0x87,0x38,0xa5,0x75,0xeb,0x7d,0xa9,0xfd,0xa7,0xee,0x57,0x53,0x84,0x9f,0x11,0x75,0x7d,0x5e,0x14,
|
||||
0x7e,0xa6,0xd4,0x54,0x1e,0x5d,0xaf,0xd7,0xee,0xef,0x5d,0x9f,0x7f,0xc5,0x7e,0xf6,0xda,0xd5,0x7f,0x6e,0x7b,0xf4,0x6d,0x9f,
|
||||
0xba,0xee,0x53,0x4b,0x3f,0xfe,0x6d,0x4f,0x5b,0x7b,0x6d,0x5a,0xb7,0xad,0xdd,0xfd,0xba,0xe3,0xfc,0xcf,0xdd,0xae,0xfa,0xfa,
|
||||
0xe7,0x92,0xf1,0x53,0xe5,0x79,0xed,0xf8,0x43,0xda,0xd8,0x9c,0x7d,0x34,0xf5,0xf8,0xb1,0x77,0xa9,0xfb,0xe9,0x1e,0xa4,0xae,
|
||||
0x23,0xf5,0xbf,0x5c,0x3d,0xa5,0x4e,0xf3,0x5a,0xf9,0x4f,0x9d,0xb6,0x58,0x31,0xf7,0xac,0xd5,0x4d,0xbd,0x7f,0x04,0x20,0x95,
|
||||
0xd4,0xc7,0x8b,0xd4,0xe3,0xfd,0x90,0xb4,0x56,0xc7,0x84,0xfa,0xff,0xaa,0xc5,0x1c,0xfb,0xd8,0x66,0xfb,0x8b,0xad,0xf7,0x14,
|
||||
0xe9,0x1f,0xf2,0x1d,0x24,0x73,0xe4,0x23,0x75,0xfd,0xc5,0x5c,0xd7,0xdd,0xa2,0xad,0xb5,0xc7,0x2d,0xa5,0x3f,0x26,0xfe,0xd0,
|
||||
0x76,0xbc,0x37,0x53,0xbe,0x5b,0xa8,0xeb,0x1a,0xe1,0xd2,0xf5,0x18,0x7b,0x5e,0x53,0xaf,0xb7,0x7a,0x3d,0x0e,0xad,0xfb,0xbd,
|
||||
0xd6,0xff,0xd8,0x71,0x3a,0xbc,0x0e,0x3c,0xe4,0x7f,0x62,0xb3,0x6c,0xb9,0x7a,0x8f,0x69,0x6b,0x75,0x53,0xcf,0x7f,0xb7,0x5c,
|
||||
0xff,0x63,0xfb,0xed,0x90,0x72,0x69,0xfa,0x3c,0x60,0x48,0x3f,0x4a,0x5d,0x46,0x61,0x79,0x15,0x8f,0x77,0x91,0x69,0xdf,0x7a,
|
||||
0xfd,0xaf,0xd5,0x5e,0xc2,0xfd,0xd4,0xdb,0xc2,0x6d,0xcb,0xfa,0xd5,0xf3,0xd8,0x76,0x56,0xaf,0x97,0xf0,0x3b,0x37,0xe6,0x2e,
|
||||
0x87,0x14,0xf3,0x8f,0xb5,0xfa,0xc2,0x94,0x63,0x78,0xd8,0xc7,0x53,0xcd,0x59,0xb7,0x24,0xa6,0x4e,0x9b,0xd6,0x9b,0x5a,0xdf,
|
||||
0x43,0xb6,0x6f,0xfa,0x6e,0x9a,0x2d,0x8e,0xbf,0x4b,0xb7,0xe5,0xa5,0x8f,0xff,0x55,0x8c,0x98,0xba,0x3b,0x75,0xbc,0x9e,0x5b,
|
||||
0x6c,0x3b,0xed,0x5a,0xb7,0x9e,0xd7,0xbe,0xb2,0x0f,0xcb,0xa6,0xa9,0xac,0xea,0x79,0xee,0x2a,0xdb,0xd8,0x36,0xdb,0x15,0xab,
|
||||
0xab,0x1d,0xc4,0xb6,0x13,0x68,0x92,0x7a,0x0c,0xdc,0xc2,0xb8,0x3a,0x74,0x5e,0x58,0x9f,0x47,0x0c,0x3d,0xcf,0xa8,0xca,0x3c,
|
||||
0xdc,0xbf,0xfa,0x4f,0x5b,0xd7,0x6d,0x75,0xde,0x57,0x7e,0x3e,0x7f,0x66,0xcf,0xd2,0xdf,0xff,0x3f,0xde,0xb1,0xc3,0xdb,0x77,
|
||||
0xdf,0xf6,0xbb,0x3b,0xbb,0x2d,0xdd,0x97,0xea,0x71,0x6e,0x27,0x68,0x4b,0x73,0xcc,0xf7,0xf6,0xae,0x21,0xf5,0xf8,0xbd,0x85,
|
||||
0xf1,0x3f,0xbc,0xce,0x3f,0xa4,0xff,0x4c,0x1d,0xff,0xef,0x46,0x98,0xb7,0xff,0xef,0xc7,0x94,0xe3,0xf9,0x52,0xf5,0xb7,0x77,
|
||||
0x7f,0xac,0x68,0x8e,0x98,0x63,0xeb,0xaf,0xda,0xbe,0x3e,0x7f,0x1f,0x1a,0x0b,0xae,0x4d,0xea,0x31,0x7d,0xcd,0xe3,0xfd,0xd0,
|
||||
0x63,0x3b,0xda,0xdf,0xd2,0x86,0x7c,0x7e,0xd8,0x67,0xee,0xb2,0xaf,0xaf,0x37,0x64,0x9b,0xa6,0xe7,0x6b,0x8f,0x07,0xa7,0xe0,
|
||||
0xf9,0xa9,0x61,0x9d,0x2c,0x78,0xac,0x9f,0x0b,0x74,0x7d,0xe6,0x54,0xf7,0xd9,0xe7,0x8f,0x4b,0xf7,0xff,0x3d,0x8c,0x13,0x43,
|
||||
0x3e,0x4b,0x6a,0x3b,0x2e,0xdd,0xd5,0xf6,0xb5,0x6e,0xf9,0xc7,0x5d,0x23,0x39,0x6e,0xe0,0x7a,0xcf,0x94,0xeb,0x41,0x4d,0xef,
|
||||
0xdf,0xb5,0x5c,0xdf,0xb9,0xab,0xad,0xdf,0x7f,0xfd,0x24,0xbe,0xfc,0xf6,0x50,0x86,0x63,0xca,0x36,0x46,0x78,0x4d,0xec,0xae,
|
||||
0xa6,0x5a,0x3e,0xee,0xfa,0xd5,0x54,0xe9,0xc7,0x8f,0xa5,0xa5,0x1e,0xe3,0x81,0x6d,0x8a,0x1d,0x3f,0x52,0x8f,0x61,0x43,0xe7,
|
||||
0x5d,0xe1,0x39,0x40,0xd7,0xdc,0xab,0xe9,0x7b,0x41,0x62,0xcb,0x6f,0xce,0xf3,0xb7,0x31,0xe3,0x79,0x31,0x6f,0xbc,0x4f,0x58,
|
||||
0x07,0x55,0x3a,0xe6,0xfe,0x1c,0x7e,0x48,0x1d,0xf6,0xcd,0xbd,0x19,0xd7,0xff,0x4f,0x2d,0xcf,0xb7,0x26,0xa6,0xfe,0x9b,0xae,
|
||||
0x09,0xf4,0x8d,0x0b,0x31,0x6d,0x68,0xea,0xf9,0xff,0x5e,0xca,0x3e,0xe6,0x1a,0xcb,0x98,0x6b,0xae,0xae,0x9f,0x00,0x9f,0xd5,
|
||||
0x92,0x63,0x74,0x38,0x47,0x83,0x6b,0x33,0xb5,0x7d,0xa7,0x98,0x4b,0x3d,0x07,0xe6,0xd8,0xe7,0x98,0xbc,0xfb,0x7e,0x7a,0x00,
|
||||
0x00,0x00,0xe6,0x96,0xfa,0x3a,0x01,0xdb,0xb9,0xfe,0xc1,0x7c,0x7d,0x6a,0xca,0xbd,0x0b,0xea,0x1f,0xde,0x4b,0x3d,0x1e,0x03,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x2c,0x2d,0xf5,0xfd,0x9a,0x4c,0xbb,0x77,0x35,0xf5,0xf7,0xca,0x02,0x00,0x5c,
|
||||
0x9b,0xa7,0x9a,0xef,0x35,0xa9,0xd3,0x15,0x0a,0xd3,0x54,0xa5,0xf7,0xa9,0xe1,0x3d,0x60,0x3f,0xea,0x63,0x4f,0xea,0xb4,0xc0,
|
||||
0x5c,0x8a,0xdf,0x7f,0xb9,0xe9,0x50,0xb5,0xfb,0xee,0xdf,0x90,0x49,0x7f,0x0d,0x0d,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x52,0xff,0x0f,0x3f,0x00,0xec,0x89,0xef,0x45,0xbb,0x7e,0xdd,0xdf,0x1b,0x74,0x2d,0xd2,
|
||||
0xcf,0x41,0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x52,0xc8,0x00,0x00,0xae,0xd0,0x56,0xe7,0x3f,0x45,0xfc,0xdf,0x23,
|
||||
0x85,0xe9,0xbe,0x2d,0xa5,0x2e,0xdb,0x3d,0x9b,0x52,0xfe,0xa9,0xdb,0x4f,0x15,0xff,0xd8,0xe0,0xb6,0x23,0xbd,0x5b,0x49,0xff,
|
||||
0x5c,0x9a,0xf2,0x5f,0x2f,0x87,0xa1,0xfd,0xa4,0x5a,0x37,0xb6,0xfc,0x86,0xb4,0x9f,0xbe,0xfa,0x5c,0xb2,0x9d,0x2c,0x55,0xe7,
|
||||
0xa9,0xcf,0x5f,0x01,0x00,0x60,0x88,0xd4,0xe7,0x2f,0xd7,0x2c,0x3c,0xf7,0x4a,0x5d,0xd7,0x68,0xff,0x53,0x84,0x65,0x77,0x2c,
|
||||
0x97,0x77,0x5d,0x83,0xd8,0xbb,0xae,0xb6,0x13,0xae,0x3b,0x47,0x99,0x7e,0x36,0x8f,0xf9,0xe1,0x9d,0x9b,0xb3,0x53,0x16,0xef,
|
||||
0x98,0x5f,0x0c,0xd9,0xa6,0xee,0x21,0x07,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xfa,0xf8,0xfe,0x7f,0x00,0x00,0xa0,0x92,0x01,0x00,0xb3,0x19,0xfb,0x7b,0x9c,0x6b,0x8b,
|
||||
0x99,0x23,0xa4,0x4e,0x23,0x4b,0x4a,0xff,0x1b,0xb8,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x43,0x64,0xf9,0xe1,
|
||||
0x9d,0x53,0x76,0xf8,0xb0,0xac,0xed,0xfd,0xe2,0xf9,0x43,0x0e,0x90,0x5e,0x31,0x1e,0xed,0xcd,0x5f,0xf3,0x37,0x73,0xef,0x2f,
|
||||
0x66,0x9f,0xa9,0xeb,0x0c,0x80,0x7d,0xf8,0x78,0x0c,0x49,0x7f,0x0e,0x03,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x8c,0x93,
|
||||
0xb1,0x1b,0x73,0xd5,0xdf,0xd0,0xed,0xe7,0x68,0x3f,0xf5,0xf5,0x8f,0xa5,0xdb,0xda,0xf3,0x4a,0xea,0xfe,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xb0,0xb4,0x63,0x76,0xd8,0xa5,0xea,0xf7,0x0b,0xd7,
|
||||
0x88,0xd1,0x25,0xe3,0xaa,0x0c,0xff,0xcd,0xe6,0xf4,0x7d,0x78,0x8a,0xd4,0xe5,0x0d,0xcc,0x2f,0x76,0xfc,0x4a,0x9d,0xce,0x98,
|
||||
0x3c,0xa4,0x4e,0xc7,0xda,0x9a,0xe6,0x22,0x7d,0xef,0xcf,0x21,0x66,0xff,0x5b,0x29,0x93,0xd4,0x75,0x94,0xc2,0xf0,0xb9,0x49,
|
||||
0x4c,0xff,0x4f,0xff,0xbd,0xb6,0x5b,0x50,0xff,0x0e,0xda,0xbe,0xef,0xbc,0x85,0xb9,0xa4,0x1e,0x23,0x52,0x8f,0x69,0xd7,0x6c,
|
||||
0x2b,0xe5,0x7f,0xcd,0xe7,0xaf,0x4c,0x1d,0x7f,0x98,0x9b,0x72,0x8d,0x2f,0x9f,0x7a,0x3b,0x0c,0xdb,0x64,0x5b,0x1b,0x1d,0x53,
|
||||
0xbe,0xa7,0xc8,0x6d,0xd5,0x5d,0x7b,0x39,0xc4,0x8e,0x19,0x5b,0x2c,0xe3,0x21,0xed,0x28,0x6c,0x8f,0x5b,0xcc,0x0f,0xc0,0xb5,
|
||||
0x32,0x3f,0x05,0xb6,0xa6,0x1a,0x97,0x7e,0xbf,0x12,0xa9,0xaf,0x91,0x01,0x00,0xeb,0x4b,0x7d,0x1f,0xef,0x92,0xae,0x35,0xaf,
|
||||
0x31,0x75,0x3a,0xa5,0x3d,0x54,0xcf,0x6f,0x03,0xc5,0xb2,0x29,0xf7,0x9a,0x34,0xe5,0x65,0xea,0x3d,0xdc,0xa9,0x3f,0x3f,0x03,
|
||||
0x00,0x00,0x00,0xd8,0xba,0x2d,0x7c,0x96,0x0a,0xa4,0x71,0xec,0xd0,0xf7,0x7e,0xac,0xa1,0xb1,0xda,0xd6,0x4d,0x5d,0x56,0x70,
|
||||
0x6d,0x52,0xdf,0x4f,0x35,0x75,0xde,0xd0,0x35,0xa6,0xcc,0x79,0x1f,0x57,0x5b,0xb9,0xa5,0xae,0x3f,0x80,0x54,0x52,0x1d,0x03,
|
||||
0xe6,0x9a,0x0f,0xa6,0x3e,0x96,0x8d,0xc9,0x77,0xdd,0xd8,0xe3,0x57,0xe1,0x65,0xa6,0x32,0x04,0x00,0x00,0x00,0x00,0x9a,0xf5,
|
||||
0x7d,0x46,0xd5,0xb5,0xac,0x6f,0xfb,0x98,0xcf,0xd1,0x52,0x5f,0xcf,0x84,0xad,0x89,0xe9,0x9b,0x95,0x98,0xfb,0x5e,0xb6,0x2c,
|
||||
0x75,0x59,0x6f,0x4d,0xdf,0xfd,0x04,0x61,0xf9,0x8d,0xfd,0xfc,0xe5,0xa9,0x94,0xba,0xfe,0x01,0x00,0x80,0x7d,0x49,0x7d,0xce,
|
||||
0xb4,0xa6,0xe7,0x9e,0xd7,0x4d,0xe7,0x68,0x68,0x3f,0xda,0x08,0x7c,0xd4,0xd4,0x2f,0xd6,0xee,0x87,0xe1,0xf3,0x53,0xf0,0x7c,
|
||||
0xcc,0xbe,0x9a,0xf6,0xd9,0xd5,0xef,0x9b,0xde,0x6b,0xdb,0x7e,0x4c,0xfa,0x63,0xf6,0xd7,0xb4,0xfd,0x90,0xba,0x89,0xdd,0x66,
|
||||
0xae,0xb2,0x9d,0x6b,0xdc,0x8d,0x89,0xb3,0x64,0xfc,0x3d,0xbb,0xd6,0x7c,0x01,0xcb,0x7b,0xc8,0x0e,0xf9,0x3b,0x79,0xf0,0x1a,
|
||||
0x68,0x76,0x05,0x7d,0xe5,0xdb,0xf1,0xf0,0x35,0x5a,0x76,0x31,0x7a,0xfb,0x19,0x95,0xdf,0x51,0x9d,0x2c,0x7e,0xa2,0xfc,0xbe,
|
||||
0xe6,0x39,0x28,0xff,0xca,0xd0,0x7d,0x8e,0xdd,0xee,0x22,0xaf,0x6d,0x5b,0x3c,0x8f,0x31,0x53,0x59,0xa4,0xee,0x33,0x6b,0xf8,
|
||||
0x9f,0xec,0x70,0xb3,0x86,0x87,0xfc,0xcb,0xd7,0xb3,0xf1,0x63,0x59,0x7e,0xae,0x8f,0x38,0x43,0xd6,0x1d,0xb3,0xcf,0x3c,0x42,
|
||||
0xd3,0x7c,0xa7,0x3f,0x4e,0x77,0xfe,0xa7,0x1d,0x07,0xda,0xd2,0xba,0x81,0x36,0xc8,0x27,0x10,0xd7,0x6f,0x96,0xb5,0x44,0x9a,
|
||||
0xb7,0x92,0xb7,0x2d,0xea,0x29,0x9b,0x5f,0x16,0xac,0xcb,0xac,0xb4,0x64,0xfb,0xcb,0x4a,0x6d,0xef,0xb5,0xe5,0xb9,0xd2,0x54,
|
||||
0x0e,0xaf,0xef,0x65,0x17,0x9d,0x69,0x4f,0xd1,0xff,0xc2,0xfd,0xb5,0xec,0xff,0x3f,0xf2,0xc3,0x4d,0x28,0x79,0x5b,0x4c,0xa9,
|
||||
0x56,0x5e,0x4d,0x75,0x1f,0x6b,0x89,0xb4,0x0d,0x89,0x3f,0x24,0x7d,0x4d,0xe9,0x0d,0xd7,0x8d,0xcd,0xdb,0x2f,0x1d,0xfb,0x8c,
|
||||
0x95,0xb5,0x3c,0xb6,0xc5,0x6a,0xdb,0xb6,0x6d,0x3b,0x1a,0xd4,0xc6,0x86,0xac,0xc3,0xd4,0x38,0x5d,0xfb,0x9e,0x3b,0xee,0xe0,
|
||||
0x38,0xfd,0xbf,0x85,0x95,0x67,0xe1,0xf1,0xaa,0xa9,0x1c,0xd7,0xaa,0xab,0x48,0x1f,0x8e,0x51,0xd5,0xf2,0x11,0xfb,0x8a,0x8d,
|
||||
0xd7,0x14,0x6b,0x74,0xbc,0x85,0xd2,0xb9,0x96,0xb0,0xdd,0x34,0xb6,0xa3,0x04,0xf1,0x57,0x69,0xab,0x57,0xa2,0xeb,0xd8,0x19,
|
||||
0x4a,0xfd,0xfb,0x8d,0x6d,0x7e,0xd4,0x3c,0xd6,0x84,0xeb,0xa5,0x2e,0xeb,0xb0,0x7c,0x97,0xaa,0xbb,0xc1,0x31,0xdb,0xc6,0xbb,
|
||||
0xf0,0xbd,0xa6,0x6d,0xfa,0xf6,0x13,0x11,0xa7,0x73,0xbb,0x98,0x75,0xba,0xbc,0x1f,0x2f,0x92,0xb7,0x55,0xe6,0x33,0xe2,0x78,
|
||||
0x91,0x3c,0xcd,0xd7,0x66,0x54,0x9f,0x8e,0xd5,0xb4,0xfd,0xa4,0xf9,0xc2,0xb0,0xfb,0xa7,0x1e,0xb2,0x2c,0xaf,0x9b,0xe3,0x9e,
|
||||
0xac,0x2d,0x0b,0xf3,0x3b,0x36,0xff,0x53,0xb7,0xdf,0x7b,0xfe,0xd7,0x4e,0x17,0x71,0x86,0x8e,0x6d,0x6d,0xd7,0x47,0x63,0xe6,
|
||||
0x63,0x43,0xae,0x9d,0x0d,0x99,0xbf,0x45,0x5f,0x03,0x2b,0xd3,0x1f,0x35,0x3f,0xcc,0xb6,0x35,0x37,0x1e,0x3b,0x17,0x4e,0x9d,
|
||||
0x86,0x54,0xf9,0x0e,0xaf,0x65,0xce,0x59,0x1e,0x5d,0xd7,0x4b,0x53,0x5e,0x33,0x1e,0x23,0x8b,0xb8,0x66,0x41,0xbc,0xa5,0xaf,
|
||||
0xef,0x44,0xcd,0x1f,0xa7,0xbe,0xdf,0xb4,0xde,0x90,0xf8,0x4b,0x1b,0x1b,0xbf,0x27,0xfd,0xef,0xfa,0xe7,0x94,0xf2,0x1f,0x52,
|
||||
0x96,0x63,0xb7,0x2b,0x75,0x8e,0x31,0x11,0xe9,0x4f,0x3d,0xbf,0xe4,0x7a,0x9c,0x36,0x90,0x86,0xa5,0xf3,0xb7,0x35,0x53,0x7e,
|
||||
0xff,0xe3,0x72,0xff,0x7f,0xfa,0x73,0x10,0x00,0x00,0x00,0x60,0x19,0x3f,0xcf,0xff,0xe7,0xff,0x9f,0x3c,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x60,0xa7,0x4e,0x59,0xf6,0x2a,0x75,0x3a,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x80,0xed,0x38,0x65,0x19,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0xc0,0x6e,0x1c,0xd3,0xc6,0xbe,0x21,0x9d,0xd4,0x6d,0x8f,0xb4,0x8e,0x47,0x60,0xaf,0x52,0x8f,
|
||||
0x1f,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xff,0xdf,0xee,0x1c,0x1a,0x01,0x00,0x83,0x40,0x00,0x7b,
|
||||
0x2a,0xba,0xff,0xc8,0x15,0x0c,0x51,0xee,0x88,0x88,0x0f,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0xb0,0xc0,0x29,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x80,0x96,0xb4,0xdf,0x0f,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,
|
||||
0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x60,0x8e,0xe4,0x3e,
|
||||
0x43,0x2a,0x52,0xa2,
|
||||
};
|
||||
};
|
||||
|
||||
class BreakPairTable
|
||||
{
|
||||
public:
|
||||
BreakPairTable() = delete;
|
||||
|
||||
static BreakOpportunity getLineBreakOpportunity (LineBreakType a, LineBreakType b)
|
||||
{
|
||||
return (BreakOpportunity) table[(int) a][(int) b];
|
||||
}
|
||||
|
||||
private:
|
||||
static constexpr uint8_t table[44][44]
|
||||
{
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x2,0x1,0x1,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x1,0x1,0x1,0x0,0x0,0x2,0x2,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x1,0x1,0x1,0x0,0x0,0x2,0x2,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x2,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x1,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x2,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x0,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x1,0x1,0x1,0x0,0x0,0x2,0x2,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x2,0x1,0x0,0x1,0x1,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x1,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x1,0x1,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x0,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x1,0x1,0x0,0x1,0x1,0x2,0x1,0x0,0x0,0x1,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x1,0x2,0x0,0x0,0x1,0x1,0x1,0x0,0x0,0x1,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x1,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x2,0x0,0x4,0x0,0x2,0x0,0x0,0x0,0x2,0x2,0x2,0x0,0x2,0x2,0x2,0x0,0x0,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x2,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x0,0x2,0x1,0x1,0x1,0x1,0x1,0x1,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x1,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x1,0x1,0x1,0x0,0x0,0x2,0x2,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x1,0x1,0x2,0x1,0x1,0x1,0x1,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x0,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x0,0x1,0x1,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x3,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x1,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x2,0x0,0x0,0x2,0x0,0x0,0x1,0x1,0x0,0x2,0x0,0x0,0x0,0x0,0x1,0x1,0x0,0x0,0x0,0x1,0x0,0x0,0x0,0x2,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
{ 0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,0x0,},
|
||||
};
|
||||
};
|
||||
}
|
||||
@@ -0,0 +1,279 @@
|
||||
/*
|
||||
==============================================================================
|
||||
|
||||
This file is part of the JUCE framework.
|
||||
Copyright (c) Raw Material Software Limited
|
||||
|
||||
JUCE is an open source framework subject to commercial or open source
|
||||
licensing.
|
||||
|
||||
By downloading, installing, or using the JUCE framework, or combining the
|
||||
JUCE framework with any other source code, object code, content or any other
|
||||
copyrightable work, you agree to the terms of the JUCE End User Licence
|
||||
Agreement, and all incorporated terms including the JUCE Privacy Policy and
|
||||
the JUCE Website Terms of Service, as applicable, which will bind you. If you
|
||||
do not agree to the terms of these agreements, we will not license the JUCE
|
||||
framework to you, and you must discontinue the installation or download
|
||||
process and cease use of the JUCE framework.
|
||||
|
||||
JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/
|
||||
JUCE Privacy Policy: https://juce.com/juce-privacy-policy
|
||||
JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/
|
||||
|
||||
Or:
|
||||
|
||||
You may also use this code under the terms of the AGPLv3:
|
||||
https://www.gnu.org/licenses/agpl-3.0.en.html
|
||||
|
||||
THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL
|
||||
WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF
|
||||
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
|
||||
|
||||
==============================================================================
|
||||
*/
|
||||
|
||||
namespace juce
|
||||
{
|
||||
|
||||
class TR14
|
||||
{
|
||||
public:
|
||||
TR14() = delete;
|
||||
|
||||
template <typename Callback>
|
||||
static size_t analyseLineBreaks (Span<const UnicodeAnalysisPoint> span, Callback&& callback)
|
||||
{
|
||||
uint32_t resultIndex = 0;
|
||||
uint32_t regionalCounter = 0;
|
||||
std::optional<LineBreakType> lb9;
|
||||
bool lb21a{};
|
||||
|
||||
const auto data = span.data();
|
||||
const auto len = span.size();
|
||||
|
||||
const auto emit = [&] (auto op) { callback ((int) resultIndex++, op); };
|
||||
|
||||
for (size_t i = 0; i < len;)
|
||||
{
|
||||
const auto isSOT = i == 0;
|
||||
const auto isEOT = i == len - 1;
|
||||
|
||||
const auto resolved = resolve (data[i]);
|
||||
const auto prev = isSOT ? resolveSOT (resolved)
|
||||
: lb9.value_or (resolved);
|
||||
const auto finalBreak = lb9.has_value() ? LineBreakType::al
|
||||
: LineBreakType::cm;
|
||||
const auto next = isEOT ? finalBreak
|
||||
: resolve (data[i + 1]);
|
||||
lb9.reset();
|
||||
|
||||
// LB3
|
||||
if (isEOT)
|
||||
{
|
||||
if (contains ({ LineBreakType::cr, LineBreakType::lf, LineBreakType::nl }, prev))
|
||||
emit (TextBreakType::hard);
|
||||
else
|
||||
emit (TextBreakType::soft);
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
//==============================================================================
|
||||
// LB4-6
|
||||
if (prev == LineBreakType::bk)
|
||||
{
|
||||
emit (TextBreakType::hard);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (prev == LineBreakType::cr && next == LineBreakType::lf)
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (contains ({ LineBreakType::cr, LineBreakType::lf, LineBreakType::nl }, prev))
|
||||
{
|
||||
emit (TextBreakType::hard);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
if (contains ({ LineBreakType::cr, LineBreakType::lf, LineBreakType::nl, LineBreakType::bk }, next))
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
//==============================================================================
|
||||
// LB7
|
||||
if (contains ({ LineBreakType::sp, LineBreakType::zw }, next))
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
// LB8a
|
||||
if (prev == LineBreakType::zwj)
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
// LB13
|
||||
if (contains ({ LineBreakType::cl, LineBreakType::cp, LineBreakType::ex, LineBreakType::is, LineBreakType::sy }, next))
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
// lb21a
|
||||
if (lb21a && contains ({ LineBreakType::hy, LineBreakType::ba }, prev))
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
lb21a = prev == LineBreakType::hl;
|
||||
|
||||
// LB30a
|
||||
if (prev == LineBreakType::ri)
|
||||
{
|
||||
regionalCounter++;
|
||||
|
||||
if (next == LineBreakType::ri && regionalCounter % 2 == 0)
|
||||
{
|
||||
regionalCounter = 0;
|
||||
emit (TextBreakType::soft);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
regionalCounter = 0;
|
||||
}
|
||||
|
||||
const auto bt = BreakPairTable::getLineBreakOpportunity (prev, next);
|
||||
|
||||
switch (bt)
|
||||
{
|
||||
case BreakOpportunity::direct:
|
||||
{
|
||||
emit (TextBreakType::soft);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
case BreakOpportunity::prohibited:
|
||||
{
|
||||
emit (TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
case BreakOpportunity::indirect:
|
||||
{
|
||||
emit (next == LineBreakType::sp || next == LineBreakType::cm ? TextBreakType::soft
|
||||
: TextBreakType::none);
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
case BreakOpportunity::combinedIndirect:
|
||||
case BreakOpportunity::combinedProhibited:
|
||||
{
|
||||
if (! contains ({ LineBreakType::bk, LineBreakType::cr,
|
||||
LineBreakType::lf, LineBreakType::nl,
|
||||
LineBreakType::sp, LineBreakType::zw }, prev))
|
||||
{
|
||||
lb9 = std::make_optional (prev);
|
||||
}
|
||||
|
||||
while (i < len)
|
||||
{
|
||||
if (i == len - 1)
|
||||
{
|
||||
emit (TextBreakType::soft);
|
||||
i++;
|
||||
break;
|
||||
}
|
||||
|
||||
emit (TextBreakType::none);
|
||||
|
||||
if (! contains ({ LineBreakType::cm, LineBreakType::zwj }, resolve (data[i])))
|
||||
break;
|
||||
|
||||
i++;
|
||||
}
|
||||
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
i++;
|
||||
continue;
|
||||
}
|
||||
|
||||
return resultIndex;
|
||||
}
|
||||
|
||||
private:
|
||||
static LineBreakType resolve (const UnicodeAnalysisPoint& point)
|
||||
{
|
||||
const auto bc = point.getBreakType();
|
||||
|
||||
JUCE_BEGIN_IGNORE_WARNINGS_GCC_LIKE ("-Wswitch-enum")
|
||||
switch (bc)
|
||||
{
|
||||
case LineBreakType::ai:
|
||||
case LineBreakType::sg:
|
||||
case LineBreakType::xx:
|
||||
return LineBreakType::al;
|
||||
|
||||
case LineBreakType::cj:
|
||||
return LineBreakType::ns;
|
||||
|
||||
case LineBreakType::sa:
|
||||
return contains ({ (SBGeneralCategory) SBGeneralCategoryMN,
|
||||
(SBGeneralCategory) SBGeneralCategoryMC },
|
||||
point.getGeneralCategory())
|
||||
? LineBreakType::cm
|
||||
: LineBreakType::al;
|
||||
|
||||
default: break;
|
||||
}
|
||||
JUCE_END_IGNORE_WARNINGS_GCC_LIKE
|
||||
|
||||
return bc;
|
||||
}
|
||||
|
||||
static LineBreakType resolveSOT (LineBreakType bc)
|
||||
{
|
||||
JUCE_BEGIN_IGNORE_WARNINGS_GCC_LIKE ("-Wswitch-enum")
|
||||
switch (bc)
|
||||
{
|
||||
case LineBreakType::lf:
|
||||
case LineBreakType::nl:
|
||||
return LineBreakType::bk;
|
||||
|
||||
case LineBreakType::sp:
|
||||
return LineBreakType::wj;
|
||||
|
||||
default: break;
|
||||
}
|
||||
JUCE_END_IGNORE_WARNINGS_GCC_LIKE
|
||||
|
||||
return bc;
|
||||
}
|
||||
};
|
||||
|
||||
}
|
||||
@@ -0,0 +1,226 @@
|
||||
/*
|
||||
==============================================================================
|
||||
|
||||
This file is part of the JUCE framework.
|
||||
Copyright (c) Raw Material Software Limited
|
||||
|
||||
JUCE is an open source framework subject to commercial or open source
|
||||
licensing.
|
||||
|
||||
By downloading, installing, or using the JUCE framework, or combining the
|
||||
JUCE framework with any other source code, object code, content or any other
|
||||
copyrightable work, you agree to the terms of the JUCE End User Licence
|
||||
Agreement, and all incorporated terms including the JUCE Privacy Policy and
|
||||
the JUCE Website Terms of Service, as applicable, which will bind you. If you
|
||||
do not agree to the terms of these agreements, we will not license the JUCE
|
||||
framework to you, and you must discontinue the installation or download
|
||||
process and cease use of the JUCE framework.
|
||||
|
||||
JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/
|
||||
JUCE Privacy Policy: https://juce.com/juce-privacy-policy
|
||||
JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/
|
||||
|
||||
Or:
|
||||
|
||||
You may also use this code under the terms of the AGPLv3:
|
||||
https://www.gnu.org/licenses/agpl-3.0.en.html
|
||||
|
||||
THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL
|
||||
WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF
|
||||
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
|
||||
|
||||
==============================================================================
|
||||
*/
|
||||
|
||||
namespace juce
|
||||
{
|
||||
// https://www.unicode.org/reports/tr31/#Table_Recommended_Scripts
|
||||
enum class TextScript
|
||||
{
|
||||
// Recommend scripts
|
||||
common,
|
||||
arabic,
|
||||
armenian,
|
||||
bengali,
|
||||
bopomofo,
|
||||
cyrillic,
|
||||
devanagari,
|
||||
ethiopic,
|
||||
georgian,
|
||||
greek,
|
||||
gujarati,
|
||||
gurmukhi,
|
||||
hangul,
|
||||
han,
|
||||
hebrew,
|
||||
hiragana,
|
||||
katakana,
|
||||
kannada,
|
||||
khmer,
|
||||
lao,
|
||||
latin,
|
||||
malayalam,
|
||||
myanmar,
|
||||
oriya,
|
||||
sinhala,
|
||||
tamil,
|
||||
telugu,
|
||||
thaana,
|
||||
thai,
|
||||
tibetan,
|
||||
|
||||
// Limited use
|
||||
adlam,
|
||||
balinese,
|
||||
bamum,
|
||||
batak,
|
||||
chakma,
|
||||
canadianAboriginalSyllabics,
|
||||
cham,
|
||||
cherokee,
|
||||
nyiakengPuachueHmong,
|
||||
javanese,
|
||||
kayahLi,
|
||||
taiTham,
|
||||
lepcha,
|
||||
limbu,
|
||||
lisu,
|
||||
mandaic,
|
||||
meeteiMayek,
|
||||
newa,
|
||||
nko,
|
||||
olChiki,
|
||||
osage,
|
||||
miao,
|
||||
hanifiRohingya,
|
||||
saurashtra,
|
||||
sundanese,
|
||||
sylotiNagri,
|
||||
syriac,
|
||||
taiLe,
|
||||
newTaiLue,
|
||||
taiViet,
|
||||
tifinagh,
|
||||
vai,
|
||||
wancho,
|
||||
yi,
|
||||
};
|
||||
|
||||
// https://www.unicode.org/reports/tr24/tr24-32.html
|
||||
class TR24
|
||||
{
|
||||
public:
|
||||
TR24() = delete;
|
||||
|
||||
template <typename Callback>
|
||||
static void analyseScripts (Span<const UnicodeAnalysisPoint> points, Callback&& callback)
|
||||
{
|
||||
bool once = false;
|
||||
SBScript previousBaseTextScript = SBScriptZYYY;
|
||||
|
||||
for (const auto [i, value] : enumerate (points))
|
||||
{
|
||||
auto script = value.getScriptType();
|
||||
|
||||
if (! std::exchange (once, true))
|
||||
{
|
||||
if (script == SBScriptZINH)
|
||||
script = SBScriptZYYY;
|
||||
|
||||
previousBaseTextScript = script;
|
||||
}
|
||||
|
||||
if (script == SBScriptZYYY || script == SBScriptZINH)
|
||||
script = previousBaseTextScript;
|
||||
|
||||
callback ((int) i, mapTextScript (script));
|
||||
previousBaseTextScript = script;
|
||||
}
|
||||
}
|
||||
|
||||
private:
|
||||
// The Unicode script spec lists a large number of scripts, some of which are recommended to be ignored.
|
||||
// We map them to a script that we support here.
|
||||
static TextScript mapTextScript (SBScript type)
|
||||
{
|
||||
JUCE_BEGIN_IGNORE_WARNINGS_GCC_LIKE ("-Wswitch-enum")
|
||||
|
||||
switch (type)
|
||||
{
|
||||
case SBScriptZYYY: return TextScript::common;
|
||||
case SBScriptARAB: return TextScript::arabic;
|
||||
case SBScriptARMN: return TextScript::armenian;
|
||||
case SBScriptBENG: return TextScript::bengali;
|
||||
case SBScriptBOPO: return TextScript::bopomofo;
|
||||
case SBScriptCYRL: return TextScript::cyrillic;
|
||||
case SBScriptDEVA: return TextScript::devanagari;
|
||||
case SBScriptETHI: return TextScript::ethiopic;
|
||||
case SBScriptGEOR: return TextScript::georgian;
|
||||
case SBScriptGREK: return TextScript::greek;
|
||||
case SBScriptGUJR: return TextScript::gujarati;
|
||||
case SBScriptGURU: return TextScript::gurmukhi;
|
||||
case SBScriptHANG: return TextScript::hangul;
|
||||
case SBScriptHANI: return TextScript::han;
|
||||
case SBScriptHEBR: return TextScript::hebrew;
|
||||
case SBScriptHIRA: return TextScript::hiragana;
|
||||
case SBScriptKANA: return TextScript::katakana;
|
||||
case SBScriptKNDA: return TextScript::kannada;
|
||||
case SBScriptKHMR: return TextScript::khmer;
|
||||
case SBScriptLAOO: return TextScript::lao;
|
||||
case SBScriptLATN: return TextScript::latin;
|
||||
case SBScriptMLYM: return TextScript::malayalam;
|
||||
case SBScriptMYMR: return TextScript::myanmar;
|
||||
case SBScriptORYA: return TextScript::oriya;
|
||||
case SBScriptSINH: return TextScript::sinhala;
|
||||
case SBScriptTAML: return TextScript::tamil;
|
||||
case SBScriptTELU: return TextScript::telugu;
|
||||
case SBScriptTHAA: return TextScript::thaana;
|
||||
case SBScriptTHAI: return TextScript::thai;
|
||||
case SBScriptTIBT: return TextScript::tibetan;
|
||||
|
||||
case SBScriptADLM: return TextScript::adlam;
|
||||
case SBScriptBALI: return TextScript::balinese;
|
||||
case SBScriptBAMU: return TextScript::bamum;
|
||||
case SBScriptBATK: return TextScript::batak;
|
||||
case SBScriptCAKM: return TextScript::chakma;
|
||||
case SBScriptCHAM: return TextScript::cham;
|
||||
case SBScriptCHER: return TextScript::cherokee;
|
||||
case SBScriptJAVA: return TextScript::javanese;
|
||||
case SBScriptKALI: return TextScript::kayahLi;
|
||||
case SBScriptLANA: return TextScript::taiTham;
|
||||
case SBScriptLEPC: return TextScript::lepcha;
|
||||
case SBScriptLIMB: return TextScript::limbu;
|
||||
case SBScriptLISU: return TextScript::lisu;
|
||||
case SBScriptMAND: return TextScript::mandaic;
|
||||
case SBScriptMTEI: return TextScript::meeteiMayek;
|
||||
case SBScriptNEWA: return TextScript::newa;
|
||||
case SBScriptNKOO: return TextScript::nko;
|
||||
case SBScriptOLCK: return TextScript::olChiki;
|
||||
case SBScriptOSGE: return TextScript::osage;
|
||||
case SBScriptPLRD: return TextScript::miao;
|
||||
case SBScriptSAUR: return TextScript::saurashtra;
|
||||
case SBScriptSUND: return TextScript::sundanese;
|
||||
case SBScriptSYLO: return TextScript::sylotiNagri;
|
||||
case SBScriptSYRC: return TextScript::syriac;
|
||||
case SBScriptTALE: return TextScript::taiLe;
|
||||
case SBScriptTALU: return TextScript::newTaiLue;
|
||||
case SBScriptTAVT: return TextScript::taiViet;
|
||||
case SBScriptTFNG: return TextScript::tifinagh;
|
||||
case SBScriptVAII: return TextScript::vai;
|
||||
case SBScriptWCHO: return TextScript::wancho;
|
||||
case SBScriptYIII: return TextScript::yi;
|
||||
|
||||
case SBScriptROHG: return TextScript::hanifiRohingya;
|
||||
case SBScriptHMNP: return TextScript::nyiakengPuachueHmong;
|
||||
case SBScriptCANS: return TextScript::canadianAboriginalSyllabics;
|
||||
|
||||
default: break;
|
||||
}
|
||||
|
||||
JUCE_END_IGNORE_WARNINGS_GCC_LIKE
|
||||
|
||||
return TextScript::common;
|
||||
}
|
||||
};
|
||||
|
||||
}
|
||||
@@ -0,0 +1,85 @@
|
||||
/*
|
||||
==============================================================================
|
||||
|
||||
This file is part of the JUCE framework.
|
||||
Copyright (c) Raw Material Software Limited
|
||||
|
||||
JUCE is an open source framework subject to commercial or open source
|
||||
licensing.
|
||||
|
||||
By downloading, installing, or using the JUCE framework, or combining the
|
||||
JUCE framework with any other source code, object code, content or any other
|
||||
copyrightable work, you agree to the terms of the JUCE End User Licence
|
||||
Agreement, and all incorporated terms including the JUCE Privacy Policy and
|
||||
the JUCE Website Terms of Service, as applicable, which will bind you. If you
|
||||
do not agree to the terms of these agreements, we will not license the JUCE
|
||||
framework to you, and you must discontinue the installation or download
|
||||
process and cease use of the JUCE framework.
|
||||
|
||||
JUCE End User Licence Agreement: https://juce.com/legal/juce-8-licence/
|
||||
JUCE Privacy Policy: https://juce.com/juce-privacy-policy
|
||||
JUCE Website Terms of Service: https://juce.com/juce-website-terms-of-service/
|
||||
|
||||
Or:
|
||||
|
||||
You may also use this code under the terms of the AGPLv3:
|
||||
https://www.gnu.org/licenses/agpl-3.0.en.html
|
||||
|
||||
THE JUCE FRAMEWORK IS PROVIDED "AS IS" WITHOUT ANY WARRANTY, AND ALL
|
||||
WARRANTIES, WHETHER EXPRESSED OR IMPLIED, INCLUDING WARRANTY OF
|
||||
MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, ARE DISCLAIMED.
|
||||
|
||||
==============================================================================
|
||||
*/
|
||||
|
||||
namespace juce
|
||||
{
|
||||
|
||||
template <typename T>
|
||||
static constexpr bool contains (std::initializer_list<T> span, const T& b)
|
||||
{
|
||||
for (const auto& i : span)
|
||||
if (i == b)
|
||||
return true;
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
struct UnicodeAnalysisPoint
|
||||
{
|
||||
char32_t character = 0;
|
||||
UnicodeEntry data{};
|
||||
|
||||
UnicodeAnalysisPoint (char32_t characterIn, UnicodeEntry entry)
|
||||
: character { characterIn },
|
||||
data { std::move (entry) }
|
||||
{}
|
||||
|
||||
LineBreakType getBreakType() const
|
||||
{
|
||||
return data.bt;
|
||||
}
|
||||
|
||||
auto getGeneralCategory() const
|
||||
{
|
||||
return SBCodepointGetGeneralCategory (character);
|
||||
}
|
||||
|
||||
auto getScriptType() const
|
||||
{
|
||||
return SBCodepointGetScript (character);
|
||||
}
|
||||
};
|
||||
|
||||
//==============================================================================
|
||||
/* Types of breaks between characters. */
|
||||
enum class TextBreakType
|
||||
{
|
||||
none, // The sequence of characters should not be broken.
|
||||
|
||||
soft, // The sequence of characters can be broken, if required.
|
||||
|
||||
hard // The sequence of characters must be broken here.
|
||||
};
|
||||
|
||||
} // namespace juce
|
||||
@@ -0,0 +1,119 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_ALGORITHM_H
|
||||
#define _SB_PUBLIC_ALGORITHM_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBBidiType.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBParagraph.h"
|
||||
|
||||
typedef struct _SBAlgorithm *SBAlgorithmRef;
|
||||
|
||||
/**
|
||||
* Creates an algorithm object for the specified code point sequence. The source string inside the
|
||||
* code point sequence should not be freed until the algorithm object is in use.
|
||||
*
|
||||
* @param codepointSequence
|
||||
* The code point sequence to apply bidirectional algorithm on.
|
||||
* @return
|
||||
* A reference to an algorithm object if the call was successful, NULL otherwise.
|
||||
*/
|
||||
SBAlgorithmRef SBAlgorithmCreate(const SBCodepointSequence *codepointSequence);
|
||||
|
||||
/**
|
||||
* Returns a direct pointer to the bidirectional types of code units, stored in the algorithm
|
||||
* object.
|
||||
*
|
||||
* @param algorithm
|
||||
* The algorithm object from which to access the bidirectional types of code units.
|
||||
* @return
|
||||
* A valid pointer to an array of SBBidiType structures, whose length will be equal to that of
|
||||
* string buffer.
|
||||
*/
|
||||
const SBBidiType *SBAlgorithmGetBidiTypesPtr(SBAlgorithmRef algorithm);
|
||||
|
||||
/**
|
||||
* Determines the boundary of first paragraph within the specified range.
|
||||
*
|
||||
* The boundary of the paragraph occurs after a code point whose bidirectional type is Paragraph
|
||||
* Separator (B), or at the suggestedLength if no such code point exists before it. The exception to
|
||||
* this rule is when a Carriage Return (CR) is followed by a Line Feed (LF). Both CR and LF are
|
||||
* paragraph separators, but in that case, the boundary of the paragraph is considered after LF code
|
||||
* point.
|
||||
*
|
||||
* @param algorithm
|
||||
* The algorithm object to use for determining paragraph boundary.
|
||||
* @param paragraphOffset
|
||||
* The index to the first code unit of the paragraph in source string.
|
||||
* @param suggestedLength
|
||||
* The number of code units covering the suggested length of the paragraph.
|
||||
* @param acutalLength
|
||||
* The actual length of the first paragraph, including the paragraph separator, within the
|
||||
* given range.
|
||||
* @param separatorLength
|
||||
* On output, the length of paragraph separator. This parameter can be set to NULL if not
|
||||
* needed.
|
||||
*/
|
||||
void SBAlgorithmGetParagraphBoundary(SBAlgorithmRef algorithm,
|
||||
SBUInteger paragraphOffset, SBUInteger suggestedLength,
|
||||
SBUInteger *acutalLength, SBUInteger *separatorLength);
|
||||
|
||||
/**
|
||||
* Creates a paragraph object processed with Unicode Bidirectional Algorithm.
|
||||
*
|
||||
* This function processes only first paragraph starting at paragraphOffset with length less than or
|
||||
* equal to suggestedLength, in accordance with Rule P1 of Unicode Bidirectional Algorithm.
|
||||
*
|
||||
* The paragraph level is determined by applying Rules P2-P3 and embedding levels are resolved by
|
||||
* applying Rules X1-I2.
|
||||
*
|
||||
* @param algorithm
|
||||
* The algorithm object to use for creating the desired paragraph.
|
||||
* @param paragraphOffset
|
||||
* The index to the first code unit of the paragraph in source string.
|
||||
* @param suggestedLength
|
||||
* The number of code units covering the suggested length of the paragraph.
|
||||
* @param baseLevel
|
||||
* The desired base level of the paragraph. Rules P2-P3 would be ignored if it is neither
|
||||
* SBLevelDefaultLTR nor SBLevelDefaultRTL.
|
||||
* @return
|
||||
* A reference to a paragraph object if the call was successful, NULL otherwise.
|
||||
*/
|
||||
SBParagraphRef SBAlgorithmCreateParagraph(SBAlgorithmRef algorithm,
|
||||
SBUInteger paragraphOffset, SBUInteger suggestedLength, SBLevel baseLevel);
|
||||
|
||||
/**
|
||||
* Increments the reference count of an algorithm object.
|
||||
*
|
||||
* @param algorithm
|
||||
* The algorithm object whose reference count will be incremented.
|
||||
* @return
|
||||
* The same algorithm object passed in as the parameter.
|
||||
*/
|
||||
SBAlgorithmRef SBAlgorithmRetain(SBAlgorithmRef algorithm);
|
||||
|
||||
/**
|
||||
* Decrements the reference count of an algorithm object. The object will be deallocated when its
|
||||
* reference count reaches zero.
|
||||
*
|
||||
* @param algorithm
|
||||
* The algorithm object whose reference count will be decremented.
|
||||
*/
|
||||
void SBAlgorithmRelease(SBAlgorithmRef algorithm);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,119 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_BASE_H
|
||||
#define _SB_PUBLIC_BASE_H
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdint.h>
|
||||
|
||||
/**
|
||||
* A type to represent an 8-bit signed integer.
|
||||
*/
|
||||
typedef int8_t SBInt8;
|
||||
|
||||
/**
|
||||
* A type to represent a 16-bit signed integer.
|
||||
*/
|
||||
typedef int16_t SBInt16;
|
||||
|
||||
/**
|
||||
* A type to represent a 32-bit signed integer.
|
||||
*/
|
||||
typedef int32_t SBInt32;
|
||||
|
||||
/**
|
||||
* A type to represent an 8-bit unsigned integer.
|
||||
*/
|
||||
typedef uint8_t SBUInt8;
|
||||
|
||||
/**
|
||||
* A type to represent a 16-bit unsigned integer.
|
||||
*/
|
||||
typedef uint16_t SBUInt16;
|
||||
|
||||
/**
|
||||
* A type to represent a 32-bit unsigned integer.
|
||||
*/
|
||||
typedef uint32_t SBUInt32;
|
||||
|
||||
/**
|
||||
* A signed integer type whose width is equal to the width of the machine word.
|
||||
*/
|
||||
typedef intptr_t SBInteger;
|
||||
|
||||
/**
|
||||
* An unsigned integer type whose width is equal to the width of the machine word.
|
||||
*/
|
||||
typedef uintptr_t SBUInteger;
|
||||
|
||||
/**
|
||||
* Constants that specify the states of a boolean.
|
||||
*/
|
||||
enum {
|
||||
SBFalse = 0, /**< A value representing the false state. */
|
||||
SBTrue = 1 /**< A value representing the true state. */
|
||||
};
|
||||
/**
|
||||
* A type to represent a boolean value.
|
||||
*/
|
||||
typedef SBUInt8 SBBoolean;
|
||||
|
||||
#define SBUInt8InRange(v, s, e) \
|
||||
( \
|
||||
(SBUInt8)((v) - (s)) \
|
||||
<= (SBUInt8)((e) - (s)) \
|
||||
)
|
||||
|
||||
#define SBUInt16InRange(v, s, e) \
|
||||
( \
|
||||
(SBUInt16)((v) - (s)) \
|
||||
<= (SBUInt16)((e) - (s)) \
|
||||
)
|
||||
|
||||
#define SBUInt32InRange(v, s, e) \
|
||||
( \
|
||||
(SBUInt32)((v) - (s)) \
|
||||
<= (SBUInt32)((e) - (s)) \
|
||||
)
|
||||
|
||||
|
||||
/**
|
||||
* A type to represent a bidi level.
|
||||
*/
|
||||
typedef SBUInt8 SBLevel;
|
||||
|
||||
/**
|
||||
* A value representing an invalid bidi level.
|
||||
*/
|
||||
#define SBLevelInvalid 0xFF
|
||||
|
||||
/**
|
||||
* A value representing maximum explicit embedding level.
|
||||
*/
|
||||
#define SBLevelMax 125
|
||||
|
||||
/**
|
||||
* A value specifying to set base level to zero (left-to-right) if there is no strong character.
|
||||
*/
|
||||
#define SBLevelDefaultLTR 0xFE
|
||||
|
||||
/**
|
||||
* A value specifying to set base level to one (right-to-left) if there is no strong character.
|
||||
*/
|
||||
#define SBLevelDefaultRTL 0xFD
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,81 @@
|
||||
/*
|
||||
* Copyright (C) 2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_BIDI_TYPE_H
|
||||
#define _SB_PUBLIC_BIDI_TYPE_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
/**
|
||||
* Constants that specify the bidirectional types of a character.
|
||||
*/
|
||||
enum {
|
||||
SBBidiTypeNil = 0x00,
|
||||
|
||||
SBBidiTypeL = 0x01, /**< Strong: Left-to-Right */
|
||||
SBBidiTypeR = 0x02, /**< Strong: Right-to-Left */
|
||||
SBBidiTypeAL = 0x03, /**< Strong: Right-to-Left Arabic */
|
||||
|
||||
SBBidiTypeBN = 0x04, /**< Weak: Boundary Neutral */
|
||||
SBBidiTypeNSM = 0x05, /**< Weak: Non-Spacing Mark */
|
||||
SBBidiTypeAN = 0x06, /**< Weak: Arabic Number */
|
||||
SBBidiTypeEN = 0x07, /**< Weak: European Number */
|
||||
SBBidiTypeET = 0x08, /**< Weak: European Number Terminator */
|
||||
SBBidiTypeES = 0x09, /**< Weak: European Number Separator */
|
||||
SBBidiTypeCS = 0x0A, /**< Weak: Common Number Separator */
|
||||
|
||||
SBBidiTypeWS = 0x0B, /**< Neutral: White Space */
|
||||
SBBidiTypeS = 0x0C, /**< Neutral: Segment Separator */
|
||||
SBBidiTypeB = 0x0D, /**< Neutral: Paragraph Separator */
|
||||
SBBidiTypeON = 0x0E, /**< Neutral: Other Neutral */
|
||||
|
||||
SBBidiTypeLRI = 0x0F, /**< Format: Left-to-Right Isolate */
|
||||
SBBidiTypeRLI = 0x10, /**< Format: Right-to-Left Isolate */
|
||||
SBBidiTypeFSI = 0x11, /**< Format: First Strong Isolate */
|
||||
SBBidiTypePDI = 0x12, /**< Format: Pop Directional Isolate */
|
||||
SBBidiTypeLRE = 0x13, /**< Format: Left-to-Right Embedding */
|
||||
SBBidiTypeRLE = 0x14, /**< Format: Right-to-Left Embedding */
|
||||
SBBidiTypeLRO = 0x15, /**< Format: Left-to-Right Override */
|
||||
SBBidiTypeRLO = 0x16, /**< Format: Right-to-Left Override */
|
||||
SBBidiTypePDF = 0x17 /**< Format: Pop Directional Formatting */
|
||||
};
|
||||
|
||||
/**
|
||||
* A type to represent the bidirectional type of a character.
|
||||
*/
|
||||
typedef SBUInt8 SBBidiType;
|
||||
|
||||
/**
|
||||
* Checks whether specified bidirectional type is strong.
|
||||
*/
|
||||
#define SBBidiTypeIsStrong(t) SBUInt8InRange(t, SBBidiTypeL, SBBidiTypeAL)
|
||||
|
||||
/**
|
||||
* Checks whether specified bidirectional type is weak.
|
||||
*/
|
||||
#define SBBidiTypeIsWeak(t) SBUInt8InRange(t, SBBidiTypeBN, SBBidiTypeCS)
|
||||
|
||||
/**
|
||||
* Checks whether specified bidirectional type is neutral.
|
||||
*/
|
||||
#define SBBidiTypeIsNeutral(t) SBUInt8InRange(t, SBBidiTypeWS, SBBidiTypeON)
|
||||
|
||||
/**
|
||||
* Checks whether specified bidirectional type is format.
|
||||
*/
|
||||
#define SBBidiTypeIsFormat(t) SBUInt8InRange(t, SBBidiTypeLRI, SBBidiTypePDF)
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,80 @@
|
||||
/*
|
||||
* Copyright (C) 2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_CODEPOINT_H
|
||||
#define _SB_PUBLIC_CODEPOINT_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBBidiType.h"
|
||||
#include "SBGeneralCategory.h"
|
||||
#include "SBScript.h"
|
||||
|
||||
/**
|
||||
* A type to represent a unicode code point.
|
||||
*/
|
||||
typedef SBUInt32 SBCodepoint;
|
||||
|
||||
/**
|
||||
* A value representing an invalid code point.
|
||||
*/
|
||||
#define SBCodepointInvalid UINT32_MAX
|
||||
|
||||
/**
|
||||
* A value representing a faulty code point, used as a replacement by the decoder.
|
||||
*/
|
||||
#define SBCodepointFaulty 0xFFFD
|
||||
|
||||
/**
|
||||
* Returns the bidirectional type of a code point.
|
||||
*
|
||||
* @param codepoint
|
||||
* The code point whose bidirectional type is returned.
|
||||
* @return
|
||||
* The bidirectional type of specified code point.
|
||||
*/
|
||||
SBBidiType SBCodepointGetBidiType(SBCodepoint codepoint);
|
||||
|
||||
/**
|
||||
* Returns the general category of a code point.
|
||||
*
|
||||
* @param codepoint
|
||||
* The code point whose general category is returned.
|
||||
* @return
|
||||
* The general category of specified code point.
|
||||
*/
|
||||
SBGeneralCategory SBCodepointGetGeneralCategory(SBCodepoint codepoint);
|
||||
|
||||
/**
|
||||
* Returns the mirror of a code point.
|
||||
*
|
||||
* @param codepoint
|
||||
* The code point whose mirror is returned.
|
||||
* @return
|
||||
* The mirror of specified code point if available, 0 otherwise.
|
||||
*/
|
||||
SBCodepoint SBCodepointGetMirror(SBCodepoint codepoint);
|
||||
|
||||
/**
|
||||
* Returns the script of a code point.
|
||||
*
|
||||
* @param codepoint
|
||||
* The code point whose script is returned.
|
||||
* @return
|
||||
* The script of specified code point.
|
||||
*/
|
||||
SBScript SBCodepointGetScript(SBCodepoint codepoint);
|
||||
|
||||
#endif
|
||||
+66
@@ -0,0 +1,66 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_CODEPOINT_SEQUENCE_H
|
||||
#define _SB_PUBLIC_CODEPOINT_SEQUENCE_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepoint.h"
|
||||
|
||||
enum {
|
||||
SBStringEncodingUTF8 = 0, /**< An 8-bit representation of Unicode code points. */
|
||||
SBStringEncodingUTF16 = 1, /**< 16-bit UTF encoding in native endianness. */
|
||||
SBStringEncodingUTF32 = 2 /**< 32-bit UTF encoding in native endianness. */
|
||||
};
|
||||
typedef SBUInt32 SBStringEncoding;
|
||||
|
||||
typedef struct _SBCodepointSequence {
|
||||
SBStringEncoding stringEncoding; /**< The encoding of the string. */
|
||||
void *stringBuffer; /**< The source string containing the code units. */
|
||||
SBUInteger stringLength; /**< The length of the string in terms of code units. */
|
||||
} SBCodepointSequence;
|
||||
|
||||
/**
|
||||
* Returns the code point before the given string index.
|
||||
*
|
||||
* @param codepointSequence
|
||||
* The object holding the information of the string.
|
||||
* @param stringIndex
|
||||
* The index of code unit before which to get the code point. On output, it is set to point to
|
||||
* the first code unit of returned code point.
|
||||
* @return
|
||||
* The code point before the given string index, or SBCodepointInvalid if stringIndex is equal
|
||||
* to zero or larger than actual length of source string.
|
||||
*/
|
||||
SBCodepoint SBCodepointSequenceGetCodepointBefore(const SBCodepointSequence *codepointSequence,
|
||||
SBUInteger *stringIndex);
|
||||
|
||||
/**
|
||||
* Returns the code point at the given string index.
|
||||
*
|
||||
* @param codepointSequence
|
||||
* The object holding the information of the string.
|
||||
* @param stringIndex
|
||||
* The index of code unit at which to get the code point. On output, it is set to point to the
|
||||
* first code unit of next code point.
|
||||
* @return
|
||||
* The code point at the given string index, or SBCodepointInvalid if stringIndex is larger
|
||||
* than or equal to actual length of source string.
|
||||
*/
|
||||
SBCodepoint SBCodepointSequenceGetCodepointAt(const SBCodepointSequence *codepointSequence,
|
||||
SBUInteger *stringIndex);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,29 @@
|
||||
/*
|
||||
* Copyright (C) 2014 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_CONFIG_H
|
||||
#define _SB_PUBLIC_CONFIG_H
|
||||
|
||||
/* #define SB_CONFIG_LOG */
|
||||
/* #define SB_CONFIG_UNITY */
|
||||
|
||||
#ifdef SB_CONFIG_UNITY
|
||||
#define SB_INTERNAL static
|
||||
#else
|
||||
#define SB_INTERNAL
|
||||
#endif
|
||||
|
||||
#endif
|
||||
+106
@@ -0,0 +1,106 @@
|
||||
/*
|
||||
* Copyright (C) 2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_GENERAL_CATEGORY_H
|
||||
#define _SB_PUBLIC_GENERAL_CATEGORY_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
/**
|
||||
* Constants that specify the general category of a character.
|
||||
*/
|
||||
enum {
|
||||
SBGeneralCategoryNil = 0x00,
|
||||
|
||||
SBGeneralCategoryLU = 0x01, /**< Letter: Uppercase Letter */
|
||||
SBGeneralCategoryLL = 0x02, /**< Letter: Lowercase Letter */
|
||||
SBGeneralCategoryLT = 0x03, /**< Letter: Titlecase Letter */
|
||||
SBGeneralCategoryLM = 0x04, /**< Letter: Modifier Letter */
|
||||
SBGeneralCategoryLO = 0x05, /**< Letter: Other Letter */
|
||||
|
||||
SBGeneralCategoryMN = 0x06, /**< Mark: Nonspacing Mark */
|
||||
SBGeneralCategoryMC = 0x07, /**< Mark: Spacing Mark */
|
||||
SBGeneralCategoryME = 0x08, /**< Mark: Enclosing Mark */
|
||||
|
||||
SBGeneralCategoryND = 0x09, /**< Number: Decimal Number */
|
||||
SBGeneralCategoryNL = 0x0A, /**< Number: Letter Number */
|
||||
SBGeneralCategoryNO = 0x0B, /**< Number: Other Number */
|
||||
|
||||
SBGeneralCategoryPC = 0x0C, /**< Punctuation: Connector Punctuation */
|
||||
SBGeneralCategoryPD = 0x0D, /**< Punctuation: Dash Punctuation */
|
||||
SBGeneralCategoryPS = 0x0E, /**< Punctuation: Open Punctuation */
|
||||
SBGeneralCategoryPE = 0x0F, /**< Punctuation: Close Punctuation */
|
||||
SBGeneralCategoryPI = 0x10, /**< Punctuation: Initial Punctuation */
|
||||
SBGeneralCategoryPF = 0x11, /**< Punctuation: Final Punctuation */
|
||||
SBGeneralCategoryPO = 0x12, /**< Punctuation: Other Punctuation */
|
||||
|
||||
SBGeneralCategorySM = 0x13, /**< Symbol: Math Symbol */
|
||||
SBGeneralCategorySC = 0x14, /**< Symbol: Currency Symbol */
|
||||
SBGeneralCategorySK = 0x15, /**< Symbol: Modifier Symbol */
|
||||
SBGeneralCategorySO = 0x16, /**< Symbol: Other Symbol */
|
||||
|
||||
SBGeneralCategoryZS = 0x17, /**< Separator: Space Separator */
|
||||
SBGeneralCategoryZL = 0x18, /**< Separator: Line Separator */
|
||||
SBGeneralCategoryZP = 0x19, /**< Separator: Paragraph Separator */
|
||||
|
||||
SBGeneralCategoryCC = 0x1A, /**< Other: Control */
|
||||
SBGeneralCategoryCF = 0x1B, /**< Other: Format */
|
||||
SBGeneralCategoryCS = 0x1C, /**< Other: Surrogate */
|
||||
SBGeneralCategoryCO = 0x1D, /**< Other: Private_Use */
|
||||
SBGeneralCategoryCN = 0x1E /**< Other: Unassigned */
|
||||
};
|
||||
|
||||
/**
|
||||
* A type to represent the general category of a character.
|
||||
*/
|
||||
typedef SBUInt8 SBGeneralCategory;
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is letter.
|
||||
*/
|
||||
#define SBGeneralCategoryIsLetter(gc) SBUInt8InRange(gc, SBGeneralCategoryLU, SBGeneralCategoryLO)
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is mark.
|
||||
*/
|
||||
#define SBGeneralCategoryIsMark(gc) SBUInt8InRange(gc, SBGeneralCategoryMN, SBGeneralCategoryME)
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is number.
|
||||
*/
|
||||
#define SBGeneralCategoryIsNumber(gc) SBUInt8InRange(gc, SBGeneralCategoryND, SBGeneralCategoryNO)
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is punctuation.
|
||||
*/
|
||||
#define SBGeneralCategoryIsPunctuation(gc) SBUInt8InRange(gc, SBGeneralCategoryPC, SBGeneralCategoryPO)
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is symbol.
|
||||
*/
|
||||
#define SBGeneralCategoryIsSymbol(gc) SBUInt8InRange(gc, SBGeneralCategorySM, SBGeneralCategorySO)
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is separator.
|
||||
*/
|
||||
#define SBGeneralCategoryIsSeparator(gc) SBUInt8InRange(gc, SBGeneralCategoryZS, SBGeneralCategoryZP)
|
||||
|
||||
/**
|
||||
* Checks whether specified general category is other.
|
||||
*/
|
||||
#define SBGeneralCategoryIsOther(gc) SBUInt8InRange(gc, SBGeneralCategoryCC, SBGeneralCategoryCN)
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,84 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_LINE_H
|
||||
#define _SB_PUBLIC_LINE_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBRun.h"
|
||||
|
||||
typedef struct _SBLine *SBLineRef;
|
||||
|
||||
/**
|
||||
* Returns the index to the first code unit of the line in source string.
|
||||
*
|
||||
* @param line
|
||||
* The line whose offset is returned.
|
||||
* @return
|
||||
* The offset of the line passed in.
|
||||
*/
|
||||
SBUInteger SBLineGetOffset(SBLineRef line);
|
||||
|
||||
/**
|
||||
* Returns the number of code units coverting the length of the line.
|
||||
*
|
||||
* @param line
|
||||
* The line whose length is returned.
|
||||
* @return
|
||||
* The length of the line passed in.
|
||||
*/
|
||||
SBUInteger SBLineGetLength(SBLineRef line);
|
||||
|
||||
/**
|
||||
* Returns the number of runs in the line.
|
||||
*
|
||||
* @param line
|
||||
* The line whose run count is returned.
|
||||
* @return
|
||||
* The number of runs in the line passed in.
|
||||
*/
|
||||
SBUInteger SBLineGetRunCount(SBLineRef line);
|
||||
|
||||
/**
|
||||
* Returns a direct pointer to the run array, stored in the line.
|
||||
*
|
||||
* @param line
|
||||
* The line from which to access the runs.
|
||||
* @return
|
||||
* A valid pointer to an array of SBRun structures.
|
||||
*/
|
||||
const SBRun *SBLineGetRunsPtr(SBLineRef line);
|
||||
|
||||
/**
|
||||
* Increments the reference count of a line object.
|
||||
*
|
||||
* @param line
|
||||
* The line object whose reference count will be incremented.
|
||||
* @return
|
||||
* The same line object passed in as the parameter.
|
||||
*/
|
||||
SBLineRef SBLineRetain(SBLineRef line);
|
||||
|
||||
/**
|
||||
* Decrements the reference count of a line object. The object will be deallocated when its
|
||||
* reference count reaches zero.
|
||||
*
|
||||
* @param line
|
||||
* The line object whose reference count will be decremented.
|
||||
*/
|
||||
void SBLineRelease(SBLineRef line);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,103 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_MIRROR_LOCATOR_H
|
||||
#define _SB_PUBLIC_MIRROR_LOCATOR_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepoint.h"
|
||||
#include "SBLine.h"
|
||||
|
||||
typedef struct _SBMirrorLocator *SBMirrorLocatorRef;
|
||||
|
||||
/**
|
||||
* A structure containing the information about a code point having Bidi_Mirrored property.
|
||||
*/
|
||||
typedef struct _SBMirrorAgent {
|
||||
SBUInteger index; /**< The absolute index of the code point. */
|
||||
SBCodepoint mirror; /**< The mirrored code point. */
|
||||
SBCodepoint codepoint; /**< The actual code point. */
|
||||
} SBMirrorAgent;
|
||||
|
||||
/**
|
||||
* Creates a mirror locator object which can be used to find mirrors in a line.
|
||||
*
|
||||
* @return
|
||||
* A reference to a mirror locator object.
|
||||
*/
|
||||
SBMirrorLocatorRef SBMirrorLocatorCreate(void);
|
||||
|
||||
/**
|
||||
* Loads a line in the locator so that its mirror can be located.
|
||||
*
|
||||
* @param locator
|
||||
* The locator in which the line will be loaded.
|
||||
* @param line
|
||||
* The line which will be loaded in the locator.
|
||||
* @param stringBuffer
|
||||
* The string buffer from which the line's algorithm was created.
|
||||
*/
|
||||
void SBMirrorLocatorLoadLine(SBMirrorLocatorRef locator, SBLineRef line, void *stringBuffer);
|
||||
|
||||
/**
|
||||
* Returns the agent containing the information of current located mirror.
|
||||
*
|
||||
* @param locator
|
||||
* The locator whose agent is returned.
|
||||
*/
|
||||
const SBMirrorAgent *SBMirrorLocatorGetAgent(SBMirrorLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Instructs the locator to find next mirror in the loaded line.
|
||||
*
|
||||
* @param locator
|
||||
* The locator whom you want to instruct.
|
||||
* @return
|
||||
* SBTrue if another mirror is available, SBFalse otherwise.
|
||||
* @note
|
||||
* The locator will be reset after locating last mirror.
|
||||
*/
|
||||
SBBoolean SBMirrorLocatorMoveNext(SBMirrorLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Instructs the locator to reset itself so that mirrors of the loaded line can be obatained from
|
||||
* the beginning.
|
||||
*
|
||||
* @param locator
|
||||
* The locator whom you want to reset.
|
||||
*/
|
||||
void SBMirrorLocatorReset(SBMirrorLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Increments the reference count of a mirror locator object.
|
||||
*
|
||||
* @param locator
|
||||
* The mirror locator object whose reference count will be incremented.
|
||||
* @return
|
||||
* The same mirror locator object passed in as the parameter.
|
||||
*/
|
||||
SBMirrorLocatorRef SBMirrorLocatorRetain(SBMirrorLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Decrements the reference count of a mirror locator object. The object will be deallocated when
|
||||
* its reference count reaches zero.
|
||||
*
|
||||
* @param locator
|
||||
* The mirror locator object whose reference count will be decremented.
|
||||
*/
|
||||
void SBMirrorLocatorRelease(SBMirrorLocatorRef locator);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,100 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_PARAGRAPH_H
|
||||
#define _SB_PUBLIC_PARAGRAPH_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBLine.h"
|
||||
|
||||
typedef struct _SBParagraph *SBParagraphRef;
|
||||
|
||||
/**
|
||||
* Returns the index to the first code unit of the paragraph in source string.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph whose offset is returned.
|
||||
* @return
|
||||
* The offset of the paragraph passed in.
|
||||
*/
|
||||
SBUInteger SBParagraphGetOffset(SBParagraphRef paragraph);
|
||||
|
||||
/**
|
||||
* Returns the number of code units covering the length of the paragraph.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph whose length is returned.
|
||||
* @return
|
||||
* The length of the paragraph passed in.
|
||||
*/
|
||||
SBUInteger SBParagraphGetLength(SBParagraphRef paragraph);
|
||||
|
||||
/**
|
||||
* Returns the base level of the paragraph.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph whose base level is returned.
|
||||
* @return
|
||||
* The base level of the paragraph passed in.
|
||||
*/
|
||||
SBLevel SBParagraphGetBaseLevel(SBParagraphRef paragraph);
|
||||
|
||||
/**
|
||||
* Returns a direct pointer to the embedding levels, stored in the paragraph.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph from which to access the embedding levels.
|
||||
* @return
|
||||
* A valid pointer to an array of SBLevel structures.
|
||||
*/
|
||||
const SBLevel *SBParagraphGetLevelsPtr(SBParagraphRef paragraph);
|
||||
|
||||
/**
|
||||
* Creates a line object of specified range by applying rules L1-L2 of Unicode Bidirectional
|
||||
* Algorithm.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph that creates the line.
|
||||
* @param lineOffset
|
||||
* The index to the first code unit of the line in source string. It should occur within the
|
||||
* range of paragraph.
|
||||
* @param lineLength
|
||||
* The number of code units covering the length of the line.
|
||||
* @return
|
||||
* A reference to a line object if the call was successful, NULL otherwise.
|
||||
*/
|
||||
SBLineRef SBParagraphCreateLine(SBParagraphRef paragraph, SBUInteger lineOffset, SBUInteger lineLength);
|
||||
|
||||
/**
|
||||
* Increments the reference count of a paragraph object.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph object whose reference count will be incremented.
|
||||
* @return
|
||||
* The same paragraph object passed in as the parameter.
|
||||
*/
|
||||
SBParagraphRef SBParagraphRetain(SBParagraphRef paragraph);
|
||||
|
||||
/**
|
||||
* Decrements the reference count of a paragraph object. The object will be deallocated when its
|
||||
* reference count reaches zero.
|
||||
*
|
||||
* @param paragraph
|
||||
* The paragraph object whose reference count will be decremented.
|
||||
*/
|
||||
void SBParagraphRelease(SBParagraphRef paragraph);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_RUN_H
|
||||
#define _SB_PUBLIC_RUN_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
/**
|
||||
* A structure containing the information of a sequence of characters having the same embedding
|
||||
* level.
|
||||
*/
|
||||
typedef struct _SBRun {
|
||||
SBUInteger offset; /**< The index to the first code unit of the run in source string. */
|
||||
SBUInteger length; /**< The number of code units covering the length of the run. */
|
||||
SBLevel level; /**< The embedding level of the run. */
|
||||
} SBRun;
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,258 @@
|
||||
/*
|
||||
* Copyright (C) 2018-2021 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_SCRIPT_H
|
||||
#define _SB_PUBLIC_SCRIPT_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
/**
|
||||
* Constants that specify the script of a character.
|
||||
*/
|
||||
enum {
|
||||
SBScriptNil = 0x00,
|
||||
|
||||
SBScriptZINH = 0x01, /**< Inherited */
|
||||
SBScriptZYYY = 0x02, /**< Common */
|
||||
SBScriptZZZZ = 0x03, /**< Unknown */
|
||||
|
||||
/* Unicode 1.1 */
|
||||
SBScriptARAB = 0x04, /**< Arabic */
|
||||
SBScriptARMN = 0x05, /**< Armenian */
|
||||
SBScriptBENG = 0x06, /**< Bengali */
|
||||
SBScriptBOPO = 0x07, /**< Bopomofo */
|
||||
SBScriptCYRL = 0x08, /**< Cyrillic */
|
||||
SBScriptDEVA = 0x09, /**< Devanagari */
|
||||
SBScriptGEOR = 0x0A, /**< Georgian */
|
||||
SBScriptGREK = 0x0B, /**< Greek */
|
||||
SBScriptGUJR = 0x0C, /**< Gujarati */
|
||||
SBScriptGURU = 0x0D, /**< Gurmukhi */
|
||||
SBScriptHANG = 0x0E, /**< Hangul */
|
||||
SBScriptHANI = 0x0F, /**< Han */
|
||||
SBScriptHEBR = 0x10, /**< Hebrew */
|
||||
SBScriptHIRA = 0x11, /**< Hiragana */
|
||||
SBScriptKANA = 0x12, /**< Katakana */
|
||||
SBScriptKNDA = 0x13, /**< Kannada */
|
||||
SBScriptLAOO = 0x14, /**< Lao */
|
||||
SBScriptLATN = 0x15, /**< Latin */
|
||||
SBScriptMLYM = 0x16, /**< Malayalam */
|
||||
SBScriptORYA = 0x17, /**< Oriya */
|
||||
SBScriptTAML = 0x18, /**< Tamil */
|
||||
SBScriptTELU = 0x19, /**< Telugu */
|
||||
SBScriptTHAI = 0x1A, /**< Thai */
|
||||
|
||||
/* Unicode 2.0 */
|
||||
SBScriptTIBT = 0x1B, /**< Tibetan */
|
||||
|
||||
/* Unicode 3.0 */
|
||||
SBScriptBRAI = 0x1C, /**< Braille */
|
||||
SBScriptCANS = 0x1D, /**< Canadian_Aboriginal */
|
||||
SBScriptCHER = 0x1E, /**< Cherokee */
|
||||
SBScriptETHI = 0x1F, /**< Ethiopic */
|
||||
SBScriptKHMR = 0x20, /**< Khmer */
|
||||
SBScriptMONG = 0x21, /**< Mongolian */
|
||||
SBScriptMYMR = 0x22, /**< Myanmar */
|
||||
SBScriptOGAM = 0x23, /**< Ogham */
|
||||
SBScriptRUNR = 0x24, /**< Runic */
|
||||
SBScriptSINH = 0x25, /**< Sinhala */
|
||||
SBScriptSYRC = 0x26, /**< Syriac */
|
||||
SBScriptTHAA = 0x27, /**< Thaana */
|
||||
SBScriptYIII = 0x28, /**< Yi */
|
||||
|
||||
/* Unicode 3.1 */
|
||||
SBScriptDSRT = 0x29, /**< Deseret */
|
||||
SBScriptGOTH = 0x2A, /**< Gothic */
|
||||
SBScriptITAL = 0x2B, /**< Old_Italic */
|
||||
|
||||
/* Unicode 3.2 */
|
||||
SBScriptBUHD = 0x2C, /**< Buhid */
|
||||
SBScriptHANO = 0x2D, /**< Hanunoo */
|
||||
SBScriptTAGB = 0x2E, /**< Tagbanwa */
|
||||
SBScriptTGLG = 0x2F, /**< Tagalog */
|
||||
|
||||
/* Unicode 4.0 */
|
||||
SBScriptCPRT = 0x30, /**< Cypriot */
|
||||
SBScriptLIMB = 0x31, /**< Limbu */
|
||||
SBScriptLINB = 0x32, /**< Linear_B */
|
||||
SBScriptOSMA = 0x33, /**< Osmanya */
|
||||
SBScriptSHAW = 0x34, /**< Shavian */
|
||||
SBScriptTALE = 0x35, /**< Tai_Le */
|
||||
SBScriptUGAR = 0x36, /**< Ugaritic */
|
||||
|
||||
/* Unicode 4.1 */
|
||||
SBScriptBUGI = 0x37, /**< Buginese */
|
||||
SBScriptCOPT = 0x38, /**< Coptic */
|
||||
SBScriptGLAG = 0x39, /**< Glagolitic */
|
||||
SBScriptKHAR = 0x3A, /**< Kharoshthi */
|
||||
SBScriptSYLO = 0x3B, /**< Syloti_Nagri */
|
||||
SBScriptTALU = 0x3C, /**< New_Tai_Lue */
|
||||
SBScriptTFNG = 0x3D, /**< Tifinagh */
|
||||
SBScriptXPEO = 0x3E, /**< Old_Persian */
|
||||
|
||||
/* Unicode 5.0 */
|
||||
SBScriptBALI = 0x3F, /**< Balinese */
|
||||
SBScriptNKOO = 0x40, /**< Nko */
|
||||
SBScriptPHAG = 0x41, /**< Phags_Pa */
|
||||
SBScriptPHNX = 0x42, /**< Phoenician */
|
||||
SBScriptXSUX = 0x43, /**< Cuneiform */
|
||||
|
||||
/* Unicode 5.1 */
|
||||
SBScriptCARI = 0x44, /**< Carian */
|
||||
SBScriptCHAM = 0x45, /**< Cham */
|
||||
SBScriptKALI = 0x46, /**< Kayah_Li */
|
||||
SBScriptLEPC = 0x47, /**< Lepcha */
|
||||
SBScriptLYCI = 0x48, /**< Lycian */
|
||||
SBScriptLYDI = 0x49, /**< Lydian */
|
||||
SBScriptOLCK = 0x4A, /**< Ol_Chiki */
|
||||
SBScriptRJNG = 0x4B, /**< Rejang */
|
||||
SBScriptSAUR = 0x4C, /**< Saurashtra */
|
||||
SBScriptSUND = 0x4D, /**< Sundanese */
|
||||
SBScriptVAII = 0x4E, /**< Vai */
|
||||
|
||||
/* Unicode 5.2 */
|
||||
SBScriptARMI = 0x4F, /**< Imperial_Aramaic */
|
||||
SBScriptAVST = 0x50, /**< Avestan */
|
||||
SBScriptBAMU = 0x51, /**< Bamum */
|
||||
SBScriptEGYP = 0x52, /**< Egyptian_Hieroglyphs */
|
||||
SBScriptJAVA = 0x53, /**< Javanese */
|
||||
SBScriptKTHI = 0x54, /**< Kaithi */
|
||||
SBScriptLANA = 0x55, /**< Tai_Tham */
|
||||
SBScriptLISU = 0x56, /**< Lisu */
|
||||
SBScriptMTEI = 0x57, /**< Meetei_Mayek */
|
||||
SBScriptORKH = 0x58, /**< Old_Turkic */
|
||||
SBScriptPHLI = 0x59, /**< Inscriptional_Pahlavi */
|
||||
SBScriptPRTI = 0x5A, /**< Inscriptional_Parthian */
|
||||
SBScriptSAMR = 0x5B, /**< Samaritan */
|
||||
SBScriptSARB = 0x5C, /**< Old_South_Arabian */
|
||||
SBScriptTAVT = 0x5D, /**< Tai_Viet */
|
||||
|
||||
/* Unicode 6.0 */
|
||||
SBScriptBATK = 0x5E, /**< Batak */
|
||||
SBScriptBRAH = 0x5F, /**< Brahmi */
|
||||
SBScriptMAND = 0x60, /**< Mandaic */
|
||||
|
||||
/* Unicode 6.1 */
|
||||
SBScriptCAKM = 0x61, /**< Chakma */
|
||||
SBScriptMERC = 0x62, /**< Meroitic_Cursive */
|
||||
SBScriptMERO = 0x63, /**< Meroitic_Hieroglyphs */
|
||||
SBScriptPLRD = 0x64, /**< Miao */
|
||||
SBScriptSHRD = 0x65, /**< Sharada */
|
||||
SBScriptSORA = 0x66, /**< Sora_Sompeng */
|
||||
SBScriptTAKR = 0x67, /**< Takri */
|
||||
|
||||
/* Unicode 7.0 */
|
||||
SBScriptAGHB = 0x68, /**< Caucasian_Albanian */
|
||||
SBScriptBASS = 0x69, /**< Bassa_Vah */
|
||||
SBScriptDUPL = 0x6A, /**< Duployan */
|
||||
SBScriptELBA = 0x6B, /**< Elbasan */
|
||||
SBScriptGRAN = 0x6C, /**< Grantha */
|
||||
SBScriptHMNG = 0x6D, /**< Pahawh_Hmong */
|
||||
SBScriptKHOJ = 0x6E, /**< Khojki */
|
||||
SBScriptLINA = 0x6F, /**< Linear_A */
|
||||
SBScriptMAHJ = 0x70, /**< Mahajani */
|
||||
SBScriptMANI = 0x71, /**< Manichaean */
|
||||
SBScriptMEND = 0x72, /**< Mende_Kikakui */
|
||||
SBScriptMODI = 0x73, /**< Modi */
|
||||
SBScriptMROO = 0x74, /**< Mro */
|
||||
SBScriptNARB = 0x75, /**< Old_North_Arabian */
|
||||
SBScriptNBAT = 0x76, /**< Nabataean */
|
||||
SBScriptPALM = 0x77, /**< Palmyrene */
|
||||
SBScriptPAUC = 0x78, /**< Pau_Cin_Hau */
|
||||
SBScriptPERM = 0x79, /**< Old_Permic */
|
||||
SBScriptPHLP = 0x7A, /**< Psalter_Pahlavi */
|
||||
SBScriptSIDD = 0x7B, /**< Siddham */
|
||||
SBScriptSIND = 0x7C, /**< Khudawadi */
|
||||
SBScriptTIRH = 0x7D, /**< Tirhuta */
|
||||
SBScriptWARA = 0x7E, /**< Warang_Citi */
|
||||
|
||||
/* Unicode 8.0 */
|
||||
SBScriptAHOM = 0x7F, /**< Ahom */
|
||||
SBScriptHATR = 0x80, /**< Hatran */
|
||||
SBScriptHLUW = 0x81, /**< Anatolian_Hieroglyphs */
|
||||
SBScriptHUNG = 0x82, /**< Old_Hungarian */
|
||||
SBScriptMULT = 0x83, /**< Multani */
|
||||
SBScriptSGNW = 0x84, /**< SignWriting */
|
||||
|
||||
/* Unicode 9.0 */
|
||||
SBScriptADLM = 0x85, /**< Adlam */
|
||||
SBScriptBHKS = 0x86, /**< Bhaiksuki */
|
||||
SBScriptMARC = 0x87, /**< Marchen */
|
||||
SBScriptNEWA = 0x88, /**< Newa */
|
||||
SBScriptOSGE = 0x89, /**< Osage */
|
||||
SBScriptTANG = 0x8A, /**< Tangut */
|
||||
|
||||
/* Unicode 10.0 */
|
||||
SBScriptGONM = 0x8B, /**< Masaram_Gondi */
|
||||
SBScriptNSHU = 0x8C, /**< Nushu */
|
||||
SBScriptSOYO = 0x8D, /**< Soyombo */
|
||||
SBScriptZANB = 0x8E, /**< Zanabazar_Square */
|
||||
|
||||
/* Unicode 11.0 */
|
||||
SBScriptDOGR = 0x8F, /**< Dogra */
|
||||
SBScriptGONG = 0x90, /**< Gunjala_Gondi */
|
||||
SBScriptMAKA = 0x91, /**< Makasar */
|
||||
SBScriptMEDF = 0x92, /**< Medefaidrin */
|
||||
SBScriptROHG = 0x93, /**< Hanifi_Rohingya */
|
||||
SBScriptSOGD = 0x94, /**< Sogdian */
|
||||
SBScriptSOGO = 0x95, /**< Old_Sogdian */
|
||||
|
||||
/* Unicode 12.0 */
|
||||
SBScriptELYM = 0x96, /**< Elymaic */
|
||||
SBScriptHMNP = 0x97, /**< Nyiakeng_Puachue_Hmong */
|
||||
SBScriptNAND = 0x98, /**< Nandinagari */
|
||||
SBScriptWCHO = 0x99, /**< Wancho */
|
||||
|
||||
/* Unicde 13.0 */
|
||||
SBScriptCHRS = 0x9A, /**< Chorasmian */
|
||||
SBScriptDIAK = 0x9B, /**< Dives_Akuru */
|
||||
SBScriptKITS = 0x9C, /**< Khitan_Small_Script */
|
||||
SBScriptYEZI = 0x9D, /**< Yezidi */
|
||||
|
||||
/* Unicde 14.0 */
|
||||
SBScriptCPMN = 0x9E, /**< Cypro_Minoan */
|
||||
SBScriptOUGR = 0x9F, /**< Old_Uyghur */
|
||||
SBScriptTNSA = 0xA0, /**< Tangsa */
|
||||
SBScriptTOTO = 0xA1, /**< Toto */
|
||||
SBScriptVITH = 0xA2, /**< Vithkuqi */
|
||||
|
||||
/* Unicde 15.1 */
|
||||
SBScriptKAWI = 0xA3, /**< Kawi */
|
||||
SBScriptNAGM = 0xA4 /**< Nag_Mundari */
|
||||
};
|
||||
|
||||
/**
|
||||
* A type to represent the script of a character.
|
||||
*/
|
||||
typedef SBUInt8 SBScript;
|
||||
|
||||
/**
|
||||
* Returns the OpenType tag of a script as UInt32 in big endian byte order. The association between
|
||||
* Unicode Script property and OpenType script tags is taken from the specification:
|
||||
* https://docs.microsoft.com/en-us/typography/opentype/spec/scripttags.
|
||||
*
|
||||
* If more than one tag is associated with a script, then the latest one is retured. For example,
|
||||
* Devanagari script has two tags, `deva` and `dev2`. So in this case, `dev2` will be returned.
|
||||
*
|
||||
* If no tag is associated with a script, then `DFLT` is returned.
|
||||
*
|
||||
* @param script
|
||||
* The script whose OpenType tag is returned.
|
||||
* @return
|
||||
* The OpenType tag of specified script as UInt32 in big endian byte order.
|
||||
*/
|
||||
SBUInt32 SBScriptGetOpenTypeTag(SBScript script);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,101 @@
|
||||
/*
|
||||
* Copyright (C) 2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_PUBLIC_SCRIPT_LOCATOR_H
|
||||
#define _SB_PUBLIC_SCRIPT_LOCATOR_H
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBScript.h"
|
||||
|
||||
typedef struct _SBScriptLocator *SBScriptLocatorRef;
|
||||
|
||||
/**
|
||||
* A structure containing the information about a run of code points having same script.
|
||||
*/
|
||||
typedef struct _SBScriptAgent {
|
||||
SBUInteger offset; /**< The index to the first code unit of the run in source string. */
|
||||
SBUInteger length; /**< The number of code units covering the length of the run. */
|
||||
SBScript script; /**< The script of the run. */
|
||||
} SBScriptAgent;
|
||||
|
||||
/**
|
||||
* Creates a script locator object which can be used to find script runs in a string.
|
||||
*
|
||||
* @return
|
||||
* A reference to a script locator object.
|
||||
*/
|
||||
SBScriptLocatorRef SBScriptLocatorCreate(void);
|
||||
|
||||
/**
|
||||
* Loads a code point sequence in the locator so that its script runs can be located.
|
||||
*
|
||||
* @param locator
|
||||
* The locator in which the code point sequence will be loaded.
|
||||
* @param codepointSequence
|
||||
* The code point sequence which will be loaded in the locator.
|
||||
*/
|
||||
void SBScriptLocatorLoadCodepoints(SBScriptLocatorRef locator, const SBCodepointSequence *codepointSequence);
|
||||
|
||||
/**
|
||||
* Returns the agent containing the information of current located script run.
|
||||
*
|
||||
* @param locator
|
||||
* The locator whose agent is returned.
|
||||
*/
|
||||
const SBScriptAgent *SBScriptLocatorGetAgent(SBScriptLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Instructs the locator to find next script run in the loaded code point sequence.
|
||||
*
|
||||
* @param locator
|
||||
* The locator whom you want to instruct.
|
||||
* @return
|
||||
* SBTrue if another script run is available, SBFalse otherwise.
|
||||
* @note
|
||||
* The locator will be reset after locating last script run.
|
||||
*/
|
||||
SBBoolean SBScriptLocatorMoveNext(SBScriptLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Instructs the locator to reset itself so that script runs of the loaded line can be obatained
|
||||
* from the beginning.
|
||||
*
|
||||
* @param locator
|
||||
* The locator whom you want to reset.
|
||||
*/
|
||||
void SBScriptLocatorReset(SBScriptLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Increments the reference count of a script locator object.
|
||||
*
|
||||
* @param locator
|
||||
* The script locator object whose reference count will be incremented.
|
||||
* @return
|
||||
* The same script locator object passed in as the parameter.
|
||||
*/
|
||||
SBScriptLocatorRef SBScriptLocatorRetain(SBScriptLocatorRef locator);
|
||||
|
||||
/**
|
||||
* Decrements the reference count of a script locator object. The object will be deallocated when
|
||||
* its reference count reaches zero.
|
||||
*
|
||||
* @param locator
|
||||
* The script locator object whose reference count will be decremented.
|
||||
*/
|
||||
void SBScriptLocatorRelease(SBScriptLocatorRef locator);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,33 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2018 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SHEEN_BIDI_H
|
||||
#define _SHEEN_BIDI_H
|
||||
|
||||
#include "SBAlgorithm.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBBidiType.h"
|
||||
#include "SBCodepoint.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBGeneralCategory.h"
|
||||
#include "SBLine.h"
|
||||
#include "SBMirrorLocator.h"
|
||||
#include "SBParagraph.h"
|
||||
#include "SBRun.h"
|
||||
#include "SBScript.h"
|
||||
#include "SBScriptLocator.h"
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,3 @@
|
||||
- The include of SBRun.h in SBLine.c was changed to use angle brackets.
|
||||
- Include paths to SheenBidi headers in <angle brackets> have been swapped for
|
||||
versions that explicitly point inside the juce_graphics module.
|
||||
@@ -0,0 +1,202 @@
|
||||
|
||||
Apache License
|
||||
Version 2.0, January 2004
|
||||
http://www.apache.org/licenses/
|
||||
|
||||
TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
|
||||
|
||||
1. Definitions.
|
||||
|
||||
"License" shall mean the terms and conditions for use, reproduction,
|
||||
and distribution as defined by Sections 1 through 9 of this document.
|
||||
|
||||
"Licensor" shall mean the copyright owner or entity authorized by
|
||||
the copyright owner that is granting the License.
|
||||
|
||||
"Legal Entity" shall mean the union of the acting entity and all
|
||||
other entities that control, are controlled by, or are under common
|
||||
control with that entity. For the purposes of this definition,
|
||||
"control" means (i) the power, direct or indirect, to cause the
|
||||
direction or management of such entity, whether by contract or
|
||||
otherwise, or (ii) ownership of fifty percent (50%) or more of the
|
||||
outstanding shares, or (iii) beneficial ownership of such entity.
|
||||
|
||||
"You" (or "Your") shall mean an individual or Legal Entity
|
||||
exercising permissions granted by this License.
|
||||
|
||||
"Source" form shall mean the preferred form for making modifications,
|
||||
including but not limited to software source code, documentation
|
||||
source, and configuration files.
|
||||
|
||||
"Object" form shall mean any form resulting from mechanical
|
||||
transformation or translation of a Source form, including but
|
||||
not limited to compiled object code, generated documentation,
|
||||
and conversions to other media types.
|
||||
|
||||
"Work" shall mean the work of authorship, whether in Source or
|
||||
Object form, made available under the License, as indicated by a
|
||||
copyright notice that is included in or attached to the work
|
||||
(an example is provided in the Appendix below).
|
||||
|
||||
"Derivative Works" shall mean any work, whether in Source or Object
|
||||
form, that is based on (or derived from) the Work and for which the
|
||||
editorial revisions, annotations, elaborations, or other modifications
|
||||
represent, as a whole, an original work of authorship. For the purposes
|
||||
of this License, Derivative Works shall not include works that remain
|
||||
separable from, or merely link (or bind by name) to the interfaces of,
|
||||
the Work and Derivative Works thereof.
|
||||
|
||||
"Contribution" shall mean any work of authorship, including
|
||||
the original version of the Work and any modifications or additions
|
||||
to that Work or Derivative Works thereof, that is intentionally
|
||||
submitted to Licensor for inclusion in the Work by the copyright owner
|
||||
or by an individual or Legal Entity authorized to submit on behalf of
|
||||
the copyright owner. For the purposes of this definition, "submitted"
|
||||
means any form of electronic, verbal, or written communication sent
|
||||
to the Licensor or its representatives, including but not limited to
|
||||
communication on electronic mailing lists, source code control systems,
|
||||
and issue tracking systems that are managed by, or on behalf of, the
|
||||
Licensor for the purpose of discussing and improving the Work, but
|
||||
excluding communication that is conspicuously marked or otherwise
|
||||
designated in writing by the copyright owner as "Not a Contribution."
|
||||
|
||||
"Contributor" shall mean Licensor and any individual or Legal Entity
|
||||
on behalf of whom a Contribution has been received by Licensor and
|
||||
subsequently incorporated within the Work.
|
||||
|
||||
2. Grant of Copyright License. Subject to the terms and conditions of
|
||||
this License, each Contributor hereby grants to You a perpetual,
|
||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||
copyright license to reproduce, prepare Derivative Works of,
|
||||
publicly display, publicly perform, sublicense, and distribute the
|
||||
Work and such Derivative Works in Source or Object form.
|
||||
|
||||
3. Grant of Patent License. Subject to the terms and conditions of
|
||||
this License, each Contributor hereby grants to You a perpetual,
|
||||
worldwide, non-exclusive, no-charge, royalty-free, irrevocable
|
||||
(except as stated in this section) patent license to make, have made,
|
||||
use, offer to sell, sell, import, and otherwise transfer the Work,
|
||||
where such license applies only to those patent claims licensable
|
||||
by such Contributor that are necessarily infringed by their
|
||||
Contribution(s) alone or by combination of their Contribution(s)
|
||||
with the Work to which such Contribution(s) was submitted. If You
|
||||
institute patent litigation against any entity (including a
|
||||
cross-claim or counterclaim in a lawsuit) alleging that the Work
|
||||
or a Contribution incorporated within the Work constitutes direct
|
||||
or contributory patent infringement, then any patent licenses
|
||||
granted to You under this License for that Work shall terminate
|
||||
as of the date such litigation is filed.
|
||||
|
||||
4. Redistribution. You may reproduce and distribute copies of the
|
||||
Work or Derivative Works thereof in any medium, with or without
|
||||
modifications, and in Source or Object form, provided that You
|
||||
meet the following conditions:
|
||||
|
||||
(a) You must give any other recipients of the Work or
|
||||
Derivative Works a copy of this License; and
|
||||
|
||||
(b) You must cause any modified files to carry prominent notices
|
||||
stating that You changed the files; and
|
||||
|
||||
(c) You must retain, in the Source form of any Derivative Works
|
||||
that You distribute, all copyright, patent, trademark, and
|
||||
attribution notices from the Source form of the Work,
|
||||
excluding those notices that do not pertain to any part of
|
||||
the Derivative Works; and
|
||||
|
||||
(d) If the Work includes a "NOTICE" text file as part of its
|
||||
distribution, then any Derivative Works that You distribute must
|
||||
include a readable copy of the attribution notices contained
|
||||
within such NOTICE file, excluding those notices that do not
|
||||
pertain to any part of the Derivative Works, in at least one
|
||||
of the following places: within a NOTICE text file distributed
|
||||
as part of the Derivative Works; within the Source form or
|
||||
documentation, if provided along with the Derivative Works; or,
|
||||
within a display generated by the Derivative Works, if and
|
||||
wherever such third-party notices normally appear. The contents
|
||||
of the NOTICE file are for informational purposes only and
|
||||
do not modify the License. You may add Your own attribution
|
||||
notices within Derivative Works that You distribute, alongside
|
||||
or as an addendum to the NOTICE text from the Work, provided
|
||||
that such additional attribution notices cannot be construed
|
||||
as modifying the License.
|
||||
|
||||
You may add Your own copyright statement to Your modifications and
|
||||
may provide additional or different license terms and conditions
|
||||
for use, reproduction, or distribution of Your modifications, or
|
||||
for any such Derivative Works as a whole, provided Your use,
|
||||
reproduction, and distribution of the Work otherwise complies with
|
||||
the conditions stated in this License.
|
||||
|
||||
5. Submission of Contributions. Unless You explicitly state otherwise,
|
||||
any Contribution intentionally submitted for inclusion in the Work
|
||||
by You to the Licensor shall be under the terms and conditions of
|
||||
this License, without any additional terms or conditions.
|
||||
Notwithstanding the above, nothing herein shall supersede or modify
|
||||
the terms of any separate license agreement you may have executed
|
||||
with Licensor regarding such Contributions.
|
||||
|
||||
6. Trademarks. This License does not grant permission to use the trade
|
||||
names, trademarks, service marks, or product names of the Licensor,
|
||||
except as required for reasonable and customary use in describing the
|
||||
origin of the Work and reproducing the content of the NOTICE file.
|
||||
|
||||
7. Disclaimer of Warranty. Unless required by applicable law or
|
||||
agreed to in writing, Licensor provides the Work (and each
|
||||
Contributor provides its Contributions) on an "AS IS" BASIS,
|
||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
|
||||
implied, including, without limitation, any warranties or conditions
|
||||
of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
|
||||
PARTICULAR PURPOSE. You are solely responsible for determining the
|
||||
appropriateness of using or redistributing the Work and assume any
|
||||
risks associated with Your exercise of permissions under this License.
|
||||
|
||||
8. Limitation of Liability. In no event and under no legal theory,
|
||||
whether in tort (including negligence), contract, or otherwise,
|
||||
unless required by applicable law (such as deliberate and grossly
|
||||
negligent acts) or agreed to in writing, shall any Contributor be
|
||||
liable to You for damages, including any direct, indirect, special,
|
||||
incidental, or consequential damages of any character arising as a
|
||||
result of this License or out of the use or inability to use the
|
||||
Work (including but not limited to damages for loss of goodwill,
|
||||
work stoppage, computer failure or malfunction, or any and all
|
||||
other commercial damages or losses), even if such Contributor
|
||||
has been advised of the possibility of such damages.
|
||||
|
||||
9. Accepting Warranty or Additional Liability. While redistributing
|
||||
the Work or Derivative Works thereof, You may choose to offer,
|
||||
and charge a fee for, acceptance of support, warranty, indemnity,
|
||||
or other liability obligations and/or rights consistent with this
|
||||
License. However, in accepting such obligations, You may act only
|
||||
on Your own behalf and on Your sole responsibility, not on behalf
|
||||
of any other Contributor, and only if You agree to indemnify,
|
||||
defend, and hold each Contributor harmless for any liability
|
||||
incurred by, or claims asserted against, such Contributor by reason
|
||||
of your accepting any such warranty or additional liability.
|
||||
|
||||
END OF TERMS AND CONDITIONS
|
||||
|
||||
APPENDIX: How to apply the Apache License to your work.
|
||||
|
||||
To apply the Apache License to your work, attach the following
|
||||
boilerplate notice, with the fields enclosed by brackets "[]"
|
||||
replaced with your own identifying information. (Don't include
|
||||
the brackets!) The text should be enclosed in the appropriate
|
||||
comment syntax for the file format. We also recommend that a
|
||||
file or class name and description of purpose be included on the
|
||||
same "printed page" as the copyright notice for easier
|
||||
identification within third-party archives.
|
||||
|
||||
Copyright [yyyy] [name of copyright owner]
|
||||
|
||||
Licensed under the Apache License, Version 2.0 (the "License");
|
||||
you may not use this file except in compliance with the License.
|
||||
You may obtain a copy of the License at
|
||||
|
||||
http://www.apache.org/licenses/LICENSE-2.0
|
||||
|
||||
Unless required by applicable law or agreed to in writing, software
|
||||
distributed under the License is distributed on an "AS IS" BASIS,
|
||||
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
See the License for the specific language governing permissions and
|
||||
limitations under the License.
|
||||
@@ -0,0 +1,110 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "BidiChain.h"
|
||||
|
||||
SB_INTERNAL void BidiChainInitialize(BidiChainRef chain,
|
||||
SBBidiType *types, SBLevel *levels, BidiLink *links)
|
||||
{
|
||||
chain->types = types;
|
||||
chain->levels = levels;
|
||||
chain->links = links;
|
||||
chain->roller = 0;
|
||||
chain->last = 0;
|
||||
|
||||
/* Make first link empty. */
|
||||
chain->types[0] = SBBidiTypeNil;
|
||||
chain->levels[0] = SBLevelInvalid;
|
||||
chain->links[0] = BidiLinkNone;
|
||||
}
|
||||
|
||||
SB_INTERNAL void BidiChainAdd(BidiChainRef chain, SBBidiType type, SBUInteger length)
|
||||
{
|
||||
BidiLink last = chain->last;
|
||||
BidiLink current = last + (SBUInt32)length;
|
||||
|
||||
chain->types[current] = type;
|
||||
chain->links[current] = chain->roller;
|
||||
|
||||
chain->links[last] = current;
|
||||
chain->last = current;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean BidiChainIsSingle(BidiChainRef chain, BidiLink link)
|
||||
{
|
||||
BidiLink next = chain->links[link];
|
||||
|
||||
/* Check the type of in between code units. */
|
||||
while (++link != next) {
|
||||
if (chain->types[link] != SBBidiTypeBN) {
|
||||
return SBFalse;
|
||||
}
|
||||
}
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBidiType BidiChainGetType(BidiChainRef chain, BidiLink link)
|
||||
{
|
||||
return chain->types[link];
|
||||
}
|
||||
|
||||
SB_INTERNAL void BidiChainSetType(BidiChainRef chain, BidiLink link, SBBidiType type)
|
||||
{
|
||||
chain->types[link] = type;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBLevel BidiChainGetLevel(BidiChainRef chain, BidiLink link)
|
||||
{
|
||||
return chain->levels[link];
|
||||
}
|
||||
|
||||
SB_INTERNAL void BidiChainSetLevel(BidiChainRef chain, BidiLink link, SBLevel level)
|
||||
{
|
||||
chain->levels[link] = level;
|
||||
}
|
||||
|
||||
SB_INTERNAL BidiLink BidiChainGetNext(BidiChainRef chain, BidiLink link)
|
||||
{
|
||||
return chain->links[link];
|
||||
}
|
||||
|
||||
SB_INTERNAL void BidiChainSetNext(BidiChainRef chain, BidiLink link, BidiLink next)
|
||||
{
|
||||
chain->links[link] = next;
|
||||
}
|
||||
|
||||
SB_INTERNAL void BidiChainAbandonNext(BidiChainRef chain, BidiLink link)
|
||||
{
|
||||
BidiLink next = chain->links[link];
|
||||
BidiLink limit = chain->links[next];
|
||||
|
||||
chain->links[link] = limit;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean BidiChainMergeIfEqual(BidiChainRef chain, BidiLink first, BidiLink second)
|
||||
{
|
||||
if (chain->types[first] == chain->types[second]
|
||||
&& chain->levels[first] == chain->levels[second]) {
|
||||
chain->links[first] = chain->links[second];
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
return SBFalse;
|
||||
}
|
||||
@@ -0,0 +1,60 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_BIDI_CHAIN_H
|
||||
#define _SB_INTERNAL_BIDI_CHAIN_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include "SBBase.h"
|
||||
|
||||
typedef SBUInt32 BidiLink;
|
||||
|
||||
#define BidiLinkNone (SBUInt32)(-1)
|
||||
|
||||
typedef struct _BidiChain {
|
||||
SBBidiType *types;
|
||||
SBLevel *levels;
|
||||
BidiLink *links;
|
||||
BidiLink roller;
|
||||
BidiLink last;
|
||||
} BidiChain, *BidiChainRef;
|
||||
|
||||
SB_INTERNAL void BidiChainInitialize(BidiChainRef chain,
|
||||
SBBidiType *types, SBLevel *levels, BidiLink *links);
|
||||
SB_INTERNAL void BidiChainAdd(BidiChainRef chain, SBBidiType type, SBUInteger length);
|
||||
|
||||
#define BidiChainGetOffset(chain, link) \
|
||||
( \
|
||||
(link) - 1 \
|
||||
)
|
||||
|
||||
SB_INTERNAL SBBoolean BidiChainIsSingle(BidiChainRef chain, BidiLink link);
|
||||
|
||||
SB_INTERNAL SBBidiType BidiChainGetType(BidiChainRef chain, BidiLink link);
|
||||
SB_INTERNAL void BidiChainSetType(BidiChainRef chain, BidiLink link, SBBidiType type);
|
||||
|
||||
SB_INTERNAL SBLevel BidiChainGetLevel(BidiChainRef chain, BidiLink link);
|
||||
SB_INTERNAL void BidiChainSetLevel(BidiChainRef chain, BidiLink link, SBLevel level);
|
||||
|
||||
SB_INTERNAL BidiLink BidiChainGetNext(BidiChainRef chain, BidiLink link);
|
||||
SB_INTERNAL void BidiChainSetNext(BidiChainRef chain, BidiLink link, BidiLink next);
|
||||
SB_INTERNAL void BidiChainAbandonNext(BidiChainRef chain, BidiLink link);
|
||||
SB_INTERNAL SBBoolean BidiChainMergeIfEqual(BidiChainRef chain, BidiLink first, BidiLink second);
|
||||
|
||||
#define BidiChainForEach(chain, roller, link) \
|
||||
for (link = chain->links[roller]; link != roller; link = chain->links[link])
|
||||
|
||||
#endif
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,16 @@
|
||||
/*
|
||||
* Automatically generated by SheenBidiGenerator tool.
|
||||
* DO NOT EDIT!!
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_BIDI_TYPE_LOOKUP_H
|
||||
#define _SB_INTERNAL_BIDI_TYPE_LOOKUP_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBidiType.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
SB_INTERNAL SBBidiType LookupBidiType(SBCodepoint codepoint);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,242 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "BracketQueue.h"
|
||||
|
||||
static SBBoolean BracketQueueInsertElement(BracketQueueRef queue)
|
||||
{
|
||||
if (queue->_rearTop != BracketQueueList_MaxIndex) {
|
||||
queue->_rearTop += 1;
|
||||
} else {
|
||||
BracketQueueListRef previousList = queue->_rearList;
|
||||
BracketQueueListRef rearList = previousList->next;
|
||||
|
||||
if (!rearList) {
|
||||
rearList = malloc(sizeof(BracketQueueList));
|
||||
if (!rearList) {
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
rearList->previous = previousList;
|
||||
rearList->next = NULL;
|
||||
|
||||
previousList->next = rearList;
|
||||
}
|
||||
|
||||
queue->_rearList = rearList;
|
||||
queue->_rearTop = 0;
|
||||
}
|
||||
queue->count += 1;
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
static void BracketQueueFinalizePairs(BracketQueueRef queue, BracketQueueListRef list, SBInteger top)
|
||||
{
|
||||
do {
|
||||
SBInteger limit = (list == queue->_rearList ? queue->_rearTop : BracketQueueList_MaxIndex);
|
||||
|
||||
while (++top <= limit) {
|
||||
if (list->openingLink[top] != BidiLinkNone
|
||||
&& list->closingLink[top] == BidiLinkNone) {
|
||||
list->openingLink[top] = BidiLinkNone;
|
||||
}
|
||||
}
|
||||
|
||||
list = list->next;
|
||||
top = 0;
|
||||
} while (list);
|
||||
}
|
||||
|
||||
SB_INTERNAL void BracketQueueInitialize(BracketQueueRef queue)
|
||||
{
|
||||
queue->_firstList.previous = NULL;
|
||||
queue->_firstList.next = NULL;
|
||||
queue->_frontList = NULL;
|
||||
queue->_rearList = NULL;
|
||||
queue->count = 0;
|
||||
queue->shouldDequeue = SBFalse;
|
||||
}
|
||||
|
||||
SB_INTERNAL void BracketQueueReset(BracketQueueRef queue, SBBidiType direction)
|
||||
{
|
||||
queue->_frontList = &queue->_firstList;
|
||||
queue->_rearList = &queue->_firstList;
|
||||
queue->_frontTop = 0;
|
||||
queue->_rearTop = -1;
|
||||
queue->count = 0;
|
||||
queue->shouldDequeue = SBFalse;
|
||||
queue->_direction = direction;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean BracketQueueEnqueue(BracketQueueRef queue,
|
||||
BidiLink priorStrongLink, BidiLink openingLink, SBCodepoint bracket)
|
||||
{
|
||||
/* The queue can only take a maximum of 63 elements. */
|
||||
SBAssert(queue->count < BracketQueueGetMaxCapacity());
|
||||
|
||||
if (BracketQueueInsertElement(queue)) {
|
||||
BracketQueueListRef list = queue->_rearList;
|
||||
SBInteger top = queue->_rearTop;
|
||||
|
||||
list->priorStrongLink[top] = priorStrongLink;
|
||||
list->openingLink[top] = openingLink;
|
||||
list->closingLink[top] = BidiLinkNone;
|
||||
list->bracket[top] = bracket;
|
||||
list->strongType[top] = SBBidiTypeNil;
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
SB_INTERNAL void BracketQueueDequeue(BracketQueueRef queue)
|
||||
{
|
||||
/* The queue must NOT be empty. */
|
||||
SBAssert(queue->count != 0);
|
||||
|
||||
if (queue->_frontTop != BracketQueueList_MaxIndex) {
|
||||
queue->_frontTop += 1;
|
||||
} else {
|
||||
BracketQueueListRef frontList = queue->_frontList;
|
||||
|
||||
if (frontList == queue->_rearList) {
|
||||
queue->_rearTop = -1;
|
||||
} else {
|
||||
queue->_frontList = frontList->next;
|
||||
}
|
||||
|
||||
queue->_frontTop = 0;
|
||||
}
|
||||
|
||||
queue->count -= 1;
|
||||
}
|
||||
|
||||
SB_INTERNAL void BracketQueueSetStrongType(BracketQueueRef queue, SBBidiType strongType)
|
||||
{
|
||||
BracketQueueListRef list = queue->_rearList;
|
||||
SBInteger top = queue->_rearTop;
|
||||
|
||||
while (1) {
|
||||
SBInteger limit = (list == queue->_frontList ? queue->_frontTop : 0);
|
||||
|
||||
do {
|
||||
if (list->closingLink[top] == BidiLinkNone
|
||||
&& list->strongType[top] != queue->_direction) {
|
||||
list->strongType[top] = strongType;
|
||||
}
|
||||
} while (top-- > limit);
|
||||
|
||||
if (list == queue->_frontList) {
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->previous;
|
||||
top = BracketQueueList_MaxIndex;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void BracketQueueClosePair(BracketQueueRef queue, BidiLink closingLink, SBCodepoint bracket)
|
||||
{
|
||||
BracketQueueListRef list = queue->_rearList;
|
||||
SBInteger top = queue->_rearTop;
|
||||
SBCodepoint canonical;
|
||||
|
||||
switch (bracket) {
|
||||
case 0x232A:
|
||||
canonical = 0x3009;
|
||||
break;
|
||||
|
||||
case 0x3009:
|
||||
canonical = 0x232A;
|
||||
break;
|
||||
|
||||
default:
|
||||
canonical = bracket;
|
||||
break;
|
||||
}
|
||||
|
||||
while (1) {
|
||||
SBBoolean isFrontList = (list == queue->_frontList);
|
||||
SBInteger limit = (isFrontList ? queue->_frontTop : 0);
|
||||
|
||||
do {
|
||||
if (list->openingLink[top] != BidiLinkNone
|
||||
&& list->closingLink[top] == BidiLinkNone
|
||||
&& (list->bracket[top] == bracket || list->bracket[top] == canonical)) {
|
||||
list->closingLink[top] = closingLink;
|
||||
BracketQueueFinalizePairs(queue, list, top);
|
||||
|
||||
if (isFrontList && top == queue->_frontTop) {
|
||||
queue->shouldDequeue = SBTrue;
|
||||
}
|
||||
|
||||
return;
|
||||
}
|
||||
} while (top-- > limit);
|
||||
|
||||
if (isFrontList) {
|
||||
break;
|
||||
}
|
||||
|
||||
list = list->previous;
|
||||
top = BracketQueueList_MaxIndex;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean BracketQueueShouldDequeue(BracketQueueRef queue)
|
||||
{
|
||||
return queue->shouldDequeue;
|
||||
}
|
||||
|
||||
SB_INTERNAL BidiLink BracketQueueGetPriorStrongLink(BracketQueueRef queue)
|
||||
{
|
||||
return queue->_frontList->priorStrongLink[queue->_frontTop];
|
||||
}
|
||||
|
||||
SB_INTERNAL BidiLink BracketQueueGetOpeningLink(BracketQueueRef queue)
|
||||
{
|
||||
return queue->_frontList->openingLink[queue->_frontTop];
|
||||
}
|
||||
|
||||
SB_INTERNAL BidiLink BracketQueueGetClosingLink(BracketQueueRef queue)
|
||||
{
|
||||
return queue->_frontList->closingLink[queue->_frontTop];
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBidiType BracketQueueGetStrongType(BracketQueueRef queue)
|
||||
{
|
||||
return queue->_frontList->strongType[queue->_frontTop];
|
||||
}
|
||||
|
||||
SB_INTERNAL void BracketQueueFinalize(BracketQueueRef queue)
|
||||
{
|
||||
BracketQueueListRef list = queue->_firstList.next;
|
||||
|
||||
while (list) {
|
||||
BracketQueueListRef next = list->next;
|
||||
free(list);
|
||||
list = next;
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,72 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_BRACKET_QUEUE_H
|
||||
#define _SB_INTERNAL_BRACKET_QUEUE_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "SBBase.h"
|
||||
|
||||
#define BracketQueueList_Length 8
|
||||
#define BracketQueueList_MaxIndex (BracketQueueList_Length - 1)
|
||||
|
||||
typedef struct _BracketQueueList {
|
||||
SBCodepoint bracket[BracketQueueList_Length];
|
||||
BidiLink priorStrongLink[BracketQueueList_Length];
|
||||
BidiLink openingLink[BracketQueueList_Length];
|
||||
BidiLink closingLink[BracketQueueList_Length];
|
||||
SBBidiType strongType[BracketQueueList_Length];
|
||||
|
||||
struct _BracketQueueList *previous;
|
||||
struct _BracketQueueList *next;
|
||||
} BracketQueueList, *BracketQueueListRef;
|
||||
|
||||
typedef struct _BracketQueue {
|
||||
BracketQueueList _firstList;
|
||||
BracketQueueListRef _frontList;
|
||||
BracketQueueListRef _rearList;
|
||||
SBInteger _frontTop;
|
||||
SBInteger _rearTop;
|
||||
SBUInteger count;
|
||||
SBBoolean shouldDequeue;
|
||||
SBBidiType _direction;
|
||||
} BracketQueue, *BracketQueueRef;
|
||||
|
||||
#define BracketQueueGetMaxCapacity() 63
|
||||
|
||||
SB_INTERNAL void BracketQueueInitialize(BracketQueueRef queue);
|
||||
SB_INTERNAL void BracketQueueReset(BracketQueueRef queue, SBBidiType direction);
|
||||
|
||||
SB_INTERNAL SBBoolean BracketQueueEnqueue(BracketQueueRef queue,
|
||||
BidiLink priorStrongLink, BidiLink openingLink, SBCodepoint bracket);
|
||||
SB_INTERNAL void BracketQueueDequeue(BracketQueueRef queue);
|
||||
|
||||
SB_INTERNAL void BracketQueueSetStrongType(BracketQueueRef queue, SBBidiType strongType);
|
||||
SB_INTERNAL void BracketQueueClosePair(BracketQueueRef queue,
|
||||
BidiLink closingLink, SBCodepoint bracket);
|
||||
|
||||
SB_INTERNAL SBBoolean BracketQueueShouldDequeue(BracketQueueRef queue);
|
||||
|
||||
SB_INTERNAL BidiLink BracketQueueGetPriorStrongLink(BracketQueueRef queue);
|
||||
SB_INTERNAL BidiLink BracketQueueGetOpeningLink(BracketQueueRef queue);
|
||||
SB_INTERNAL BidiLink BracketQueueGetClosingLink(BracketQueueRef queue);
|
||||
SB_INTERNAL SBBidiType BracketQueueGetStrongType(BracketQueueRef queue);
|
||||
|
||||
SB_INTERNAL void BracketQueueFinalize(BracketQueueRef queue);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_BRACKET_TYPE_H
|
||||
#define _SB_INTERNAL_BRACKET_TYPE_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
enum {
|
||||
BracketTypeNone = 0x00,
|
||||
BracketTypeOpen = 0x40, /**< Opening paired bracket. */
|
||||
BracketTypeClose = 0x80, /**< Closing paired bracket. */
|
||||
|
||||
BracketTypePrimaryMask = BracketTypeOpen | BracketTypeClose,
|
||||
BracketTypeInverseMask = ~BracketTypePrimaryMask
|
||||
};
|
||||
typedef SBUInt8 BracketType;
|
||||
|
||||
#endif
|
||||
+2112
File diff suppressed because it is too large
Load Diff
+16
@@ -0,0 +1,16 @@
|
||||
/*
|
||||
* Automatically generated by SheenBidiGenerator tool.
|
||||
* DO NOT EDIT!!
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_GENERAL_CATEGORY_LOOKUP_H
|
||||
#define _SB_INTERNAL_GENERAL_CATEGORY_LOOKUP_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBGeneralCategory.h>
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
SB_INTERNAL SBGeneralCategory LookupGeneralCategory(SBCodepoint codepoint);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,537 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "BracketQueue.h"
|
||||
#include "BracketType.h"
|
||||
#include "LevelRun.h"
|
||||
#include "PairingLookup.h"
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBLog.h"
|
||||
#include "IsolatingRun.h"
|
||||
|
||||
static void ResolveAvailableBracketPairs(IsolatingRunRef isolatingRun);
|
||||
|
||||
static void AttachLevelRunLinks(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
LevelRunRef baseLevelRun = isolatingRun->baseLevelRun;
|
||||
LevelRunRef current;
|
||||
LevelRunRef next;
|
||||
|
||||
isolatingRun->_originalLink = BidiChainGetNext(chain, chain->roller);
|
||||
BidiChainSetNext(chain, chain->roller, baseLevelRun->firstLink);
|
||||
|
||||
/* Iterate over level runs and attach their links to form an isolating run. */
|
||||
for (current = baseLevelRun; (next = current->next); current = next) {
|
||||
BidiChainSetNext(chain, current->lastLink, next->firstLink);
|
||||
}
|
||||
BidiChainSetNext(chain, current->lastLink, chain->roller);
|
||||
|
||||
isolatingRun->_lastLevelRun = current;
|
||||
isolatingRun->_sos = RunExtrema_SOR(baseLevelRun->extrema);
|
||||
|
||||
if (!RunKindIsPartialIsolate(baseLevelRun->kind)) {
|
||||
isolatingRun->_eos = RunExtrema_EOR(current->extrema);
|
||||
} else {
|
||||
SBLevel paragraphLevel = isolatingRun->paragraphLevel;
|
||||
SBLevel runLevel = baseLevelRun->level;
|
||||
SBLevel eosLevel = (runLevel > paragraphLevel ? runLevel : paragraphLevel);
|
||||
isolatingRun->_eos = ((eosLevel & 1) ? SBBidiTypeR : SBBidiTypeL);
|
||||
}
|
||||
}
|
||||
|
||||
static void AttachOriginalLinks(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
LevelRunRef current;
|
||||
|
||||
BidiChainSetNext(chain, chain->roller, isolatingRun->_originalLink);
|
||||
|
||||
/* Iterate over level runs and attach original subsequent links. */
|
||||
for (current = isolatingRun->baseLevelRun; current; current = current->next) {
|
||||
BidiChainSetNext(chain, current->lastLink, current->subsequentLink);
|
||||
}
|
||||
}
|
||||
|
||||
static BidiLink ResolveWeakTypes(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
BidiLink roller = chain->roller;
|
||||
BidiLink link;
|
||||
|
||||
BidiLink priorLink;
|
||||
SBBidiType sos;
|
||||
|
||||
SBBidiType w1PriorType;
|
||||
SBBidiType w2StrongType;
|
||||
SBBidiType w4PriorType;
|
||||
SBBidiType w5PriorType;
|
||||
SBBidiType w7StrongType;
|
||||
|
||||
priorLink = roller;
|
||||
sos = isolatingRun->_sos;
|
||||
|
||||
w1PriorType = sos;
|
||||
w2StrongType = sos;
|
||||
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
SBBoolean forceMerge = SBFalse;
|
||||
|
||||
/* Rule W1 */
|
||||
if (type == SBBidiTypeNSM) {
|
||||
/* Change the 'type' variable as well because it can be EN on which W2 depends. */
|
||||
type = (SBBidiTypeIsIsolate(w1PriorType) ? SBBidiTypeON : w1PriorType);
|
||||
BidiChainSetType(chain, link, type);
|
||||
|
||||
/* Fix for 3rd point of rule N0. */
|
||||
if (w1PriorType == SBBidiTypeON) {
|
||||
forceMerge = SBTrue;
|
||||
}
|
||||
}
|
||||
w1PriorType = type;
|
||||
|
||||
/* Rule W2 */
|
||||
if (type == SBBidiTypeEN) {
|
||||
if (w2StrongType == SBBidiTypeAL) {
|
||||
BidiChainSetType(chain, link, SBBidiTypeAN);
|
||||
}
|
||||
}
|
||||
/*
|
||||
* Rule W3
|
||||
* NOTE: It is safe to apply W3 in 'else-if' statement because it only depends on type AL.
|
||||
* Even if W2 changes EN to AN, there won't be any harm.
|
||||
*/
|
||||
else if (type == SBBidiTypeAL) {
|
||||
BidiChainSetType(chain, link, SBBidiTypeR);
|
||||
}
|
||||
|
||||
if (SBBidiTypeIsStrong(type)) {
|
||||
/* Save the strong type as it is checked in W2. */
|
||||
w2StrongType = type;
|
||||
}
|
||||
|
||||
if ((type != SBBidiTypeON && BidiChainGetType(chain, priorLink) == type) || forceMerge) {
|
||||
BidiChainAbandonNext(chain, priorLink);
|
||||
} else {
|
||||
priorLink = link;
|
||||
}
|
||||
}
|
||||
|
||||
priorLink = roller;
|
||||
w4PriorType = sos;
|
||||
w5PriorType = sos;
|
||||
w7StrongType = sos;
|
||||
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
SBBidiType nextType = BidiChainGetType(chain, BidiChainGetNext(chain, link));
|
||||
|
||||
/* Rule W4 */
|
||||
if (BidiChainIsSingle(chain, link)
|
||||
&& SBBidiTypeIsNumberSeparator(type)
|
||||
&& SBBidiTypeIsNumber(w4PriorType)
|
||||
&& (w4PriorType == nextType)
|
||||
&& (w4PriorType == SBBidiTypeEN || type == SBBidiTypeCS))
|
||||
{
|
||||
/* Change the current type as well because it can be EN on which W5 depends. */
|
||||
type = w4PriorType;
|
||||
BidiChainSetType(chain, link, type);
|
||||
}
|
||||
w4PriorType = type;
|
||||
|
||||
/* Rule W5 */
|
||||
if (type == SBBidiTypeET && (w5PriorType == SBBidiTypeEN || nextType == SBBidiTypeEN)) {
|
||||
/* Change the current type as well because it is EN on which W7 depends. */
|
||||
type = SBBidiTypeEN;
|
||||
BidiChainSetType(chain, link, type);
|
||||
}
|
||||
w5PriorType = type;
|
||||
|
||||
switch (type) {
|
||||
/* Rule W6 */
|
||||
case SBBidiTypeET:
|
||||
case SBBidiTypeCS:
|
||||
case SBBidiTypeES:
|
||||
BidiChainSetType(chain, link, SBBidiTypeON);
|
||||
break;
|
||||
|
||||
/*
|
||||
* Rule W7
|
||||
* NOTE: W7 is expected to be applied after W6. However this is not the case here. The
|
||||
* reason is that W6 can only create the type ON which is not tested in W7 by any
|
||||
* means. So it won't affect the algorithm.
|
||||
*/
|
||||
case SBBidiTypeEN:
|
||||
if (w7StrongType == SBBidiTypeL) {
|
||||
BidiChainSetType(chain, link, SBBidiTypeL);
|
||||
}
|
||||
break;
|
||||
|
||||
/*
|
||||
* Save the strong type for W7.
|
||||
* NOTE: The strong type is expected to be saved after applying W7 because W7 itself creates
|
||||
* a strong type. However the strong type being saved here is based on the type after
|
||||
* W5. This won't effect the algorithm because a single link contains all consecutive
|
||||
* EN types. This means that even if W7 creates a strong type, it will be saved in
|
||||
* next iteration.
|
||||
*/
|
||||
case SBBidiTypeL:
|
||||
case SBBidiTypeR:
|
||||
w7StrongType = type;
|
||||
break;
|
||||
}
|
||||
|
||||
if (type != SBBidiTypeON && BidiChainGetType(chain, priorLink) == type) {
|
||||
BidiChainAbandonNext(chain, priorLink);
|
||||
} else {
|
||||
priorLink = link;
|
||||
}
|
||||
}
|
||||
|
||||
return priorLink;
|
||||
}
|
||||
|
||||
static SBBoolean ResolveBrackets(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
const SBCodepointSequence *sequence = isolatingRun->codepointSequence;
|
||||
SBUInteger paragraphOffset = isolatingRun->paragraphOffset;
|
||||
BracketQueueRef queue = &isolatingRun->_bracketQueue;
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
BidiLink roller = chain->roller;
|
||||
BidiLink link;
|
||||
|
||||
BidiLink priorStrongLink;
|
||||
SBLevel runLevel;
|
||||
|
||||
priorStrongLink = BidiLinkNone;
|
||||
runLevel = isolatingRun->baseLevelRun->level;
|
||||
|
||||
BracketQueueReset(queue, SBLevelAsNormalBidiType(runLevel));
|
||||
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBUInteger stringIndex;
|
||||
SBCodepoint codepoint;
|
||||
SBBidiType type;
|
||||
|
||||
SBCodepoint bracketValue;
|
||||
BracketType bracketType;
|
||||
|
||||
type = BidiChainGetType(chain, link);
|
||||
|
||||
switch (type) {
|
||||
case SBBidiTypeON:
|
||||
stringIndex = BidiChainGetOffset(chain, link) + paragraphOffset;
|
||||
codepoint = SBCodepointSequenceGetCodepointAt(sequence, &stringIndex);
|
||||
bracketValue = LookupBracketPair(codepoint, &bracketType);
|
||||
|
||||
switch (bracketType) {
|
||||
case BracketTypeOpen:
|
||||
if (queue->count < BracketQueueGetMaxCapacity()) {
|
||||
if (!BracketQueueEnqueue(queue, priorStrongLink, link, bracketValue)) {
|
||||
return SBFalse;
|
||||
}
|
||||
} else {
|
||||
goto Resolve;
|
||||
}
|
||||
break;
|
||||
|
||||
case BracketTypeClose:
|
||||
if (queue->count != 0) {
|
||||
BracketQueueClosePair(queue, link, codepoint);
|
||||
|
||||
if (BracketQueueShouldDequeue(queue)) {
|
||||
ResolveAvailableBracketPairs(isolatingRun);
|
||||
}
|
||||
}
|
||||
break;
|
||||
}
|
||||
break;
|
||||
|
||||
case SBBidiTypeEN:
|
||||
case SBBidiTypeAN:
|
||||
type = SBBidiTypeR;
|
||||
|
||||
case SBBidiTypeR:
|
||||
case SBBidiTypeL:
|
||||
if (queue->count != 0) {
|
||||
BracketQueueSetStrongType(queue, type);
|
||||
}
|
||||
|
||||
priorStrongLink = link;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
Resolve:
|
||||
ResolveAvailableBracketPairs(isolatingRun);
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
static void ResolveAvailableBracketPairs(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BracketQueueRef queue = &isolatingRun->_bracketQueue;
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
|
||||
SBLevel runLevel;
|
||||
SBBidiType embeddingDirection;
|
||||
SBBidiType oppositeDirection;
|
||||
|
||||
runLevel = isolatingRun->baseLevelRun->level;
|
||||
embeddingDirection = SBLevelAsNormalBidiType(runLevel);
|
||||
oppositeDirection = SBLevelAsOppositeBidiType(runLevel);
|
||||
|
||||
while (queue->count != 0) {
|
||||
BidiLink openingLink = BracketQueueGetOpeningLink(queue);
|
||||
BidiLink closingLink = BracketQueueGetClosingLink(queue);
|
||||
|
||||
if ((openingLink != BidiLinkNone) && (closingLink != BidiLinkNone)) {
|
||||
SBBidiType innerStrongType;
|
||||
SBBidiType pairType;
|
||||
|
||||
innerStrongType = BracketQueueGetStrongType(queue);
|
||||
|
||||
/* Rule: N0.b */
|
||||
if (innerStrongType == embeddingDirection) {
|
||||
pairType = innerStrongType;
|
||||
}
|
||||
/* Rule: N0.c */
|
||||
else if (innerStrongType == oppositeDirection) {
|
||||
BidiLink priorStrongLink;
|
||||
SBBidiType priorStrongType;
|
||||
|
||||
priorStrongLink = BracketQueueGetPriorStrongLink(queue);
|
||||
|
||||
if (priorStrongLink != BidiLinkNone) {
|
||||
BidiLink link;
|
||||
|
||||
priorStrongType = BidiChainGetType(chain, priorStrongLink);
|
||||
if (SBBidiTypeIsNumber(priorStrongType)) {
|
||||
priorStrongType = SBBidiTypeR;
|
||||
}
|
||||
|
||||
link = BidiChainGetNext(chain, priorStrongLink);
|
||||
|
||||
while (link != openingLink) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
if (type == SBBidiTypeL || type == SBBidiTypeR) {
|
||||
priorStrongType = type;
|
||||
}
|
||||
|
||||
link = BidiChainGetNext(chain, link);
|
||||
}
|
||||
} else {
|
||||
priorStrongType = isolatingRun->_sos;
|
||||
}
|
||||
|
||||
/* Rule: N0.c.1 */
|
||||
if (priorStrongType == oppositeDirection) {
|
||||
pairType = oppositeDirection;
|
||||
}
|
||||
/* Rule: N0.c.2 */
|
||||
else {
|
||||
pairType = embeddingDirection;
|
||||
}
|
||||
}
|
||||
/* Rule: N0.d */
|
||||
else {
|
||||
pairType = SBBidiTypeNil;
|
||||
}
|
||||
|
||||
if (pairType != SBBidiTypeNil) {
|
||||
/* Do the substitution */
|
||||
BidiChainSetType(chain, openingLink, pairType);
|
||||
BidiChainSetType(chain, closingLink, pairType);
|
||||
}
|
||||
}
|
||||
|
||||
BracketQueueDequeue(queue);
|
||||
}
|
||||
}
|
||||
|
||||
static void ResolveNeutrals(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
BidiLink roller = chain->roller;
|
||||
BidiLink link;
|
||||
|
||||
SBLevel runLevel;
|
||||
SBBidiType strongType;
|
||||
BidiLink neutralLink;
|
||||
|
||||
runLevel = isolatingRun->baseLevelRun->level;
|
||||
strongType = isolatingRun->_sos;
|
||||
neutralLink = BidiLinkNone;
|
||||
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
SBBidiType nextType;
|
||||
|
||||
SBAssert(SBBidiTypeIsStrongOrNumber(type) || SBBidiTypeIsNeutralOrIsolate(type));
|
||||
|
||||
switch (type) {
|
||||
case SBBidiTypeL:
|
||||
strongType = SBBidiTypeL;
|
||||
break;
|
||||
|
||||
case SBBidiTypeR:
|
||||
case SBBidiTypeEN:
|
||||
case SBBidiTypeAN:
|
||||
strongType = SBBidiTypeR;
|
||||
break;
|
||||
|
||||
case SBBidiTypeB:
|
||||
case SBBidiTypeS:
|
||||
case SBBidiTypeWS:
|
||||
case SBBidiTypeON:
|
||||
case SBBidiTypeLRI:
|
||||
case SBBidiTypeRLI:
|
||||
case SBBidiTypeFSI:
|
||||
case SBBidiTypePDI:
|
||||
if (neutralLink == BidiLinkNone) {
|
||||
neutralLink = link;
|
||||
}
|
||||
|
||||
nextType = BidiChainGetType(chain, BidiChainGetNext(chain, link));
|
||||
if (SBBidiTypeIsNumber(nextType)) {
|
||||
nextType = SBBidiTypeR;
|
||||
} else if (nextType == SBBidiTypeNil) {
|
||||
nextType = isolatingRun->_eos;
|
||||
}
|
||||
|
||||
if (SBBidiTypeIsStrong(nextType)) {
|
||||
/* Rules N1, N2 */
|
||||
SBBidiType resolvedType = (strongType == nextType
|
||||
? strongType
|
||||
: SBLevelAsNormalBidiType(runLevel));
|
||||
|
||||
do {
|
||||
BidiChainSetType(chain, neutralLink, resolvedType);
|
||||
neutralLink = BidiChainGetNext(chain, neutralLink);
|
||||
} while (neutralLink != BidiChainGetNext(chain, link));
|
||||
|
||||
neutralLink = BidiLinkNone;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void ResolveImplicitLevels(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BidiChainRef chain = isolatingRun->bidiChain;
|
||||
BidiLink roller = chain->roller;
|
||||
BidiLink link;
|
||||
|
||||
SBLevel runLevel = isolatingRun->baseLevelRun->level;
|
||||
|
||||
if ((runLevel & 1) == 0) {
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
SBLevel level = BidiChainGetLevel(chain, link);
|
||||
|
||||
SBAssert(SBBidiTypeIsStrongOrNumber(type));
|
||||
|
||||
/* Rule I1 */
|
||||
if (type == SBBidiTypeR) {
|
||||
BidiChainSetLevel(chain, link, level + 1);
|
||||
} else if (type != SBBidiTypeL) {
|
||||
BidiChainSetLevel(chain, link, level + 2);
|
||||
}
|
||||
}
|
||||
} else {
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
SBLevel level = BidiChainGetLevel(chain, link);
|
||||
|
||||
SBAssert(SBBidiTypeIsStrongOrNumber(type));
|
||||
|
||||
/* Rule I2 */
|
||||
if (type != SBBidiTypeR) {
|
||||
BidiChainSetLevel(chain, link, level + 1);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void IsolatingRunInitialize(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BracketQueueInitialize(&isolatingRun->_bracketQueue);
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean IsolatingRunResolve(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BidiLink lastLink;
|
||||
BidiLink subsequentLink;
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Identified Isolating Run");
|
||||
|
||||
/* Attach level run links to form isolating run. */
|
||||
AttachLevelRunLinks(isolatingRun);
|
||||
/* Save last subsequent link. */
|
||||
subsequentLink = isolatingRun->_lastLevelRun->subsequentLink;
|
||||
|
||||
SB_LOG_STATEMENT("Range", 1, SB_LOG_RUN_RANGE(isolatingRun));
|
||||
SB_LOG_STATEMENT("Types", 1, SB_LOG_RUN_TYPES(isolatingRun));
|
||||
SB_LOG_STATEMENT("Level", 1, SB_LOG_LEVEL(isolatingRun->baseLevelRun->level));
|
||||
SB_LOG_STATEMENT("SOS", 1, SB_LOG_BIDI_TYPE(isolatingRun->_sos));
|
||||
SB_LOG_STATEMENT("EOS", 1, SB_LOG_BIDI_TYPE(isolatingRun->_eos));
|
||||
|
||||
/* Rules W1-W7 */
|
||||
lastLink = ResolveWeakTypes(isolatingRun);
|
||||
SB_LOG_BLOCK_OPENER("Resolved Weak Types");
|
||||
SB_LOG_STATEMENT("Types", 1, SB_LOG_RUN_TYPES(isolatingRun));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
/* Rule N0 */
|
||||
if (!ResolveBrackets(isolatingRun)) {
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Resolved Brackets");
|
||||
SB_LOG_STATEMENT("Types", 1, SB_LOG_RUN_TYPES(isolatingRun));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
/* Rules N1, N2 */
|
||||
ResolveNeutrals(isolatingRun);
|
||||
SB_LOG_BLOCK_OPENER("Resolved Neutrals");
|
||||
SB_LOG_STATEMENT("Types", 1, SB_LOG_RUN_TYPES(isolatingRun));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
/* Rules I1, I2 */
|
||||
ResolveImplicitLevels(isolatingRun);
|
||||
SB_LOG_BLOCK_OPENER("Resolved Implicit Levels");
|
||||
SB_LOG_STATEMENT("Levels", 1, SB_LOG_RUN_LEVELS(isolatingRun));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
/* Re-attach original links. */
|
||||
AttachOriginalLinks(isolatingRun);
|
||||
/* Attach new final link (of isolating run) with last subsequent link. */
|
||||
BidiChainSetNext(isolatingRun->bidiChain, lastLink, subsequentLink);
|
||||
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
SB_INTERNAL void IsolatingRunFinalize(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
BracketQueueFinalize(&isolatingRun->_bracketQueue);
|
||||
}
|
||||
@@ -0,0 +1,47 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_ISOLATING_RUN_H
|
||||
#define _SB_INTERNAL_ISOLATING_RUN_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "BracketQueue.h"
|
||||
#include "LevelRun.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
|
||||
typedef struct _IsolatingRun {
|
||||
const SBCodepointSequence *codepointSequence;
|
||||
const SBBidiType *bidiTypes;
|
||||
BidiChainRef bidiChain;
|
||||
LevelRunRef baseLevelRun;
|
||||
LevelRunRef _lastLevelRun;
|
||||
BracketQueue _bracketQueue;
|
||||
SBUInteger paragraphOffset;
|
||||
BidiLink _originalLink;
|
||||
SBBidiType _sos;
|
||||
SBBidiType _eos;
|
||||
SBLevel paragraphLevel;
|
||||
} IsolatingRun, *IsolatingRunRef;
|
||||
|
||||
SB_INTERNAL void IsolatingRunInitialize(IsolatingRunRef isolatingRun);
|
||||
SB_INTERNAL SBBoolean IsolatingRunResolve(IsolatingRunRef isolatingRun);
|
||||
|
||||
SB_INTERNAL void IsolatingRunFinalize(IsolatingRunRef isolatingRun);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,68 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <stddef.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "RunExtrema.h"
|
||||
#include "RunKind.h"
|
||||
#include "SBAssert.h"
|
||||
#include "LevelRun.h"
|
||||
|
||||
SB_INTERNAL void LevelRunInitialize(LevelRunRef levelRun,
|
||||
BidiChainRef bidiChain, BidiLink firstLink, BidiLink lastLink,
|
||||
SBBidiType sor, SBBidiType eor)
|
||||
{
|
||||
SBBidiType firstType = BidiChainGetType(bidiChain, firstLink);
|
||||
SBBidiType lastType = BidiChainGetType(bidiChain, lastLink);
|
||||
|
||||
levelRun->next = NULL;
|
||||
levelRun->firstLink = firstLink;
|
||||
levelRun->lastLink = lastLink;
|
||||
levelRun->subsequentLink = BidiChainGetNext(bidiChain, lastLink);
|
||||
levelRun->extrema = RunExtremaMake(sor, eor);
|
||||
levelRun->kind = RunKindMake
|
||||
(
|
||||
SBBidiTypeIsIsolateInitiator(lastType),
|
||||
SBBidiTypeIsIsolateTerminator(firstType)
|
||||
);
|
||||
levelRun->level = BidiChainGetLevel(bidiChain, firstLink);
|
||||
}
|
||||
|
||||
SB_INTERNAL void LevelRunAttach(LevelRunRef levelRun, LevelRunRef next)
|
||||
{
|
||||
/* Only the runs of same level can be attached. */
|
||||
SBAssert(levelRun->level == next->level);
|
||||
/* No other run can be attached with a simple run. */
|
||||
SBAssert(!RunKindIsSimple(levelRun->kind));
|
||||
/* No other run can be attached with a complete isolating run. */
|
||||
SBAssert(!RunKindIsCompleteIsolate(levelRun->kind));
|
||||
/* Only a terminating run can be attached with an isolating run. */
|
||||
SBAssert(RunKindIsIsolate(levelRun->kind) && RunKindIsTerminating(next->kind));
|
||||
/* The next run must be unattached. */
|
||||
SBAssert(!RunKindIsAttachedTerminating(next->kind));
|
||||
|
||||
if (RunKindIsTerminating(next->kind)) {
|
||||
RunKindMakeAttached(next->kind);
|
||||
}
|
||||
|
||||
if (RunKindIsIsolate(levelRun->kind)) {
|
||||
RunKindMakeComplete(levelRun->kind);
|
||||
}
|
||||
|
||||
levelRun->next = next;
|
||||
}
|
||||
@@ -0,0 +1,42 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_LEVEL_RUN_H
|
||||
#define _SB_INTERNAL_LEVEL_RUN_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "RunExtrema.h"
|
||||
#include "RunKind.h"
|
||||
#include "SBBase.h"
|
||||
|
||||
typedef struct _LevelRun {
|
||||
struct _LevelRun *next; /**< Reference to the next sequence of run links. */
|
||||
BidiLink firstLink; /**< First link of the run. */
|
||||
BidiLink lastLink; /**< Last link of the run. */
|
||||
BidiLink subsequentLink; /**< Subsequent link of the run. */
|
||||
RunExtrema extrema;
|
||||
RunKind kind;
|
||||
SBLevel level;
|
||||
} LevelRun, *LevelRunRef;
|
||||
|
||||
SB_INTERNAL void LevelRunInitialize(LevelRunRef levelRun,
|
||||
BidiChainRef bidiChain, BidiLink firstLink, BidiLink lastLink,
|
||||
SBBidiType sor, SBBidiType eor);
|
||||
SB_INTERNAL void LevelRunAttach(LevelRunRef levelRun, LevelRunRef next);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,267 @@
|
||||
/*
|
||||
* Automatically generated by SheenBidiGenerator tool.
|
||||
* DO NOT EDIT!!
|
||||
*
|
||||
* REQUIRED MEMORY: (37)+2310+(617*2) = 3618 Bytes
|
||||
*/
|
||||
|
||||
#include "PairingLookup.h"
|
||||
|
||||
static const SBInt16 PairDifferences[37] = {
|
||||
0, 1, -1, 2, -2, 16, -16, 3, -3, 2016, 2527, 1923, 1914, 1918,
|
||||
2250, 138, 7, -7, 1824, 2104, 2108, 2106, 1316, -138, 8, -8, -1316,
|
||||
-1914, -1918, -1923, -1824, -2016, -2104, -2106, -2108, -2250, -2527
|
||||
};
|
||||
|
||||
static const SBUInt8 PairData[2310] = {
|
||||
/* DATA_BLOCK: -- 0x0000..0x0069 -- */
|
||||
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, 65, 130, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 3, 0, 4, 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, 67, 0, 132, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x006A..0x00D3 -- */
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 67, 0,
|
||||
132, 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, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x00D4..0x013D -- */
|
||||
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, 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,
|
||||
/* DATA_BLOCK: -- 0x013E..0x01A7 -- */
|
||||
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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 65, 130, 65, 130, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x01A8..0x0211 -- */
|
||||
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, 65, 130, 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,
|
||||
/* DATA_BLOCK: -- 0x0212..0x027B -- */
|
||||
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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 65, 130, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x027C..0x02E5 -- */
|
||||
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, 65, 130, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 65, 130, 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,
|
||||
/* DATA_BLOCK: -- 0x02E6..0x034F -- */
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 7, 7, 7, 8, 8, 8, 0, 0, 0, 0, 0, 0, 0, 9, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 10, 11, 12, 13, 0, 14, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0,
|
||||
0, 0, 0, 15, 0, 16, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 0, 0, 1,
|
||||
2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x0350..0x03B9 -- */
|
||||
0, 0, 0, 0, 0, 0, 1, 2, 1, 2, 1, 2, 1, 2, 0, 0, 1, 2, 1,
|
||||
2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2,
|
||||
1, 2, 1, 2, 1, 2, 1, 2, 0, 0, 0, 1, 2, 1, 2, 0, 0, 0, 0,
|
||||
0, 18, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 19, 0, 20, 21,
|
||||
0, 21, 0, 0, 0, 0, 1, 2, 1, 2, 1, 2, 1, 2, 22, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x03BA..0x0423 -- */
|
||||
0, 1, 2, 1, 2, 23, 0, 0, 1, 2, 0, 0, 0, 0, 1, 2, 1, 2, 1,
|
||||
2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2,
|
||||
0, 0, 1, 2, 24, 24, 24, 0, 16, 16, 0, 0, 25, 25, 25, 17, 17, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 65, 130, 65, 130, 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, 65, 130, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x0424..0x048D -- */
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 65,
|
||||
130, 65, 130, 65, 130, 65, 130, 65, 130, 65, 130, 65, 130, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x048E..0x04F7 -- */
|
||||
0, 0, 0, 1, 2, 65, 130, 0, 1, 2, 0, 3, 0, 4, 0, 0, 0, 0, 0,
|
||||
0, 0, 1, 2, 0, 0, 0, 0, 0, 26, 1, 2, 0, 0, 0, 1, 2, 1, 2,
|
||||
65, 130, 65, 130, 65, 130, 65, 130, 65, 130, 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,
|
||||
/* DATA_BLOCK: -- 0x04F8..0x0561 -- */
|
||||
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, 65, 130, 65, 130, 65, 130, 65, 130, 65, 130, 71,
|
||||
129, 66, 136, 65, 130, 65, 130, 65, 130, 65, 130, 0, 0, 27, 0, 0, 0, 0, 28,
|
||||
0, 0, 29, 1, 2, 0, 0, 1, 2, 1, 2, 1, 2, 1, 2, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 30, 0, 0, 0, 0, 0, 0, 0, 1, 2, 0, 0, 1, 2, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1,
|
||||
/* DATA_BLOCK: -- 0x0562..0x05CB -- */
|
||||
2, 0, 1, 2, 0, 0, 65, 130, 65, 130, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 0, 0,
|
||||
1, 2, 0, 0, 65, 130, 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, 2, 1, 2, 0, 0,
|
||||
0, 0, 0, 1, 2, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x05CC..0x0635 -- */
|
||||
1, 2, 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, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1,
|
||||
2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2,
|
||||
1, 2, 1, 2, 1, 2, 1, 2, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x0636..0x069F -- */
|
||||
1, 2, 1, 2, 1, 2, 1, 2, 0, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2,
|
||||
1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1,
|
||||
2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 32,
|
||||
0, 0, 0, 0, 33, 34, 33, 0, 0, 0, 0, 0, 0, 1, 2, 35, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 1, 2, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x06A0..0x0709 -- */
|
||||
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, 36, 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, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x070A..0x0773 -- */
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 1, 2, 0, 0, 0,
|
||||
1, 2, 0, 1, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
1, 2, 0, 0, 1, 2, 65, 130, 65, 130, 65, 130, 65, 130, 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,
|
||||
65, 130, 65, 130, 65, 130, 65, 130, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x0774..0x07DD -- */
|
||||
65, 130, 65, 130, 65, 130, 65, 130, 65, 130, 0, 0, 65, 130, 65, 130, 65, 130, 65,
|
||||
130, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x07DE..0x0847 -- */
|
||||
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, 65, 130, 65, 130, 65, 130, 0, 0, 0,
|
||||
0, 0, 1, 2, 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,
|
||||
/* DATA_BLOCK: -- 0x0848..0x08B1 -- */
|
||||
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, 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, 65, 130, 0, 0, 0, 0, 0, 0,
|
||||
/* DATA_BLOCK: -- 0x08B2..0x0905 -- */
|
||||
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 4, 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, 67, 0, 132, 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, 67,
|
||||
0, 132, 0, 65, 130, 0, 65, 130,
|
||||
};
|
||||
|
||||
static const SBUInt16 PairIndexes[617] = {
|
||||
0x0000, 0x006A, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x013E, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x01A8, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x0212, 0x027C, 0x00D4, 0x00D4, 0x00D4, 0x02E6, 0x0350,
|
||||
0x03BA, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x0424,
|
||||
0x048E, 0x00D4, 0x00D4, 0x00D4, 0x04F8, 0x0562, 0x05CC, 0x0636, 0x00D4, 0x00D4, 0x06A0, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x070A, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x0774, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4, 0x00D4,
|
||||
0x00D4, 0x00D4, 0x07DE, 0x0848, 0x08B2
|
||||
};
|
||||
|
||||
SB_INTERNAL SBCodepoint LookupMirror(SBCodepoint codepoint)
|
||||
{
|
||||
if (codepoint <= 0xFF63) {
|
||||
SBInt16 diff = PairDifferences[
|
||||
PairData[
|
||||
PairIndexes[
|
||||
codepoint / 0x06A
|
||||
] + (codepoint % 0x06A)
|
||||
] & BracketTypeInverseMask
|
||||
];
|
||||
|
||||
if (diff != 0) {
|
||||
return (codepoint + diff);
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBCodepoint LookupBracketPair(SBCodepoint codepoint, BracketType *type)
|
||||
{
|
||||
if (codepoint <= 0xFF63) {
|
||||
SBUInt8 data = PairData[
|
||||
PairIndexes[
|
||||
codepoint / 0x06A
|
||||
] + (codepoint % 0x06A)
|
||||
];
|
||||
*type = (data & BracketTypePrimaryMask);
|
||||
|
||||
if (*type != 0) {
|
||||
SBInt16 diff = PairDifferences[
|
||||
data & BracketTypeInverseMask
|
||||
];
|
||||
return (codepoint + diff);
|
||||
}
|
||||
} else {
|
||||
*type = BracketTypeNone;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
@@ -0,0 +1,17 @@
|
||||
/*
|
||||
* Automatically generated by SheenBidiGenerator tool.
|
||||
* DO NOT EDIT!!
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_PAIRING_LOOKUP_H
|
||||
#define _SB_INTERNAL_PAIRING_LOOKUP_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "BracketType.h"
|
||||
#include "SBBase.h"
|
||||
|
||||
SB_INTERNAL SBCodepoint LookupMirror(SBCodepoint codepoint);
|
||||
SB_INTERNAL SBCodepoint LookupBracketPair(SBCodepoint codepoint, BracketType *bracketType);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,50 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_RUN_EXTREMA_H
|
||||
#define _SB_INTERNAL_RUN_EXTREMA_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
enum {
|
||||
RunExtremaLeadingL = SBBidiTypeL << 0,
|
||||
RunExtremaLeadingR = SBBidiTypeR << 0,
|
||||
|
||||
RunExtremaTrailingL = SBBidiTypeL << 4,
|
||||
RunExtremaTrailingR = SBBidiTypeR << 4
|
||||
};
|
||||
typedef SBUInt8 RunExtrema;
|
||||
|
||||
#define RunExtremaMake(sor, eor) \
|
||||
(RunExtrema) \
|
||||
( \
|
||||
((sor) << 0) \
|
||||
| ((eor) << 4) \
|
||||
)
|
||||
|
||||
#define RunExtrema_SOR(e) \
|
||||
(RunExtrema) \
|
||||
( \
|
||||
(e) & 0xF \
|
||||
)
|
||||
|
||||
#define RunExtrema_EOR(e) \
|
||||
(RunExtrema) \
|
||||
( \
|
||||
(e) >> 4 \
|
||||
)
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,81 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_RUN_KIND_H
|
||||
#define _SB_INTERNAL_RUN_KIND_H
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
enum {
|
||||
RunKindSimple = 0x00,
|
||||
|
||||
RunKindIsolate = 0x01,
|
||||
RunKindPartial = 0x02,
|
||||
RunKindPartialIsolate = RunKindIsolate | RunKindPartial,
|
||||
|
||||
RunKindTerminating = 0x04,
|
||||
RunKindAttached = 0x08
|
||||
};
|
||||
typedef SBUInt8 RunKind;
|
||||
|
||||
#define RunKindMake(i, t) \
|
||||
( \
|
||||
((i) ? RunKindPartialIsolate : 0) \
|
||||
| ((t) ? RunKindTerminating : 0) \
|
||||
)
|
||||
|
||||
#define RunKindMakeComplete(k) \
|
||||
( \
|
||||
(k) &= ~RunKindPartial \
|
||||
)
|
||||
|
||||
#define RunKindMakeAttached(k) \
|
||||
( \
|
||||
(k) |= RunKindAttached \
|
||||
)
|
||||
|
||||
#define RunKindIsSimple(k) \
|
||||
( \
|
||||
(k) == RunKindSimple \
|
||||
)
|
||||
|
||||
#define RunKindIsIsolate(k) \
|
||||
( \
|
||||
(k) & RunKindIsolate \
|
||||
)
|
||||
|
||||
#define RunKindIsTerminating(k) \
|
||||
( \
|
||||
(k) & RunKindTerminating \
|
||||
)
|
||||
|
||||
#define RunKindIsPartialIsolate(k) \
|
||||
( \
|
||||
(k) & RunKindPartial \
|
||||
)
|
||||
|
||||
#define RunKindIsCompleteIsolate(k) \
|
||||
( \
|
||||
((k) & RunKindPartialIsolate) \
|
||||
== RunKindIsolate \
|
||||
)
|
||||
|
||||
#define RunKindIsAttachedTerminating(k) \
|
||||
( \
|
||||
(k) & RunKindAttached \
|
||||
)
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,161 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "LevelRun.h"
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "RunQueue.h"
|
||||
|
||||
static SBBoolean RunQueueInsertElement(RunQueueRef queue)
|
||||
{
|
||||
if (queue->_rearTop != RunQueueList_MaxIndex) {
|
||||
queue->_rearTop += 1;
|
||||
} else {
|
||||
RunQueueListRef previousList = queue->_rearList;
|
||||
RunQueueListRef rearList = previousList->next;
|
||||
|
||||
if (!rearList) {
|
||||
rearList = malloc(sizeof(RunQueueList));
|
||||
if (!rearList) {
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
rearList->previous = previousList;
|
||||
rearList->next = NULL;
|
||||
|
||||
previousList->next = rearList;
|
||||
}
|
||||
|
||||
queue->_rearList = rearList;
|
||||
queue->_rearTop = 0;
|
||||
}
|
||||
queue->count += 1;
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
static void FindPreviousPartialRun(RunQueueRef queue)
|
||||
{
|
||||
RunQueueListRef list = queue->_partialList;
|
||||
SBInteger top = queue->_partialTop;
|
||||
|
||||
do {
|
||||
SBInteger limit = (list == queue->_frontList ? queue->_frontTop : 0);
|
||||
|
||||
do {
|
||||
LevelRunRef levelRun = &list->elements[top];
|
||||
if (RunKindIsPartialIsolate(levelRun->kind)) {
|
||||
queue->_partialList = list;
|
||||
queue->_partialTop = top;
|
||||
return;
|
||||
}
|
||||
} while (top-- > limit);
|
||||
|
||||
list = list->previous;
|
||||
top = RunQueueList_MaxIndex;
|
||||
} while (list);
|
||||
|
||||
queue->_partialList = NULL;
|
||||
queue->_partialTop = -1;
|
||||
queue->shouldDequeue = SBFalse;
|
||||
}
|
||||
|
||||
SB_INTERNAL void RunQueueInitialize(RunQueueRef queue)
|
||||
{
|
||||
/* Initialize first list. */
|
||||
queue->_firstList.previous = NULL;
|
||||
queue->_firstList.next = NULL;
|
||||
|
||||
/* Initialize front and rear lists with first list. */
|
||||
queue->_frontList = &queue->_firstList;
|
||||
queue->_rearList = &queue->_firstList;
|
||||
queue->_partialList = NULL;
|
||||
|
||||
/* Initialize list indexes. */
|
||||
queue->_frontTop = 0;
|
||||
queue->_rearTop = -1;
|
||||
queue->_partialTop = -1;
|
||||
|
||||
/* Initialize rest of the elements. */
|
||||
queue->count = 0;
|
||||
queue->peek = &queue->_frontList->elements[queue->_frontTop];
|
||||
queue->shouldDequeue = SBFalse;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean RunQueueEnqueue(RunQueueRef queue, const LevelRunRef levelRun)
|
||||
{
|
||||
if (RunQueueInsertElement(queue)) {
|
||||
LevelRunRef element = &queue->_rearList->elements[queue->_rearTop];
|
||||
|
||||
/* Copy the level run into the current element. */
|
||||
*element = *levelRun;
|
||||
|
||||
/* Complete the latest isolating run with this terminating run. */
|
||||
if (queue->_partialTop != -1 && RunKindIsTerminating(element->kind)) {
|
||||
LevelRunRef incompleteRun = &queue->_partialList->elements[queue->_partialTop];
|
||||
LevelRunAttach(incompleteRun, element);
|
||||
FindPreviousPartialRun(queue);
|
||||
}
|
||||
|
||||
/* Save the location of the isolating run. */
|
||||
if (RunKindIsIsolate(element->kind)) {
|
||||
queue->_partialList = queue->_rearList;
|
||||
queue->_partialTop = queue->_rearTop;
|
||||
}
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
SB_INTERNAL void RunQueueDequeue(RunQueueRef queue)
|
||||
{
|
||||
/* The queue should not be empty. */
|
||||
SBAssert(queue->count != 0);
|
||||
|
||||
if (queue->_frontTop != RunQueueList_MaxIndex) {
|
||||
queue->_frontTop += 1;
|
||||
} else {
|
||||
RunQueueListRef frontList = queue->_frontList;
|
||||
|
||||
if (frontList == queue->_rearList) {
|
||||
queue->_rearTop = -1;
|
||||
} else {
|
||||
queue->_frontList = frontList->next;
|
||||
}
|
||||
|
||||
queue->_frontTop = 0;
|
||||
}
|
||||
|
||||
queue->count -= 1;
|
||||
queue->peek = &queue->_frontList->elements[queue->_frontTop];
|
||||
}
|
||||
|
||||
SB_INTERNAL void RunQueueFinalize(RunQueueRef queue)
|
||||
{
|
||||
RunQueueListRef list = queue->_firstList.next;
|
||||
|
||||
while (list) {
|
||||
RunQueueListRef next = list->next;
|
||||
free(list);
|
||||
list = next;
|
||||
};
|
||||
}
|
||||
@@ -0,0 +1,55 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_RUN_QUEUE_H
|
||||
#define _SB_INTERNAL_RUN_QUEUE_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "LevelRun.h"
|
||||
#include "SBBase.h"
|
||||
|
||||
#define RunQueueList_Length 8
|
||||
#define RunQueueList_MaxIndex (RunQueueList_Length - 1)
|
||||
|
||||
typedef struct _RunQueueList {
|
||||
LevelRun elements[RunQueueList_Length];
|
||||
|
||||
struct _RunQueueList *previous; /**< Reference to the previous list of queue elements */
|
||||
struct _RunQueueList *next; /**< Reference to the next list of queue elements */
|
||||
} RunQueueList, *RunQueueListRef;
|
||||
|
||||
typedef struct _RunQueue {
|
||||
RunQueueList _firstList; /**< First list of elements, which is part of the queue */
|
||||
RunQueueListRef _frontList; /**< The list containing front element of the queue */
|
||||
RunQueueListRef _rearList; /**< The list containing rear element of the queue */
|
||||
RunQueueListRef _partialList; /**< The list containing latest partial isolating run */
|
||||
SBInteger _frontTop; /**< Index of front element in front list */
|
||||
SBInteger _rearTop; /**< Index of rear element in rear list */
|
||||
SBInteger _partialTop; /**< Index of partial run in partial list */
|
||||
LevelRunRef peek; /**< Peek element of the queue */
|
||||
SBUInteger count; /**< Number of elements the queue contains */
|
||||
SBBoolean shouldDequeue;
|
||||
} RunQueue, *RunQueueRef;
|
||||
|
||||
SB_INTERNAL void RunQueueInitialize(RunQueueRef queue);
|
||||
|
||||
SB_INTERNAL SBBoolean RunQueueEnqueue(RunQueueRef queue, const LevelRunRef levelRun);
|
||||
SB_INTERNAL void RunQueueDequeue(RunQueueRef queue);
|
||||
|
||||
SB_INTERNAL void RunQueueFinalize(RunQueueRef queue);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,203 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "BidiTypeLookup.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBLog.h"
|
||||
#include "SBParagraph.h"
|
||||
#include "SBAlgorithm.h"
|
||||
|
||||
static SBAlgorithmRef AllocateAlgorithm(SBUInteger stringLength)
|
||||
{
|
||||
const SBUInteger sizeAlgorithm = sizeof(SBAlgorithm);
|
||||
const SBUInteger sizeTypes = sizeof(SBBidiType) * stringLength;
|
||||
const SBUInteger sizeMemory = sizeAlgorithm + sizeTypes;
|
||||
|
||||
void *pointer = malloc(sizeMemory);
|
||||
|
||||
if (pointer) {
|
||||
const SBUInteger offsetAlgorithm = 0;
|
||||
const SBUInteger offsetTypes = offsetAlgorithm + sizeAlgorithm;
|
||||
|
||||
SBUInt8 *memory = (SBUInt8 *)pointer;
|
||||
SBAlgorithmRef algorithm = (SBAlgorithmRef)(memory + offsetAlgorithm);
|
||||
SBLevel *fixedTypes = (SBLevel *)(memory + offsetTypes);
|
||||
|
||||
algorithm->fixedTypes = fixedTypes;
|
||||
|
||||
return algorithm;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static void DisposeAlgorithm(SBAlgorithmRef algorithm)
|
||||
{
|
||||
free(algorithm);
|
||||
}
|
||||
|
||||
static void DetermineBidiTypes(const SBCodepointSequence *sequence, SBBidiType *types)
|
||||
{
|
||||
SBUInteger stringIndex = 0;
|
||||
SBUInteger firstIndex = 0;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
while ((codepoint = SBCodepointSequenceGetCodepointAt(sequence, &stringIndex)) != SBCodepointInvalid) {
|
||||
types[firstIndex] = LookupBidiType(codepoint);
|
||||
|
||||
/* Subsequent code units get 'BN' type. */
|
||||
while (++firstIndex < stringIndex) {
|
||||
types[firstIndex] = SBBidiTypeBN;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static SBAlgorithmRef CreateAlgorithm(const SBCodepointSequence *codepointSequence)
|
||||
{
|
||||
SBUInteger stringLength = codepointSequence->stringLength;
|
||||
SBAlgorithmRef algorithm;
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Algorithm Input");
|
||||
SB_LOG_STATEMENT("Codepoints", 1, SB_LOG_CODEPOINT_SEQUENCE(codepointSequence));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
algorithm = AllocateAlgorithm(stringLength);
|
||||
|
||||
if (algorithm) {
|
||||
algorithm->codepointSequence = *codepointSequence;
|
||||
algorithm->retainCount = 1;
|
||||
|
||||
DetermineBidiTypes(codepointSequence, algorithm->fixedTypes);
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Determined Types");
|
||||
SB_LOG_STATEMENT("Types", 1, SB_LOG_BIDI_TYPES_ARRAY(algorithm->fixedTypes, stringLength));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
SB_LOG_BREAKER();
|
||||
}
|
||||
|
||||
return algorithm;
|
||||
}
|
||||
|
||||
SBAlgorithmRef SBAlgorithmCreate(const SBCodepointSequence *codepointSequence)
|
||||
{
|
||||
if (SBCodepointSequenceIsValid(codepointSequence)) {
|
||||
return CreateAlgorithm(codepointSequence);
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
const SBBidiType *SBAlgorithmGetBidiTypesPtr(SBAlgorithmRef algorithm)
|
||||
{
|
||||
return algorithm->fixedTypes;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBUInteger SBAlgorithmGetSeparatorLength(SBAlgorithmRef algorithm, SBUInteger separatorIndex)
|
||||
{
|
||||
const SBCodepointSequence *codepointSequence = &algorithm->codepointSequence;
|
||||
SBUInteger stringIndex = separatorIndex;
|
||||
SBCodepoint codepoint;
|
||||
SBUInteger separatorLength;
|
||||
|
||||
codepoint = SBCodepointSequenceGetCodepointAt(codepointSequence, &stringIndex);
|
||||
separatorLength = stringIndex - separatorIndex;
|
||||
|
||||
if (codepoint == '\r') {
|
||||
/* Don't break in between 'CR' and 'LF'. */
|
||||
if (stringIndex < codepointSequence->stringLength) {
|
||||
codepoint = SBCodepointSequenceGetCodepointAt(codepointSequence, &stringIndex);
|
||||
|
||||
if (codepoint == '\n') {
|
||||
separatorLength = stringIndex - separatorIndex;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return separatorLength;
|
||||
}
|
||||
|
||||
void SBAlgorithmGetParagraphBoundary(SBAlgorithmRef algorithm,
|
||||
SBUInteger paragraphOffset, SBUInteger suggestedLength,
|
||||
SBUInteger *acutalLength, SBUInteger *separatorLength)
|
||||
{
|
||||
const SBCodepointSequence *codepointSequence = &algorithm->codepointSequence;
|
||||
SBBidiType *bidiTypes = algorithm->fixedTypes;
|
||||
SBUInteger limitIndex;
|
||||
SBUInteger startIndex;
|
||||
|
||||
if (separatorLength) {
|
||||
*separatorLength = 0;
|
||||
}
|
||||
|
||||
SBUIntegerNormalizeRange(codepointSequence->stringLength, ¶graphOffset, &suggestedLength);
|
||||
limitIndex = paragraphOffset + suggestedLength;
|
||||
|
||||
for (startIndex = paragraphOffset; startIndex < limitIndex; startIndex++) {
|
||||
SBBidiType currentType = bidiTypes[startIndex];
|
||||
|
||||
if (currentType == SBBidiTypeB) {
|
||||
SBUInteger codeUnitCount = SBAlgorithmGetSeparatorLength(algorithm, startIndex);
|
||||
|
||||
startIndex += codeUnitCount;
|
||||
|
||||
if (separatorLength) {
|
||||
*separatorLength = codeUnitCount;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (acutalLength) {
|
||||
*acutalLength = startIndex - paragraphOffset;
|
||||
}
|
||||
}
|
||||
|
||||
SBParagraphRef SBAlgorithmCreateParagraph(SBAlgorithmRef algorithm,
|
||||
SBUInteger paragraphOffset, SBUInteger suggestedLength, SBLevel baseLevel)
|
||||
{
|
||||
const SBCodepointSequence *codepointSequence = &algorithm->codepointSequence;
|
||||
SBUInteger stringLength = codepointSequence->stringLength;
|
||||
|
||||
SBUIntegerNormalizeRange(stringLength, ¶graphOffset, &suggestedLength);
|
||||
|
||||
if (suggestedLength > 0) {
|
||||
return SBParagraphCreate(algorithm, paragraphOffset, suggestedLength, baseLevel);
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
SBAlgorithmRef SBAlgorithmRetain(SBAlgorithmRef algorithm)
|
||||
{
|
||||
if (algorithm) {
|
||||
algorithm->retainCount += 1;
|
||||
}
|
||||
|
||||
return algorithm;
|
||||
}
|
||||
|
||||
void SBAlgorithmRelease(SBAlgorithmRef algorithm)
|
||||
{
|
||||
if (algorithm && --algorithm->retainCount == 0) {
|
||||
DisposeAlgorithm(algorithm);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,34 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_ALGORITHM_H
|
||||
#define _SB_INTERNAL_ALGORITHM_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBAlgorithm.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBidiType.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBCodepointSequence.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
typedef struct _SBAlgorithm {
|
||||
SBCodepointSequence codepointSequence;
|
||||
SBBidiType *fixedTypes;
|
||||
SBUInteger retainCount;
|
||||
} SBAlgorithm;
|
||||
|
||||
SB_INTERNAL SBUInteger SBAlgorithmGetSeparatorLength(SBAlgorithmRef algorithm, SBUInteger separatorIndex);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,24 @@
|
||||
/*
|
||||
* Copyright (C) 2014 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_ASSERT_H
|
||||
#define _SB_INTERNAL_ASSERT_H
|
||||
|
||||
#include <assert.h>
|
||||
|
||||
#define SBAssert(exp) assert(exp)
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,420 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "BidiTypeLookup.h"
|
||||
#include "GeneralCategoryLookup.h"
|
||||
#include "PairingLookup.h"
|
||||
#include "ScriptLookup.h"
|
||||
#include "SBBase.h"
|
||||
|
||||
#define TAG(a, b, c, d) \
|
||||
(SBUInt32) \
|
||||
( \
|
||||
((SBUInt8)(a) << 24) \
|
||||
| ((SBUInt8)(b) << 16) \
|
||||
| ((SBUInt8)(c) << 8) \
|
||||
| ((SBUInt8)(d) << 0) \
|
||||
)
|
||||
|
||||
SB_INTERNAL void SBUIntegerNormalizeRange(SBUInteger actualLength,
|
||||
SBUInteger *rangeOffset, SBUInteger *rangeLength)
|
||||
{
|
||||
/**
|
||||
* Assume:
|
||||
* Actual Length = 10
|
||||
*
|
||||
* Case 1:
|
||||
* Offset = 0, Length = 10
|
||||
* Result:
|
||||
* Offset = 0, Length = 10
|
||||
*
|
||||
* Case 2:
|
||||
* Offset = 0, Length = 11
|
||||
* Result:
|
||||
* Offset = 0, Length = 10
|
||||
*
|
||||
* Case 3:
|
||||
* Offset = 1, Length = -1 (MAX)
|
||||
* Result:
|
||||
* Offset = 1, Length = 9
|
||||
*
|
||||
* Case 4:
|
||||
* Offset = 10, Length = 0
|
||||
* Result:
|
||||
* Offset = Invalid, Length = 0
|
||||
*
|
||||
* Case 5:
|
||||
* Offset = -1 (MAX), Length = 1
|
||||
* Result:
|
||||
* Offset = Invalid, Length = 0
|
||||
*/
|
||||
|
||||
if (*rangeOffset < actualLength) {
|
||||
SBUInteger possibleLimit = *rangeOffset + *rangeLength;
|
||||
|
||||
if (*rangeOffset <= possibleLimit && possibleLimit <= actualLength) {
|
||||
/* The range is valid. Nothing to do here. */
|
||||
} else {
|
||||
*rangeLength = actualLength - *rangeOffset;
|
||||
}
|
||||
} else {
|
||||
*rangeOffset = SBInvalidIndex;
|
||||
*rangeLength = 0;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean SBUIntegerVerifyRange(SBUInteger actualLength,
|
||||
SBUInteger rangeOffset, SBUInteger rangeLength)
|
||||
{
|
||||
SBUInteger possibleLimit = rangeOffset + rangeLength;
|
||||
|
||||
return rangeOffset < actualLength
|
||||
&& rangeOffset <= possibleLimit
|
||||
&& possibleLimit <= actualLength;
|
||||
}
|
||||
|
||||
SBBidiType SBCodepointGetBidiType(SBCodepoint codepoint)
|
||||
{
|
||||
return LookupBidiType(codepoint);
|
||||
}
|
||||
|
||||
SBGeneralCategory SBCodepointGetGeneralCategory(SBCodepoint codepoint)
|
||||
{
|
||||
return LookupGeneralCategory(codepoint);
|
||||
}
|
||||
|
||||
SBCodepoint SBCodepointGetMirror(SBCodepoint codepoint)
|
||||
{
|
||||
return LookupMirror(codepoint);
|
||||
}
|
||||
|
||||
SBScript SBCodepointGetScript(SBCodepoint codepoint)
|
||||
{
|
||||
return LookupScript(codepoint);
|
||||
}
|
||||
|
||||
SBUInt32 SBScriptGetOpenTypeTag(SBScript script)
|
||||
{
|
||||
/* Reference: https://docs.microsoft.com/en-us/typography/opentype/spec/scripttags */
|
||||
/* Dated: 07/24/2017 */
|
||||
|
||||
switch (script) {
|
||||
case SBScriptADLM:
|
||||
return TAG('a', 'd', 'l', 'm');
|
||||
case SBScriptAHOM:
|
||||
return TAG('a', 'h', 'o', 'm');
|
||||
case SBScriptHLUW:
|
||||
return TAG('h', 'l', 'u', 'w');
|
||||
case SBScriptARAB:
|
||||
return TAG('a', 'r', 'a', 'b');
|
||||
case SBScriptARMN:
|
||||
return TAG('a', 'r', 'm', 'n');
|
||||
case SBScriptAVST:
|
||||
return TAG('a', 'v', 's', 't');
|
||||
case SBScriptBALI:
|
||||
return TAG('b', 'a', 'l', 'i');
|
||||
case SBScriptBAMU:
|
||||
return TAG('b', 'a', 'm', 'u');
|
||||
case SBScriptBASS:
|
||||
return TAG('b', 'a', 's', 's');
|
||||
case SBScriptBATK:
|
||||
return TAG('b', 'a', 't', 'k');
|
||||
/* case SBScriptBENG:
|
||||
return TAG('b', 'e', 'n', 'g'); */
|
||||
case SBScriptBENG:
|
||||
return TAG('b', 'n', 'g', '2');
|
||||
case SBScriptBHKS:
|
||||
return TAG('b', 'h', 'k', 's');
|
||||
case SBScriptBOPO:
|
||||
return TAG('b', 'o', 'p', 'o');
|
||||
case SBScriptBRAH:
|
||||
return TAG('b', 'r', 'a', 'h');
|
||||
case SBScriptBRAI:
|
||||
return TAG('b', 'r', 'a', 'i');
|
||||
case SBScriptBUGI:
|
||||
return TAG('b', 'u', 'g', 'i');
|
||||
case SBScriptBUHD:
|
||||
return TAG('b', 'u', 'h', 'd');
|
||||
/* case SBScriptBYZM:
|
||||
return TAG('b', 'y', 'z', 'm'); */
|
||||
case SBScriptCANS:
|
||||
return TAG('c', 'a', 'n', 's');
|
||||
case SBScriptCARI:
|
||||
return TAG('c', 'a', 'r', 'i');
|
||||
case SBScriptAGHB:
|
||||
return TAG('a', 'g', 'h', 'b');
|
||||
case SBScriptCAKM:
|
||||
return TAG('c', 'a', 'k', 'm');
|
||||
case SBScriptCHAM:
|
||||
return TAG('c', 'h', 'a', 'm');
|
||||
case SBScriptCHER:
|
||||
return TAG('c', 'h', 'e', 'r');
|
||||
case SBScriptHANI:
|
||||
return TAG('h', 'a', 'n', 'i');
|
||||
case SBScriptCOPT:
|
||||
return TAG('c', 'o', 'p', 't');
|
||||
case SBScriptCPRT:
|
||||
return TAG('c', 'p', 'r', 't');
|
||||
case SBScriptCYRL:
|
||||
return TAG('c', 'y', 'r', 'l');
|
||||
/* case SBScriptDFLT:
|
||||
return TAG('D', 'F', 'L', 'T'); */
|
||||
case SBScriptDSRT:
|
||||
return TAG('d', 's', 'r', 't');
|
||||
/* case SBScriptDEVA:
|
||||
return TAG('d', 'e', 'v', 'a'); */
|
||||
case SBScriptDEVA:
|
||||
return TAG('d', 'e', 'v', '2');
|
||||
case SBScriptDUPL:
|
||||
return TAG('d', 'u', 'p', 'l');
|
||||
case SBScriptEGYP:
|
||||
return TAG('e', 'g', 'y', 'p');
|
||||
case SBScriptELBA:
|
||||
return TAG('e', 'l', 'b', 'a');
|
||||
case SBScriptETHI:
|
||||
return TAG('e', 't', 'h', 'i');
|
||||
case SBScriptGEOR:
|
||||
return TAG('g', 'e', 'o', 'r');
|
||||
case SBScriptGLAG:
|
||||
return TAG('g', 'l', 'a', 'g');
|
||||
case SBScriptGOTH:
|
||||
return TAG('g', 'o', 't', 'h');
|
||||
case SBScriptGRAN:
|
||||
return TAG('g', 'r', 'a', 'n');
|
||||
case SBScriptGREK:
|
||||
return TAG('g', 'r', 'e', 'k');
|
||||
/* case SBScriptGUJR:
|
||||
return TAG('g', 'u', 'j', 'r'); */
|
||||
case SBScriptGUJR:
|
||||
return TAG('g', 'j', 'r', '2');
|
||||
/* case SBScriptGURU:
|
||||
return TAG('g', 'u', 'r', 'u'); */
|
||||
case SBScriptGURU:
|
||||
return TAG('g', 'u', 'r', '2');
|
||||
case SBScriptHANG:
|
||||
return TAG('h', 'a', 'n', 'g');
|
||||
/* case SBScriptJAMO:
|
||||
return TAG('j', 'a', 'm', 'o'); */
|
||||
case SBScriptHANO:
|
||||
return TAG('h', 'a', 'n', 'o');
|
||||
case SBScriptHATR:
|
||||
return TAG('h', 'a', 't', 'r');
|
||||
case SBScriptHEBR:
|
||||
return TAG('h', 'e', 'b', 'r');
|
||||
case SBScriptHIRA:
|
||||
return TAG('k', 'a', 'n', 'a');
|
||||
case SBScriptARMI:
|
||||
return TAG('a', 'r', 'm', 'i');
|
||||
case SBScriptPHLI:
|
||||
return TAG('p', 'h', 'l', 'i');
|
||||
case SBScriptPRTI:
|
||||
return TAG('p', 'r', 't', 'i');
|
||||
case SBScriptJAVA:
|
||||
return TAG('j', 'a', 'v', 'a');
|
||||
case SBScriptKTHI:
|
||||
return TAG('k', 't', 'h', 'i');
|
||||
/* case SBScriptKNDA:
|
||||
return TAG('k', 'n', 'd', 'a'); */
|
||||
case SBScriptKNDA:
|
||||
return TAG('k', 'n', 'd', '2');
|
||||
case SBScriptKANA:
|
||||
return TAG('k', 'a', 'n', 'a');
|
||||
case SBScriptKALI:
|
||||
return TAG('k', 'a', 'l', 'i');
|
||||
case SBScriptKHAR:
|
||||
return TAG('k', 'h', 'a', 'r');
|
||||
case SBScriptKHMR:
|
||||
return TAG('k', 'h', 'm', 'r');
|
||||
case SBScriptKHOJ:
|
||||
return TAG('k', 'h', 'o', 'j');
|
||||
case SBScriptSIND:
|
||||
return TAG('s', 'i', 'n', 'd');
|
||||
case SBScriptLAOO:
|
||||
return TAG('l', 'a', 'o', ' ');
|
||||
case SBScriptLATN:
|
||||
return TAG('l', 'a', 't', 'n');
|
||||
case SBScriptLEPC:
|
||||
return TAG('l', 'e', 'p', 'c');
|
||||
case SBScriptLIMB:
|
||||
return TAG('l', 'i', 'm', 'b');
|
||||
case SBScriptLINA:
|
||||
return TAG('l', 'i', 'n', 'a');
|
||||
case SBScriptLINB:
|
||||
return TAG('l', 'i', 'n', 'b');
|
||||
case SBScriptLISU:
|
||||
return TAG('l', 'i', 's', 'u');
|
||||
case SBScriptLYCI:
|
||||
return TAG('l', 'y', 'c', 'i');
|
||||
case SBScriptLYDI:
|
||||
return TAG('l', 'y', 'd', 'i');
|
||||
case SBScriptMAHJ:
|
||||
return TAG('m', 'a', 'h', 'j');
|
||||
/* case SBScriptMLYM:
|
||||
return TAG('m', 'l', 'y', 'm'); */
|
||||
case SBScriptMLYM:
|
||||
return TAG('m', 'l', 'm', '2');
|
||||
case SBScriptMAND:
|
||||
return TAG('m', 'a', 'n', 'd');
|
||||
case SBScriptMANI:
|
||||
return TAG('m', 'a', 'n', 'i');
|
||||
case SBScriptMARC:
|
||||
return TAG('m', 'a', 'r', 'c');
|
||||
/* case SBScriptMATH:
|
||||
return TAG('m', 'a', 't', 'h'); */
|
||||
case SBScriptMTEI:
|
||||
return TAG('m', 't', 'e', 'i');
|
||||
case SBScriptMEND:
|
||||
return TAG('m', 'e', 'n', 'd');
|
||||
case SBScriptMERC:
|
||||
return TAG('m', 'e', 'r', 'c');
|
||||
case SBScriptMERO:
|
||||
return TAG('m', 'e', 'r', 'o');
|
||||
case SBScriptPLRD:
|
||||
return TAG('p', 'l', 'r', 'd');
|
||||
case SBScriptMODI:
|
||||
return TAG('m', 'o', 'd', 'i');
|
||||
case SBScriptMONG:
|
||||
return TAG('m', 'o', 'n', 'g');
|
||||
case SBScriptMROO:
|
||||
return TAG('m', 'r', 'o', 'o');
|
||||
case SBScriptMULT:
|
||||
return TAG('m', 'u', 'l', 't');
|
||||
/* case SBScriptMUSC:
|
||||
return TAG('m', 'u', 's', 'c'); */
|
||||
/* case SBScriptMYMR:
|
||||
return TAG('m', 'y', 'm', 'r'); */
|
||||
case SBScriptMYMR:
|
||||
return TAG('m', 'y', 'm', '2');
|
||||
case SBScriptNBAT:
|
||||
return TAG('n', 'b', 'a', 't');
|
||||
case SBScriptNEWA:
|
||||
return TAG('n', 'e', 'w', 'a');
|
||||
case SBScriptTALU:
|
||||
return TAG('t', 'a', 'l', 'u');
|
||||
case SBScriptNKOO:
|
||||
return TAG('n', 'k', 'o', ' ');
|
||||
/* case SBScriptORYA:
|
||||
return TAG('o', 'r', 'y', 'a'); */
|
||||
case SBScriptORYA:
|
||||
return TAG('o', 'r', 'y', '2');
|
||||
case SBScriptOGAM:
|
||||
return TAG('o', 'g', 'a', 'm');
|
||||
case SBScriptOLCK:
|
||||
return TAG('o', 'l', 'c', 'k');
|
||||
case SBScriptITAL:
|
||||
return TAG('i', 't', 'a', 'l');
|
||||
case SBScriptHUNG:
|
||||
return TAG('h', 'u', 'n', 'g');
|
||||
case SBScriptNARB:
|
||||
return TAG('n', 'a', 'r', 'b');
|
||||
case SBScriptPERM:
|
||||
return TAG('p', 'e', 'r', 'm');
|
||||
case SBScriptXPEO:
|
||||
return TAG('x', 'p', 'e', 'o');
|
||||
case SBScriptSARB:
|
||||
return TAG('s', 'a', 'r', 'b');
|
||||
case SBScriptORKH:
|
||||
return TAG('o', 'r', 'k', 'h');
|
||||
case SBScriptOSGE:
|
||||
return TAG('o', 's', 'g', 'e');
|
||||
case SBScriptOSMA:
|
||||
return TAG('o', 's', 'm', 'a');
|
||||
case SBScriptHMNG:
|
||||
return TAG('h', 'm', 'n', 'g');
|
||||
case SBScriptPALM:
|
||||
return TAG('p', 'a', 'l', 'm');
|
||||
case SBScriptPAUC:
|
||||
return TAG('p', 'a', 'u', 'c');
|
||||
case SBScriptPHAG:
|
||||
return TAG('p', 'h', 'a', 'g');
|
||||
case SBScriptPHNX:
|
||||
return TAG('p', 'h', 'n', 'x');
|
||||
case SBScriptPHLP:
|
||||
return TAG('p', 'h', 'l', 'p');
|
||||
case SBScriptRJNG:
|
||||
return TAG('r', 'j', 'n', 'g');
|
||||
case SBScriptRUNR:
|
||||
return TAG('r', 'u', 'n', 'r');
|
||||
case SBScriptSAMR:
|
||||
return TAG('s', 'a', 'm', 'r');
|
||||
case SBScriptSAUR:
|
||||
return TAG('s', 'a', 'u', 'r');
|
||||
case SBScriptSHRD:
|
||||
return TAG('s', 'h', 'r', 'd');
|
||||
case SBScriptSHAW:
|
||||
return TAG('s', 'h', 'a', 'w');
|
||||
case SBScriptSIDD:
|
||||
return TAG('s', 'i', 'd', 'd');
|
||||
case SBScriptSGNW:
|
||||
return TAG('s', 'g', 'n', 'w');
|
||||
case SBScriptSINH:
|
||||
return TAG('s', 'i', 'n', 'h');
|
||||
case SBScriptSORA:
|
||||
return TAG('s', 'o', 'r', 'a');
|
||||
case SBScriptXSUX:
|
||||
return TAG('x', 's', 'u', 'x');
|
||||
case SBScriptSUND:
|
||||
return TAG('s', 'u', 'n', 'd');
|
||||
case SBScriptSYLO:
|
||||
return TAG('s', 'y', 'l', 'o');
|
||||
case SBScriptSYRC:
|
||||
return TAG('s', 'y', 'r', 'c');
|
||||
case SBScriptTGLG:
|
||||
return TAG('t', 'g', 'l', 'g');
|
||||
case SBScriptTAGB:
|
||||
return TAG('t', 'a', 'g', 'b');
|
||||
case SBScriptTALE:
|
||||
return TAG('t', 'a', 'l', 'e');
|
||||
case SBScriptLANA:
|
||||
return TAG('l', 'a', 'n', 'a');
|
||||
case SBScriptTAVT:
|
||||
return TAG('t', 'a', 'v', 't');
|
||||
case SBScriptTAKR:
|
||||
return TAG('t', 'a', 'k', 'r');
|
||||
/* case SBScriptTAML:
|
||||
return TAG('t', 'a', 'm', 'l'); */
|
||||
case SBScriptTAML:
|
||||
return TAG('t', 'm', 'l', '2');
|
||||
case SBScriptTANG:
|
||||
return TAG('t', 'a', 'n', 'g');
|
||||
/* case SBScriptTELU:
|
||||
return TAG('t', 'e', 'l', 'u'); */
|
||||
case SBScriptTELU:
|
||||
return TAG('t', 'e', 'l', '2');
|
||||
case SBScriptTHAA:
|
||||
return TAG('t', 'h', 'a', 'a');
|
||||
case SBScriptTHAI:
|
||||
return TAG('t', 'h', 'a', 'i');
|
||||
case SBScriptTIBT:
|
||||
return TAG('t', 'i', 'b', 't');
|
||||
case SBScriptTFNG:
|
||||
return TAG('t', 'f', 'n', 'g');
|
||||
case SBScriptTIRH:
|
||||
return TAG('t', 'i', 'r', 'h');
|
||||
case SBScriptUGAR:
|
||||
return TAG('u', 'g', 'a', 'r');
|
||||
case SBScriptVAII:
|
||||
return TAG('v', 'a', 'i', ' ');
|
||||
case SBScriptWARA:
|
||||
return TAG('w', 'a', 'r', 'a');
|
||||
case SBScriptYIII:
|
||||
return TAG('y', 'i', ' ', ' ');
|
||||
default:
|
||||
return TAG('D', 'F', 'L', 'T');
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,108 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_BASE_H
|
||||
#define _SB_INTERNAL_BASE_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBidiType.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBCodepoint.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBGeneralCategory.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBScript.h>
|
||||
|
||||
/**
|
||||
* A value that indicates an invalid unsigned index.
|
||||
*/
|
||||
#define SBInvalidIndex (SBUInteger)(-1)
|
||||
|
||||
SB_INTERNAL void SBUIntegerNormalizeRange(SBUInteger actualLength,
|
||||
SBUInteger *rangeOffset, SBUInteger *rangeLength);
|
||||
|
||||
SB_INTERNAL SBBoolean SBUIntegerVerifyRange(SBUInteger actualLength,
|
||||
SBUInteger rangeOffset, SBUInteger rangeLength);
|
||||
|
||||
|
||||
#define SBNumberGetMax(first, second) \
|
||||
( \
|
||||
(first) > (second) \
|
||||
? (first) \
|
||||
: (second) \
|
||||
)
|
||||
|
||||
#define SBNumberLimitIncrement(number, limit) \
|
||||
( \
|
||||
(number) < (limit) \
|
||||
? (number) + (1) \
|
||||
: (limit) \
|
||||
)
|
||||
|
||||
#define SBNumberLimitDecrement(number, limit) \
|
||||
( \
|
||||
(number) > (limit) \
|
||||
? (number) - (1) \
|
||||
: (limit) \
|
||||
)
|
||||
|
||||
#define SBNumberRingAdd(number, count, capacity) \
|
||||
(((number) + (count)) % (capacity))
|
||||
|
||||
#define SBNumberRingIncrement(number, capacity) \
|
||||
SBNumberRingAdd(number, 1, capacity)
|
||||
|
||||
#define SBNumberRingSubtract(number, count, capacity) \
|
||||
(((number) + (capacity) - (count)) % (capacity))
|
||||
|
||||
#define SBNumberRingDecrement(number, capacity) \
|
||||
SBNumberRingSubtract(number, 1, capacity)
|
||||
|
||||
|
||||
#define SBLevelAsNormalBidiType(level) \
|
||||
( \
|
||||
((level) & 1) \
|
||||
? SBBidiTypeR \
|
||||
: SBBidiTypeL \
|
||||
)
|
||||
|
||||
#define SBLevelAsOppositeBidiType(level) \
|
||||
( \
|
||||
((level) & 1) \
|
||||
? SBBidiTypeL \
|
||||
: SBBidiTypeR \
|
||||
)
|
||||
|
||||
|
||||
#define SBBidiTypeIsEqual(t1, t2) ((t1) == (t2))
|
||||
|
||||
#define SBBidiTypeIsNumber(t) SBUInt8InRange(t, SBBidiTypeAN, SBBidiTypeEN)
|
||||
#define SBBidiTypeIsIsolate(t) SBUInt8InRange(t, SBBidiTypeLRI, SBBidiTypePDI)
|
||||
|
||||
#define SBBidiTypeIsStrongOrNumber(t) (SBBidiTypeIsStrong(t) || SBBidiTypeIsNumber(t))
|
||||
#define SBBidiTypeIsNumberSeparator(t) SBUInt8InRange(t, SBBidiTypeES, SBBidiTypeCS)
|
||||
#define SBBidiTypeIsIsolateInitiator(t) SBUInt8InRange(t, SBBidiTypeLRI, SBBidiTypeFSI)
|
||||
#define SBBidiTypeIsIsolateTerminator(t) SBBidiTypeIsEqual(t, SBBidiTypePDI)
|
||||
#define SBBidiTypeIsNeutralOrIsolate(t) SBUInt8InRange(t, SBBidiTypeWS, SBBidiTypePDI)
|
||||
|
||||
|
||||
#define SBCodepointMax 0x10FFFF
|
||||
#define SBCodepointInRange(v, s, e) SBUInt32InRange(v, s, e)
|
||||
#define SBCodepointIsSurrogate(c) SBCodepointInRange(c, 0xD800, 0xDFFF)
|
||||
#define SBCodepointIsValid(c) (!SBCodepointIsSurrogate(c) && (c) <= SBCodepointMax)
|
||||
|
||||
|
||||
#define SBScriptIsCommonOrInherited(s) ((s) <= SBScriptZYYY)
|
||||
|
||||
#endif
|
||||
+303
@@ -0,0 +1,303 @@
|
||||
/*
|
||||
* Copyright (C) 2016-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
|
||||
typedef struct {
|
||||
SBUInt8 valid;
|
||||
SBUInt8 total;
|
||||
SBUInt8 start;
|
||||
SBUInt8 end;
|
||||
} UTF8State;
|
||||
|
||||
static const UTF8State UTF8StateTable[9] = {
|
||||
{1,0,0x00,0x00}, {0,0,0x00,0x00}, {1,2,0x80,0xBF}, {1,3,0xA0,0xBF}, {1,3,0x80,0xBF},
|
||||
{1,3,0x80,0x9F}, {1,4,0x90,0xBF}, {1,4,0x80,0xBF}, {1,4,0x80,0x8F}
|
||||
};
|
||||
|
||||
static const SBUInt8 UTF8LookupTable[256] = {
|
||||
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, 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,
|
||||
/* LEAD: -- 80..BF -- */
|
||||
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, 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,
|
||||
/* LEAD: -- C0..C1 -- */
|
||||
1, 1,
|
||||
/* LEAD: -- C2..DF -- */
|
||||
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
||||
/* LEAD: -- E0..E0 -- */
|
||||
3,
|
||||
/* LEAD: -- E1..EC -- */
|
||||
4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
|
||||
/* LEAD: -- ED..ED -- */
|
||||
5,
|
||||
/* LEAD: -- EE..EF -- */
|
||||
4, 4,
|
||||
/* LEAD: -- F0..F0 -- */
|
||||
6,
|
||||
/* LEAD: -- F1..F3 -- */
|
||||
7, 7, 7,
|
||||
/* LEAD: -- F4..F4 -- */
|
||||
8,
|
||||
/* LEAD: -- F5..F7 -- */
|
||||
1, 1, 1,
|
||||
/* LEAD: -- F8..FB -- */
|
||||
1, 1, 1, 1,
|
||||
/* LEAD: -- FC..FD -- */
|
||||
1, 1,
|
||||
/* LEAD: -- FE..FF -- */
|
||||
1, 1
|
||||
};
|
||||
|
||||
static SBCodepoint GetUTF8CodepointAt(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex);
|
||||
static SBCodepoint GetUTF8CodepointBefore(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex);
|
||||
static SBCodepoint GetUTF16CodepointAt(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex);
|
||||
static SBCodepoint GetUTF16CodepointBefore(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex);
|
||||
static SBCodepoint GetUTF32CodepointAt(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex);
|
||||
static SBCodepoint GetUTF32CodepointBefore(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex);
|
||||
|
||||
SB_INTERNAL SBBoolean SBCodepointSequenceIsValid(const SBCodepointSequence *codepointSequence)
|
||||
{
|
||||
if (codepointSequence) {
|
||||
SBBoolean encodingValid = SBFalse;
|
||||
|
||||
switch (codepointSequence->stringEncoding) {
|
||||
case SBStringEncodingUTF8:
|
||||
case SBStringEncodingUTF16:
|
||||
case SBStringEncodingUTF32:
|
||||
encodingValid = SBTrue;
|
||||
break;
|
||||
}
|
||||
|
||||
return (encodingValid && codepointSequence->stringBuffer && codepointSequence->stringLength > 0);
|
||||
}
|
||||
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
SBCodepoint SBCodepointSequenceGetCodepointBefore(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex)
|
||||
{
|
||||
SBCodepoint codepoint = SBCodepointInvalid;
|
||||
|
||||
if ((*stringIndex - 1) < codepointSequence->stringLength) {
|
||||
switch (codepointSequence->stringEncoding) {
|
||||
case SBStringEncodingUTF8:
|
||||
codepoint = GetUTF8CodepointBefore(codepointSequence, stringIndex);
|
||||
break;
|
||||
|
||||
case SBStringEncodingUTF16:
|
||||
codepoint = GetUTF16CodepointBefore(codepointSequence, stringIndex);
|
||||
break;
|
||||
|
||||
case SBStringEncodingUTF32:
|
||||
codepoint = GetUTF32CodepointBefore(codepointSequence, stringIndex);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
SBCodepoint SBCodepointSequenceGetCodepointAt(const SBCodepointSequence *codepointSequence, SBUInteger *stringIndex)
|
||||
{
|
||||
SBCodepoint codepoint = SBCodepointInvalid;
|
||||
|
||||
if (*stringIndex < codepointSequence->stringLength) {
|
||||
switch (codepointSequence->stringEncoding) {
|
||||
case SBStringEncodingUTF8:
|
||||
codepoint = GetUTF8CodepointAt(codepointSequence, stringIndex);
|
||||
break;
|
||||
|
||||
case SBStringEncodingUTF16:
|
||||
codepoint = GetUTF16CodepointAt(codepointSequence, stringIndex);
|
||||
break;
|
||||
|
||||
case SBStringEncodingUTF32:
|
||||
codepoint = GetUTF32CodepointAt(codepointSequence, stringIndex);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
static SBCodepoint GetUTF8CodepointAt(const SBCodepointSequence *sequence, SBUInteger *index)
|
||||
{
|
||||
const SBUInt8 *buffer = sequence->stringBuffer;
|
||||
SBUInteger length = sequence->stringLength;
|
||||
SBUInt8 lead;
|
||||
UTF8State state;
|
||||
SBUInteger limit;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
lead = buffer[*index];
|
||||
state = UTF8StateTable[UTF8LookupTable[lead]];
|
||||
limit = *index + state.total;
|
||||
|
||||
if (limit > length) {
|
||||
limit = length;
|
||||
state.valid = SBFalse;
|
||||
}
|
||||
|
||||
codepoint = lead & (0x7F >> state.total);
|
||||
|
||||
while (++(*index) < limit) {
|
||||
SBUInt8 byte = buffer[*index];
|
||||
|
||||
if (byte >= state.start && byte <= state.end) {
|
||||
codepoint = (codepoint << 6) | (byte & 0x3F);
|
||||
} else {
|
||||
state.valid = SBFalse;
|
||||
break;
|
||||
}
|
||||
|
||||
state.start = 0x80;
|
||||
state.end = 0xBF;
|
||||
}
|
||||
|
||||
if (state.valid) {
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
return SBCodepointFaulty;
|
||||
}
|
||||
|
||||
static SBCodepoint GetUTF8CodepointBefore(const SBCodepointSequence *sequence, SBUInteger *index)
|
||||
{
|
||||
const SBUInt8 *buffer = sequence->stringBuffer;
|
||||
SBUInteger startIndex = *index;
|
||||
SBUInteger limitIndex;
|
||||
SBUInteger continuation;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
continuation = 7;
|
||||
|
||||
while (--continuation && --startIndex) {
|
||||
SBUInt8 codeunit = buffer[startIndex];
|
||||
|
||||
if ((codeunit & 0xC0) != 0x80) {
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
limitIndex = startIndex;
|
||||
codepoint = GetUTF8CodepointAt(sequence, &limitIndex);
|
||||
|
||||
if (limitIndex == *index) {
|
||||
*index = startIndex;
|
||||
} else {
|
||||
codepoint = SBCodepointFaulty;
|
||||
*index -= 1;
|
||||
}
|
||||
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
static SBCodepoint GetUTF16CodepointAt(const SBCodepointSequence *sequence, SBUInteger *index)
|
||||
{
|
||||
const SBUInt16 *buffer = sequence->stringBuffer;
|
||||
SBUInteger length = sequence->stringLength;
|
||||
SBCodepoint codepoint;
|
||||
SBUInt16 lead;
|
||||
|
||||
codepoint = SBCodepointFaulty;
|
||||
|
||||
lead = buffer[*index];
|
||||
*index += 1;
|
||||
|
||||
if (!SBCodepointIsSurrogate(lead)) {
|
||||
codepoint = lead;
|
||||
} else if (lead <= 0xDBFF) {
|
||||
if (*index < length) {
|
||||
SBUInt16 trail = buffer[*index];
|
||||
|
||||
if (SBUInt16InRange(trail, 0xDC00, 0xDFFF)) {
|
||||
codepoint = (lead << 10) + trail - ((0xD800 << 10) + 0xDC00 - 0x10000);
|
||||
*index += 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
static SBCodepoint GetUTF16CodepointBefore(const SBCodepointSequence *sequence, SBUInteger *index)
|
||||
{
|
||||
const SBUInt16 *buffer = sequence->stringBuffer;
|
||||
SBCodepoint codepoint;
|
||||
SBUInt16 trail;
|
||||
|
||||
codepoint = SBCodepointFaulty;
|
||||
|
||||
*index -= 1;
|
||||
trail = buffer[*index];
|
||||
|
||||
if (!SBCodepointIsSurrogate(trail)) {
|
||||
codepoint = trail;
|
||||
} else if (trail >= 0xDC00) {
|
||||
if (*index > 0) {
|
||||
SBUInt16 lead = buffer[*index - 1];
|
||||
|
||||
if (SBUInt16InRange(lead, 0xD800, 0xDBFF)) {
|
||||
codepoint = (lead << 10) + trail - ((0xD800 << 10) + 0xDC00 - 0x10000);
|
||||
*index -= 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
static SBCodepoint GetUTF32CodepointAt(const SBCodepointSequence *sequence, SBUInteger *index)
|
||||
{
|
||||
const SBUInt32 *buffer = sequence->stringBuffer;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
codepoint = buffer[*index];
|
||||
*index += 1;
|
||||
|
||||
if (SBCodepointIsValid(codepoint)) {
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
return SBCodepointFaulty;
|
||||
}
|
||||
|
||||
static SBCodepoint GetUTF32CodepointBefore(const SBCodepointSequence *sequence, SBUInteger *index)
|
||||
{
|
||||
const SBUInt32 *buffer = sequence->stringBuffer;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
*index -= 1;
|
||||
codepoint = buffer[*index];
|
||||
|
||||
if (SBCodepointIsValid(codepoint)) {
|
||||
return codepoint;
|
||||
}
|
||||
|
||||
return SBCodepointFaulty;
|
||||
}
|
||||
+25
@@ -0,0 +1,25 @@
|
||||
/*
|
||||
* Copyright (C) 2016 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_CODEPOINT_SEQUENCE_H
|
||||
#define _SB_INTERNAL_CODEPOINT_SEQUENCE_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBCodepointSequence.h>
|
||||
|
||||
SB_INTERNAL SBBoolean SBCodepointSequenceIsValid(const SBCodepointSequence *codepointSequence);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,321 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBRun.h>
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "PairingLookup.h"
|
||||
#include "SBAlgorithm.h"
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBParagraph.h"
|
||||
#include "SBLine.h"
|
||||
|
||||
typedef struct _LineContext {
|
||||
const SBBidiType *refTypes;
|
||||
SBLevel *fixedLevels;
|
||||
SBUInteger runCount;
|
||||
SBLevel maxLevel;
|
||||
} LineContext, *LineContextRef;
|
||||
|
||||
static SBLevel CopyLevels(SBLevel *destination,
|
||||
const SBLevel *source, SBUInteger length, SBUInteger *runCount)
|
||||
{
|
||||
SBLevel lastLevel = SBLevelInvalid;
|
||||
SBLevel maxLevel = 0;
|
||||
SBUInteger totalRuns = 0;
|
||||
|
||||
while (length--) {
|
||||
SBLevel level = *(source++);
|
||||
*(destination++) = level;
|
||||
|
||||
if (level != lastLevel) {
|
||||
totalRuns += 1;
|
||||
|
||||
if (level > maxLevel) {
|
||||
maxLevel = level;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
*runCount = totalRuns;
|
||||
|
||||
return maxLevel;
|
||||
}
|
||||
|
||||
static LineContextRef CreateLineContext(const SBBidiType *types, const SBLevel *levels, SBUInteger length)
|
||||
{
|
||||
const SBUInteger sizeContext = sizeof(LineContext);
|
||||
const SBUInteger sizeLevels = sizeof(SBLevel) * length;
|
||||
const SBUInteger sizeMemory = sizeContext + sizeLevels;
|
||||
|
||||
void *pointer = malloc(sizeMemory);
|
||||
|
||||
if (pointer) {
|
||||
const SBUInteger offsetContext = 0;
|
||||
const SBUInteger offsetLevels = offsetContext + sizeContext;
|
||||
|
||||
SBUInt8 *memory = (SBUInt8 *)pointer;
|
||||
LineContextRef context = (LineContextRef)(memory + offsetContext);
|
||||
SBLevel *fixedLevels = (SBLevel *)(memory + offsetLevels);
|
||||
|
||||
context->refTypes = types;
|
||||
context->fixedLevels = fixedLevels;
|
||||
context->maxLevel = CopyLevels(fixedLevels, levels, length, &context->runCount);
|
||||
|
||||
return context;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static void DisposeLineContext(LineContextRef context)
|
||||
{
|
||||
free(context);
|
||||
}
|
||||
|
||||
static SBLineRef AllocateLine(SBUInteger runCount)
|
||||
{
|
||||
const SBUInteger sizeLine = sizeof(SBLine);
|
||||
const SBUInteger sizeRuns = sizeof(SBRun) * runCount;
|
||||
const SBUInteger sizeMemory = sizeLine + sizeRuns;
|
||||
|
||||
void *pointer = malloc(sizeMemory);
|
||||
|
||||
if (pointer) {
|
||||
const SBUInteger offsetLine = 0;
|
||||
const SBUInteger offsetRuns = offsetLine + sizeLine;
|
||||
|
||||
SBUInt8 *memory = (SBUInt8 *)pointer;
|
||||
SBLineRef line = (SBLineRef)(memory + offsetLine);
|
||||
SBRun *runs = (SBRun *)(memory + offsetRuns);
|
||||
|
||||
line->fixedRuns = runs;
|
||||
|
||||
return line;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static void SetNewLevel(SBLevel *levels, SBUInteger length, SBLevel newLevel)
|
||||
{
|
||||
SBUInteger index = length;
|
||||
|
||||
while (index--) {
|
||||
levels[index] = newLevel;
|
||||
}
|
||||
}
|
||||
|
||||
static void ResetLevels(LineContextRef context, SBLevel baseLevel, SBUInteger charCount)
|
||||
{
|
||||
const SBBidiType *types = context->refTypes;
|
||||
SBLevel *levels = context->fixedLevels;
|
||||
SBUInteger index;
|
||||
SBUInteger length;
|
||||
SBBoolean reset;
|
||||
|
||||
index = charCount;
|
||||
length = 0;
|
||||
reset = SBTrue;
|
||||
|
||||
while (index--) {
|
||||
SBBidiType type = types[index];
|
||||
|
||||
switch (type) {
|
||||
case SBBidiTypeB:
|
||||
case SBBidiTypeS:
|
||||
SetNewLevel(levels + index, length + 1, baseLevel);
|
||||
length = 0;
|
||||
reset = SBTrue;
|
||||
context->runCount += 1;
|
||||
break;
|
||||
|
||||
case SBBidiTypeLRE:
|
||||
case SBBidiTypeRLE:
|
||||
case SBBidiTypeLRO:
|
||||
case SBBidiTypeRLO:
|
||||
case SBBidiTypePDF:
|
||||
case SBBidiTypeBN:
|
||||
length += 1;
|
||||
break;
|
||||
|
||||
case SBBidiTypeWS:
|
||||
case SBBidiTypeLRI:
|
||||
case SBBidiTypeRLI:
|
||||
case SBBidiTypeFSI:
|
||||
case SBBidiTypePDI:
|
||||
if (reset) {
|
||||
SetNewLevel(levels + index, length + 1, baseLevel);
|
||||
length = 0;
|
||||
|
||||
context->runCount += 1;
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
length = 0;
|
||||
reset = SBFalse;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static SBUInteger InitializeRuns(SBRun *runs,
|
||||
const SBLevel *levels, SBUInteger length, SBUInteger lineOffset)
|
||||
{
|
||||
SBUInteger index;
|
||||
SBUInteger runCount = 1;
|
||||
|
||||
(*runs).offset = lineOffset;
|
||||
(*runs).level = levels[0];
|
||||
|
||||
for (index = 0; index < length; index++) {
|
||||
SBLevel level = levels[index];
|
||||
|
||||
if (level != (*runs).level) {
|
||||
(*runs).length = index + lineOffset - (*runs).offset;
|
||||
|
||||
++runs;
|
||||
(*runs).offset = lineOffset + index;
|
||||
(*runs).level = level;
|
||||
|
||||
runCount += 1;
|
||||
}
|
||||
}
|
||||
|
||||
(*runs).length = index + lineOffset - (*runs).offset;
|
||||
|
||||
return runCount;
|
||||
}
|
||||
|
||||
static void ReverseRunSequence(SBRun *runs, SBUInteger runCount)
|
||||
{
|
||||
SBUInteger halfCount = runCount / 2;
|
||||
SBUInteger finalIndex = runCount - 1;
|
||||
SBUInteger index;
|
||||
|
||||
for (index = 0; index < halfCount; index++) {
|
||||
SBUInteger tieIndex;
|
||||
SBRun tempRun;
|
||||
|
||||
tieIndex = finalIndex - index;
|
||||
|
||||
tempRun = runs[index];
|
||||
runs[index] = runs[tieIndex];
|
||||
runs[tieIndex] = tempRun;
|
||||
}
|
||||
}
|
||||
|
||||
static void ReorderRuns(SBRun *runs, SBUInteger runCount, SBLevel maxLevel)
|
||||
{
|
||||
SBLevel newLevel;
|
||||
|
||||
for (newLevel = maxLevel; newLevel; newLevel--) {
|
||||
SBUInteger start = runCount;
|
||||
|
||||
while (start--) {
|
||||
if (runs[start].level >= newLevel) {
|
||||
SBUInteger count = 1;
|
||||
|
||||
for (; start && runs[start - 1].level >= newLevel; start--) {
|
||||
count += 1;
|
||||
}
|
||||
|
||||
ReverseRunSequence(runs + start, count);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL SBLineRef SBLineCreate(SBParagraphRef paragraph,
|
||||
SBUInteger lineOffset, SBUInteger lineLength)
|
||||
{
|
||||
SBUInteger innerOffset = lineOffset - paragraph->offset;
|
||||
const SBBidiType *refTypes = paragraph->refTypes + innerOffset;
|
||||
const SBLevel *refLevels = paragraph->fixedLevels + innerOffset;
|
||||
LineContextRef context;
|
||||
SBLineRef line;
|
||||
|
||||
/* Line range MUST be valid. */
|
||||
SBAssert(lineOffset < (lineOffset + lineLength)
|
||||
&& lineOffset >= paragraph->offset
|
||||
&& (lineOffset + lineLength) <= (paragraph->offset + paragraph->length));
|
||||
|
||||
context = CreateLineContext(refTypes, refLevels, lineLength);
|
||||
|
||||
if (context) {
|
||||
ResetLevels(context, paragraph->baseLevel, lineLength);
|
||||
|
||||
line = AllocateLine(context->runCount);
|
||||
|
||||
if (line) {
|
||||
line->runCount = InitializeRuns(line->fixedRuns, context->fixedLevels, lineLength, lineOffset);
|
||||
ReorderRuns(line->fixedRuns, line->runCount, context->maxLevel);
|
||||
|
||||
line->codepointSequence = paragraph->algorithm->codepointSequence;
|
||||
line->offset = lineOffset;
|
||||
line->length = lineLength;
|
||||
line->retainCount = 1;
|
||||
}
|
||||
|
||||
DisposeLineContext(context);
|
||||
|
||||
return line;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
SBUInteger SBLineGetOffset(SBLineRef line)
|
||||
{
|
||||
return line->offset;
|
||||
}
|
||||
|
||||
SBUInteger SBLineGetLength(SBLineRef line)
|
||||
{
|
||||
return line->length;
|
||||
}
|
||||
|
||||
SBUInteger SBLineGetRunCount(SBLineRef line)
|
||||
{
|
||||
return line->runCount;
|
||||
}
|
||||
|
||||
const SBRun *SBLineGetRunsPtr(SBLineRef line)
|
||||
{
|
||||
return line->fixedRuns;
|
||||
}
|
||||
|
||||
SBLineRef SBLineRetain(SBLineRef line)
|
||||
{
|
||||
if (line) {
|
||||
line->retainCount += 1;
|
||||
}
|
||||
|
||||
return line;
|
||||
}
|
||||
|
||||
void SBLineRelease(SBLineRef line)
|
||||
{
|
||||
if (line && --line->retainCount == 0) {
|
||||
free(line);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,39 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_LINE_H
|
||||
#define _SB_INTERNAL_LINE_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBCodepointSequence.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBLine.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBParagraph.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBRun.h>
|
||||
|
||||
typedef struct _SBLine {
|
||||
SBCodepointSequence codepointSequence;
|
||||
SBRun *fixedRuns;
|
||||
SBUInteger runCount;
|
||||
SBUInteger offset;
|
||||
SBUInteger length;
|
||||
SBUInteger retainCount;
|
||||
} SBLine;
|
||||
|
||||
SB_INTERNAL SBLineRef SBLineCreate(SBParagraphRef paragraph,
|
||||
SBUInteger lineOffset, SBUInteger lineLength);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,303 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#ifdef SB_CONFIG_LOG
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBBidiChain.h"
|
||||
#include "SBBidiType.h"
|
||||
#include "SBIsolatingRun.h"
|
||||
#include "SBLog.h"
|
||||
|
||||
int _SBLogPosition = 0;
|
||||
|
||||
SB_INTERNAL void PrintBaseLevel(SBLevel baseLevel)
|
||||
{
|
||||
switch (baseLevel) {
|
||||
case SBLevelDefaultLTR:
|
||||
SB_LOG_STRING("Auto-LTR");
|
||||
break;
|
||||
|
||||
case SBLevelDefaultRTL:
|
||||
SB_LOG_STRING("Auto-RTL");
|
||||
break;
|
||||
|
||||
case 0:
|
||||
SB_LOG_STRING("LTR");
|
||||
break;
|
||||
|
||||
case 1:
|
||||
SB_LOG_STRING("RTL");
|
||||
break;
|
||||
|
||||
default:
|
||||
SB_LOG(("Level - %d", baseLevel));
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintBidiType(SBBidiType type)
|
||||
{
|
||||
switch (type) {
|
||||
case SBBidiTypeNil:
|
||||
SB_LOG_STRING("Nil");
|
||||
break;
|
||||
|
||||
case SBBidiTypeL:
|
||||
SB_LOG_STRING("L");
|
||||
break;
|
||||
|
||||
case SBBidiTypeR:
|
||||
SB_LOG_STRING("R");
|
||||
break;
|
||||
|
||||
case SBBidiTypeAL:
|
||||
SB_LOG_STRING("AL");
|
||||
break;
|
||||
|
||||
case SBBidiTypeEN:
|
||||
SB_LOG_STRING("EN");
|
||||
break;
|
||||
|
||||
case SBBidiTypeES:
|
||||
SB_LOG_STRING("ES");
|
||||
break;
|
||||
|
||||
case SBBidiTypeET:
|
||||
SB_LOG_STRING("EN");
|
||||
break;
|
||||
|
||||
case SBBidiTypeAN:
|
||||
SB_LOG_STRING("AN");
|
||||
break;
|
||||
|
||||
case SBBidiTypeCS:
|
||||
SB_LOG_STRING("CS");
|
||||
break;
|
||||
|
||||
case SBBidiTypeNSM:
|
||||
SB_LOG_STRING("NSM");
|
||||
break;
|
||||
|
||||
case SBBidiTypeBN:
|
||||
SB_LOG_STRING("BN");
|
||||
break;
|
||||
|
||||
case SBBidiTypeB:
|
||||
SB_LOG_STRING("B");
|
||||
break;
|
||||
|
||||
case SBBidiTypeS:
|
||||
SB_LOG_STRING("S");
|
||||
break;
|
||||
|
||||
case SBBidiTypeWS:
|
||||
SB_LOG_STRING("WS");
|
||||
break;
|
||||
|
||||
case SBBidiTypeON:
|
||||
SB_LOG_STRING("ON");
|
||||
break;
|
||||
|
||||
case SBBidiTypeLRE:
|
||||
SB_LOG_STRING("LRE");
|
||||
break;
|
||||
|
||||
case SBBidiTypeRLE:
|
||||
SB_LOG_STRING("RLE");
|
||||
break;
|
||||
|
||||
case SBBidiTypeLRO:
|
||||
SB_LOG_STRING("LRO");
|
||||
break;
|
||||
|
||||
case SBBidiTypeRLO:
|
||||
SB_LOG_STRING("RLO");
|
||||
break;
|
||||
|
||||
case SBBidiTypePDF:
|
||||
SB_LOG_STRING("PDF");
|
||||
break;
|
||||
|
||||
case SBBidiTypeLRI:
|
||||
SB_LOG_STRING("LRI");
|
||||
break;
|
||||
|
||||
case SBBidiTypeRLI:
|
||||
SB_LOG_STRING("RLI");
|
||||
break;
|
||||
|
||||
case SBBidiTypeFSI:
|
||||
SB_LOG_STRING("FSI");
|
||||
break;
|
||||
|
||||
case SBBidiTypePDI:
|
||||
SB_LOG_STRING("PDI");
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintCodepointSequence(const SBCodepointSequence *codepointSequence)
|
||||
{
|
||||
SBUInteger stringIndex = 0;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
while ((codepoint = SBCodepointSequenceGetCodepointAt(codepointSequence, &stringIndex)) != SBCodepointInvalid) {
|
||||
SB_LOG(("%04X ", codepoint));
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintBidiTypesArray(SBBidiType *types, SBUInteger length)
|
||||
{
|
||||
SBUInteger index;
|
||||
|
||||
for (index = 0; index < length; ++index) {
|
||||
SB_LOG_BIDI_TYPE(types[index]);
|
||||
SB_LOG_DIVIDER(1);
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintLevelsArray(SBLevel *levels, SBUInteger length)
|
||||
{
|
||||
SBUInteger index;
|
||||
|
||||
for (index = 0; index < length; ++index) {
|
||||
SB_LOG_LEVEL(levels[index]);
|
||||
SB_LOG_DIVIDER(1);
|
||||
}
|
||||
}
|
||||
|
||||
typedef struct {
|
||||
void *object;
|
||||
BidiLink link;
|
||||
SBUInteger length;
|
||||
} IsolatingContext;
|
||||
|
||||
typedef void (*IsolatingConsumer)(IsolatingRunRef isolatingRun, IsolatingContext *context);
|
||||
|
||||
SB_INTERNAL void IsolatingRunForEach(IsolatingRunRef isolatingRun,
|
||||
IsolatingContext *context, IsolatingConsumer consumer)
|
||||
{
|
||||
BidiChainRef bidiChain = isolatingRun->bidiChain;
|
||||
LevelRunRef levelRun;
|
||||
|
||||
/* Iterate over individual level runs of the isolating run. */
|
||||
for (levelRun = isolatingRun->baseLevelRun; levelRun; levelRun = levelRun->next) {
|
||||
BidiLink breakLink = BidiChainGetNext(bidiChain, levelRun->lastLink);
|
||||
BidiLink currentLink = levelRun->firstLink;
|
||||
BidiLink subsequentLink = levelRun->subsequentLink;
|
||||
|
||||
/* Iterate over each link of the level run. */
|
||||
while (currentLink != breakLink) {
|
||||
BidiLink nextLink = BidiChainGetNext(bidiChain, currentLink);
|
||||
SBUInteger linkOffset = BidiChainGetOffset(bidiChain, currentLink);
|
||||
SBUInteger linkLength;
|
||||
SBUInteger index;
|
||||
|
||||
if (nextLink != breakLink) {
|
||||
linkLength = BidiChainGetOffset(bidiChain, nextLink) - linkOffset;
|
||||
} else {
|
||||
linkLength = BidiChainGetOffset(bidiChain, subsequentLink) - linkOffset;
|
||||
}
|
||||
|
||||
/* Skip any sequence of BN character types. */
|
||||
for (index = 1; index < linkLength; index++) {
|
||||
SBBidiType bidiType = BidiChainGetType(bidiChain, currentLink + index);
|
||||
if (bidiType == SBBidiTypeBN) {
|
||||
linkLength = index;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
context->link = currentLink;
|
||||
context->length = linkLength;
|
||||
consumer(isolatingRun, context);
|
||||
|
||||
currentLink = nextLink;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
static void PrintTypesOperation(IsolatingRunRef isolatingRun, IsolatingContext *context)
|
||||
{
|
||||
SBBidiType bidiType = BidiChainGetType(isolatingRun->bidiChain, context->link);
|
||||
|
||||
while (context->length--) {
|
||||
SB_LOG_BIDI_TYPE(bidiType);
|
||||
SB_LOG_DIVIDER(1);
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintRunTypes(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
IsolatingContext context;
|
||||
IsolatingRunForEach(isolatingRun, &context, _SBPrintTypesOperation);
|
||||
}
|
||||
|
||||
static void PrintLevelsOperation(IsolatingRunRef isolatingRun, IsolatingContext *context)
|
||||
{
|
||||
SBLevel charLevel = BidiChainGetLevel(isolatingRun->bidiChain, context->link);
|
||||
|
||||
while (context->length--) {
|
||||
SB_LOG_LEVEL(charLevel);
|
||||
SB_LOG_DIVIDER(1);
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintRunLevels(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
IsolatingContext context;
|
||||
IsolatingRunForEach(isolatingRun, &context, _SBPrintLevelsOperation);
|
||||
}
|
||||
|
||||
typedef struct {
|
||||
SBUInteger offset;
|
||||
SBUInteger length;
|
||||
} IsolatingRange;
|
||||
|
||||
static void PrintRangeOperation(IsolatingRunRef isolatingRun, IsolatingContext *context)
|
||||
{
|
||||
IsolatingRange *range = context->object;
|
||||
SBUInteger offset = BidiChainGetOffset(isolatingRun->bidiChain, context->link);
|
||||
|
||||
if (range->length == 0) {
|
||||
range->offset = offset;
|
||||
range->length = context->length;
|
||||
} else if (offset == (range->offset + range->length)) {
|
||||
range->length += context->length;
|
||||
} else {
|
||||
SB_LOG_RANGE(range->offset, range->length);
|
||||
SB_LOG_DIVIDER(1);
|
||||
|
||||
range->offset = offset;
|
||||
range->length = context->length;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void PrintRunRange(IsolatingRunRef isolatingRun)
|
||||
{
|
||||
IsolatingRange range = { 0, 0 };
|
||||
IsolatingContext context;
|
||||
context.object = ⦥
|
||||
|
||||
IsolatingRunForEach(isolatingRun, &context, _SBPrintRangeOperation);
|
||||
SB_LOG_RANGE(range.offset, range.length);
|
||||
SB_LOG_DIVIDER(1);
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,153 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_LOG_H
|
||||
#define _SB_INTERNAL_LOG_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#ifdef SB_CONFIG_LOG
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
#include "SBBase.h"
|
||||
#include "SBBidiType.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBIsolatingRun.h"
|
||||
|
||||
SB_INTERNAL void PrintBaseLevel(SBLevel baseLevel);
|
||||
SB_INTERNAL void PrintBidiType(SBBidiType type);
|
||||
|
||||
SB_INTERNAL void PrintCodepointSequence(const SBCodepointSequence *codepointSequence);
|
||||
SB_INTERNAL void PrintBidiTypesArray(SBBidiType *types, SBUInteger length);
|
||||
SB_INTERNAL void PrintLevelsArray(SBLevel *levels, SBUInteger length);
|
||||
|
||||
SB_INTERNAL void PrintRunTypes(IsolatingRunRef isolatingRun);
|
||||
SB_INTERNAL void PrintRunLevels(IsolatingRunRef isolatingRun);
|
||||
SB_INTERNAL void PrintRunRange(IsolatingRunRef isolatingRun);
|
||||
|
||||
extern int _SBLogPosition;
|
||||
|
||||
#define SB_LOG_BEGIN() (++_SBLogPosition)
|
||||
#define SB_LOG_END() (--_SBLogPosition)
|
||||
|
||||
#define SB_LOG(s) printf s
|
||||
|
||||
#define SB_LOG_NUMBER(n) \
|
||||
SB_LOG(("%ld", (long)n))
|
||||
|
||||
#define SB_LOG_RANGE(o, l) \
|
||||
SB_LOG(("[%ld, %ld]", (long)o, (long)(o + l - 1)))
|
||||
|
||||
#define SB_LOG_CHAR(c) \
|
||||
SBLOG(("%c", c))
|
||||
|
||||
#define SB_LOG_STRING(s) \
|
||||
SB_LOG(("%s", s))
|
||||
|
||||
#define SB_LOG_LEVEL(l) \
|
||||
SB_LOG_NUMBER(l)
|
||||
|
||||
#define SB_LOG_BREAKER() \
|
||||
SB_LOG(("\n"))
|
||||
|
||||
#define SB_LOG_DIVIDER(n) \
|
||||
SB_LOG(("%.*s", n, "\t\t\t\t\t\t\t\t\t\t"))
|
||||
|
||||
#define SB_LOG_INITIATOR() \
|
||||
SB_LOG_DIVIDER(_SBLogPosition)
|
||||
|
||||
#define SB_LOG_CAPTION(c) \
|
||||
SB_LOG((c":"))
|
||||
|
||||
#define SB_LOG_STATEMENT_TEXT(t) \
|
||||
(t)
|
||||
|
||||
#define SB_LOG_LINE(s) \
|
||||
do { \
|
||||
SB_LOG(s); \
|
||||
SB_LOG_BREAKER(); \
|
||||
} while (0)
|
||||
|
||||
#define SB_LOG_STATEMENT(c, d, t) \
|
||||
do { \
|
||||
SB_LOG_INITIATOR(); \
|
||||
SB_LOG_CAPTION(c); \
|
||||
SB_LOG_DIVIDER(d); \
|
||||
SB_LOG_STATEMENT_TEXT(t); \
|
||||
SB_LOG_BREAKER(); \
|
||||
} while (0)
|
||||
|
||||
#define SB_LOG_BLOCK_OPENER(c) \
|
||||
do { \
|
||||
SB_LOG_INITIATOR(); \
|
||||
SB_LOG_CAPTION(c); \
|
||||
SB_LOG_BREAKER(); \
|
||||
SB_LOG_BEGIN(); \
|
||||
} while (0)
|
||||
|
||||
#define SB_LOG_BLOCK_CLOSER() SB_LOG_END()
|
||||
|
||||
#define SB_LOG_BASE_LEVEL(l) PrintBaseLevel(l)
|
||||
#define SB_LOG_BIDI_TYPE(t) PrintBidiType(t)
|
||||
|
||||
#define SB_LOG_CODEPOINT_SEQUENCE(s) PrintCodepointSequence(s)
|
||||
#define SB_LOG_BIDI_TYPES_ARRAY(a, l) PrintBidiTypesArray(a, l)
|
||||
#define SB_LOG_LEVELS_ARRAY(a, l) PrintLevelsArray(a, l)
|
||||
|
||||
#define SB_LOG_RUN_TYPES(r) PrintRunTypes(r)
|
||||
#define SB_LOG_RUN_LEVELS(r) PrintRunLevels(r)
|
||||
#define SB_LOG_RUN_RANGE(r) PrintRunRange(r)
|
||||
|
||||
#else
|
||||
|
||||
#define SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG(s) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_NUMBER(n) SB_LOG_NONE()
|
||||
#define SB_LOG_RANGE(o, l) SB_LOG_NONE()
|
||||
#define SB_LOG_CHAR(c) SB_LOG_NONE()
|
||||
#define SB_LOG_STRING(s) SB_LOG_NONE()
|
||||
#define SB_LOG_LEVEL(l) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_BREAKER() SB_LOG_NONE()
|
||||
#define SB_LOG_DIVIDER(n) SB_LOG_NONE()
|
||||
#define SB_LOG_INITIATOR() SB_LOG_NONE()
|
||||
#define SB_LOG_CAPTION(c) SB_LOG_NONE()
|
||||
#define SB_LOG_STATEMENT_TEXT(t) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_LINE(s) SB_LOG_NONE()
|
||||
#define SB_LOG_STATEMENT(c, d, t) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_BLOCK_OPENER(c) SB_LOG_NONE()
|
||||
#define SB_LOG_BLOCK_CLOSER() SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_BASE_LEVEL(l) SB_LOG_NONE()
|
||||
#define SB_LOG_BIDI_TYPE(t) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_CODEPOINT_SEQUENCE(s) SB_LOG_NONE()
|
||||
#define SB_LOG_BIDI_TYPES_ARRAY(a, l) SB_LOG_NONE()
|
||||
#define SB_LOG_LEVELS_ARRAY(a, l) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_RUN_TYPES(r) SB_LOG_NONE()
|
||||
#define SB_LOG_RUN_LEVELS(r) SB_LOG_NONE()
|
||||
|
||||
#define SB_LOG_RUN_RANGE(r) SB_LOG_NONE()
|
||||
|
||||
#endif
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,123 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "PairingLookup.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBLine.h"
|
||||
#include "SBMirrorLocator.h"
|
||||
|
||||
SBMirrorLocatorRef SBMirrorLocatorCreate(void)
|
||||
{
|
||||
SBMirrorLocatorRef locator = malloc(sizeof(SBMirrorLocator));
|
||||
|
||||
if (locator) {
|
||||
locator->_line = NULL;
|
||||
locator->retainCount = 1;
|
||||
|
||||
SBMirrorLocatorReset(locator);
|
||||
}
|
||||
|
||||
return locator;
|
||||
}
|
||||
|
||||
void SBMirrorLocatorLoadLine(SBMirrorLocatorRef locator, SBLineRef line, void *stringBuffer)
|
||||
{
|
||||
SBLineRelease(locator->_line);
|
||||
|
||||
if (line && stringBuffer == line->codepointSequence.stringBuffer) {
|
||||
locator->_line = SBLineRetain(line);
|
||||
}
|
||||
|
||||
SBMirrorLocatorReset(locator);
|
||||
}
|
||||
|
||||
const SBMirrorAgent *SBMirrorLocatorGetAgent(SBMirrorLocatorRef locator)
|
||||
{
|
||||
return &locator->agent;
|
||||
}
|
||||
|
||||
SBBoolean SBMirrorLocatorMoveNext(SBMirrorLocatorRef locator)
|
||||
{
|
||||
SBLineRef line = locator->_line;
|
||||
|
||||
if (line) {
|
||||
const SBCodepointSequence *sequence = &line->codepointSequence;
|
||||
|
||||
do {
|
||||
const SBRun *run = &line->fixedRuns[locator->_runIndex];
|
||||
|
||||
if (run->level & 1) {
|
||||
SBUInteger stringIndex;
|
||||
SBUInteger stringLimit;
|
||||
|
||||
stringIndex = locator->_stringIndex;
|
||||
if (stringIndex == SBInvalidIndex) {
|
||||
stringIndex = run->offset;
|
||||
}
|
||||
stringLimit = run->offset + run->length;
|
||||
|
||||
while (stringIndex < stringLimit) {
|
||||
SBUInteger initialIndex = stringIndex;
|
||||
SBCodepoint codepoint = SBCodepointSequenceGetCodepointAt(sequence, &stringIndex);
|
||||
SBCodepoint mirror = LookupMirror(codepoint);
|
||||
|
||||
if (mirror) {
|
||||
locator->_stringIndex = stringIndex;
|
||||
locator->agent.index = initialIndex;
|
||||
locator->agent.mirror = mirror;
|
||||
locator->agent.codepoint = codepoint;
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
locator->_stringIndex = SBInvalidIndex;
|
||||
} while (++locator->_runIndex < line->runCount);
|
||||
|
||||
SBMirrorLocatorReset(locator);
|
||||
}
|
||||
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
void SBMirrorLocatorReset(SBMirrorLocatorRef locator)
|
||||
{
|
||||
locator->_runIndex = 0;
|
||||
locator->_stringIndex = SBInvalidIndex;
|
||||
locator->agent.index = SBInvalidIndex;
|
||||
locator->agent.mirror = 0;
|
||||
}
|
||||
|
||||
SBMirrorLocatorRef SBMirrorLocatorRetain(SBMirrorLocatorRef locator)
|
||||
{
|
||||
if (locator) {
|
||||
locator->retainCount += 1;
|
||||
}
|
||||
|
||||
return locator;
|
||||
}
|
||||
|
||||
void SBMirrorLocatorRelease(SBMirrorLocatorRef locator)
|
||||
{
|
||||
if (locator && --locator->retainCount == 0) {
|
||||
SBLineRelease(locator->_line);
|
||||
free(locator);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,32 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_MIRROR_LOCATOR_H
|
||||
#define _SB_INTERNAL_MIRROR_LOCATOR_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBMirrorLocator.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBLine.h>
|
||||
|
||||
typedef struct _SBMirrorLocator {
|
||||
SBLineRef _line;
|
||||
SBUInteger _runIndex;
|
||||
SBUInteger _stringIndex;
|
||||
SBMirrorAgent agent;
|
||||
SBUInteger retainCount;
|
||||
} SBMirrorLocator;
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,702 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "BidiChain.h"
|
||||
#include "BidiTypeLookup.h"
|
||||
#include "IsolatingRun.h"
|
||||
#include "LevelRun.h"
|
||||
#include "RunQueue.h"
|
||||
#include "SBAlgorithm.h"
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "SBLine.h"
|
||||
#include "SBLog.h"
|
||||
#include "StatusStack.h"
|
||||
#include "SBParagraph.h"
|
||||
|
||||
typedef struct _ParagraphContext {
|
||||
BidiChain bidiChain;
|
||||
StatusStack statusStack;
|
||||
RunQueue runQueue;
|
||||
IsolatingRun isolatingRun;
|
||||
} ParagraphContext, *ParagraphContextRef;
|
||||
|
||||
static void PopulateBidiChain(BidiChainRef chain, const SBBidiType *types, SBUInteger length);
|
||||
static SBBoolean ProcessRun(ParagraphContextRef context, const LevelRunRef levelRun, SBBoolean forceFinish);
|
||||
|
||||
static ParagraphContextRef CreateParagraphContext(const SBBidiType *types, SBLevel *levels, SBUInteger length)
|
||||
{
|
||||
const SBUInteger sizeContext = sizeof(ParagraphContext);
|
||||
const SBUInteger sizeLinks = sizeof(BidiLink) * (length + 2);
|
||||
const SBUInteger sizeTypes = sizeof(SBBidiType) * (length + 2);
|
||||
const SBUInteger sizeMemory = sizeContext + sizeLinks + sizeTypes;
|
||||
|
||||
void *pointer = malloc(sizeMemory);
|
||||
|
||||
if (pointer) {
|
||||
const SBUInteger offsetContext = 0;
|
||||
const SBUInteger offsetLinks = offsetContext + sizeContext;
|
||||
const SBUInteger offsetTypes = offsetLinks + sizeLinks;
|
||||
|
||||
SBUInt8 *memory = (SBUInt8 *)pointer;
|
||||
ParagraphContextRef context = (ParagraphContextRef)(memory + offsetContext);
|
||||
BidiLink *fixedLinks = (BidiLink *)(memory + offsetLinks);
|
||||
SBBidiType *fixedTypes = (SBBidiType *)(memory + offsetTypes);
|
||||
|
||||
BidiChainInitialize(&context->bidiChain, fixedTypes, levels, fixedLinks);
|
||||
StatusStackInitialize(&context->statusStack);
|
||||
RunQueueInitialize(&context->runQueue);
|
||||
IsolatingRunInitialize(&context->isolatingRun);
|
||||
|
||||
PopulateBidiChain(&context->bidiChain, types, length);
|
||||
|
||||
return context;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static void DisposeParagraphContext(ParagraphContextRef context)
|
||||
{
|
||||
StatusStackFinalize(&context->statusStack);
|
||||
RunQueueFinalize(&context->runQueue);
|
||||
IsolatingRunFinalize(&context->isolatingRun);
|
||||
free(context);
|
||||
}
|
||||
|
||||
static SBParagraphRef AllocateParagraph(SBUInteger length)
|
||||
{
|
||||
const SBUInteger sizeParagraph = sizeof(SBParagraph);
|
||||
const SBUInteger sizeLevels = sizeof(SBLevel) * (length + 2);
|
||||
const SBUInteger sizeMemory = sizeParagraph + sizeLevels;
|
||||
|
||||
void *pointer = malloc(sizeMemory);
|
||||
|
||||
if (pointer) {
|
||||
const SBUInteger offsetParagraph = 0;
|
||||
const SBUInteger offsetLevels = offsetParagraph + sizeParagraph;
|
||||
|
||||
SBUInt8 *memory = (SBUInt8 *)pointer;
|
||||
SBParagraphRef paragraph = (SBParagraphRef)(memory + offsetParagraph);
|
||||
SBLevel *levels = (SBLevel *)(memory + offsetLevels);
|
||||
|
||||
paragraph->fixedLevels = levels;
|
||||
|
||||
return paragraph;
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
static void DisposeParagraph(SBParagraphRef paragraph)
|
||||
{
|
||||
free(paragraph);
|
||||
}
|
||||
|
||||
static SBUInteger DetermineBoundary(SBAlgorithmRef algorithm, SBUInteger paragraphOffset, SBUInteger suggestedLength)
|
||||
{
|
||||
SBBidiType *bidiTypes = algorithm->fixedTypes;
|
||||
SBUInteger suggestedLimit = paragraphOffset + suggestedLength;
|
||||
SBUInteger stringIndex;
|
||||
|
||||
for (stringIndex = paragraphOffset; stringIndex < suggestedLimit; stringIndex++) {
|
||||
if (bidiTypes[stringIndex] == SBBidiTypeB) {
|
||||
stringIndex += SBAlgorithmGetSeparatorLength(algorithm, stringIndex);
|
||||
goto Return;
|
||||
}
|
||||
}
|
||||
|
||||
Return:
|
||||
return (stringIndex - paragraphOffset);
|
||||
}
|
||||
|
||||
static void PopulateBidiChain(BidiChainRef chain, const SBBidiType *types, SBUInteger length)
|
||||
{
|
||||
SBBidiType type = SBBidiTypeNil;
|
||||
SBUInteger priorIndex = SBInvalidIndex;
|
||||
SBUInteger index;
|
||||
|
||||
for (index = 0; index < length; index++) {
|
||||
SBBidiType priorType = type;
|
||||
type = types[index];
|
||||
|
||||
switch (type) {
|
||||
case SBBidiTypeB:
|
||||
case SBBidiTypeON:
|
||||
case SBBidiTypeLRE:
|
||||
case SBBidiTypeRLE:
|
||||
case SBBidiTypeLRO:
|
||||
case SBBidiTypeRLO:
|
||||
case SBBidiTypePDF:
|
||||
case SBBidiTypeLRI:
|
||||
case SBBidiTypeRLI:
|
||||
case SBBidiTypeFSI:
|
||||
case SBBidiTypePDI:
|
||||
BidiChainAdd(chain, type, index - priorIndex);
|
||||
priorIndex = index;
|
||||
|
||||
if (type == SBBidiTypeB) {
|
||||
index = length;
|
||||
goto AddLast;
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
if (type != priorType) {
|
||||
BidiChainAdd(chain, type, index - priorIndex);
|
||||
priorIndex = index;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
AddLast:
|
||||
BidiChainAdd(chain, SBBidiTypeNil, index - priorIndex);
|
||||
}
|
||||
|
||||
static BidiLink SkipIsolatingRun(BidiChainRef chain, BidiLink skipLink, BidiLink breakLink)
|
||||
{
|
||||
BidiLink link = skipLink;
|
||||
SBUInteger depth = 1;
|
||||
|
||||
while ((link = BidiChainGetNext(chain, link)) != breakLink) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
|
||||
switch (type) {
|
||||
case SBBidiTypeLRI:
|
||||
case SBBidiTypeRLI:
|
||||
case SBBidiTypeFSI:
|
||||
depth += 1;
|
||||
break;
|
||||
|
||||
case SBBidiTypePDI:
|
||||
if (--depth == 0) {
|
||||
return link;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
return BidiLinkNone;
|
||||
}
|
||||
|
||||
static SBLevel DetermineBaseLevel(BidiChainRef chain, BidiLink skipLink, BidiLink breakLink, SBLevel defaultLevel, SBBoolean isIsolate)
|
||||
{
|
||||
BidiLink link = skipLink;
|
||||
|
||||
/* Rules P2, P3 */
|
||||
while ((link = BidiChainGetNext(chain, link)) != breakLink) {
|
||||
SBBidiType type = BidiChainGetType(chain, link);
|
||||
|
||||
switch (type) {
|
||||
case SBBidiTypeL:
|
||||
return 0;
|
||||
|
||||
case SBBidiTypeAL:
|
||||
case SBBidiTypeR:
|
||||
return 1;
|
||||
|
||||
case SBBidiTypeLRI:
|
||||
case SBBidiTypeRLI:
|
||||
case SBBidiTypeFSI:
|
||||
link = SkipIsolatingRun(chain, link, breakLink);
|
||||
if (link == BidiLinkNone) {
|
||||
goto Default;
|
||||
}
|
||||
break;
|
||||
|
||||
case SBBidiTypePDI:
|
||||
if (isIsolate) {
|
||||
/*
|
||||
* In case of isolating run, the PDI will be the last code point.
|
||||
* NOTE:
|
||||
* The inner isolating runs will be skipped by the case above this one.
|
||||
*/
|
||||
goto Default;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
Default:
|
||||
return defaultLevel;
|
||||
}
|
||||
|
||||
static SBLevel DetermineParagraphLevel(BidiChainRef chain, SBLevel baseLevel)
|
||||
{
|
||||
if (baseLevel >= SBLevelMax) {
|
||||
return DetermineBaseLevel(chain, chain->roller, chain->roller,
|
||||
(baseLevel != SBLevelDefaultRTL ? 0 : 1),
|
||||
SBFalse);
|
||||
}
|
||||
|
||||
return baseLevel;
|
||||
}
|
||||
|
||||
static SBBoolean DetermineLevels(ParagraphContextRef context, SBLevel baseLevel)
|
||||
{
|
||||
BidiChainRef chain = &context->bidiChain;
|
||||
StatusStackRef stack = &context->statusStack;
|
||||
BidiLink roller = chain->roller;
|
||||
BidiLink link;
|
||||
|
||||
BidiLink priorLink;
|
||||
BidiLink firstLink;
|
||||
BidiLink lastLink;
|
||||
|
||||
SBLevel priorLevel;
|
||||
SBBidiType sor;
|
||||
SBBidiType eor;
|
||||
|
||||
SBUInteger overIsolate;
|
||||
SBUInteger overEmbedding;
|
||||
SBUInteger validIsolate;
|
||||
|
||||
priorLink = chain->roller;
|
||||
firstLink = BidiLinkNone;
|
||||
lastLink = BidiLinkNone;
|
||||
|
||||
priorLevel = baseLevel;
|
||||
sor = SBBidiTypeNil;
|
||||
|
||||
/* Rule X1 */
|
||||
overIsolate = 0;
|
||||
overEmbedding = 0;
|
||||
validIsolate = 0;
|
||||
|
||||
StatusStackPush(stack, baseLevel, SBBidiTypeON, SBFalse);
|
||||
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBBoolean forceFinish = SBFalse;
|
||||
SBBoolean bnEquivalent = SBFalse;
|
||||
SBBidiType type;
|
||||
|
||||
type = BidiChainGetType(chain, link);
|
||||
|
||||
#define LeastGreaterOddLevel() \
|
||||
( \
|
||||
(StatusStackGetEmbeddingLevel(stack) + 1) | 1 \
|
||||
)
|
||||
|
||||
#define LeastGreaterEvenLevel() \
|
||||
( \
|
||||
(StatusStackGetEmbeddingLevel(stack) + 2) & ~1 \
|
||||
)
|
||||
|
||||
#define MergeLinkIfNeeded() \
|
||||
{ \
|
||||
if (BidiChainMergeIfEqual(chain, priorLink, link)) { \
|
||||
continue; \
|
||||
} \
|
||||
}
|
||||
|
||||
#define PushEmbedding(l, o) \
|
||||
{ \
|
||||
SBLevel newLevel = l; \
|
||||
\
|
||||
bnEquivalent = SBTrue; \
|
||||
\
|
||||
if (newLevel <= SBLevelMax && !overIsolate && !overEmbedding) { \
|
||||
if (!StatusStackPush(stack, newLevel, o, SBFalse)) { \
|
||||
return SBFalse; \
|
||||
} \
|
||||
} else { \
|
||||
if (!overIsolate) { \
|
||||
overEmbedding += 1; \
|
||||
} \
|
||||
} \
|
||||
}
|
||||
|
||||
#define PushIsolate(l, o) \
|
||||
{ \
|
||||
SBBidiType priorStatus = StatusStackGetOverrideStatus(stack); \
|
||||
SBLevel newLevel = l; \
|
||||
\
|
||||
BidiChainSetLevel(chain, link, \
|
||||
StatusStackGetEmbeddingLevel(stack)); \
|
||||
\
|
||||
if (newLevel <= SBLevelMax && !overIsolate && !overEmbedding) { \
|
||||
validIsolate += 1; \
|
||||
\
|
||||
if (!StatusStackPush(stack, newLevel, o, SBTrue)) { \
|
||||
return SBFalse; \
|
||||
} \
|
||||
} else { \
|
||||
overIsolate += 1; \
|
||||
} \
|
||||
\
|
||||
if (priorStatus != SBBidiTypeON) { \
|
||||
BidiChainSetType(chain, link, priorStatus); \
|
||||
MergeLinkIfNeeded(); \
|
||||
} \
|
||||
}
|
||||
|
||||
switch (type) {
|
||||
/* Rule X2 */
|
||||
case SBBidiTypeRLE:
|
||||
PushEmbedding(LeastGreaterOddLevel(), SBBidiTypeON);
|
||||
break;
|
||||
|
||||
/* Rule X3 */
|
||||
case SBBidiTypeLRE:
|
||||
PushEmbedding(LeastGreaterEvenLevel(), SBBidiTypeON);
|
||||
break;
|
||||
|
||||
/* Rule X4 */
|
||||
case SBBidiTypeRLO:
|
||||
PushEmbedding(LeastGreaterOddLevel(), SBBidiTypeR);
|
||||
break;
|
||||
|
||||
/* Rule X5 */
|
||||
case SBBidiTypeLRO:
|
||||
PushEmbedding(LeastGreaterEvenLevel(), SBBidiTypeL);
|
||||
break;
|
||||
|
||||
/* Rule X5a */
|
||||
case SBBidiTypeRLI:
|
||||
PushIsolate(LeastGreaterOddLevel(), SBBidiTypeON);
|
||||
break;
|
||||
|
||||
/* Rule X5b */
|
||||
case SBBidiTypeLRI:
|
||||
PushIsolate(LeastGreaterEvenLevel(), SBBidiTypeON);
|
||||
break;
|
||||
|
||||
/* Rule X5c */
|
||||
case SBBidiTypeFSI:
|
||||
{
|
||||
SBBoolean isRTL = (DetermineBaseLevel(chain, link, roller, 0, SBTrue) == 1);
|
||||
PushIsolate(isRTL ? LeastGreaterOddLevel() : LeastGreaterEvenLevel(), SBBidiTypeON);
|
||||
break;
|
||||
}
|
||||
|
||||
/* Rule X6 */
|
||||
default:
|
||||
BidiChainSetLevel(chain, link, StatusStackGetEmbeddingLevel(stack));
|
||||
|
||||
if (StatusStackGetOverrideStatus(stack) != SBBidiTypeON) {
|
||||
BidiChainSetType(chain, link, StatusStackGetOverrideStatus(stack));
|
||||
MergeLinkIfNeeded();
|
||||
}
|
||||
break;
|
||||
|
||||
/* Rule X6a */
|
||||
case SBBidiTypePDI:
|
||||
{
|
||||
SBBidiType overrideStatus;
|
||||
|
||||
if (overIsolate != 0) {
|
||||
overIsolate -= 1;
|
||||
} else if (validIsolate == 0) {
|
||||
/* Do nothing */
|
||||
} else {
|
||||
overEmbedding = 0;
|
||||
|
||||
while (!StatusStackGetIsolateStatus(stack)) {
|
||||
StatusStackPop(stack);
|
||||
}
|
||||
StatusStackPop(stack);
|
||||
|
||||
validIsolate -= 1;
|
||||
}
|
||||
|
||||
BidiChainSetLevel(chain, link, StatusStackGetEmbeddingLevel(stack));
|
||||
overrideStatus = StatusStackGetOverrideStatus(stack);
|
||||
|
||||
if (overrideStatus != SBBidiTypeON) {
|
||||
BidiChainSetType(chain, link, overrideStatus);
|
||||
MergeLinkIfNeeded();
|
||||
}
|
||||
break;
|
||||
}
|
||||
|
||||
/* Rule X7 */
|
||||
case SBBidiTypePDF:
|
||||
bnEquivalent = SBTrue;
|
||||
|
||||
if (overIsolate != 0) {
|
||||
/* Do nothing */
|
||||
} else if (overEmbedding != 0) {
|
||||
overEmbedding -= 1;
|
||||
} else if (!StatusStackGetIsolateStatus(stack) && stack->count >= 2) {
|
||||
StatusStackPop(stack);
|
||||
}
|
||||
break;
|
||||
|
||||
/* Rule X8 */
|
||||
case SBBidiTypeB:
|
||||
/*
|
||||
* These values are reset for clarity, in this implementation B can only occur as the
|
||||
* last code in the array.
|
||||
*/
|
||||
StatusStackSetEmpty(stack);
|
||||
StatusStackPush(stack, baseLevel, SBBidiTypeON, SBFalse);
|
||||
|
||||
overIsolate = 0;
|
||||
overEmbedding = 0;
|
||||
validIsolate = 0;
|
||||
|
||||
BidiChainSetLevel(chain, link, baseLevel);
|
||||
break;
|
||||
|
||||
case SBBidiTypeBN:
|
||||
bnEquivalent = SBTrue;
|
||||
break;
|
||||
|
||||
case SBBidiTypeNil:
|
||||
forceFinish = SBTrue;
|
||||
BidiChainSetLevel(chain, link, baseLevel);
|
||||
break;
|
||||
}
|
||||
|
||||
/* Rule X9 */
|
||||
if (bnEquivalent) {
|
||||
/* The type of this link is BN equivalent, so abandon it and continue the loop. */
|
||||
BidiChainSetType(chain, link, SBBidiTypeBN);
|
||||
BidiChainAbandonNext(chain, priorLink);
|
||||
continue;
|
||||
}
|
||||
|
||||
if (sor == SBBidiTypeNil) {
|
||||
sor = SBLevelAsNormalBidiType(SBNumberGetMax(baseLevel, BidiChainGetLevel(chain, link)));
|
||||
firstLink = link;
|
||||
priorLevel = BidiChainGetLevel(chain, link);
|
||||
} else if (priorLevel != BidiChainGetLevel(chain, link) || forceFinish) {
|
||||
LevelRun levelRun;
|
||||
SBLevel currentLevel;
|
||||
|
||||
/* Since the level has changed at this link, therefore the run must end at prior link. */
|
||||
lastLink = priorLink;
|
||||
|
||||
/* Save the current level i.e. level of the next run. */
|
||||
currentLevel = BidiChainGetLevel(chain, link);
|
||||
/*
|
||||
* Now we have both the prior level and the current level i.e. unchanged levels of both
|
||||
* the current run and the next run. So, identify eor of the current run.
|
||||
* NOTE:
|
||||
* sor of the run has been already determined at this stage.
|
||||
*/
|
||||
eor = SBLevelAsNormalBidiType(SBNumberGetMax(priorLevel, currentLevel));
|
||||
|
||||
LevelRunInitialize(&levelRun, chain, firstLink, lastLink, sor, eor);
|
||||
|
||||
if (!ProcessRun(context, &levelRun, forceFinish)) {
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
/* The sor of next run (if any) should be technically equal to eor of this run. */
|
||||
sor = eor;
|
||||
/* The next run (if any) will start from this index. */
|
||||
firstLink = link;
|
||||
|
||||
priorLevel = currentLevel;
|
||||
}
|
||||
|
||||
priorLink = link;
|
||||
}
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
static SBBoolean ProcessRun(ParagraphContextRef context, const LevelRunRef levelRun, SBBoolean forceFinish)
|
||||
{
|
||||
RunQueueRef queue = &context->runQueue;
|
||||
|
||||
if (!RunQueueEnqueue(queue, levelRun)) {
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
if (queue->shouldDequeue || forceFinish) {
|
||||
IsolatingRunRef isolatingRun = &context->isolatingRun;
|
||||
LevelRunRef peek;
|
||||
|
||||
/* Rule X10 */
|
||||
for (; queue->count != 0; RunQueueDequeue(queue)) {
|
||||
peek = queue->peek;
|
||||
if (RunKindIsAttachedTerminating(peek->kind)) {
|
||||
continue;
|
||||
}
|
||||
|
||||
isolatingRun->baseLevelRun = peek;
|
||||
|
||||
if (!IsolatingRunResolve(isolatingRun)) {
|
||||
return SBFalse;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
static void SaveLevels(BidiChainRef chain, SBLevel *levels, SBLevel baseLevel)
|
||||
{
|
||||
BidiLink roller = chain->roller;
|
||||
BidiLink link;
|
||||
|
||||
SBUInteger index = 0;
|
||||
SBLevel level = baseLevel;
|
||||
|
||||
BidiChainForEach(chain, roller, link) {
|
||||
SBUInteger offset = BidiChainGetOffset(chain, link);
|
||||
|
||||
for (; index < offset; index++) {
|
||||
levels[index] = level;
|
||||
}
|
||||
|
||||
level = BidiChainGetLevel(chain, link);
|
||||
}
|
||||
}
|
||||
|
||||
static SBBoolean ResolveParagraph(SBParagraphRef paragraph,
|
||||
SBAlgorithmRef algorithm, SBUInteger offset, SBUInteger length, SBLevel baseLevel)
|
||||
{
|
||||
const SBBidiType *bidiTypes = algorithm->fixedTypes + offset;
|
||||
SBBoolean isSucceeded = SBFalse;
|
||||
ParagraphContextRef context;
|
||||
SBLevel resolvedLevel;
|
||||
|
||||
context = CreateParagraphContext(bidiTypes, paragraph->fixedLevels, length);
|
||||
|
||||
if (context) {
|
||||
resolvedLevel = DetermineParagraphLevel(&context->bidiChain, baseLevel);
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Determined Paragraph Level");
|
||||
SB_LOG_STATEMENT("Base Level", 1, SB_LOG_LEVEL(resolvedLevel));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
context->isolatingRun.codepointSequence = &algorithm->codepointSequence;
|
||||
context->isolatingRun.bidiTypes = bidiTypes;
|
||||
context->isolatingRun.bidiChain = &context->bidiChain;
|
||||
context->isolatingRun.paragraphOffset = offset;
|
||||
context->isolatingRun.paragraphLevel = resolvedLevel;
|
||||
|
||||
if (DetermineLevels(context, resolvedLevel)) {
|
||||
SaveLevels(&context->bidiChain, ++paragraph->fixedLevels, resolvedLevel);
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Determined Embedding Levels");
|
||||
SB_LOG_STATEMENT("Levels", 1, SB_LOG_LEVELS_ARRAY(paragraph->fixedLevels, length));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
paragraph->algorithm = SBAlgorithmRetain(algorithm);
|
||||
paragraph->refTypes = bidiTypes;
|
||||
paragraph->offset = offset;
|
||||
paragraph->length = length;
|
||||
paragraph->baseLevel = resolvedLevel;
|
||||
paragraph->retainCount = 1;
|
||||
|
||||
isSucceeded = SBTrue;
|
||||
}
|
||||
|
||||
DisposeParagraphContext(context);
|
||||
}
|
||||
|
||||
return isSucceeded;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBParagraphRef SBParagraphCreate(SBAlgorithmRef algorithm,
|
||||
SBUInteger paragraphOffset, SBUInteger suggestedLength, SBLevel baseLevel)
|
||||
{
|
||||
const SBCodepointSequence *codepointSequence = &algorithm->codepointSequence;
|
||||
SBUInteger stringLength = codepointSequence->stringLength;
|
||||
SBUInteger actualLength;
|
||||
|
||||
SBParagraphRef paragraph;
|
||||
|
||||
/* The given range MUST be valid. */
|
||||
SBAssert(SBUIntegerVerifyRange(stringLength, paragraphOffset, suggestedLength) && suggestedLength > 0);
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Paragraph Input");
|
||||
SB_LOG_STATEMENT("Paragraph Offset", 1, SB_LOG_NUMBER(paragraphOffset));
|
||||
SB_LOG_STATEMENT("Suggested Length", 1, SB_LOG_NUMBER(suggestedLength));
|
||||
SB_LOG_STATEMENT("Base Direction", 1, SB_LOG_BASE_LEVEL(baseLevel));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
actualLength = DetermineBoundary(algorithm, paragraphOffset, suggestedLength);
|
||||
|
||||
SB_LOG_BLOCK_OPENER("Determined Paragraph Boundary");
|
||||
SB_LOG_STATEMENT("Actual Length", 1, SB_LOG_NUMBER(actualLength));
|
||||
SB_LOG_BLOCK_CLOSER();
|
||||
|
||||
paragraph = AllocateParagraph(actualLength);
|
||||
|
||||
if (paragraph) {
|
||||
if (ResolveParagraph(paragraph, algorithm, paragraphOffset, actualLength, baseLevel)) {
|
||||
return paragraph;
|
||||
}
|
||||
|
||||
DisposeParagraph(paragraph);
|
||||
}
|
||||
|
||||
SB_LOG_BREAKER();
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
SBUInteger SBParagraphGetOffset(SBParagraphRef paragraph)
|
||||
{
|
||||
return paragraph->offset;
|
||||
}
|
||||
|
||||
SBUInteger SBParagraphGetLength(SBParagraphRef paragraph)
|
||||
{
|
||||
return paragraph->length;
|
||||
}
|
||||
|
||||
SBLevel SBParagraphGetBaseLevel(SBParagraphRef paragraph)
|
||||
{
|
||||
return paragraph->baseLevel;
|
||||
}
|
||||
|
||||
const SBLevel *SBParagraphGetLevelsPtr(SBParagraphRef paragraph)
|
||||
{
|
||||
return paragraph->fixedLevels;
|
||||
}
|
||||
|
||||
SBLineRef SBParagraphCreateLine(SBParagraphRef paragraph, SBUInteger lineOffset, SBUInteger lineLength)
|
||||
{
|
||||
SBUInteger paragraphOffset = paragraph->offset;
|
||||
SBUInteger paragraphLength = paragraph->length;
|
||||
SBUInteger paragraphLimit = paragraphOffset + paragraphLength;
|
||||
SBUInteger lineLimit = lineOffset + lineLength;
|
||||
|
||||
if (lineOffset < lineLimit && lineOffset >= paragraphOffset && lineLimit <= paragraphLimit) {
|
||||
return SBLineCreate(paragraph, lineOffset, lineLength);
|
||||
}
|
||||
|
||||
return NULL;
|
||||
}
|
||||
|
||||
SBParagraphRef SBParagraphRetain(SBParagraphRef paragraph)
|
||||
{
|
||||
if (paragraph) {
|
||||
paragraph->retainCount += 1;
|
||||
}
|
||||
|
||||
return paragraph;
|
||||
}
|
||||
|
||||
void SBParagraphRelease(SBParagraphRef paragraph)
|
||||
{
|
||||
if (paragraph && --paragraph->retainCount == 0) {
|
||||
SBAlgorithmRelease(paragraph->algorithm);
|
||||
DisposeParagraph(paragraph);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,38 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_PARAGRAPH_H
|
||||
#define _SB_INTERNAL_PARAGRAPH_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBAlgorithm.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBParagraph.h>
|
||||
|
||||
typedef struct _SBParagraph {
|
||||
SBAlgorithmRef algorithm;
|
||||
const SBBidiType *refTypes;
|
||||
SBLevel *fixedLevels;
|
||||
SBUInteger offset;
|
||||
SBUInteger length;
|
||||
SBLevel baseLevel;
|
||||
SBUInteger retainCount;
|
||||
} SBParagraph;
|
||||
|
||||
SB_INTERNAL SBParagraphRef SBParagraphCreate(SBAlgorithmRef algorithm,
|
||||
SBUInteger paragraphOffset, SBUInteger suggestedLength, SBLevel baseLevel);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,176 @@
|
||||
/*
|
||||
* Copyright (C) 2018-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "GeneralCategoryLookup.h"
|
||||
#include "PairingLookup.h"
|
||||
#include "SBBase.h"
|
||||
#include "SBCodepointSequence.h"
|
||||
#include "ScriptLookup.h"
|
||||
#include "ScriptStack.h"
|
||||
#include "SBScriptLocator.h"
|
||||
|
||||
static SBBoolean IsSimilarScript(SBScript lhs, SBScript rhs)
|
||||
{
|
||||
return SBScriptIsCommonOrInherited(lhs)
|
||||
|| SBScriptIsCommonOrInherited(rhs)
|
||||
|| lhs == rhs;
|
||||
}
|
||||
|
||||
SBScriptLocatorRef SBScriptLocatorCreate(void)
|
||||
{
|
||||
SBScriptLocatorRef locator = malloc(sizeof(SBScriptLocator));
|
||||
|
||||
if (locator) {
|
||||
locator->_codepointSequence.stringEncoding = SBStringEncodingUTF8;
|
||||
locator->_codepointSequence.stringBuffer = NULL;
|
||||
locator->_codepointSequence.stringLength = 0;
|
||||
locator->retainCount = 1;
|
||||
|
||||
SBScriptLocatorReset(locator);
|
||||
}
|
||||
|
||||
return locator;
|
||||
}
|
||||
|
||||
void SBScriptLocatorLoadCodepoints(SBScriptLocatorRef locator, const SBCodepointSequence *codepointSequence)
|
||||
{
|
||||
locator->_codepointSequence = *codepointSequence;
|
||||
SBScriptLocatorReset(locator);
|
||||
}
|
||||
|
||||
const SBScriptAgent *SBScriptLocatorGetAgent(SBScriptLocatorRef locator)
|
||||
{
|
||||
return &locator->agent;
|
||||
}
|
||||
|
||||
static void ResolveScriptRun(SBScriptLocatorRef locator, SBUInteger offset)
|
||||
{
|
||||
const SBCodepointSequence *sequence = &locator->_codepointSequence;
|
||||
ScriptStackRef stack = &locator->_scriptStack;
|
||||
SBScript result = SBScriptZYYY;
|
||||
SBUInteger current = offset;
|
||||
SBUInteger next = offset;
|
||||
SBCodepoint codepoint;
|
||||
|
||||
/* Iterate over the code points of specified string buffer. */
|
||||
while ((codepoint = SBCodepointSequenceGetCodepointAt(sequence, &next)) != SBCodepointInvalid) {
|
||||
SBBoolean isStacked = SBFalse;
|
||||
SBScript script;
|
||||
|
||||
script = LookupScript(codepoint);
|
||||
|
||||
/* Handle paired punctuations in case of a common script. */
|
||||
if (script == SBScriptZYYY) {
|
||||
SBGeneralCategory generalCategory = LookupGeneralCategory(codepoint);
|
||||
|
||||
/* Check if current code point is an open punctuation. */
|
||||
if (generalCategory == SBGeneralCategoryPS) {
|
||||
SBCodepoint mirror = LookupMirror(codepoint);
|
||||
if (mirror) {
|
||||
/* A closing pair exists for this punctuation, so push it onto the stack. */
|
||||
ScriptStackPush(stack, result, mirror);
|
||||
}
|
||||
}
|
||||
/* Check if current code point is a close punctuation. */
|
||||
else if (generalCategory == SBGeneralCategoryPE) {
|
||||
SBBoolean isMirrored = (LookupMirror(codepoint) != 0);
|
||||
if (isMirrored) {
|
||||
/* Find the matching entry in the stack, while popping the unmatched ones. */
|
||||
while (!ScriptStackIsEmpty(stack)) {
|
||||
SBCodepoint mirror = ScriptStackGetMirror(stack);
|
||||
if (mirror != codepoint) {
|
||||
ScriptStackPop(stack);
|
||||
} else {
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (!ScriptStackIsEmpty(stack)) {
|
||||
isStacked = SBTrue;
|
||||
/* Paired punctuation match the script of enclosing text. */
|
||||
script = ScriptStackGetScript(stack);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (IsSimilarScript(result, script)) {
|
||||
if (SBScriptIsCommonOrInherited(result) && !SBScriptIsCommonOrInherited(script)) {
|
||||
/* Set the concrete script of this code point as the result. */
|
||||
result = script;
|
||||
/* Seal the pending punctuations with the result. */
|
||||
ScriptStackSealPairs(stack, result);
|
||||
}
|
||||
|
||||
if (isStacked) {
|
||||
/* Pop the paired punctuation from the stack. */
|
||||
ScriptStackPop(stack);
|
||||
}
|
||||
} else {
|
||||
/* The current code point has a different script, so finish the run. */
|
||||
break;
|
||||
}
|
||||
|
||||
current = next;
|
||||
}
|
||||
|
||||
ScriptStackLeavePairs(stack);
|
||||
|
||||
/* Set the run info in agent. */
|
||||
locator->agent.offset = offset;
|
||||
locator->agent.length = current - offset;
|
||||
locator->agent.script = result;
|
||||
}
|
||||
|
||||
SBBoolean SBScriptLocatorMoveNext(SBScriptLocatorRef locator)
|
||||
{
|
||||
SBUInteger offset = locator->agent.offset + locator->agent.length;
|
||||
|
||||
if (offset < locator->_codepointSequence.stringLength) {
|
||||
ResolveScriptRun(locator, offset);
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
SBScriptLocatorReset(locator);
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
void SBScriptLocatorReset(SBScriptLocatorRef locator)
|
||||
{
|
||||
ScriptStackReset(&locator->_scriptStack);
|
||||
locator->agent.offset = 0;
|
||||
locator->agent.length = 0;
|
||||
locator->agent.script = SBScriptNil;
|
||||
}
|
||||
|
||||
SBScriptLocatorRef SBScriptLocatorRetain(SBScriptLocatorRef locator)
|
||||
{
|
||||
if (locator) {
|
||||
locator->retainCount += 1;
|
||||
}
|
||||
|
||||
return locator;
|
||||
}
|
||||
|
||||
void SBScriptLocatorRelease(SBScriptLocatorRef locator)
|
||||
{
|
||||
if (locator && --locator->retainCount == 0) {
|
||||
free(locator);
|
||||
}
|
||||
}
|
||||
@@ -0,0 +1,33 @@
|
||||
/*
|
||||
* Copyright (C) 2018-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_SCRIPT_LOCATOR_H
|
||||
#define _SB_INTERNAL_SCRIPT_LOCATOR_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBCodepointSequence.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBScriptLocator.h>
|
||||
|
||||
#include "ScriptStack.h"
|
||||
|
||||
typedef struct _SBScriptLocator {
|
||||
SBCodepointSequence _codepointSequence;
|
||||
ScriptStack _scriptStack;
|
||||
SBScriptAgent agent;
|
||||
SBUInteger retainCount;
|
||||
} SBScriptLocator;
|
||||
|
||||
#endif
|
||||
File diff suppressed because it is too large
Load Diff
@@ -0,0 +1,16 @@
|
||||
/*
|
||||
* Automatically generated by SheenBidiGenerator tool.
|
||||
* DO NOT EDIT!!
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_SCRIPT_LOOKUP_H
|
||||
#define _SB_INTERNAL_SCRIPT_LOOKUP_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBScript.h>
|
||||
|
||||
#include "SBBase.h"
|
||||
|
||||
SB_INTERNAL SBScript LookupScript(SBCodepoint codepoint);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,83 @@
|
||||
/*
|
||||
* Copyright (C) 2018-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "ScriptStack.h"
|
||||
|
||||
SB_INTERNAL void ScriptStackReset(ScriptStackRef stack)
|
||||
{
|
||||
stack->top = -1;
|
||||
stack->count = 0;
|
||||
stack->open = 0;
|
||||
}
|
||||
|
||||
SB_INTERNAL void ScriptStackPush(ScriptStackRef stack, SBScript script, SBCodepoint mirror)
|
||||
{
|
||||
stack->count = SBNumberLimitIncrement(stack->count, _SBScriptStackCapacity);
|
||||
stack->open = SBNumberLimitIncrement(stack->open, _SBScriptStackCapacity);
|
||||
|
||||
stack->top = SBNumberRingIncrement(stack->top, _SBScriptStackCapacity);
|
||||
stack->_elements[stack->top].script = script;
|
||||
stack->_elements[stack->top].mirror = mirror;
|
||||
}
|
||||
|
||||
SB_INTERNAL void ScriptStackPop(ScriptStackRef stack)
|
||||
{
|
||||
/* There must be at least one entry in the stack. */
|
||||
SBAssert(stack->count > 0);
|
||||
|
||||
stack->count -= 1;
|
||||
stack->open = SBNumberLimitDecrement(stack->open, 0);
|
||||
stack->top = SBNumberRingDecrement(stack->top, _SBScriptStackCapacity);
|
||||
|
||||
if (ScriptStackIsEmpty(stack)) {
|
||||
stack->top = -1;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL void ScriptStackLeavePairs(ScriptStackRef stack)
|
||||
{
|
||||
stack->open = 0;
|
||||
}
|
||||
|
||||
SB_INTERNAL void ScriptStackSealPairs(ScriptStackRef stack, SBScript script)
|
||||
{
|
||||
SBInteger index = SBNumberRingSubtract(stack->top, (SBInteger)stack->open, _SBScriptStackCapacity);
|
||||
|
||||
while (stack->open) {
|
||||
index = SBNumberRingIncrement(index, _SBScriptStackCapacity);
|
||||
stack->_elements[index].script = script;
|
||||
stack->open -= 1;
|
||||
}
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean ScriptStackIsEmpty(ScriptStackRef stack)
|
||||
{
|
||||
return (stack->count == 0);
|
||||
}
|
||||
|
||||
SB_INTERNAL SBScript ScriptStackGetScript(ScriptStackRef stack)
|
||||
{
|
||||
return stack->_elements[stack->top].script;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBCodepoint ScriptStackGetMirror(ScriptStackRef stack)
|
||||
{
|
||||
return stack->_elements[stack->top].mirror;
|
||||
}
|
||||
@@ -0,0 +1,49 @@
|
||||
/*
|
||||
* Copyright (C) 2018-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_SCRIPT_STACK_H
|
||||
#define _SB_INTERNAL_SCRIPT_STACK_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBBase.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
|
||||
#define _SBScriptStackCapacity 63
|
||||
|
||||
typedef struct _SBScriptStackElement {
|
||||
SBScript script;
|
||||
SBCodepoint mirror;
|
||||
} _SBScriptStackElement;
|
||||
|
||||
typedef struct _SBScriptStack {
|
||||
_SBScriptStackElement _elements[_SBScriptStackCapacity];
|
||||
SBInteger top;
|
||||
SBUInteger count;
|
||||
SBUInteger open;
|
||||
} ScriptStack, *ScriptStackRef;
|
||||
|
||||
SB_INTERNAL void ScriptStackReset(ScriptStackRef stack);
|
||||
|
||||
SB_INTERNAL void ScriptStackPush(ScriptStackRef stack, SBScript script, SBCodepoint mirror);
|
||||
SB_INTERNAL void ScriptStackPop(ScriptStackRef stack);
|
||||
|
||||
SB_INTERNAL void ScriptStackLeavePairs(ScriptStackRef stack);
|
||||
SB_INTERNAL void ScriptStackSealPairs(ScriptStackRef stack, SBScript script);
|
||||
|
||||
SB_INTERNAL SBBoolean ScriptStackIsEmpty(ScriptStackRef stack);
|
||||
SB_INTERNAL SBScript ScriptStackGetScript(ScriptStackRef stack);
|
||||
SB_INTERNAL SBCodepoint ScriptStackGetMirror(ScriptStackRef stack);
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,42 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2019 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SheenBidi.h>
|
||||
|
||||
#ifdef SB_CONFIG_UNITY
|
||||
|
||||
#include "BidiChain.c"
|
||||
#include "BidiTypeLookup.c"
|
||||
#include "BracketQueue.c"
|
||||
#include "GeneralCategoryLookup.c"
|
||||
#include "IsolatingRun.c"
|
||||
#include "LevelRun.c"
|
||||
#include "PairingLookup.c"
|
||||
#include "RunQueue.c"
|
||||
#include "SBAlgorithm.c"
|
||||
#include "SBBase.c"
|
||||
#include "SBCodepointSequence.c"
|
||||
#include "SBLine.c"
|
||||
#include "SBLog.c"
|
||||
#include "SBMirrorLocator.c"
|
||||
#include "SBParagraph.c"
|
||||
#include "SBScriptLocator.c"
|
||||
#include "ScriptLookup.c"
|
||||
#include "ScriptStack.c"
|
||||
#include "StatusStack.c"
|
||||
|
||||
#endif
|
||||
@@ -0,0 +1,124 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include <stddef.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
#include "SBAssert.h"
|
||||
#include "SBBase.h"
|
||||
#include "StatusStack.h"
|
||||
|
||||
static SBBoolean StatusStackInsertElement(StatusStackRef stack)
|
||||
{
|
||||
if (stack->_peekTop != _StatusStackList_MaxIndex) {
|
||||
stack->_peekTop += 1;
|
||||
} else {
|
||||
_StatusStackListRef previousList = stack->_peekList;
|
||||
_StatusStackListRef peekList = previousList->next;
|
||||
|
||||
if (!peekList) {
|
||||
peekList = malloc(sizeof(_StatusStackList));
|
||||
if (!peekList) {
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
peekList->previous = previousList;
|
||||
peekList->next = NULL;
|
||||
|
||||
previousList->next = peekList;
|
||||
}
|
||||
|
||||
stack->_peekList = peekList;
|
||||
stack->_peekTop = 0;
|
||||
}
|
||||
stack->count += 1;
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
SB_INTERNAL void StatusStackInitialize(StatusStackRef stack)
|
||||
{
|
||||
stack->_firstList.previous = NULL;
|
||||
stack->_firstList.next = NULL;
|
||||
|
||||
StatusStackSetEmpty(stack);
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean StatusStackPush(StatusStackRef stack,
|
||||
SBLevel embeddingLevel, SBBidiType overrideStatus, SBBoolean isolateStatus)
|
||||
{
|
||||
/* The stack can hold upto 127 elements. */
|
||||
SBAssert(stack->count <= 127);
|
||||
|
||||
if (StatusStackInsertElement(stack)) {
|
||||
_StatusStackElementRef element = &stack->_peekList->elements[stack->_peekTop];
|
||||
element->embeddingLevel = embeddingLevel;
|
||||
element->overrideStatus = overrideStatus;
|
||||
element->isolateStatus = isolateStatus;
|
||||
|
||||
return SBTrue;
|
||||
}
|
||||
|
||||
return SBFalse;
|
||||
}
|
||||
|
||||
SB_INTERNAL void StatusStackPop(StatusStackRef stack)
|
||||
{
|
||||
/* The stack should not be empty. */
|
||||
SBAssert(stack->count != 0);
|
||||
|
||||
if (stack->_peekTop != 0) {
|
||||
stack->_peekTop -= 1;
|
||||
} else {
|
||||
stack->_peekList = stack->_peekList->previous;
|
||||
stack->_peekTop = _StatusStackList_MaxIndex;
|
||||
}
|
||||
stack->count -= 1;
|
||||
}
|
||||
|
||||
SB_INTERNAL void StatusStackSetEmpty(StatusStackRef stack)
|
||||
{
|
||||
stack->_peekList = &stack->_firstList;
|
||||
stack->_peekTop = 0;
|
||||
stack->count = 0;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBLevel StatusStackGetEmbeddingLevel(StatusStackRef stack)
|
||||
{
|
||||
return stack->_peekList->elements[stack->_peekTop].embeddingLevel;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBidiType StatusStackGetOverrideStatus(StatusStackRef stack)
|
||||
{
|
||||
return stack->_peekList->elements[stack->_peekTop].overrideStatus;
|
||||
}
|
||||
|
||||
SB_INTERNAL SBBoolean StatusStackGetIsolateStatus(StatusStackRef stack)
|
||||
{
|
||||
return stack->_peekList->elements[stack->_peekTop].isolateStatus;
|
||||
}
|
||||
|
||||
SB_INTERNAL void StatusStackFinalize(StatusStackRef stack)
|
||||
{
|
||||
_StatusStackListRef list = stack->_firstList.next;
|
||||
|
||||
while (list) {
|
||||
_StatusStackListRef next = list->next;
|
||||
free(list);
|
||||
list = next;
|
||||
};
|
||||
}
|
||||
@@ -0,0 +1,58 @@
|
||||
/*
|
||||
* Copyright (C) 2014-2022 Muhammad Tayyab Akram
|
||||
*
|
||||
* Licensed under the Apache License, Version 2.0 (the "License");
|
||||
* you may not use this file except in compliance with the License.
|
||||
* You may obtain a copy of the License at
|
||||
*
|
||||
* http://www.apache.org/licenses/LICENSE-2.0
|
||||
*
|
||||
* Unless required by applicable law or agreed to in writing, software
|
||||
* distributed under the License is distributed on an "AS IS" BASIS,
|
||||
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
* See the License for the specific language governing permissions and
|
||||
* limitations under the License.
|
||||
*/
|
||||
|
||||
#ifndef _SB_INTERNAL_STATUS_STACK_H
|
||||
#define _SB_INTERNAL_STATUS_STACK_H
|
||||
|
||||
#include <juce_graphics/unicode/sheenbidi/Headers/SBConfig.h>
|
||||
#include "SBBase.h"
|
||||
|
||||
#define _StatusStackList_Length 16
|
||||
#define _StatusStackList_MaxIndex (_StatusStackList_Length - 1)
|
||||
|
||||
typedef struct _StatusStackElement {
|
||||
SBBoolean isolateStatus;
|
||||
SBBidiType overrideStatus;
|
||||
SBLevel embeddingLevel;
|
||||
} _StatusStackElement, *_StatusStackElementRef;
|
||||
|
||||
typedef struct _StatusStackList {
|
||||
_StatusStackElement elements[_StatusStackList_Length];
|
||||
|
||||
struct _StatusStackList *previous;
|
||||
struct _StatusStackList *next;
|
||||
} _StatusStackList, *_StatusStackListRef;
|
||||
|
||||
typedef struct _StatusStack {
|
||||
_StatusStackList _firstList;
|
||||
_StatusStackListRef _peekList;
|
||||
SBUInteger _peekTop;
|
||||
SBUInteger count;
|
||||
} StatusStack, *StatusStackRef;
|
||||
|
||||
SB_INTERNAL void StatusStackInitialize(StatusStackRef stack);
|
||||
SB_INTERNAL void StatusStackFinalize(StatusStackRef stack);
|
||||
|
||||
SB_INTERNAL SBBoolean StatusStackPush(StatusStackRef stack,
|
||||
SBLevel embeddingLevel, SBBidiType overrideStatus, SBBoolean isolateStatus);
|
||||
SB_INTERNAL void StatusStackPop(StatusStackRef stack);
|
||||
SB_INTERNAL void StatusStackSetEmpty(StatusStackRef stack);
|
||||
|
||||
SB_INTERNAL SBLevel StatusStackGetEmbeddingLevel(StatusStackRef stack);
|
||||
SB_INTERNAL SBBidiType StatusStackGetOverrideStatus(StatusStackRef stack);
|
||||
SB_INTERNAL SBBoolean StatusStackGetIsolateStatus(StatusStackRef stack);
|
||||
|
||||
#endif
|
||||
Reference in New Issue
Block a user