Here you can find the source of repeat(String val, int n)
Parameter | Description |
---|---|
val | the string |
n | the repetitions |
public static String repeat(String val, int n)
//package com.java2s; /*// www .ja v a 2s . c o m * This file is part of JOP, the Java Optimized Processor * see <http://www.jopdesign.com/> * * Copyright (C) 2008, Benedikt Huber (benedikt.huber@gmail.com) * * 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 3 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. * * You should have received a copy of the GNU General Public License * along with this program. If not, see <http://www.gnu.org/licenses/>. */ import java.util.Collection; import java.util.Iterator; public class Main { /** * Return n repetitions of a string, which is usually a single character. * * @param val the string * @param n the repetitions * @return the repeated string */ public static String repeat(String val, int n) { StringBuffer sb = new StringBuffer(); for (int i = 0; i < n; i++) { sb.append(val); } return sb.toString(); } /** * @param entries a collection of things * @param max maximum number of entries to print * @return a string representation of this collection with up to max entries. */ public static String toString(Collection<?> entries, int max) { StringBuffer sb = new StringBuffer("["); int cnt = Math.min(entries.size(), max); Iterator<?> it = entries.iterator(); for (int i = 0; i < cnt; i++) { if (i > 0) sb.append(","); sb.append(it.next().toString()); } if (cnt < entries.size()) { sb.append(",..."); } sb.append("]"); return sb.toString(); } }