download JSLineBreaker.java
Language: Java
Copyright: (c) 1998 Tal Davidson. All rights reserved.
LOC: 356
Project Info
Jipe
Server: SourceForge
Type: cvs
...\j\jipe\jipe\jipe\src\jipe\
   BoxComment.java
   BrowserLauncher.java
   ClassBrowser.java
   ClassFilter.java
   DeleteLine.java
   Editor.java
   ExtensionFilter.java
   Find.java
   FindInFiles.java
   HelpConsole.java
   HtmlFilter.java
   IDEOptions.java
   JarFileManager.java
   JavaFilter.java
   JavaOptions.java
   Jipe.java
   JipeCodeCompleter.java
   JipeCompiler.java
   JipeConsole.java
   JipeDecompiler.java
   JipeMethodFinder.java
   JipeProjectManager.java
   JipeUtilities.java
   JSBeautifier.java
   JSFormatter.java
   JSLineBreaker.java
   JspFilter.java
   LeftIndent.java
   ListAllFiles.java
   MasterFilter.java
   Print.java
   PrintManager.java
   ProjectFilter.java
   PropertiesManager.java
   RemoveSpaces.java
   RightIndent.java
   SimpleComment.java
   SpecialFileFilters.java
   StatusBar.java
   StringParser.java
   TextFilter.java
   ToLowerCase.java
   ToUpperCase.java
   WingComment.java

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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
/*
 * Copyright (c) 1998 Tal Davidson. All rights reserved.
 *
 * JSLineBreaker 0.4.0
 * by Tal Davidson (davidsont@bigfoot.com)
 *
 * JSLineBreaker 0.4.0 is distributed under the "Artistic Licence" detailed below:
 *
 *
 *                           The ``Artistic License''
 *
 * Preamble
 * The intent of this document is to state the conditions under which a Package may
 * be copied, such that the Copyright Holder maintains some semblance of artistic
 * control over the development of the package, while giving the users of the
 * package the right to use and distribute the Package in a more-or-less customary
 * fashion, plus the right to make reasonable modifications.
 *
 * Definitions
 *     ``Package'' refers to the collection of files distributed by the Copyright
 *     Holder, and derivatives of that collection of files created through textual
 *     modification.
 *     ``Standard Version'' refers to such a Package if it has not been modified,
 *     or has been modified in accordance with the wishes of the Copyright Holder
 *     as specified below.
 *     ``Copyright Holder'' is whoever is named in the copyright or copyrights for
 *     the package.
 *     ``You'' is you, if you're thinking about copying or distributing this
 *     Package.
 *     ``Reasonable copying fee'' is whatever you can justify on the basis of media
 *     cost, duplication charges, time of people involved, and so on. (You will not
 *     be required to justify it to the Copyright Holder, but only to the computing
 *     community at large as a market that must bear the fee.)
 *     ``Freely Available'' means that no fee is charged for the item itself,
 *     though there may be fees involved in handling the item. It also means that
 *     recipients of the item may redistribute it under the same conditions they
 *     received it.
 *
 *     1. You may make and give away verbatim copies of the source form of the
 *        Standard Version of this Package without restriction, provided that you
 *        duplicate all of the original copyright notices and associated disclaimers.
 *     2. You may apply bug fixes, portability fixes and other modifications derived
 *        from the Public Domain or from the Copyright Holder. A Package modified in
 *        such a way shall still be considered the Standard Version.
 *     3. You may otherwise modify your copy of this Package in any way, provided that
 *        you insert a prominent notice in each changed file stating how and when you
 *        changed that file, and provided that you do at least ONE of the following:
 *         a. place your modifications in the Public Domain or otherwise make them
 *            Freely Available, such as by posting said modifications to Usenet or an
 *            equivalent medium, or placing the modifications on a major archive site
 *            such as uunet.uu.net, or by allowing the Copyright Holder to include
 *            your modifications in the Standard Version of the Package.
 *         b. use the modified Package only within your corporation or organization.
 *         c. rename any non-standard executables so the names do not conflict with
 *            standard executables, which must also be provided, and provide a
 *            separate manual page for each non-standard executable that clearly
 *            documents how it differs from the Standard Version.
 *         d. make other distribution arrangements with the Copyright Holder.
 *     4. You may distribute the programs of this Package in object code or executable
 *        form, provided that you do at least ONE of the following:
 *         a. distribute a Standard Version of the executables and library files,
 *            together with instructions (in the manual page or equivalent) on where
 *            to get the Standard Version.
 *         b. accompany the distribution with the machine-readable source of the
 *            Package with your modifications.
 *         c. give non-standard executables non-standard names, and clearly document
 *            the differences in manual pages (or equivalent), together with
 *            instructions on where to get the Standard Version.
 *         d. make other distribution arrangements with the Copyright Holder.
 *     5. You may charge a reasonable copying fee for any distribution of this
 *        Package. You may charge any fee you choose for support of this Package. You
 *        may not charge a fee for this Package itself. However, you may distribute
 *        this Package in aggregate with other (possibly commercial) programs as part
 *        of a larger (possibly commercial) software distribution provided that you do
 *        not advertise this Package as a product of your own. You may embed this
 *        Package's interpreter within an executable of yours (by linking); this shall
 *        be construed as a mere form of aggregation, provided that the complete
 *        Standard Version of the interpreter is so embedded.
 *     6. The scripts and library files supplied as input to or produced as output
 *        from the programs of this Package do not automatically fall under the
 *        copyright of this Package, but belong to whomever generated them, and may be
 *        sold commercially, and may be aggregated with this Package. If such scripts
 *        or library files are aggregated with this Package via the so-called "undump"
 *        or "unexec" methods of producing a binary executable image, then
 *        distribution of such an image shall neither be construed as a distribution
 *        of this Package nor shall it fall under the restrictions of Paragraphs 3 and
 *        4, provided that you do not represent such an executable image as a Standard
 *        Version of this Package.
 *     7. C subroutines (or comparably compiled subroutines in other languages)
 *        supplied by you and linked into this Package in order to emulate subroutines
 *        and variables of the language defined by this Package shall not be
 *        considered part of this Package, but are the equivalent of input as in
 *        Paragraph 6, provided these subroutines do not change the language in any
 *        way that would cause it to fail the regression tests for the language.
 *     8. Aggregation of this Package with a commercial distribution is always
 *        permitted provided that the use of this Package is embedded; that is, when
 *        no overt attempt is made to make this Package's interfaces visible to the
 *        end user of the commercial distribution. Such use shall not be construed as
 *        a distribution of this Package.
 *     9. The name of the Copyright Holder may not be used to endorse or promote
 *        products derived from this software without specific prior written
 *        permission.
 *        THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
 *        WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
 *        MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 * The End
 */
