private static CharSequence reverse(CharSequence s) { return new StringBuilder(s).reverse(); } }
private static CharSequence reverse(CharSequence s) { return new StringBuilder(s).reverse(); } }
private static String reverse(String word) { return new StringBuilder(word).reverse().toString(); }
private static CharSequence reverse(CharSequence s) { return new StringBuilder(s).reverse(); } }
private static CharSequence reverse(CharSequence s) { return new StringBuilder(s).reverse(); } }
/** * <p>Reverses a String as per {@link StringBuilder#reverse()}.</p> * * <p>A {@code null} String returns {@code null}.</p> * * <pre> * StringUtils.reverse(null) = null * StringUtils.reverse("") = "" * StringUtils.reverse("bat") = "tab" * </pre> * * @param str the String to reverse, may be null * @return the reversed String, {@code null} if null String input */ public static String reverse(final String str) { if (str == null) { return null; } return new StringBuilder(str).reverse().toString(); }
String source = "Hello World"; for (String part : source.split(" ")) { System.out.print(new StringBuilder(part).reverse().toString()); System.out.print(" "); }
public static String encode(long num, String symbols) { Preconditions.checkArgument(num>=0,"Expected non-negative number: " + num); final int B = symbols.length(); StringBuilder sb = new StringBuilder(); while (num != 0) { sb.append(symbols.charAt((int) (num % B))); num /= B; } return sb.reverse().toString(); }
public static boolean isPalindrome(String str) { return str.equals(new StringBuilder(str).reverse().toString()); }
public static String reverse(String str) { return new StringBuilder(str).reverse().toString(); }
/** * Gets a short string version of this ID. Use it only for UI where full version is * available to the application. * * @return Short string version of this ID. */ public String shortString() { return new StringBuilder(Long.toHexString(locId)).reverse().toString(); }
public static String encode(long num, String symbols) { Preconditions.checkArgument(num>=0,"Expected non-negative number: " + num); final int B = symbols.length(); StringBuilder sb = new StringBuilder(); while (num != 0) { sb.append(symbols.charAt((int) (num % B))); num /= B; } return sb.reverse().toString(); }
public static boolean isPalindrome(String input) { String s = input.toLowerCase().replaceAll("[\\W_]", ""); return Objects.equals( s, new StringBuilder(s).reverse().toString() ); }
int getLastDiffPosition(String text1, String text2) { StringBuilder reverse1 = new StringBuilder(text1.trim()).reverse(); StringBuilder reverse2 = new StringBuilder(text2.trim()).reverse(); int revDiffPos = getFirstDiffPosition(reverse1.toString(), reverse2.toString()); if (revDiffPos != -1) { return text1.length() - revDiffPos; } else { return -1; } }
@Override public CharSeq reverse() { return of(new StringBuilder(back).reverse().toString()); }
/** * Simplified version of org.apache.commons.lang3.StringUtils.reverse() */ public static String reverse(final String str) { return new StringBuilder(str).reverse().toString(); } }
@Override public TextValue reverse() { StringBuilder stringBuilder = new StringBuilder( value() ); return Values.stringValue( stringBuilder.reverse().toString() ); }
public CharAdapter toReversed() { StringBuilder builder = new StringBuilder(this.adapted); return new CharAdapter(builder.reverse().toString()); }
public static String reverseToUpperCase(String self) { StringBuilder sb = new StringBuilder(self.toUpperCase()); return sb.reverse().toString(); } }
@Nullable @Override public String apply(@Nullable String s) { if (s == null){ return null; } else { StringBuilder sb = new StringBuilder(s); return sb.toString() + sb.reverse().toString(); } } };