File: DelimiterFactory.java

package info (click to toggle)
libjmathtex-java 0.7~pre-4
  • links: PTS, VCS
  • area: main
  • in suites: lenny, squeeze
  • size: 952 kB
  • ctags: 1,112
  • sloc: java: 5,129; xml: 2,151; makefile: 24
file content (103 lines) | stat: -rw-r--r-- 4,103 bytes parent folder | download
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
/* DelimiterFactory.java
 * =========================================================================
 * This file is part of the JMathTeX Library - http://jmathtex.sourceforge.net
 *
 * Copyright (C) 2004-2007 Universiteit Gent
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or (at
 * your option) any later version.
 *
 * This program is distributed in the hope that it will be useful, but
 * WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * A copy of the GNU General Public License can be found in the file
 * LICENSE.txt provided with the source distribution of this program (see
 * the META-INF directory in the source jar). This license can also be
 * found on the GNU website at http://www.gnu.org/licenses/gpl.html.
 *
 * If you did not receive a copy of the GNU General Public License along
 * with this program, contact the lead developer, or write to the Free
 * Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
 * 02110-1301, USA.
 *
 */

package be.ugent.caagt.jmathtex; // NOPMD

/**
 * Responsible for creating a box containing a delimiter symbol that exists
 * in different sizes.
 */
class DelimiterFactory {
    
    /**
     *
     * @param symbol the name of the delimiter symbol
     * @param env the TeXEnvironment in which to create the delimiter box
     * @param minHeight the minimum required total height of the box (height + depth).
     * @return the box representing the delimiter variant that fits best according to
     * 			the required minimum size.
     */
    public static Box create(String symbol, TeXEnvironment env, float minHeight) {
        TeXFont tf = env.getTeXFont();
        int style = env.getStyle();
        Char c = tf.getChar(symbol, style);
        
        // start with smallest character
        Metrics m = c.getMetrics();
        float total = m.getHeight() + m.getDepth();
        
        // try larger versions of the same character until minHeight has been
        // reached
        while (total < minHeight && tf.hasNextLarger(c)) {
            c = tf.getNextLarger(c, style);
            m = c.getMetrics();
            total = m.getHeight() + m.getDepth();
        }
        if (total >= minHeight) { // tall enough character found
            return new CharBox(c);
        } else if (tf.isExtensionChar(c)) {
            // construct tall enough vertical box
            VerticalBox vBox = new VerticalBox();
            Extension ext = tf.getExtension(c, style); // extension info
            
            if (ext.hasTop()) { // insert top part
                c = ext.getTop();
                vBox.add(new CharBox(c));
            }
            
            boolean middle = ext.hasMiddle();
            if (middle) { // insert middle part
                c = ext.getMiddle();
                vBox.add(new CharBox(c));
            }
            
            if (ext.hasBottom()) { // insert bottom part
                c = ext.getBottom();
                vBox.add(new CharBox(c));
            }
            
            // insert repeatable part until tall enough
            c = ext.getRepeat();
            CharBox rep = new CharBox(c);
            do {
                if (ext.hasTop() && ext.hasBottom()) {
                    vBox.add(1, rep);
                    if (middle)
                        vBox.add(vBox.getSize() - 1, rep);
                } else if (ext.hasBottom())
                    vBox.add(0, rep);
                else
                    vBox.add(rep);
            } while (vBox.getHeight() + vBox.getDepth() < minHeight);
            
            return vBox;
        } else
            // no extensions, so return tallest possible character
            return new CharBox(c);
    }
}