Lines Matching defs:codePoints
25 const CodePointArrayView codePoints = wordProperty.getCodePoints();
26 if (codePoints.empty() || codePoints.size() > MAX_WORD_LENGTH) {
29 return addWordInner(codePoints, wordProperty, mRootPtNodeArray);
32 bool OffdeviceIntermediateDict::addWordInner(const CodePointArrayView codePoints,
39 if (codePoints[0] < ptNodeCodePoints[0]) {
42 if (codePoints[0] > ptNodeCodePoints[0]) {
46 for (; i < codePoints.size(); ++i) {
49 return addWordInner(codePoints.skip(i), wordProperty,
52 if (codePoints[i] != ptNodeCodePoints[i]) {
56 if (codePoints.size() == i && codePoints.size() == ptNodeCodePoints.size()) {
69 auto newPtNode = codePoints.size() == i
70 ? std::make_shared<OffdeviceIntermediateDictPtNode>(codePoints, wordProperty)
71 : std::make_shared<OffdeviceIntermediateDictPtNode>(codePoints.limit(i));
80 if (codePoints.size() != i) {
82 return addWordInner(codePoints.skip(i), wordProperty, childrenPtNodeArray);
87 std::make_shared<OffdeviceIntermediateDictPtNode>(codePoints, wordProperty));
92 const CodePointArrayView codePoints) const {
94 for (size_t i = 0; i < codePoints.size();) {
98 if (codePoints[i] < ptNodeCodePoints[0]) {
101 if (codePoints[i] > ptNodeCodePoints[0]
102 || codePoints.size() < ptNodeCodePoints.size()) {
106 if (codePoints[i + j] != ptNodeCodePoints[j]) {
111 if (i == codePoints.size()) {
