1 /* 2 * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 */ 25 26 /* 27 * This file is available under and governed by the GNU General Public 28 * License version 2 only, as published by the Free Software Foundation. 29 * However, the following notice accompanied the original version of this 30 * file: 31 * 32 * The MIT License 33 * 34 * Copyright (c) 2004-2015 Paul R. Holser, Jr. 35 * 36 * Permission is hereby granted, free of charge, to any person obtaining 37 * a copy of this software and associated documentation files (the 38 * "Software"), to deal in the Software without restriction, including 39 * without limitation the rights to use, copy, modify, merge, publish, 40 * distribute, sublicense, and/or sell copies of the Software, and to 41 * permit persons to whom the Software is furnished to do so, subject to 42 * the following conditions: 43 * 44 * The above copyright notice and this permission notice shall be 45 * included in all copies or substantial portions of the Software. 46 * 47 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 48 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 49 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 50 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 51 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 52 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 53 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 54 */ 55 56 package jdk.internal.joptsimple.internal; 57 58 import java.text.BreakIterator; 59 import java.util.ArrayList; 60 import java.util.List; 61 62 import static java.text.BreakIterator.*; 63 64 import static jdk.internal.joptsimple.internal.Strings.*; 65 66 /** 67 * @author <a href="mailto:pholser@alumni.rice.edu">Paul Holser</a> 68 */ 69 class Columns { 70 private static final int INDENT_WIDTH = 2; 71 72 private final int optionWidth; 73 private final int descriptionWidth; 74 Columns( int optionWidth, int descriptionWidth )75 Columns( int optionWidth, int descriptionWidth ) { 76 this.optionWidth = optionWidth; 77 this.descriptionWidth = descriptionWidth; 78 } 79 fit( Row row )80 List<Row> fit( Row row ) { 81 List<String> options = piecesOf( row.option, optionWidth ); 82 List<String> descriptions = piecesOf( row.description, descriptionWidth ); 83 84 List<Row> rows = new ArrayList<>(); 85 for ( int i = 0; i < Math.max( options.size(), descriptions.size() ); ++i ) 86 rows.add( new Row( itemOrEmpty( options, i ), itemOrEmpty( descriptions, i ) ) ); 87 88 return rows; 89 } 90 itemOrEmpty( List<String> items, int index )91 private static String itemOrEmpty( List<String> items, int index ) { 92 return index >= items.size() ? "" : items.get( index ); 93 } 94 piecesOf( String raw, int width )95 private List<String> piecesOf( String raw, int width ) { 96 List<String> pieces = new ArrayList<>(); 97 98 for ( String each : raw.trim().split( LINE_SEPARATOR ) ) 99 pieces.addAll( piecesOfEmbeddedLine( each, width ) ); 100 101 return pieces; 102 } 103 piecesOfEmbeddedLine( String line, int width )104 private List<String> piecesOfEmbeddedLine( String line, int width ) { 105 List<String> pieces = new ArrayList<>(); 106 107 BreakIterator words = BreakIterator.getLineInstance(); 108 words.setText( line ); 109 110 StringBuilder nextPiece = new StringBuilder(); 111 112 int start = words.first(); 113 for ( int end = words.next(); end != DONE; start = end, end = words.next() ) 114 nextPiece = processNextWord( line, nextPiece, start, end, width, pieces ); 115 116 if ( nextPiece.length() > 0 ) 117 pieces.add( nextPiece.toString() ); 118 119 return pieces; 120 } 121 processNextWord( String source, StringBuilder nextPiece, int start, int end, int width, List<String> pieces )122 private StringBuilder processNextWord( String source, StringBuilder nextPiece, int start, int end, int width, 123 List<String> pieces ) { 124 StringBuilder augmented = nextPiece; 125 126 String word = source.substring( start, end ); 127 if ( augmented.length() + word.length() > width ) { 128 pieces.add( augmented.toString().replaceAll( "\\s+$", "" ) ); 129 augmented = new StringBuilder( repeat( ' ', INDENT_WIDTH ) ).append( word ); 130 } 131 else 132 augmented.append( word ); 133 134 return augmented; 135 } 136 } 137