package jipe;
import java.util.*;

class JSLineBreaker
{
    private static final int BEFORE = 0;
    private static final int AFTER = 1;

    private String prefs[] = {
        "().", "()", ").", "+=", "-=", "*=", "/=", "%=", "^=", "||", "&&", "==", "!=", ">=", "<=",
        "(", ")", "[", "]", "?", ":", ",", ";", "=", "<", ">", "+", "-", "*", "/", "&", "|", /*"!",*/ "^"
    };
    private static Hashtable prefTable;
    static
    {
        prefTable = new Hashtable();
        prefTable.put("()", new Integer(80/*35*/)); // () appears here so that it will not be cut in the middle...

        prefTable.put("().", new Integer(90)); // () appears here so that it will not be cut in the middle...
        prefTable.put(").", new Integer(90)); // () appears here so that it will not be cut in the middle...

        prefTable.put("(", new Integer(80));//<--
        prefTable.put(")", new Integer(80));
        prefTable.put("[", new Integer(80));
        prefTable.put("]", new Integer(80));
        prefTable.put(",", new Integer(10));
        prefTable.put(";", new Integer(5));


        prefTable.put("=", new Integer(20));
        prefTable.put("+=", new Integer(20));
        prefTable.put("-=", new Integer(20));
        prefTable.put("*=", new Integer(20));
        prefTable.put("/=", new Integer(20));
        prefTable.put("|=", new Integer(20));
        prefTable.put("&=", new Integer(20));
        prefTable.put("^=", new Integer(20));

        prefTable.put("?", new Integer(25));
        prefTable.put(":", new Integer(25));

        prefTable.put("||", new Integer(30));
        prefTable.put("&&", new Integer(30));

        prefTable.put("==", new Integer(40));
        prefTable.put("!=", new Integer(40));
        prefTable.put(">=", new Integer(40));
        prefTable.put("<=", new Integer(40));
        prefTable.put(">", new Integer(40));
        prefTable.put("<", new Integer(40));

        prefTable.put("+", new Integer(50));
        prefTable.put("-", new Integer(50));
        prefTable.put("*", new Integer(60));
        prefTable.put("/", new Integer(60));
        prefTable.put("%", new Integer(60));
        //prefTable.put("!", new Integer(70));
        prefTable.put("&", new Integer(70));
        prefTable.put("|", new Integer(70));
        prefTable.put("^", new Integer(70));
    }


