Lines Matching defs:codePoints
72 int[] codePoints = toCodePoints(text);
75 segs = makeSegmentsOptimally(codePoints, version);
94 private static List<QrSegment> makeSegmentsOptimally(int[] codePoints, int version) {
95 if (codePoints.length == 0)
97 Mode[] charModes = computeCharacterModes(codePoints, version);
98 return splitIntoSegments(codePoints, charModes);
103 private static Mode[] computeCharacterModes(int[] codePoints, int version) {
104 if (codePoints.length == 0)
117 Mode[][] charModes = new Mode[codePoints.length][numModes];
125 for (int i = 0; i < codePoints.length; i++) {
126 int c = codePoints[i];
186 private static List<QrSegment> splitIntoSegments(int[] codePoints, Mode[] charModes) {
187 if (codePoints.length == 0)
195 if (i < codePoints.length && charModes[i] == curMode)
197 String s = new String(codePoints, start, i - start);
208 if (i >= codePoints.length)
219 int[] result = s.codePoints().toArray();