X-Git-Url: http://www2.svjatoslav.eu/gitweb/?p=svjatoslav_commons.git;a=blobdiff_plain;f=src%2Fmain%2Fjava%2Feu%2Fsvjatoslav%2Fcommons%2Fstring%2FString2.java;h=07e3fdb83ccc81d366ab0734121fe475c85adb22;hp=113f67ea5ac5ed7bcec9cd2451f1f96dd2d6459a;hb=b1ffc7025cc976821987469570f07a7298ea16c9;hpb=6846681d727a07385bcd3e0eb856f70a7e96448c diff --git a/src/main/java/eu/svjatoslav/commons/string/String2.java b/src/main/java/eu/svjatoslav/commons/string/String2.java index 113f67e..07e3fdb 100755 --- a/src/main/java/eu/svjatoslav/commons/string/String2.java +++ b/src/main/java/eu/svjatoslav/commons/string/String2.java @@ -1,58 +1,135 @@ /* - * Svjatoslav Commons - shared library of common functionality. - * Copyright ©2012-2017, Svjatoslav Agejenko, svjatoslav@svjatoslav.eu - * - * This program is free software; you can redistribute it and/or - * modify it under the terms of version 3 of the GNU Lesser General Public License - * or later as published by the Free Software Foundation. + * Svjatoslav Commons - shared library of common functionality. Author: Svjatoslav Agejenko. + * This project is released under Creative Commons Zero (CC0) license. */ - package eu.svjatoslav.commons.string; -import java.util.Vector; +import java.util.ArrayList; +import java.util.List; +import java.util.regex.Matcher; +import java.util.regex.Pattern; public class String2 { - private final Vector chars = new Vector<>(); + private final List chars = new ArrayList<>(); - public String2(final String value) { - for (final Character c : value.toCharArray()) - chars.add(c); + public String2(String value) { + addSuffix(value); + } + + public String2() { + } + + public String2 repeat(int count){ + String value = toString(); + + for (int i = 1; i < count; i++) { + addSuffix(value); + } + return this; } public String2 addPrefix(final String prefix) { - int j = 0; + if (prefix == null) + return this; + + int i = 0; for (final char c : prefix.toCharArray()) - chars.insertElementAt(c, j++); + chars.add(i++, c); return this; } public String2 addSuffix(final String suffix) { + if (suffix == null) + return this; + for (final char c : suffix.toCharArray()) chars.add(c); return this; } + public String2 addSuffix(String separator, final String suffix) { + if (!isEmpty()) + addSuffix(separator); + + addSuffix(suffix); + + return this; + } + + public String2 addSuffix(String s, int times) { + for (int i = 0; i < times; i++) addSuffix(s); + return this; + } + + /** * Cut given amount of characters from the left of the string. * * @param cutAmount of characters to cut * @return part that was cut. */ - public String trimLeft(final int cutAmount) { + public String2 trimPrefix(final int cutAmount) { int actualCutAmount = cutAmount; if (actualCutAmount > getLength()) actualCutAmount = getLength(); - final String result = getSubString(0, actualCutAmount); - chars.subList(0, actualCutAmount).clear(); - return result; + return this; + } + + public String2 trimPrefixIfExists(String prefix) { + if (prefix == null) + return this; + + if (hasPrefix(prefix)) + trimPrefix(prefix.length()); + + return this; + } + + public String2 trimSuffixIfExists(String suffix) { + if (hasSuffix(suffix)) + trimSuffix(suffix.length()); + + return this; + } + + public String2 trimSuffix(int charsToTrim) { + + if (charsToTrim > chars.size()) { + chars.clear(); + return this; + } + + for (int i = 0; i < charsToTrim; i++) + chars.remove(chars.size() - 1); + + return this; + } + + public boolean hasSuffix(String suffix) { + return contains(suffix, getLength() - suffix.length()); + } + + public boolean hasPrefix(String prefix) { + return contains(prefix, 0); + } + + public boolean contains(String fragment, int index) { + if (index + fragment.length() > chars.size()) + return false; + + for (int i = 0; i < fragment.length(); i++) + if (chars.get(index + i) != fragment.charAt(i)) + return false; + + return true; } public String2 enforceLength(final int targetLength) { @@ -90,4 +167,19 @@ public class String2 { public String toString() { return getSubString(0, chars.size()); } + + + public static String[] getGroups(String s, String regexp){ + Pattern pattern = Pattern.compile(regexp); + Matcher matcher = pattern.matcher(s); + + matcher.find(); + String[] result = new String[matcher.groupCount()]; + + for (int i = 0; i< result.length; i++){ + result[i] = matcher.group(i+1); + } + + return result; + } }