    private Vector brokenLineVector;
    private StringBuffer wsBuffer;
    private char quoteChar;
    private boolean isInQuote;
    private boolean isInComment;
    private boolean isNestedConnection = true;
    private boolean isCut;
    private boolean isLineComment; // true when the current character is in a // comment (such as this line ...)
    private int parenDepth;
    private int breakDepth;
    private int preferredLineLength = 70;
    private int lineLengthDeviation = 5;




    JSLineBreaker()
    {
        init();
    }

    void init()
    {
        brokenLineVector = new Vector();

        parenDepth = 0;
        breakDepth = 0; // <------ 2

        isInQuote = false;
        isInComment = false;
        isCut = false;
        isLineComment = false;
        wsBuffer = new StringBuffer();

    }

    void setPreferredLineLength(int length)
    {
        preferredLineLength = length;
    }

    void setLineLengthDeviation(int dev)
    {
        lineLengthDeviation = dev;
    }

    void setNestedConnection(boolean nest)
    {
        isNestedConnection = nest;
    }

    void breakLine(String line)
    {
        StringBuffer outBuffer = new StringBuffer();
        Stack lineBreakStack = new Stack();
        String previousAfterCut = "";
        boolean isSpecialChar = false;
        char ch = ' ';       // the current character
        char prevCh = 0;
        int i;
        int ws;
        int regBreak = 0;
        int wsBreak = 0;
        int chosenBreak = 0;
        int BufLength;
        int bufferStart = 0;

        //System.out.println("line length: " + line.length() + " line: " + line );
        if ( line.trim().length() == 0)
        {
            brokenLineVector.addElement("");
            return;
        }

        ch = line.charAt(0);
        ws = 0;

        if (!isLineComment)
            isCut = false;
        isLineComment = false;

        if (!isCut)
        {
            wsBuffer = new StringBuffer();

            while ( (ch == ' ' || ch == '\t') && ws<line.length()-1)
            {
                //System.out.println(ch + " " + ws);
                wsBuffer.append(ch);
                ch = line.charAt( ++ws );
            }
        }

        //System.out.println(ws);
        // parse characters in the current line.
        for (i=ws; i<line.length(); i++)
        {
            if (ch != ' ' && ch != '\t')
                prevCh = ch;
            ch = line.charAt(i);

            // handle special characters (i.e. backslash+character such as \n, \t, ...)
            if (isSpecialChar)
            {
                outBuffer.append(ch);
                isSpecialChar = false;
                continue;
            }
            if (!(isInComment || isLineComment) && line.regionMatches(false, i, "\\\\", 0, 2))
            {
                outBuffer.append("\\\\");
                i++;
                continue;
            }
            if (!(isInComment || isLineComment) && ch=='\\')
            {
                outBuffer.append(ch);
                isSpecialChar = true;
                continue;
            }


            // handle comments
            if ( !isInQuote && !(isInComment || isLineComment) && line.regionMatches(false, i, "//", 0, 2) )
            {
                isLineComment = true;
                outBuffer.append("//");
                i++;
                continue;
            }
            else if ( !isInQuote && !(isInComment || isLineComment) && line.regionMatches(false, i, "/*", 0, 2) )
            {
                isInComment = true;
                outBuffer.append("/*");
                i++;
                continue;
            }
            else if ( !isInQuote && (isInComment || isLineComment) && line.regionMatches(false, i, "*/", 0, 2) )
            {
                isInComment = false;
                outBuffer.append("*/");
                i++;
                continue;
            }
            if (isInComment || isLineComment)
            {
                outBuffer.append(ch);
                continue;
            }

            // handle quotes (such as 'x' and "Hello Dolly")
            if (ch=='"' || ch=='\'')
                if (!isInQuote)
                {
                    quoteChar = ch;
                    isInQuote = true;
                }
                else if (quoteChar == ch)
                {
                    isInQuote = false;
                    outBuffer.append(ch);
                    continue;
                }
            if (isInQuote)
            {
                outBuffer.append(ch);
                continue;
            }

            outBuffer.append(ch);

            for (int p=0; p<prefs.length; p++)
            {
                String key = (String) prefs[p];
                if (line.regionMatches(false, i, key, 0, key.length()))
                {
                    int breakType = AFTER;
                    if (ch == '(' || ch == '[' || ch == ')' || ch == ']')
                    {
                        if ("(".equals(key) /*ch == '('*/ || ch == '[')
                            parenDepth++;
                        else if (/*")".equals(key)*/ ch == ')' || ch == ']')
                            parenDepth--;

                        breakDepth = parenDepth;
                        if (ch == ')' || ch == ']' || key.startsWith("()"))
                            breakDepth++;

                        if (ch == '(' || ch == '[')
                            if( (prevCh>='a' &&prevCh<='z')
                                    || (prevCh>='A' &&prevCh<='Z')
                                    || (prevCh>='0' &&prevCh<='9')
                                    || (prevCh=='.'))
                                breakType = AFTER;
                            else
                                breakType = BEFORE;
                        else
                            breakType = AFTER;
                    }

                    if (key.length() > 1)
                    {
                        outBuffer.append(key.substring(1));
                        i += key.length() - 1;
                    }
                    registerLineBreak(lineBreakStack,
                                      new LineBreak(key, outBuffer.length()+bufferStart, breakDepth, breakType));

                    breakDepth = parenDepth;

                    break;
                }
            }


            int bufLength = outBuffer.length() + wsBuffer.length() + previousAfterCut.length() + (isCut ? 8 : 0);

            LineBreak curBreak = null;
            if (bufLength > preferredLineLength && i < line.length() - lineLengthDeviation)
            {
                while (!lineBreakStack.isEmpty())
                {
                    curBreak = (LineBreak) lineBreakStack.elementAt(0);
                    if (curBreak.breakWhere-bufferStart < 1) // <-----
                    {
                        curBreak = null;
                        lineBreakStack.removeElementAt(0);
                    }
                    else
                        break;
                }
                if (curBreak != null)
                    lineBreakStack.removeElementAt(0);
            }

            if (curBreak != null) // in future, think of: && line.length()>i+10) (that was used in the past...)
            {
                int cutWhere = curBreak.breakWhere - bufferStart - (curBreak.breakType == BEFORE ? curBreak.breakStr.length() : 0);
                if (cutWhere < 8)
                    continue;
                StringBuffer brokenLineBuffer = new StringBuffer();
                String outString = outBuffer.toString();
                String beforeCut = outString.substring(0, cutWhere);

                //brokenLineBuffer.append(wsBuffer);

                /*
                if (isCut)
                    brokenLineBuffer.append("        ");
                brokenLineBuffer.append(beforeCut);
                brokenLineVector.addElement(brokenLineBuffer.toString());
                */
                brokenLineBuffer.append(beforeCut);
                addBrokenLine(wsBuffer.toString(), brokenLineBuffer.toString(), curBreak, breakDepth, isCut);

                //previousAfterCut = outString.substring(cutWhere);
                bufferStart += cutWhere;
                outBuffer = new StringBuffer(outString.substring(cutWhere));

                //lineBreakStack = new Stack();
                isCut = true;
            }
        }

        // at end of line:
        StringBuffer brokenLineBuffer = new StringBuffer();
        //brokenLineBuffer.append(wsBuffer);
        /*
        if (isCut)
            brokenLineBuffer.append("        ");
        brokenLineBuffer.append(outBuffer);
        brokenLineVector.addElement(brokenLineBuffer.toString());
        */
        brokenLineBuffer.append(outBuffer);
        addBrokenLine(wsBuffer.toString(), brokenLineBuffer.toString(), null, breakDepth, isCut);

    }

