Java > Open Source Codes > com > lowagie > text > pdf > BidiLine


1 /*
2  *
3  * Copyright 2002 Paulo Soares
4  *
5  * The contents of this file are subject to the Mozilla Public License Version 1.1
6  * (the "License"); you may not use this file except in compliance with the License.
7  * You may obtain a copy of the License at http://www.mozilla.org/MPL/
8  *
9  * Software distributed under the License is distributed on an "AS IS" basis,
10  * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
11  * for the specific language governing rights and limitations under the License.
12  *
13  * The Original Code is 'iText, a free JAVA-PDF library'.
14  *
15  * The Initial Developer of the Original Code is Bruno Lowagie. Portions created by
16  * the Initial Developer are Copyright (C) 1999, 2000, 2001, 2002 by Bruno Lowagie.
17  * All Rights Reserved.
18  * Co-Developer of the code is Paulo Soares. Portions created by the Co-Developer
19  * are Copyright (C) 2000, 2001, 2002 by Paulo Soares. All Rights Reserved.
20  *
21  * Contributor(s): all the names of the contributors are added in the source code
22  * where applicable.
23  *
24  * Alternatively, the contents of this file may be used under the terms of the
25  * LGPL license (the "GNU LIBRARY GENERAL PUBLIC LICENSE"), in which case the
26  * provisions of LGPL are applicable instead of those above. If you wish to
27  * allow use of your version of this file only under the terms of the LGPL
28  * License and not to allow others to use your version of this file under
29  * the MPL, indicate your decision by deleting the provisions above and
30  * replace them with the notice and other provisions required by the LGPL.
31  * If you do not delete the provisions above, a recipient may use your version
32  * of this file under either the MPL or the GNU LIBRARY GENERAL PUBLIC LICENSE.
33  *
34  * This library is free software; you can redistribute it and/or modify it
35  * under the terms of the MPL as stated above or under the terms of the GNU
36  * Library General Public License as published by the Free Software Foundation;
37  * either version 2 of the License, or any later version.
38  *
39  * This library is distributed in the hope that it will be useful, but WITHOUT
40  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
41  * FOR A PARTICULAR PURPOSE. See the GNU Library general Public License for more
42  * details.
43  *
44  * If you didn't download this code from the following link, you should check if
45  * you aren't using an obsolete version:
46  * http://www.lowagie.com/iText/
47  */
48
49 package com.lowagie.text.pdf;
50
51 import java.util.ArrayList ;
52
53 import com.lowagie.text.Chunk;
54
55 /** Does all the line bidirectional processing with PdfChunk assembly.
56  *
57  * @author Paulo Soares (psoares@consiste.pt)
58  */
59 public class BidiLine {
60     
61     protected int runDirection;
62     protected int pieceSize = 2048;
63     protected char text[] = new char[pieceSize];
64     protected PdfChunk detailChunks[] = new PdfChunk[pieceSize];
65     protected int totalTextLength = 0;
66     
67     protected byte orderLevels[] = new byte[pieceSize];
68     protected int indexChars[] = new int[pieceSize];
69     
70     protected ArrayList chunks = new ArrayList ();
71     protected int indexChunk = 0;
72     protected int indexChunkChar = 0;
73     protected int currentChar = 0;
74     
75     protected int storedRunDirection;
76     protected char storedText[] = new char[0];
77     protected PdfChunk storedDetailChunks[] = new PdfChunk[0];
78     protected int storedTotalTextLength = 0;
79     
80     protected byte storedOrderLevels[] = new byte[0];
81     protected int storedIndexChars[] = new int[0];
82     
83     protected int storedIndexChunk = 0;
84     protected int storedIndexChunkChar = 0;
85     protected int storedCurrentChar = 0;
86     
87     protected boolean shortStore;
88 // protected ArabicShaping arabic = new ArabicShaping(ArabicShaping.LETTERS_SHAPE | ArabicShaping.LENGTH_GROW_SHRINK | ArabicShaping.TEXT_DIRECTION_LOGICAL);
89 protected static final IntHashtable mirrorChars = new IntHashtable();
90     protected int arabicOptions;
91
92     /** Creates new BidiLine */
93     public BidiLine() {
94     }
95     
96     public BidiLine(BidiLine org) {
97         runDirection = org.runDirection;
98         pieceSize = org.pieceSize;
99         text = (char[])org.text.clone();
100         detailChunks = (PdfChunk[])org.detailChunks.clone();
101         totalTextLength = org.totalTextLength;
102
103         orderLevels = (byte[])org.orderLevels.clone();
104         indexChars = (int[])org.indexChars.clone();
105
106         chunks = new ArrayList (org.chunks);
107         indexChunk = org.indexChunk;
108         indexChunkChar = org.indexChunkChar;
109         currentChar = org.currentChar;
110
111         storedRunDirection = org.storedRunDirection;
112         storedText = (char[])org.storedText.clone();
113         storedDetailChunks = (PdfChunk[])org.storedDetailChunks.clone();
114         storedTotalTextLength = org.storedTotalTextLength;
115
116         storedOrderLevels = (byte[])org.storedOrderLevels.clone();
117         storedIndexChars = (int[])org.storedIndexChars.clone();
118
119         storedIndexChunk = org.storedIndexChunk;
120         storedIndexChunkChar = org.storedIndexChunkChar;
121         storedCurrentChar = org.storedCurrentChar;
122
123         shortStore = org.shortStore;
124         arabicOptions = org.arabicOptions;
125     }
126     
127     public boolean isEmpty() {
128         return (currentChar >= totalTextLength && indexChunk >= chunks.size());
129     }
130     
131     public void clearChunks() {
132         chunks.clear();
133         totalTextLength = 0;
134         currentChar = 0;
135     }
136
137     public boolean getParagraph(int runDirection) {
138         this.runDirection = runDirection;
139         currentChar = 0;
140         totalTextLength = 0;
141         boolean hasText = false;
142         char c;
143         char uniC;
144         BaseFont bf;
145         for (; indexChunk < chunks.size(); ++indexChunk) {
146             PdfChunk ck = (PdfChunk)chunks.get(indexChunk);
147             bf = ck.font().getFont();
148             String s = ck.toString();
149             int len = s.length();
150             for (; indexChunkChar < len; ++indexChunkChar) {
151                 c = s.charAt(indexChunkChar);
152                 uniC = bf.getUnicodeEquivalent(c);
153                 if (uniC == '\r' || uniC == '\n') {
154                     // next condition is never true for CID
155 if (uniC == '\r' && indexChunkChar + 1 < len && s.charAt(indexChunkChar + 1) == '\n')
156                         ++indexChunkChar;
157                     ++indexChunkChar;
158                     if (indexChunkChar >= len) {
159                         indexChunkChar = 0;
160                         ++indexChunk;
161                     }
162                     hasText = true;
163                     if (totalTextLength == 0)
164                         detailChunks[0] = ck;
165                     break;
166                 }
167                 addPiece(c, ck);
168             }
169             if (hasText)
170                 break;
171             indexChunkChar = 0;
172         }
173         if (totalTextLength == 0)
174             return hasText;
175
176         // remove trailing WS
177 totalTextLength = trimRight(0, totalTextLength - 1) + 1;
178         if (totalTextLength == 0)
179             return true;
180         
181         if (runDirection == PdfWriter.RUN_DIRECTION_LTR || runDirection == PdfWriter.RUN_DIRECTION_RTL) {
182             if (orderLevels.length < totalTextLength) {
183                 orderLevels = new byte[pieceSize];
184                 indexChars = new int[pieceSize];
185             }
186             ArabicLigaturizer.processNumbers(text, 0, totalTextLength, arabicOptions);
187             BidiOrder order = new BidiOrder(text, 0, totalTextLength, (byte)(runDirection == PdfWriter.RUN_DIRECTION_RTL ? 1 : 0));
188             byte od[] = order.getLevels();
189             for (int k = 0; k < totalTextLength; ++k) {
190                 orderLevels[k] = od[k];
191                 indexChars[k] = k;
192             }
193             doArabicShapping();
194             mirrorGlyphs();
195         }
196         totalTextLength = trimRightEx(0, totalTextLength - 1) + 1;
197         return true;
198     }
199     
200     public void addChunk(PdfChunk chunk) {
201         chunks.add(chunk);
202     }
203     
204     public void addChunks(ArrayList chunks) {
205         this.chunks.addAll(chunks);
206     }
207     
208     public void addPiece(char c, PdfChunk chunk) {
209         if (totalTextLength >= pieceSize) {
210             char tempText[] = text;
211             PdfChunk tempDetailChunks[] = detailChunks;
212             pieceSize *= 2;
213             text = new char[pieceSize];
214             detailChunks = new PdfChunk[pieceSize];
215             System.arraycopy(tempText, 0, text, 0, totalTextLength);
216             System.arraycopy(tempDetailChunks, 0, detailChunks, 0, totalTextLength);
217         }
218         text[totalTextLength] = c;
219         detailChunks[totalTextLength++] = chunk;
220     }
221     
222     public void save() {
223         if (indexChunk > 0) {
224             if (indexChunk >= chunks.size())
225                 chunks.clear();
226             else {
227                 for (--indexChunk; indexChunk >= 0; --indexChunk)
228                     chunks.remove(indexChunk);
229             }
230             indexChunk = 0;
231         }
232         storedRunDirection = runDirection;
233         storedTotalTextLength = totalTextLength;
234         storedIndexChunk = indexChunk;
235         storedIndexChunkChar = indexChunkChar;
236         storedCurrentChar = currentChar;
237         shortStore = (currentChar < totalTextLength);
238         if (!shortStore) {
239             // long save
240 if (storedText.length < totalTextLength) {
241                 storedText = new char[totalTextLength];
242                 storedDetailChunks = new PdfChunk[totalTextLength];
243             }
244             System.arraycopy(text, 0, storedText, 0, totalTextLength);
245             System.arraycopy(detailChunks, 0, storedDetailChunks, 0, totalTextLength);
246         }
247         if (runDirection == PdfWriter.RUN_DIRECTION_LTR || runDirection == PdfWriter.RUN_DIRECTION_RTL) {
248             if (storedOrderLevels.length < totalTextLength) {
249                 storedOrderLevels = new byte[totalTextLength];
250                 storedIndexChars = new int[totalTextLength];
251             }
252             System.arraycopy(orderLevels, currentChar, storedOrderLevels, currentChar, totalTextLength - currentChar);
253             System.arraycopy(indexChars, currentChar, storedIndexChars, currentChar, totalTextLength - currentChar);
254         }
255     }
256     
257     public void restore() {
258         runDirection = storedRunDirection;
259         totalTextLength = storedTotalTextLength;
260         indexChunk = storedIndexChunk;
261         indexChunkChar = storedIndexChunkChar;
262         currentChar = storedCurrentChar;
263         if (!shortStore) {
264             // long restore
265 System.arraycopy(storedText, 0, text, 0, totalTextLength);
266             System.arraycopy(storedDetailChunks, 0, detailChunks, 0, totalTextLength);
267         }
268         if (runDirection == PdfWriter.RUN_DIRECTION_LTR || runDirection == PdfWriter.RUN_DIRECTION_RTL) {
269             System.arraycopy(storedOrderLevels, currentChar, orderLevels, currentChar, totalTextLength - currentChar);
270             System.arraycopy(storedIndexChars, currentChar, indexChars, currentChar, totalTextLength - currentChar);
271         }
272     }
273     
274     public void mirrorGlyphs() {
275         for (int k = 0; k < totalTextLength; ++k) {
276             if ((orderLevels[k] & 1) == 1) {
277                 int mirror = mirrorChars.get(text[k]);
278                 if (mirror != 0)
279                     text[k] = (char)mirror;
280             }
281         }
282     }
283     
284     public void doArabicShapping() {
285         int src = 0;
286         int dest = 0;
287         for (;;) {
288             while (src < totalTextLength) {
289                 char c = text[src];
290                 if (c >= 0x0600 && c <= 0x06ff)
291                     break;
292                 if (src != dest) {
293                     text[dest] = text[src];
294                     detailChunks[dest] = detailChunks[src];
295                     orderLevels[dest] = orderLevels[src];
296                 }
297                 ++src;
298                 ++dest;
299             }
300             if (src >= totalTextLength) {
301                 totalTextLength = dest;
302                 return;
303             }
304             int startArabicIdx = src;
305             ++src;
306             while (src < totalTextLength) {
307                 char c = text[src];
308                 if (c < 0x0600 || c > 0x06ff)
309                     break;
310                 ++src;
311             }
312             int arabicWordSize = src - startArabicIdx;
313             int size = ArabicLigaturizer.arabic_shape(text, startArabicIdx, arabicWordSize, text, dest, arabicWordSize, arabicOptions /*PangoArabicShapping.ar_novowel PangoArabicShapping.ar_lig | PangoArabicShapping.ar_composedtashkeel*/);
314             if (startArabicIdx != dest) {
315                 for (int k = 0; k < size; ++k) {
316                     detailChunks[dest] = detailChunks[startArabicIdx];
317                     orderLevels[dest++] = orderLevels[startArabicIdx++];
318                 }
319             }
320             else
321                 dest += size;
322         }
323     }
324        
325     public PdfLine processLine(float width, int alignment, int runDirection, int arabicOptions) {
326         this.arabicOptions = arabicOptions;
327         save();
328         boolean isRTL = (runDirection == PdfWriter.RUN_DIRECTION_RTL);
329         if (currentChar >= totalTextLength) {
330             boolean hasText = getParagraph(runDirection);
331             if (!hasText)
332                 return null;
333             if (totalTextLength == 0) {
334                 ArrayList ar = new ArrayList ();
335                 PdfChunk ck = new PdfChunk("", detailChunks[0]);
336                 ar.add(ck);
337                 return new PdfLine(0, 0, alignment, true, ar, isRTL);
338             }
339         }
340         float originalWidth = width;
341         int lastSplit = -1;
342         if (currentChar != 0)
343             currentChar = trimLeftEx(currentChar, totalTextLength - 1);
344         int oldCurrentChar = currentChar;
345         char c = 0;
346         char uniC = 0;
347         PdfChunk ck = null;
348         float charWidth = 0;
349         PdfChunk lastValidChunk = null;
350         for (; currentChar < totalTextLength; ++currentChar) {
351             c = text[currentChar];
352             ck = detailChunks[currentChar];
353             uniC = ck.getUnicodeEquivalent(c);
354             if (PdfChunk.noPrint(uniC))
355                 continue;
356             charWidth = ck.getCharWidth(c);
357             if (ck.isExtSplitCharacter(oldCurrentChar, currentChar, totalTextLength, text, detailChunks))
358                 lastSplit = currentChar;
359             if (width - charWidth < 0)
360                 break;
361             width -= charWidth;
362             lastValidChunk = ck;
363         }
364         if (lastValidChunk == null) {
365             // not even a single char fit; must output the first char
366 ++currentChar;
367             return new PdfLine(0, 0, alignment, false, createArrayOfPdfChunks(currentChar - 1, currentChar - 1), isRTL);
368         }
369         if (currentChar >= totalTextLength) {
370             // there was more line than text
371 return new PdfLine(0, width, alignment, true, createArrayOfPdfChunks(oldCurrentChar, totalTextLength - 1), isRTL);
372         }
373         int newCurrentChar = trimRightEx(oldCurrentChar, currentChar - 1);
374         if (newCurrentChar < oldCurrentChar) {
375             // only WS
376 return new PdfLine(0, width, alignment, false, createArrayOfPdfChunks(oldCurrentChar, currentChar - 1), isRTL);
377         }
378         if (newCurrentChar == currentChar - 1) { // middle of word
379 HyphenationEvent he = (HyphenationEvent)lastValidChunk.getAttribute(Chunk.HYPHENATION);
380             if (he != null) {
381                 int word[] = getWord(oldCurrentChar, newCurrentChar);
382                 if (word != null) {
383                     float testWidth = width + getWidth(word[0], currentChar - 1);
384                     String pre = he.getHyphenatedWordPre(new String (text, word[0], word[1] - word[0]), lastValidChunk.font().getFont(), lastValidChunk.font().size(), testWidth);
385                     String post = he.getHyphenatedWordPost();
386                     if (pre.length() > 0) {
387                         PdfChunk extra = new PdfChunk(pre, lastValidChunk);
388                         currentChar = word[1] - post.length();
389                         return new PdfLine(0, testWidth - lastValidChunk.font().width(pre), alignment, false, createArrayOfPdfChunks(oldCurrentChar, word[0] - 1, extra), isRTL);
390                     }
391                 }
392             }
393         }
394         if (lastSplit == -1 || lastSplit >= newCurrentChar) {
395             // no split point or split point ahead of end
396 return new PdfLine(0, width + getWidth(newCurrentChar + 1, currentChar - 1), alignment, false, createArrayOfPdfChunks(oldCurrentChar, newCurrentChar), isRTL);
397         }
398         // standard split
399 currentChar = lastSplit + 1;
400         newCurrentChar = trimRightEx(oldCurrentChar, lastSplit);
401         if (newCurrentChar < oldCurrentChar) {
402             // only WS again
403 newCurrentChar = currentChar - 1;
404         }
405         return new PdfLine(0, originalWidth - getWidth(oldCurrentChar, newCurrentChar), alignment, false, createArrayOfPdfChunks(oldCurrentChar, newCurrentChar), isRTL);
406     }
407     
408     /** Gets the width of a range of characters.
409      * @param startIdx the first index to calculate
410      * @param lastIdx the last inclusive index to calculate
411      * @return the sum of all widths
412      */
413     public float getWidth(int startIdx, int lastIdx) {
414         char c = 0;
415         char uniC;
416         PdfChunk ck = null;
417         float width = 0;
418         for (; startIdx <= lastIdx; ++startIdx) {
419             c = text[startIdx];
420             ck = detailChunks[startIdx];
421             uniC = ck.getUnicodeEquivalent(c);
422             if (PdfChunk.noPrint(uniC))
423                 continue;
424             width += detailChunks[startIdx].getCharWidth(c);
425         }
426         return width;
427     }
428     
429     public ArrayList createArrayOfPdfChunks(int startIdx, int endIdx) {
430         return createArrayOfPdfChunks(startIdx, endIdx, null);
431     }
432     
433     public ArrayList createArrayOfPdfChunks(int startIdx, int endIdx, PdfChunk extraPdfChunk) {
434         boolean bidi = (runDirection == PdfWriter.RUN_DIRECTION_LTR || runDirection == PdfWriter.RUN_DIRECTION_RTL);
435         if (bidi)
436             reorder(startIdx, endIdx);
437         ArrayList ar = new ArrayList ();
438         PdfChunk refCk = detailChunks[startIdx];
439         PdfChunk ck = null;
440         StringBuffer buf = new StringBuffer ();
441         char c;
442         int idx = 0;
443         for (; startIdx <= endIdx; ++startIdx) {
444             idx = bidi ? indexChars[startIdx] : startIdx;
445             c = text[idx];
446             ck = detailChunks[idx];
447             if (PdfChunk.noPrint(ck.getUnicodeEquivalent(c)))
448                 continue;
449             if (ck.isImage()) {
450                 if (buf.length() > 0) {
451                     ar.add(new PdfChunk(buf.toString(), refCk));
452                     buf = new StringBuffer ();
453                 }
454                 ar.add(ck);
455             }
456             else if (ck == refCk) {
457                 buf.append(c);
458             }
459             else {
460                 if (buf.length() > 0) {
461                     ar.add(new PdfChunk(buf.toString(), refCk));
462                     buf = new StringBuffer ();
463                 }
464                 if (!ck.isImage())
465                     buf.append(c);
466                 refCk = ck;
467             }
468         }
469         if (buf.length() > 0) {
470             ar.add(new PdfChunk(buf.toString(), refCk));
471         }
472         if (extraPdfChunk != null)
473             ar.add(extraPdfChunk);
474         return ar;
475     }
476     
477     public int[] getWord(int startIdx, int idx) {
478         int last = idx;
479         int first = idx;
480         // forward
481 for (; last < totalTextLength; ++last) {
482             if (!Character.isLetter(text[last]))
483                 break;
484         }
485         if (last == idx)
486             return null;
487         // backward
488 for (; first >= startIdx; --first) {
489             if (!Character.isLetter(text[first]))
490                 break;
491         }
492         ++first;
493         return new int[]{first, last};
494     }
495     
496     public int trimRight(int startIdx, int endIdx) {
497         int idx = endIdx;
498         char c;
499         for (; idx >= startIdx; --idx) {
500             c = detailChunks[idx].getUnicodeEquivalent(text[idx]);
501             if (!isWS(c))
502                 break;
503         }
504         return idx;
505     }
506     
507     public int trimLeft(int startIdx, int endIdx) {
508         int idx = startIdx;
509         char c;
510         for (; idx <= endIdx; ++idx) {
511             c = detailChunks[idx].getUnicodeEquivalent(text[idx]);
512             if (!isWS(c))
513                 break;
514         }
515         return idx;
516     }
517     
518     public int trimRightEx(int startIdx, int endIdx) {
519         int idx = endIdx;
520         char c = 0;
521         for (; idx >= startIdx; --idx) {
522             c = detailChunks[idx].getUnicodeEquivalent(text[idx]);
523             if (!isWS(c) && !PdfChunk.noPrint(c))
524                 break;
525         }
526         return idx;
527     }
528     
529     public int trimLeftEx(int startIdx, int endIdx) {
530         int idx = startIdx;
531         char c = 0;
532         for (; idx <= endIdx; ++idx) {
533             c = detailChunks[idx].getUnicodeEquivalent(text[idx]);
534             if (!isWS(c) && !PdfChunk.noPrint(c))
535                 break;
536         }
537         return idx;
538     }
539     
540     public void reorder(int start, int end) {
541         byte maxLevel = orderLevels[start];
542         byte minLevel = maxLevel;
543         byte onlyOddLevels = maxLevel;
544         byte onlyEvenLevels = maxLevel;
545         for (int k = start + 1; k <= end; ++k) {
546             byte b = orderLevels[k];
547             if (b > maxLevel)
548                 maxLevel = b;
549             else if (b < minLevel)
550                 minLevel = b;
551             onlyOddLevels &= b;
552             onlyEvenLevels |= b;
553         }
554         if ((onlyEvenLevels & 1) == 0) // nothing to do
555 return;
556         if ((onlyOddLevels & 1) == 1) { // single inversion
557 flip(start, end + 1);
558             return;
559         }
560         minLevel |= 1;
561         for (; maxLevel >= minLevel; --maxLevel) {
562             int pstart = start;
563             for (;;) {
564                 for (;pstart <= end; ++pstart) {
565                     if (orderLevels[pstart] >= maxLevel)
566                         break;
567                 }
568                 if (pstart > end)
569                     break;
570                 int pend = pstart + 1;
571                 for (; pend <= end; ++pend) {
572                     if (orderLevels[pend] < maxLevel)
573                         break;
574                 }
575                 flip(pstart, pend);
576                 pstart = pend + 1;
577             }
578         }
579     }
580     
581     public void flip(int start, int end) {
582         int mid = (start + end) / 2;
583         --end;
584         for (; start < mid; ++start, --end) {
585             int temp = indexChars[start];
586             indexChars[start] = indexChars[end];
587             indexChars[end] = temp;
588         }
589     }
590     
591     public static boolean isWS(char c) {
592         return (c <= ' ');
593     }
594
595     static {
596         mirrorChars.put(0x0028, 0x0029); // LEFT PARENTHESIS
597 mirrorChars.put(0x0029, 0x0028); // RIGHT PARENTHESIS
598 mirrorChars.put(0x003C, 0x003E); // LESS-THAN SIGN
599 mirrorChars.put(0x003E, 0x003C); // GREATER-THAN SIGN
600 mirrorChars.put(0x005B, 0x005D); // LEFT SQUARE BRACKET
601 mirrorChars.put(0x005D, 0x005B); // RIGHT SQUARE BRACKET
602 mirrorChars.put(0x007B, 0x007D); // LEFT CURLY BRACKET
603 mirrorChars.put(0x007D, 0x007B); // RIGHT CURLY BRACKET
604 mirrorChars.put(0x00AB, 0x00BB); // LEFT-POINTING DOUBLE ANGLE QUOTATION MARK
605 mirrorChars.put(0x00BB, 0x00AB); // RIGHT-POINTING DOUBLE ANGLE QUOTATION MARK
606 mirrorChars.put(0x2039, 0x203A); // SINGLE LEFT-POINTING ANGLE QUOTATION MARK
607 mirrorChars.put(0x203A, 0x2039); // SINGLE RIGHT-POINTING ANGLE QUOTATION MARK
608 mirrorChars.put(0x2045, 0x2046); // LEFT SQUARE BRACKET WITH QUILL
609 mirrorChars.put(0x2046, 0x2045); // RIGHT SQUARE BRACKET WITH QUILL
610 mirrorChars.put(0x207D, 0x207E); // SUPERSCRIPT LEFT PARENTHESIS
611 mirrorChars.put(0x207E, 0x207D); // SUPERSCRIPT RIGHT PARENTHESIS
612 mirrorChars.put(0x208D, 0x208E); // SUBSCRIPT LEFT PARENTHESIS
613 mirrorChars.put(0x208E, 0x208D); // SUBSCRIPT RIGHT PARENTHESIS
614 mirrorChars.put(0x2208, 0x220B); // ELEMENT OF
615 mirrorChars.put(0x2209, 0x220C); // NOT AN ELEMENT OF
616 mirrorChars.put(0x220A, 0x220D); // SMALL ELEMENT OF
617 mirrorChars.put(0x220B, 0x2208); // CONTAINS AS MEMBER
618 mirrorChars.put(0x220C, 0x2209); // DOES NOT CONTAIN AS MEMBER
619 mirrorChars.put(0x220D, 0x220A); // SMALL CONTAINS AS MEMBER
620 mirrorChars.put(0x2215, 0x29F5); // DIVISION SLASH
621 mirrorChars.put(0x223C, 0x223D); // TILDE OPERATOR
622 mirrorChars.put(0x223D, 0x223C); // REVERSED TILDE
623 mirrorChars.put(0x2243, 0x22CD); // ASYMPTOTICALLY EQUAL TO
624 mirrorChars.put(0x2252, 0x2253); // APPROXIMATELY EQUAL TO OR THE IMAGE OF
625 mirrorChars.put(0x2253, 0x2252); // IMAGE OF OR APPROXIMATELY EQUAL TO
626 mirrorChars.put(0x2254, 0x2255); // COLON EQUALS
627 mirrorChars.put(0x2255, 0x2254); // EQUALS COLON
628 mirrorChars.put(0x2264, 0x2265); // LESS-THAN OR EQUAL TO
629 mirrorChars.put(0x2265, 0x2264); // GREATER-THAN OR EQUAL TO
630 mirrorChars.put(0x2266, 0x2267); // LESS-THAN OVER EQUAL TO
631 mirrorChars.put(0x2267, 0x2266); // GREATER-THAN OVER EQUAL TO
632 mirrorChars.put(0x2268, 0x2269); // [BEST FIT] LESS-THAN BUT NOT EQUAL TO
633 mirrorChars.put(0x2269, 0x2268); // [BEST FIT] GREATER-THAN BUT NOT EQUAL TO
634 mirrorChars.put(0x226A, 0x226B); // MUCH LESS-THAN
635 mirrorChars.put(0x226B, 0x226A); // MUCH GREATER-THAN
636 mirrorChars.put(0x226E, 0x226F); // [BEST FIT] NOT LESS-THAN
637 mirrorChars.put(0x226F, 0x226E); // [BEST FIT] NOT GREATER-THAN
638 mirrorChars.put(0x2270, 0x2271); // [BEST FIT] NEITHER LESS-THAN NOR EQUAL TO
639 mirrorChars.put(0x2271, 0x2270); // [BEST FIT] NEITHER GREATER-THAN NOR EQUAL TO
640 mirrorChars.put(0x2272, 0x2273); // [BEST FIT] LESS-THAN OR EQUIVALENT TO
641 mirrorChars.put(0x2273, 0x2272); // [BEST FIT] GREATER-THAN OR EQUIVALENT TO
642 mirrorChars.put(0x2274, 0x2275); // [BEST FIT] NEITHER LESS-THAN NOR EQUIVALENT TO
643 mirrorChars.put(0x2275, 0x2274); // [BEST FIT] NEITHER GREATER-THAN NOR EQUIVALENT TO
644 mirrorChars.put(0x2276, 0x2277); // LESS-THAN OR GREATER-THAN
645 mirrorChars.put(0x2277, 0x2276); // GREATER-THAN OR LESS-THAN
646 mirrorChars.put(0x2278, 0x2279); // NEITHER LESS-THAN NOR GREATER-THAN
647 mirrorChars.put(0x2279, 0x2278); // NEITHER GREATER-THAN NOR LESS-THAN
648 mirrorChars.put(0x227A, 0x227B); // PRECEDES
649 mirrorChars.put(0x227B, 0x227A); // SUCCEEDS
650 mirrorChars.put(0x227C, 0x227D); // PRECEDES OR EQUAL TO
651 mirrorChars.put(0x227D, 0x227C); // SUCCEEDS OR EQUAL TO
652 mirrorChars.put(0x227E, 0x227F); // [BEST FIT] PRECEDES OR EQUIVALENT TO
653 mirrorChars.put(0x227F, 0x227E); // [BEST FIT] SUCCEEDS OR EQUIVALENT TO
654 mirrorChars.put(0x2280, 0x2281); // [BEST FIT] DOES NOT PRECEDE
655 mirrorChars.put(0x2281, 0x2280); // [BEST FIT] DOES NOT SUCCEED
656 mirrorChars.put(0x2282, 0x2283); // SUBSET OF
657 mirrorChars.put(0x2283, 0x2282); // SUPERSET OF
658 mirrorChars.put(0x2284, 0x2285); // [BEST FIT] NOT A SUBSET OF
659 mirrorChars.put(0x2285, 0x2284); // [BEST FIT] NOT A SUPERSET OF
660 mirrorChars.put(0x2286, 0x2287); // SUBSET OF OR EQUAL TO
661 mirrorChars.put(0x2287, 0x2286); // SUPERSET OF OR EQUAL TO
662 mirrorChars.put(0x2288, 0x2289); // [BEST FIT] NEITHER A SUBSET OF NOR EQUAL TO
663 mirrorChars.put(0x2289, 0x2288); // [BEST FIT] NEITHER A SUPERSET OF NOR EQUAL TO
664 mirrorChars.put(0x228A, 0x228B); // [BEST FIT] SUBSET OF WITH NOT EQUAL TO
665 mirrorChars.put(0x228B, 0x228A); // [BEST FIT] SUPERSET OF WITH NOT EQUAL TO
666 mirrorChars.put(0x228F, 0x2290); // SQUARE IMAGE OF
667 mirrorChars.put(0x2290, 0x228F); // SQUARE ORIGINAL OF
668 mirrorChars.put(0x2291, 0x2292); // SQUARE IMAGE OF OR EQUAL TO
669 mirrorChars.put(0x2292, 0x2291); // SQUARE ORIGINAL OF OR EQUAL TO
670 mirrorChars.put(0x2298, 0x29B8); // CIRCLED DIVISION SLASH
671 mirrorChars.put(0x22A2, 0x22A3); // RIGHT TACK
672 mirrorChars.put(0x22A3, 0x22A2); // LEFT TACK
673 mirrorChars.put(0x22A6, 0x2ADE); // ASSERTION
674 mirrorChars.put(0x22A8, 0x2AE4); // TRUE
675 mirrorChars.put(0x22A9, 0x2AE3); // FORCES
676 mirrorChars.put(0x22AB, 0x2AE5); // DOUBLE VERTICAL BAR DOUBLE RIGHT TURNSTILE
677 mirrorChars.put(0x22B0, 0x22B1); // PRECEDES UNDER RELATION
678 mirrorChars.put(0x22B1, 0x22B0); // SUCCEEDS UNDER RELATION
679 mirrorChars.put(0x22B2, 0x22B3); // NORMAL SUBGROUP OF
680 mirrorChars.put(0x22B3, 0x22B2); // CONTAINS AS NORMAL SUBGROUP
681 mirrorChars.put(0x22B4, 0x22B5); // NORMAL SUBGROUP OF OR EQUAL TO
682 mirrorChars.put(0x22B5, 0x22B4); // CONTAINS AS NORMAL SUBGROUP OR EQUAL TO
683 mirrorChars.put(0x22B6, 0x22B7); // ORIGINAL OF
684 mirrorChars.put(0x22B7, 0x22B6); // IMAGE OF
685 mirrorChars.put(0x22C9, 0x22CA); // LEFT NORMAL FACTOR SEMIDIRECT PRODUCT
686 mirrorChars.put(0x22CA, 0x22C9); // RIGHT NORMAL FACTOR SEMIDIRECT PRODUCT
687 mirrorChars.put(0x22CB, 0x22CC); // LEFT SEMIDIRECT PRODUCT
688 mirrorChars.put(0x22CC, 0x22CB); // RIGHT SEMIDIRECT PRODUCT
689 mirrorChars.put(0x22CD, 0x2243); // REVERSED TILDE EQUALS
690 mirrorChars.put(0x22D0, 0x22D1); // DOUBLE SUBSET
691 mirrorChars.put(0x22D1, 0x22D0); // DOUBLE SUPERSET
692 mirrorChars.put(0x22D6, 0x22D7); // LESS-THAN WITH DOT
693 mirrorChars.put(0x22D7, 0x22D6); // GREATER-THAN WITH DOT
694 mirrorChars.put(0x22D8, 0x22D9); // VERY MUCH LESS-THAN
695 mirrorChars.put(0x22D9, 0x22D8); // VERY MUCH GREATER-THAN
696 mirrorChars.put(0x22DA, 0x22DB); // LESS-THAN EQUAL TO OR GREATER-THAN
697 mirrorChars.put(0x22DB, 0x22DA); // GREATER-THAN EQUAL TO OR LESS-THAN
698 mirrorChars.put(0x22DC, 0x22DD); // EQUAL TO OR LESS-THAN
699 mirrorChars.put(0x22DD, 0x22DC); // EQUAL TO OR GREATER-THAN
700 mirrorChars.put(0x22DE, 0x22DF); // EQUAL TO OR PRECEDES
701 mirrorChars.put(0x22DF, 0x22DE); // EQUAL TO OR SUCCEEDS
702 mirrorChars.put(0x22E0, 0x22E1); // [BEST FIT] DOES NOT PRECEDE OR EQUAL
703 mirrorChars.put(0x22E1, 0x22E0); // [BEST FIT] DOES NOT SUCCEED OR EQUAL
704 mirrorChars.put(0x22E2, 0x22E3); // [BEST FIT] NOT SQUARE IMAGE OF OR EQUAL TO
705 mirrorChars.put(0x22E3, 0x22E2); // [BEST FIT] NOT SQUARE ORIGINAL OF OR EQUAL TO
706 mirrorChars.put(0x22E4, 0x22E5); // [BEST FIT] SQUARE IMAGE OF OR NOT EQUAL TO
707 mirrorChars.put(0x22E5, 0x22E4); // [BEST FIT] SQUARE ORIGINAL OF OR NOT EQUAL TO
708 mirrorChars.put(0x22E6, 0x22E7); // [BEST FIT] LESS-THAN BUT NOT EQUIVALENT TO
709 mirrorChars.put(0x22E7, 0x22E6); // [BEST FIT] GREATER-THAN BUT NOT EQUIVALENT TO
710 mirrorChars.put(0x22E8, 0x22E9); // [BEST FIT] PRECEDES BUT NOT EQUIVALENT TO
711 mirrorChars.put(0x22E9, 0x22E8); // [BEST FIT] SUCCEEDS BUT NOT EQUIVALENT TO
712 mirrorChars.put(0x22EA, 0x22EB); // [BEST FIT] NOT NORMAL SUBGROUP OF
713 mirrorChars.put(0x22EB, 0x22EA); // [BEST FIT] DOES NOT CONTAIN AS NORMAL SUBGROUP
714 mirrorChars.put(0x22EC, 0x22ED); // [BEST FIT] NOT NORMAL SUBGROUP OF OR EQUAL TO
715 mirrorChars.put(0x22ED, 0x22EC); // [BEST FIT] DOES NOT CONTAIN AS NORMAL SUBGROUP OR EQUAL
716 mirrorChars.put(0x22F0, 0x22F1); // UP RIGHT DIAGONAL ELLIPSIS
717 mirrorChars.put(0x22F1, 0x22F0); // DOWN RIGHT DIAGONAL ELLIPSIS
718 mirrorChars.put(0x22F2, 0x22FA); // ELEMENT OF WITH LONG HORIZONTAL STROKE
719 mirrorChars.put(0x22F3, 0x22FB); // ELEMENT OF WITH VERTICAL BAR AT END OF HORIZONTAL STROKE
720 mirrorChars.put(0x22F4, 0x22FC); // SMALL ELEMENT OF WITH VERTICAL BAR AT END OF HORIZONTAL STROKE
721 mirrorChars.put(0x22F6, 0x22FD); // ELEMENT OF WITH OVERBAR
722 mirrorChars.put(0x22F7, 0x22FE); // SMALL ELEMENT OF WITH OVERBAR
723 mirrorChars.put(0x22FA, 0x22F2); // CONTAINS WITH LONG HORIZONTAL STROKE
724 mirrorChars.put(0x22FB, 0x22F3); // CONTAINS WITH VERTICAL BAR AT END OF HORIZONTAL STROKE
725 mirrorChars.put(0x22FC, 0x22F4); // SMALL CONTAINS WITH VERTICAL BAR AT END OF HORIZONTAL STROKE
726 mirrorChars.put(0x22FD, 0x22F6); // CONTAINS WITH OVERBAR
727 mirrorChars.put(0x22FE, 0x22F7); // SMALL CONTAINS WITH OVERBAR
728 mirrorChars.put(0x2308, 0x2309); // LEFT CEILING
729 mirrorChars.put(0x2309, 0x2308); // RIGHT CEILING
730 mirrorChars.put(0x230A, 0x230B); // LEFT FLOOR
731 mirrorChars.put(0x230B, 0x230A); // RIGHT FLOOR
732 mirrorChars.put(0x2329, 0x232A); // LEFT-POINTING ANGLE BRACKET
733 mirrorChars.put(0x232A, 0x2329); // RIGHT-POINTING ANGLE BRACKET
734 mirrorChars.put(0x2768, 0x2769); // MEDIUM LEFT PARENTHESIS ORNAMENT
735 mirrorChars.put(0x2769, 0x2768); // MEDIUM RIGHT PARENTHESIS ORNAMENT
736 mirrorChars.put(0x276A, 0x276B); // MEDIUM FLATTENED LEFT PARENTHESIS ORNAMENT
737 mirrorChars.put(0x276B, 0x276A); // MEDIUM FLATTENED RIGHT PARENTHESIS ORNAMENT
738 mirrorChars.put(0x276C, 0x276D); // MEDIUM LEFT-POINTING ANGLE BRACKET ORNAMENT
739 mirrorChars.put(0x276D, 0x276C); // MEDIUM RIGHT-POINTING ANGLE BRACKET ORNAMENT
740 mirrorChars.put(0x276E, 0x276F); // HEAVY LEFT-POINTING ANGLE QUOTATION MARK ORNAMENT
741 mirrorChars.put(0x276F, 0x276E); // HEAVY RIGHT-POINTING ANGLE QUOTATION MARK ORNAMENT
742 mirrorChars.put(0x2770, 0x2771); // HEAVY LEFT-POINTING ANGLE BRACKET ORNAMENT
743 mirrorChars.put(0x2771, 0x2770); // HEAVY RIGHT-POINTING ANGLE BRACKET ORNAMENT
744 mirrorChars.put(0x2772, 0x2773); // LIGHT LEFT TORTOISE SHELL BRACKET
745 mirrorChars.put(0x2773, 0x2772); // LIGHT RIGHT TORTOISE SHELL BRACKET
746 mirrorChars.put(0x2774, 0x2775); // MEDIUM LEFT CURLY BRACKET ORNAMENT
747 mirrorChars.put(0x2775, 0x2774); // MEDIUM RIGHT CURLY BRACKET ORNAMENT
748 mirrorChars.put(0x27D5, 0x27D6); // LEFT OUTER JOIN
749 mirrorChars.put(0x27D6, 0x27D5); // RIGHT OUTER JOIN
750 mirrorChars.put(0x27DD, 0x27DE); // LONG RIGHT TACK
751 mirrorChars.put(0x27DE, 0x27DD); // LONG LEFT TACK
752 mirrorChars.put(0x27E2, 0x27E3); // WHITE CONCAVE-SIDED DIAMOND WITH LEFTWARDS TICK
753 mirrorChars.put(0x27E3, 0x27E2); // WHITE CONCAVE-SIDED DIAMOND WITH RIGHTWARDS TICK
754 mirrorChars.put(0x27E4, 0x27E5); // WHITE SQUARE WITH LEFTWARDS TICK
755 mirrorChars.put(0x27E5, 0x27E4); // WHITE SQUARE WITH RIGHTWARDS TICK
756 mirrorChars.put(0x27E6, 0x27E7); // MATHEMATICAL LEFT WHITE SQUARE BRACKET
757 mirrorChars.put(0x27E7, 0x27E6); // MATHEMATICAL RIGHT WHITE SQUARE BRACKET
758 mirrorChars.put(0x27E8, 0x27E9); // MATHEMATICAL LEFT ANGLE BRACKET
759 mirrorChars.put(0x27E9, 0x27E8); // MATHEMATICAL RIGHT ANGLE BRACKET
760 mirrorChars.put(0x27EA, 0x27EB); // MATHEMATICAL LEFT DOUBLE ANGLE BRACKET
761 mirrorChars.put(0x27EB, 0x27EA); // MATHEMATICAL RIGHT DOUBLE ANGLE BRACKET
762 mirrorChars.put(0x2983, 0x2984); // LEFT WHITE CURLY BRACKET
763 mirrorChars.put(0x2984, 0x2983); // RIGHT WHITE CURLY BRACKET
764 mirrorChars.put(0x2985, 0x2986); // LEFT WHITE PARENTHESIS
765 mirrorChars.put(0x2986, 0x2985); // RIGHT WHITE PARENTHESIS
766 mirrorChars.put(0x2987, 0x2988); // Z NOTATION LEFT IMAGE BRACKET
767 mirrorChars.put(0x2988, 0x2987); // Z NOTATION RIGHT IMAGE BRACKET
768 mirrorChars.put(0x2989, 0x298A); // Z NOTATION LEFT BINDING BRACKET
769 mirrorChars.put(0x298A, 0x2989); // Z NOTATION RIGHT BINDING BRACKET
770 mirrorChars.put(0x298B, 0x298C); // LEFT SQUARE BRACKET WITH UNDERBAR
771 mirrorChars.put(0x298C, 0x298B); // RIGHT SQUARE BRACKET WITH UNDERBAR
772 mirrorChars.put(0x298D, 0x2990); // LEFT SQUARE BRACKET WITH TICK IN TOP CORNER
773 mirrorChars.put(0x298E, 0x298F); // RIGHT SQUARE BRACKET WITH TICK IN BOTTOM CORNER
774 mirrorChars.put(0x298F, 0x298E); // LEFT SQUARE BRACKET WITH TICK IN BOTTOM CORNER
775 mirrorChars.put(0x2990, 0x298D); // RIGHT SQUARE BRACKET WITH TICK IN TOP CORNER
776 mirrorChars.put(0x2991, 0x2992); // LEFT ANGLE BRACKET WITH DOT
777 mirrorChars.put(0x2992, 0x2991); // RIGHT ANGLE BRACKET WITH DOT
778 mirrorChars.put(0x2993, 0x2994); // LEFT ARC LESS-THAN BRACKET
779 mirrorChars.put(0x2994, 0x2993); // RIGHT ARC GREATER-THAN BRACKET
780 mirrorChars.put(0x2995, 0x2996); // DOUBLE LEFT ARC GREATER-THAN BRACKET
781 mirrorChars.put(0x2996, 0x2995); // DOUBLE RIGHT ARC LESS-THAN BRACKET
782 mirrorChars.put(0x2997, 0x2998); // LEFT BLACK TORTOISE SHELL BRACKET
783 mirrorChars.put(0x2998, 0x2997); // RIGHT BLACK TORTOISE SHELL BRACKET
784 mirrorChars.put(0x29B8, 0x2298); // CIRCLED REVERSE SOLIDUS
785 mirrorChars.put(0x29C0, 0x29C1); // CIRCLED LESS-THAN
786 mirrorChars.put(0x29C1, 0x29C0); // CIRCLED GREATER-THAN
787 mirrorChars.put(0x29C4, 0x29C5); // SQUARED RISING DIAGONAL SLASH
788 mirrorChars.put(0x29C5, 0x29C4); // SQUARED FALLING DIAGONAL SLASH
789 mirrorChars.put(0x29CF, 0x29D0); // LEFT TRIANGLE BESIDE VERTICAL BAR
790 mirrorChars.put(0x29D0, 0x29CF); // VERTICAL BAR BESIDE RIGHT TRIANGLE
791 mirrorChars.put(0x29D1, 0x29D2); // BOWTIE WITH LEFT HALF BLACK
792 mirrorChars.put(0x29D2, 0x29D1); // BOWTIE WITH RIGHT HALF BLACK
793 mirrorChars.put(0x29D4, 0x29D5); // TIMES WITH LEFT HALF BLACK
794 mirrorChars.put(0x29D5, 0x29D4); // TIMES WITH RIGHT HALF BLACK
795 mirrorChars.put(0x29D8, 0x29D9); // LEFT WIGGLY FENCE
796 mirrorChars.put(0x29D9, 0x29D8); // RIGHT WIGGLY FENCE
797 mirrorChars.put(0x29DA, 0x29DB); // LEFT DOUBLE WIGGLY FENCE
798 mirrorChars.put(0x29DB, 0x29DA); // RIGHT DOUBLE WIGGLY FENCE
799 mirrorChars.put(0x29F5, 0x2215); // REVERSE SOLIDUS OPERATOR
800 mirrorChars.put(0x29F8, 0x29F9); // BIG SOLIDUS
801 mirrorChars.put(0x29F9, 0x29F8); // BIG REVERSE SOLIDUS
802 mirrorChars.put(0x29FC, 0x29FD); // LEFT-POINTING CURVED ANGLE BRACKET
803 mirrorChars.put(0x29FD, 0x29FC); // RIGHT-POINTING CURVED ANGLE BRACKET
804 mirrorChars.put(0x2A2B, 0x2A2C); // MINUS SIGN WITH FALLING DOTS
805 mirrorChars.put(0x2A2C, 0x2A2B); // MINUS SIGN WITH RISING DOTS
806 mirrorChars.put(0x2A2D, 0x2A2C); // PLUS SIGN IN LEFT HALF CIRCLE
807 mirrorChars.put(0x2A2E, 0x2A2D); // PLUS SIGN IN RIGHT HALF CIRCLE
808 mirrorChars.put(0x2A34, 0x2A35); // MULTIPLICATION SIGN IN LEFT HALF CIRCLE
809 mirrorChars.put(0x2A35, 0x2A34); // MULTIPLICATION SIGN IN RIGHT HALF CIRCLE
810 mirrorChars.put(0x2A3C, 0x2A3D); // INTERIOR PRODUCT
811 mirrorChars.put(0x2A3D, 0x2A3C); // RIGHTHAND INTERIOR PRODUCT
812 mirrorChars.put(0x2A64, 0x2A65); // Z NOTATION DOMAIN ANTIRESTRICTION
813 mirrorChars.put(0x2A65, 0x2A64); // Z NOTATION RANGE ANTIRESTRICTION
814 mirrorChars.put(0x2A79, 0x2A7A); // LESS-THAN WITH CIRCLE INSIDE
815 mirrorChars.put(0x2A7A, 0x2A79); // GREATER-THAN WITH CIRCLE INSIDE
816 mirrorChars.put(0x2A7D, 0x2A7E); // LESS-THAN OR SLANTED EQUAL TO
817 mirrorChars.put(0x2A7E, 0x2A7D); // GREATER-THAN OR SLANTED EQUAL TO
818 mirrorChars.put(0x2A7F, 0x2A80); // LESS-THAN OR SLANTED EQUAL TO WITH DOT INSIDE
819 mirrorChars.put(0x2A80, 0x2A7F); // GREATER-THAN OR SLANTED EQUAL TO WITH DOT INSIDE
820 mirrorChars.put(0x2A81, 0x2A82); // LESS-THAN OR SLANTED EQUAL TO WITH DOT ABOVE
821 mirrorChars.put(0x2A82, 0x2A81); // GREATER-THAN OR SLANTED EQUAL TO WITH DOT ABOVE
822 mirrorChars.put(0x2A83, 0x2A84); // LESS-THAN OR SLANTED EQUAL TO WITH DOT ABOVE RIGHT
823 mirrorChars.put(0x2A84, 0x2A83); // GREATER-THAN OR SLANTED EQUAL TO WITH DOT ABOVE LEFT
824 mirrorChars.put(0x2A8B, 0x2A8C); // LESS-THAN ABOVE DOUBLE-LINE EQUAL ABOVE GREATER-THAN
825 mirrorChars.put(0x2A8C, 0x2A8B); // GREATER-THAN ABOVE DOUBLE-LINE EQUAL ABOVE LESS-THAN
826 mirrorChars.put(0x2A91, 0x2A92); // LESS-THAN ABOVE GREATER-THAN ABOVE DOUBLE-LINE EQUAL
827 mirrorChars.put(0x2A92, 0x2A91); // GREATER-THAN ABOVE LESS-THAN ABOVE DOUBLE-LINE EQUAL
828 mirrorChars.put(0x2A93, 0x2A94); // LESS-THAN ABOVE SLANTED EQUAL ABOVE GREATER-THAN ABOVE SLANTED EQUAL
829 mirrorChars.put(0x2A94, 0x2A93); // GREATER-THAN ABOVE SLANTED EQUAL ABOVE LESS-THAN ABOVE SLANTED EQUAL
830 mirrorChars.put(0x2A95, 0x2A96); // SLANTED EQUAL TO OR LESS-THAN
831 mirrorChars.put(0x2A96, 0x2A95); // SLANTED EQUAL TO OR GREATER-THAN
832 mirrorChars.put(0x2A97, 0x2A98); // SLANTED EQUAL TO OR LESS-THAN WITH DOT INSIDE
833 mirrorChars.put(0x2A98, 0x2A97); // SLANTED EQUAL TO OR GREATER-THAN WITH DOT INSIDE
834 mirrorChars.put(0x2A99, 0x2A9A); // DOUBLE-LINE EQUAL TO OR LESS-THAN
835 mirrorChars.put(0x2A9A, 0x2A99); // DOUBLE-LINE EQUAL TO OR GREATER-THAN
836 mirrorChars.put(0x2A9B, 0x2A9C); // DOUBLE-LINE SLANTED EQUAL TO OR LESS-THAN
837 mirrorChars.put(0x2A9C, 0x2A9B); // DOUBLE-LINE SLANTED EQUAL TO OR GREATER-THAN
838 mirrorChars.put(0x2AA1, 0x2AA2); // DOUBLE NESTED LESS-THAN
839 mirrorChars.put(0x2AA2, 0x2AA1); // DOUBLE NESTED GREATER-THAN
840 mirrorChars.put(0x2AA6, 0x2AA7); // LESS-THAN CLOSED BY CURVE
841 mirrorChars.put(0x2AA7, 0x2AA6); // GREATER-THAN CLOSED BY CURVE
842 mirrorChars.put(0x2AA8, 0x2AA9); // LESS-THAN CLOSED BY CURVE ABOVE SLANTED EQUAL
843 mirrorChars.put(0x2AA9, 0x2AA8); // GREATER-THAN CLOSED BY CURVE ABOVE SLANTED EQUAL
844 mirrorChars.put(0x2AAA, 0x2AAB); // SMALLER THAN
845 mirrorChars.put(0x2AAB, 0x2AAA); // LARGER THAN
846 mirrorChars.put(0x2AAC, 0x2AAD); // SMALLER THAN OR EQUAL TO
847 mirrorChars.put(0x2AAD, 0x2AAC); // LARGER THAN OR EQUAL TO
848 mirrorChars.put(0x2AAF, 0x2AB0); // PRECEDES ABOVE SINGLE-LINE EQUALS SIGN
849 mirrorChars.put(0x2AB0, 0x2AAF); // SUCCEEDS ABOVE SINGLE-LINE EQUALS SIGN
850 mirrorChars.put(0x2AB3, 0x2AB4); // PRECEDES ABOVE EQUALS SIGN
851 mirrorChars.put(0x2AB4, 0x2AB3); // SUCCEEDS ABOVE EQUALS SIGN
852 mirrorChars.put(0x2ABB, 0x2ABC); // DOUBLE PRECEDES
853 mirrorChars.put(0x2ABC, 0x2ABB); // DOUBLE SUCCEEDS
854 mirrorChars.put(0x2ABD, 0x2ABE); // SUBSET WITH DOT
855 mirrorChars.put(0x2ABE, 0x2ABD); // SUPERSET WITH DOT
856 mirrorChars.put(0x2ABF, 0x2AC0); // SUBSET WITH PLUS SIGN BELOW
857 mirrorChars.put(0x2AC0, 0x2ABF); // SUPERSET WITH PLUS SIGN BELOW
858 mirrorChars.put(0x2AC1, 0x2AC2); // SUBSET WITH MULTIPLICATION SIGN BELOW
859 mirrorChars.put(0x2AC2, 0x2AC1); // SUPERSET WITH MULTIPLICATION SIGN BELOW
860 mirrorChars.put(0x2AC3, 0x2AC4); // SUBSET OF OR EQUAL TO WITH DOT ABOVE
861 mirrorChars.put(0x2AC4, 0x2AC3); // SUPERSET OF OR EQUAL TO WITH DOT ABOVE
862 mirrorChars.put(0x2AC5, 0x2AC6); // SUBSET OF ABOVE EQUALS SIGN
863 mirrorChars.put(0x2AC6, 0x2AC5); // SUPERSET OF ABOVE EQUALS SIGN
864 mirrorChars.put(0x2ACD, 0x2ACE); // SQUARE LEFT OPEN BOX OPERATOR
865 mirrorChars.put(0x2ACE, 0x2ACD); // SQUARE RIGHT OPEN BOX OPERATOR
866 mirrorChars.put(0x2ACF, 0x2AD0); // CLOSED SUBSET
867 mirrorChars.put(0x2AD0, 0x2ACF); // CLOSED SUPERSET
868 mirrorChars.put(0x2AD1, 0x2AD2); // CLOSED SUBSET OR EQUAL TO
869 mirrorChars.put(0x2AD2, 0x2AD1); // CLOSED SUPERSET OR EQUAL TO
870 mirrorChars.put(0x2AD3, 0x2AD4); // SUBSET ABOVE SUPERSET
871 mirrorChars.put(0x2AD4, 0x2AD3); // SUPERSET ABOVE SUBSET
872 mirrorChars.put(0x2AD5, 0x2AD6); // SUBSET ABOVE SUBSET
873 mirrorChars.put(0x2AD6, 0x2AD5); // SUPERSET ABOVE SUPERSET
874 mirrorChars.put(0x2ADE, 0x22A6); // SHORT LEFT TACK
875 mirrorChars.put(0x2AE3, 0x22A9); // DOUBLE VERTICAL BAR LEFT TURNSTILE
876 mirrorChars.put(0x2AE4, 0x22A8); // VERTICAL BAR DOUBLE LEFT TURNSTILE
877 mirrorChars.put(0x2AE5, 0x22AB); // DOUBLE VERTICAL BAR DOUBLE LEFT TURNSTILE
878 mirrorChars.put(0x2AEC, 0x2AED); // DOUBLE STROKE NOT SIGN
879 mirrorChars.put(0x2AED, 0x2AEC); // REVERSED DOUBLE STROKE NOT SIGN
880 mirrorChars.put(0x2AF7, 0x2AF8); // TRIPLE NESTED LESS-THAN
881 mirrorChars.put(0x2AF8, 0x2AF7); // TRIPLE NESTED GREATER-THAN
882 mirrorChars.put(0x2AF9, 0x2AFA); // DOUBLE-LINE SLANTED LESS-THAN OR EQUAL TO
883 mirrorChars.put(0x2AFA, 0x2AF9); // DOUBLE-LINE SLANTED GREATER-THAN OR EQUAL TO
884 mirrorChars.put(0x3008, 0x3009); // LEFT ANGLE BRACKET
885 mirrorChars.put(0x3009, 0x3008); // RIGHT ANGLE BRACKET
886 mirrorChars.put(0x300A, 0x300B); // LEFT DOUBLE ANGLE BRACKET
887 mirrorChars.put(0x300B, 0x300A); // RIGHT DOUBLE ANGLE BRACKET
888 mirrorChars.put(0x300C, 0x300D); // [BEST FIT] LEFT CORNER BRACKET
889 mirrorChars.put(0x300D, 0x300C); // [BEST FIT] RIGHT CORNER BRACKET
890 mirrorChars.put(0x300E, 0x300F); // [BEST FIT] LEFT WHITE CORNER BRACKET
891 mirrorChars.put(0x300F, 0x300E); // [BEST FIT] RIGHT WHITE CORNER BRACKET
892 mirrorChars.put(0x3010, 0x3011); // LEFT BLACK LENTICULAR BRACKET
893 mirrorChars.put(0x3011, 0x3010); // RIGHT BLACK LENTICULAR BRACKET
894 mirrorChars.put(0x3014, 0x3015); // LEFT TORTOISE SHELL BRACKET
895 mirrorChars.put(0x3015, 0x3014); // RIGHT TORTOISE SHELL BRACKET
896 mirrorChars.put(0x3016, 0x3017); // LEFT WHITE LENTICULAR BRACKET
897 mirrorChars.put(0x3017, 0x3016); // RIGHT WHITE LENTICULAR BRACKET
898 mirrorChars.put(0x3018, 0x3019); // LEFT WHITE TORTOISE SHELL BRACKET
899 mirrorChars.put(0x3019, 0x3018); // RIGHT WHITE TORTOISE SHELL BRACKET
900 mirrorChars.put(0x301A, 0x301B); // LEFT WHITE SQUARE BRACKET
901 mirrorChars.put(0x301B, 0x301A); // RIGHT WHITE SQUARE BRACKET
902 mirrorChars.put(0xFF08, 0xFF09); // FULLWIDTH LEFT PARENTHESIS
903 mirrorChars.put(0xFF09, 0xFF08); // FULLWIDTH RIGHT PARENTHESIS
904 mirrorChars.put(0xFF1C, 0xFF1E); // FULLWIDTH LESS-THAN SIGN
905 mirrorChars.put(0xFF1E, 0xFF1C); // FULLWIDTH GREATER-THAN SIGN
906 mirrorChars.put(0xFF3B, 0xFF3D); // FULLWIDTH LEFT SQUARE BRACKET
907 mirrorChars.put(0xFF3D, 0xFF3B); // FULLWIDTH RIGHT SQUARE BRACKET
908 mirrorChars.put(0xFF5B, 0xFF5D); // FULLWIDTH LEFT CURLY BRACKET
909 mirrorChars.put(0xFF5D, 0xFF5B); // FULLWIDTH RIGHT CURLY BRACKET
910 mirrorChars.put(0xFF5F, 0xFF60); // FULLWIDTH LEFT WHITE PARENTHESIS
911 mirrorChars.put(0xFF60, 0xFF5F); // FULLWIDTH RIGHT WHITE PARENTHESIS
912 mirrorChars.put(0xFF62, 0xFF63); // [BEST FIT] HALFWIDTH LEFT CORNER BRACKET
913 mirrorChars.put(0xFF63, 0xFF62); // [BEST FIT] HALFWIDTH RIGHT CORNER BRACKET
914 }
915 }

A to Z: JavaDoc & Examples

---

Daily Java News & Articles

---

Open Source Projects

---

Open Source Codes

---

Free Computer Books

---

Remove Frame

---

Popular Tags