Here you can find the source of leftPad(String str, int size)
public static String leftPad(String str, int size)
//package com.java2s; /**// ww w . j a v a2s .c om * Copyright Sangram Jadhav. All rights reserved. * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. */ public class Main { public static String leftPad(String str, int size) { return leftPad(str, size, ' '); } public static String leftPad(String str, int size, char padChar) { if (str == null) { return null; } int pads = size - str.length(); if (pads <= 0) { return str; } if (pads > 8192) { return leftPad(str, size, String.valueOf(padChar)); } return repeat(String.valueOf(padChar), pads).concat(str); } public static String leftPad(String str, int size, String padStr) { if (str == null) { return null; } if (isEmpty(padStr)) { padStr = " "; } int padLen = padStr.length(); int strLen = str.length(); int pads = size - strLen; if (pads <= 0) { return str; } if ((padLen == 1) && (pads <= 8192)) { return leftPad(str, size, padStr.charAt(0)); } if (pads == padLen) { return padStr.concat(str); } if (pads < padLen) { return padStr.substring(0, pads).concat(str); } char[] padding = new char[pads]; char[] padChars = padStr.toCharArray(); for (int i = 0; i < pads; i++) { padding[i] = padChars[(i % padLen)]; } return new String(padding).concat(str); } /** * <p> * Repeat a String {@code repeat} times to form a new String. * </p> * */ public static String repeat(final String s, final int repeat) { if (s == null) { return null; } if (repeat <= 0) { return ""; } final int inputLength = s.length(); if (repeat == 1 || inputLength == 0) { return s; } final int outputLength = inputLength * repeat; switch (inputLength) { case 1: return repeat(String.valueOf(s.charAt(0)), repeat); case 2: final char ch0 = s.charAt(0); final char ch1 = s.charAt(1); final char[] output2 = new char[outputLength]; for (int i = repeat * 2 - 2; i >= 0; i--, i--) { output2[i] = ch0; output2[i + 1] = ch1; } return new String(output2); default: final StringBuilder buf = new StringBuilder(outputLength); for (int i = 0; i < repeat; i++) { buf.append(s); } return buf.toString(); } } /** * <p> * Repeat a String {@code repeat} times to form a new String, with a String * separator injected each time. * </p> * */ public static String repeat(final String s, final String separator, final int repeat) { if (s == null || separator == null) { return repeat(s, repeat); } // given that repeat(String, int) is quite optimized, better to rely on // it than try and splice this into it final String result = repeat(s + separator, repeat); return removeEnd(result, separator); } /** * Checks if string is empty or null. */ public static boolean isEmpty(final String s) { return s == null || s.length() == 0; } /** * <p> * Gets a substring from the specified String avoiding exceptions. * </p> * * <p> * A negative start position can be used to start {@code n} characters from * the end of the String. * </p> * * <p> * A {@code null} String will return {@code null}. An empty ("") String will * return "". * </p> * */ public static String substring(final String s, int start) { if (s == null) { return null; } // handle negatives, which means last n characters if (start < 0) { start = s.length() + start; // remember start is negative } if (start < 0) { start = 0; } if (start > s.length()) { return ""; } return s.substring(start); } /** * <p> * Gets a substring from the specified String avoiding exceptions. * </p> * * <p> * A negative start position can be used to start/end {@code n} characters * from the end of the String. * </p> * * <p> * The returned substring starts with the character in the {@code start} * position and ends before the {@code end} position. All position counting * is zero-based -- i.e., to start at the beginning of the string use * {@code start = 0}. Negative start and end positions can be used to * specify offsets relative to the end of the String. * </p> * * <p> * If {@code start} is not strictly to the left of {@code end}, "" is * returned. * </p> * */ public static String substring(final String s, int start, int end) { if (s == null) { return null; } // handle negatives if (end < 0) { end = s.length() + end; // remember end is negative } if (start < 0) { start = s.length() + start; // remember start is negative } // check length next if (end > s.length()) { end = s.length(); } // if start is greater than end, return "" if (start > end) { return ""; } if (start < 0) { start = 0; } if (end < 0) { end = 0; } return s.substring(start, end); } /** * <p> * Removes a substring only if it is at the end of a source string, * otherwise returns the source string. * </p> * * <p> * A {@code null} source string will return {@code null}. An empty ("") * source string will return the empty string. A {@code null} search string * will return the source string. * </p> */ public static String removeEnd(final String s, final String remove) { if (isEmpty(s) || isEmpty(remove)) { return s; } if (s.endsWith(remove)) { return s.substring(0, s.length() - remove.length()); } return s; } /** * <p> * Check if a String ends with a specified suffix. * </p> * * <p> * {@code null}s are handled without exceptions. Two {@code null} references * are considered to be equal. The comparison is case sensitive. * </p> * */ public static boolean endsWith(final String s, final String suffix) { return endsWith(s, suffix, false); } /** * <p> * Check if a String ends with a specified suffix (optionally case * insensitive). * </p> */ private static boolean endsWith(final String s, final String suffix, final boolean ignoreCase) { if (s == null || suffix == null) { return s == null && suffix == null; } if (suffix.length() > s.length()) { return false; } final int strOffset = s.length() - suffix.length(); return s.toString().regionMatches(ignoreCase, strOffset, suffix.toString(), 0, suffix.length()); } }