    private void registerLineBreak(Stack lineBreakStack, LineBreak newBreak)
    {
        LineBreak lastBreak;
        while (!lineBreakStack.isEmpty())
        {
            lastBreak = (LineBreak) lineBreakStack.peek();
            if (compare(lastBreak, newBreak) < 0)
                lineBreakStack.pop();
            else
                break;
        }
        lineBreakStack.push(newBreak);
        //newBreak.dump();

        /*       System.out.println("for " + newBreak.breakStr);
               for (int s=0; s<lineBreakStack.size(); s++)
                   ((LineBreak) lineBreakStack.elementAt(s)).dump();
               System.out.println();
         */
    }

    private LineBreak previousLineBreak = null;

    private void addBrokenLine(String whiteSpace, String brokenLine, LineBreak lineBreak, int breakDepth, boolean isCut)
    {
        boolean isLineAppended = false;

        brokenLine = brokenLine.trim();

        if (previousLineBreak != null) //&& brokenLine.length() > 0)
        {
            String previousBrokenLine = (String) brokenLineVector.lastElement();
            if (brokenLine.length() + previousBrokenLine.length() <= preferredLineLength + lineLengthDeviation
                    || brokenLine.startsWith("{"))
            {
                if (lineBreak == null ||
                        (isNestedConnection && !",".equals(previousLineBreak.breakStr)) ||
                        (lineBreak.breakDepth < previousLineBreak.breakDepth) || //dfds
                        (lineBreak.breakDepth == previousLineBreak.breakDepth &&
                         ((!isNestedConnection && !",".equals(previousLineBreak.breakStr)) ||
                          ",".equals(lineBreak.breakStr) || ";".equals(lineBreak.breakStr) ||
                          ")".equals(lineBreak.breakStr) || "]".equals(lineBreak.breakStr)))
                   )
                {
                    brokenLineVector.setElementAt( (previousBrokenLine + " " + brokenLine),
                                                   brokenLineVector.size()-1);
                    isLineAppended = true;
                }
            }
        }

        if (!isLineAppended)
        {
            if (isCut &&
                    !(previousLineBreak != null && ",".equals(previousLineBreak.breakStr) &&
                      previousLineBreak.breakDepth == 0))
                brokenLine = "        " + brokenLine;
            brokenLine = whiteSpace + brokenLine;
            brokenLineVector.addElement(brokenLine);
        }

        previousLineBreak = lineBreak;
    }

