1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/*
* Copyright (C) 2018 The Android Open Source Project
*
* 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 MINIKIN_LAYOUT_PIECES_H
#define MINIKIN_LAYOUT_PIECES_H
#include <unordered_map>
#include "minikin/LayoutCache.h"
#include "minikin/LayoutCore.h"
#include "minikin/MinikinPaint.h"
namespace minikin {
struct LayoutPieces {
const static uint32_t kNoPaintId = static_cast<uint32_t>(-1);
struct Key {
Key(const Range& range, HyphenEdit hyphenEdit, bool dir, uint32_t paintId)
: range(range),
hyphenEdit(hyphenEdit),
dir(dir),
paintId(paintId),
hash(calcHash()) {}
Range range;
HyphenEdit hyphenEdit;
bool dir;
uint32_t paintId;
uint32_t hash;
uint32_t calcHash() const {
return Hasher()
.update(range.getStart())
.update(range.getEnd())
.update(hyphenEdit)
.update(dir)
.update(paintId)
.hash();
}
bool operator==(const Key& o) const {
return range == o.range && hyphenEdit == o.hyphenEdit && dir == o.dir &&
paintId == o.paintId;
}
uint32_t getMemoryUsage() const {
return sizeof(Range) + sizeof(HyphenEdit) + sizeof(bool) + sizeof(uint32_t);
}
};
struct KeyHasher {
std::size_t operator()(const Key& key) const { return key.hash; }
};
struct PaintHasher {
std::size_t operator()(const MinikinPaint& paint) const { return paint.hash(); }
};
LayoutPieces() : nextPaintId(0) {}
~LayoutPieces() {}
uint32_t nextPaintId;
std::unordered_map<MinikinPaint, uint32_t, PaintHasher> paintMap;
std::unordered_map<Key, LayoutSlot, KeyHasher> offsetMap;
void insert(const Range& range, HyphenEdit edit, const LayoutPiece& layout, bool dir,
const MinikinPaint& paint, const MinikinRect& rect) {
uint32_t paintId = findPaintId(paint);
if (paintId == kNoPaintId) {
paintId = nextPaintId++;
paintMap.insert(std::make_pair(paint, paintId));
}
offsetMap.emplace(std::piecewise_construct,
std::forward_as_tuple(range, edit, dir, paintId),
std::forward_as_tuple(layout, rect));
}
template <typename F>
void getOrCreate(const U16StringPiece& textBuf, const Range& range, const Range& context,
const MinikinPaint& paint, bool dir, StartHyphenEdit startEdit,
EndHyphenEdit endEdit, uint32_t paintId, bool boundsCalculation, F& f) const {
const HyphenEdit edit = packHyphenEdit(startEdit, endEdit);
auto it = offsetMap.find(Key(range, edit, dir, paintId));
if (it != offsetMap.end()) {
const LayoutPiece& piece = it->second.mLayout;
const MinikinRect& bounds = it->second.mBounds;
if (boundsCalculation && !bounds.isValid()) {
f(piece, paint, LayoutPiece::calculateBounds(piece, paint));
} else {
f(piece, paint, bounds);
}
return;
}
LayoutCache::getInstance().getOrCreate(textBuf.substr(context), range - context.getStart(),
paint, dir, startEdit, endEdit, boundsCalculation,
f);
}
uint32_t findPaintId(const MinikinPaint& paint) const {
auto paintIt = paintMap.find(paint);
return paintIt == paintMap.end() ? kNoPaintId : paintIt->second;
}
uint32_t getMemoryUsage() const {
uint32_t result = 0;
for (const auto& i : offsetMap) {
result += i.first.getMemoryUsage() + i.second.mLayout.getMemoryUsage();
}
result += (sizeof(MinikinPaint) + sizeof(uint32_t)) * paintMap.size();
return result;
}
};
} // namespace minikin
#endif // MINIKIN_LAYOUT_PIECES_H
|
