MarkerSubrange.cpp [plain text]
#include "config.h"
#include "MarkerSubrange.h"
#include <wtf/HashSet.h>
#include <algorithm>
namespace WebCore {
Vector<MarkerSubrange> subdivide(const Vector<MarkerSubrange>& subranges, OverlapStrategy overlapStrategy)
{
if (subranges.isEmpty())
return { };
struct Offset {
enum Kind { Begin, End };
Kind kind;
unsigned value; const MarkerSubrange* subrange;
};
Vector<Offset> offsets;
ASSERT(subranges.size() < std::numeric_limits<unsigned>::max() / 2);
unsigned numberOfSubranges = subranges.size();
unsigned numberOfOffsets = 2 * numberOfSubranges;
offsets.reserveInitialCapacity(numberOfOffsets);
for (auto& subrange : subranges) {
offsets.uncheckedAppend({ Offset::Begin, subrange.startOffset, &subrange });
offsets.uncheckedAppend({ Offset::End, subrange.endOffset, &subrange });
}
std::sort(offsets.begin(), offsets.end(), [] (const Offset& a, const Offset& b) {
return a.value < b.value || (a.value == b.value && a.kind == b.kind && a.kind == Offset::Begin && a.subrange->type < b.subrange->type)
|| (a.value == b.value && a.kind == b.kind && a.kind == Offset::End && a.subrange->type > b.subrange->type);
});
Vector<MarkerSubrange> result;
result.reserveInitialCapacity(numberOfSubranges);
HashSet<const MarkerSubrange*> processedSubranges;
unsigned offsetSoFar = offsets[0].value;
for (unsigned i = 1; i < numberOfOffsets; ++i) {
if (offsets[i].value > offsets[i - 1].value) {
if (overlapStrategy == OverlapStrategy::Frontmost) {
std::optional<unsigned> frontmost;
for (unsigned j = 0; j < i; ++j) {
if (!processedSubranges.contains(offsets[j].subrange) && (!frontmost || offsets[j].subrange->type > offsets[*frontmost].subrange->type))
frontmost = j;
}
if (frontmost)
result.append({ offsetSoFar, offsets[i].value, offsets[*frontmost].subrange->type, offsets[*frontmost].subrange->marker });
} else {
for (unsigned j = 0; j < i; ++j) {
if (!processedSubranges.contains(offsets[j].subrange))
result.append({ offsetSoFar, offsets[i].value, offsets[j].subrange->type, offsets[j].subrange->marker });
}
}
offsetSoFar = offsets[i].value;
}
if (offsets[i].kind == Offset::End)
processedSubranges.add(offsets[i].subrange);
}
if (overlapStrategy == OverlapStrategy::None)
std::sort(result.begin(), result.end(), [] (const MarkerSubrange& a, const MarkerSubrange& b) { return a.startOffset < b.startOffset || (a.startOffset == b.startOffset && a.type < b.type); });
return result;
}
}