    private int compare(LineBreak br1, LineBreak br2)
    {
        if (br1.breakDepth < br2.breakDepth)
            return 1;
        else if (br1.breakDepth > br2.breakDepth)
            return -1;

        int ord1 = ((Integer) prefTable.get(br1.breakStr)).intValue();
        int ord2 = ((Integer) prefTable.get(br2.breakStr)).intValue();
        if (ord1 < ord2)
            return 1;
        else
            return -1;


    }

    boolean hasMoreBrokenLines()
    {
        return brokenLineVector.size() > 0;
    }

    String nextBrokenLine()
    {
        String nextLine;

        if (hasMoreBrokenLines())
        {
            nextLine = (String) brokenLineVector.firstElement();
            brokenLineVector.removeElementAt(0);
        }
        else
            return nextLine = "";

        return nextLine;
    }


    class LineBreak
    {
        String breakStr;
        int breakWhere;
        int breakDepth;
        int breakType;

        LineBreak(String str, int wh, int dp, int tp)
        {
            breakStr = str;
            breakWhere = wh;
            breakDepth = dp;
            breakType = tp;
        }

        void dump()
        {
            System.out.println("LB: str="+breakStr+" wh="+breakWhere+" dep="+breakDepth+" tp="+breakType);
        }
    }

}

About Koders | Resources | Downloads | Support | Black Duck | Submit Project | Terms of Service | DMCA | Privacy Policy | Site Map| Contact Us