My StringHelper class

I've posted a few code snippets and some people noticed that there are references to unresolved methods.I am using a few helper classes. This post describes my StringHelper class. By the way, I (in the article ), that using StringBuilder is often less efficient, than simple concatenation.

Related posts:Helper functions to find pattern contaned in string from pattern List

ProperCase function in C#

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading;
namespace Common
{
using Microsoft.VisualBasic;
using System;
using System.IO;
using System.Reflection;
using System.Text;
using System.Text.RegularExpressions;
public static class StringHelper
{
// See also Westwind.Utilities.StringUtils
//'See also FxLib Author: Kamal Patel, Rick Hodder
// 'Find the first entry of sToFind and returns the string after it
// 'See also FxLib StringExtract (and StuffString)
// Methods
#region "String Functions"
public static string LeftBefore(this string str, string sToFind)
{
return LeftBefore(str, sToFind, false);
}
// 'if sToFind not found, then the full string should be returned
// 'if sToFind is empty, all string should be returned
public static string LeftBefore(this string str, string sToFind, bool EmptyIfNotFound)
{
StringBuilder builder1 = new StringBuilder(str);
if (sToFind.Length > 0)
{
int num1 = str.IndexOf(sToFind);
if (num1 < 0)
{
if (EmptyIfNotFound == true) return "";
else return str;// 6/7/2005 full string should be returned
}
builder1.Remove(num1, builder1.Length - num1);
}
return builder1.ToString;
}
// 'if sToFind not found, then original string should be returned
public static string LeftBeforeLast(this string str, string sToFind)
{
StringBuilder builder1 = new StringBuilder(str);
if (sToFind.Length > 0)
{
int num1 = str.LastIndexOf(sToFind);
if (num1 < 0)
{
return str;
}
builder1.Remove(num1, builder1.Length - num1);
}
return builder1.ToString;
}
public static string LeftBeforeLast(this string str, string sToFind, intFindNumberTimes)//6/1/2006
{
for (int i = 0; i < FindNumberTimes; i++)
{
str = LeftBeforeLast(str, sToFind);
}
return str;
}
// 'if sBefore not found, then string from the beginning should be returned
// 'if sAfter not found, then string up to the end should be returned
public static string MidBetween(this string str, string sBefore, string sAfter)
{
return MidBetween(str, sBefore, sAfter, false);
}
public static string MidBetween(this string str, string sBefore, string sAfter, boolEmptyIfNotFound)
{
string text2 = RightAfter(str, sBefore, EmptyIfNotFound);
return LeftBefore(text2, sAfter, EmptyIfNotFound);
}
///
///if sToFind not found, then original string should be returned
///if sToFind is empty, all string should be returned
///
///
///
public static string RightAfter(this string str, string sToFind)
{
return RightAfter(str, sToFind, false);
}
///
///
///
///
///
///
///
public static string RightAfter(this string str, string sToFind, bool EmptyIfNotFound)
{
StringBuilder builder1 = new StringBuilder(str);
int num1 = str.IndexOf(sToFind);
if (num1 < 0)
{
if (EmptyIfNotFound == true) return "";
else return str;
}
builder1.Remove(0, num1 + sToFind.Length);
return builder1.ToString;
}
//
///
///if sToFind not found, then original string should be returned
/// Otherwise removeBefore
///
///
///
///
public static string RemoveBefore(this string str, string sToFind)
{
int num1 = str.IndexOf(sToFind);
if (num1 > 0)
{
return str.Remove(0, num1);
}
else
{
return str;
}
}
//'Find the last entry of sToFind and returns the string after it
//if sToFind not found, then original string should be returned ' 6/7/2005 change
//if sToFind is empty, the original string should be returned
public static string RightAfterLast(string str, string sToFind)
{
StringBuilder builder1 = new StringBuilder(str);
int num1 = str.LastIndexOf(sToFind);
if (num1 < 0)
{
return str;
}
builder1.Remove(0, num1 + sToFind.Length);
return builder1.ToString;
}
public static string RightAfterLast(string str, char chToFind, intnOccurencesNumber)//6/1/2006
{ //C++ solutions to find n'th occurence see http://www.codecomments.com/forum272/message731385.html
string[] aStr = str.Split(chToFind);
StringBuilder sb = new StringBuilder;
int nPosInSplit = aStr.Length - nOccurencesNumber;
for (int i = nPosInSplit; i < aStr.Length; i++)
{
sb.Append(aStr[i]);
sb.Append(chToFind);
}
sb.Remove(sb.Length - 1, 1);//1 for char
return sb.ToString;
}
//'Removes the start part of the string, if it is matchs, otherwise leave string unchanged
public static string TrimStart(this string str, string sStartValue)
{
if (!String.IsNullOrWhiteSpace(str) && str.StartsWith(sStartValue))
{
str = str.Remove(0, sStartValue.Length);
}
return str;
}
// 'Removes the end part of the string, if it is matchs, otherwise leave string unchanged
public static string TrimEnd(this string str, string sEndValue)
{
if (str == null) { throw new NullReferenceException("str is null"); }
if (str.EndsWith(sEndValue))
{
str = str.Remove(str.Length - sEndValue.Length, sEndValue.Length);
}
return str;
}
///
/// If lenght of the string is greater than max allowed, remove the end
///
///
///
///
public static string TrimLength(this string str, int maxLength)
{
if (str == null)
{
return str;
}
if (str.Length > maxLength)
{
str = str.Remove(maxLength);
}
return str;
}
//from http://mennan.kagitkalem.com/CommentView,guid,d8e01e32-49f3-4450-994a-990c4fa0a437.aspx
//use the most efficient
public static int OccurencesCount(string str, string sToFind)
{
string copyOrginal = String.Copy(str);
int place = 0;
int numberOfOccurances = 0;
place = copyOrginal.IndexOf(sToFind.ToString);
while (place != -1)
{
copyOrginal = copyOrginal.Substring(place + 1);
place = copyOrginal.IndexOf(sToFind.ToString);
numberOfOccurances++;
}
return numberOfOccurances;
}
//case-incensitive replace from http://www.codeproject.com/cs/samples/fastestcscaseinsstringrep.asp?msg=1835929#xx1835929xx
static public string Replace(string original, string pattern, string replacement, StringComparison comparisonType)
{
if (original == null)
{
return null;
}
if (String.IsNullOrEmpty(pattern))
{
return original;
}
int lenPattern = pattern.Length;
int idxPattern = -1;
int idxLast = 0;
StringBuilder result = new StringBuilder;
while (true)
{
idxPattern = original.IndexOf(pattern, idxPattern + 1, comparisonType);
if (idxPattern < 0)
{
result.Append(original, idxLast, original.Length - idxLast);
break;
}
result.Append(original, idxLast, idxPattern - idxLast);
result.Append(replacement);
idxLast = idxPattern + lenPattern;
}
return result.ToString;
}
///
/// Uses regex '\b' as suggested in //http://stackoverflow.com/questions/6143642/way-to-have-string-replace-only-hit-whole-words
///
///
///
///
/// e.g. RegexOptions.IgnoreCase
///
static public string ReplaceWholeWord(this string original, string wordToFind, stringreplacement, RegexOptions regexOptions = RegexOptions.None)
{
string pattern = String.Format(@"\b{0}\b", wordToFind);
string ret = Regex.Replace(original, pattern, replacement, regexOptions);
return ret;
}
///
/// Find the last entry of sToFind and replace it with sToReplace string
///
///
/// if sToFind not found, then original string should be returned.
/// if sToFind is empty, the original string should be returned
///
///
public static string ReplaceLast(this string str, string sToFind, string sToReplace)
{
StringBuilder builder1 = new StringBuilder(str);
int num1 = str.LastIndexOf(sToFind);
if (num1 < 0)
{
return str;
}
builder1.Replace(sToFind, sToReplace, num1, sToFind.Length);
return builder1.ToString;
}
public static string IfNotEmptyEnsureEndsWith(string str, string sEndValue)
{
if (String.IsNullOrEmpty(str)) return str; //21/10/2005
if (!str.EndsWith(sEndValue))
{
str = str + sEndValue;
}
return str;
}
public static string EnsureEndsWith(this string str, string sEndValue)
{
if (!str.EndsWith(sEndValue))
{
str = str + sEndValue;
}
return str;
}
//converted from http://stackoverflow.com/questions/1250514/find-length-of-initial-segment-matching-mask-on-arrays
public static string LongestCommonPrefix(string str1, string str2)
{
int minLen = Math.Min(str1.Length, str2.Length);
for (int i = 0; i < minLen; i++)
{
if (str1[i] != str2[i])
{
return str1.Substring(0, i);
}
}
return str1.Substring(0, minLen);
}
///
/// Adds Prefix, if it is not exist in the string, case sensitive
///
/// if null, returns prefix
/// if null or empty, returns original string
///
public static string EnsureStartsWith(this string str, string sPrefix)
{
if (str == null)
{ //throw new ArgumentNullException("str");
return sPrefix;
}
if (!String.IsNullOrEmpty(sPrefix))
{
if (!str.StartsWith(sPrefix))
{
str = sPrefix + str;
}
}
return str;
}
public static string AppendWithDelimeter(string str, string sToAppend, string delimeter)
{
if ((!str.EndsWith(delimeter) & !String.IsNullOrEmpty(str)) &!String.IsNullOrEmpty(sToAppend))
{
str = str + delimeter;
}
str = str + sToAppend;
return str;
}
public static string AppendIfNotContains(string str, string sToAppend, string delimeter)
{
if (!str.Contains(sToAppend))
{
str = AppendWithDelimeter(str, sToAppend, delimeter);
}
return str;
}
public static string AppendIfNotEmpty(this string str, string prefixBeforeAppend,stringvalueToAppend,string suffixAfterAppend="")
{
if (!String.IsNullOrEmpty(valueToAppend))
{
str += prefixBeforeAppend + valueToAppend + suffixAfterAppend;
}
return str;
}
//from http://66.102.7.104/search?q=cache:DSw2bnf\_FlMJ:blogs.msdn.com/brada/archive/2004/02/16/73535.aspx+%22EndsWith+char+%22+string+C%23&hl=en
//" internal bool EndsWith(char value) in String class. Why it would be internal? Also, there is no bool StartsWith(char value). "
public static bool EndsWith(string str, char value)
{
int num1 = str.Length;
if ((num1 != 0) && (str[num1 - 1] == value))
{
return true;
}
return false;
}
public static bool StartsWith(string str, char value)
{
if ((str.Length != 0) && (str[0] == value))
{
return true;
}
return false;
}
#region Case conversions
///
///
///
///
///
///
/// from http://dotnetjunkies.com/WebLog/davetrux/archive/2006/05/22/138692.aspx, http://west-wind.com/weblog/posts/361.aspx
/// http://www.logiclabz.com/c/title-case-proper-case-function-in-net-c.aspx
/// use TextInfo.ToTitleCase(mText.ToLower);
/// Alternative see From http://aspcode.net/propercase-function-in-c/
///
public static string ToTitleCase(this string input)
{
input = input.ToLower;
return Thread.CurrentThread.CurrentCulture.TextInfo.ToTitleCase(input);
}
public static string ToCamelCase(this string s)
{
var sb = new StringBuilder;
char[] ca = s.ToLower.ToCharArray;
for (int i = 0; i < ca.Length; i++)
{
char c = ca[i];
if (i == 0 || Char.IsSeparator(ca[i - 1]))
{
c = Char.ToUpper(c);
}
sb.Append(c);
}
return sb.ToString;
}
///
/// Convert string from pascal case to human readable string
/// pascalCaseExample => Pascal Case Example
///
/// The string
/// human readable string
public static string ToHumanFromPascal(string s)
{
StringBuilder sb = new StringBuilder;
char[] ca = s.ToCharArray;
sb.Append(ca[0]);
for (int i = 1; i < ca.Length - 1; i++)
{
char c = ca[i];
if (Char.IsUpper(c) && (Char.IsLower(ca[i + 1]) || Char.IsLower(ca[i - 1])))
{
sb.Append(" ");
}
sb.Append(c);
}
sb.Append(ca[ca.Length - 1]);
return sb.ToString;
}
#endregion //Case conversions
//Alternatively see http://weblogs.asp.net/sushilasb/archive/2006/08/03/How-to-extract-numbers-from-string.aspx
public static string GetStartingNumericFromString(string itmName)
{
string safeNumericString = "";
foreach (char s in itmName)
{
if (s.CompareTo('0') < 0 || s.CompareTo('9') > 0)
{
break;
}
safeNumericString += s.ToString;
}
return safeNumericString;
}
///
/// method for removing all whitespace from a given string
///
/// string to strip
///
public static string RemoveAllWhitespace(string str)
{
Regex reg = new Regex(@"\s*");
str = reg.Replace(str, "");
return str;
}
/*From http://bytes.com/topic/c-sharp/answers/253519-using-regex-create-sqls-like-like-function
* Ex:
*
* bool isMatch =
* IsSqlLikeMatch("abcdef", "[az]_%[^qz]ef");
*
* should return true.
*/
///
/// Note that it could be very serious performance hit, if the pattern is started with %.
///
///
///
///
public static bool IsSqlLikeMatch(this string input, string pattern)
{
/* Turn "off" all regular expression related syntax in
* the pattern string. */
pattern = Regex.Escape(pattern);
/* Replace the SQL LIKE wildcard metacharacters with the
* equivalent regular expression metacharacters. */
pattern = pattern.Replace("%", ".*?").Replace("_", ".");
/* The previous call to Regex.Escape actually turned off
* too many metacharacters, i.e. those which are recognized by
* both the regular expression engine and the SQL LIKE
* statement ([...] and [^...]). Those metacharacters have
* to be manually unescaped here. */
pattern = pattern.Replace(@"\[", "[").Replace(@"\]", "]").Replace(@"\^", "^");
return Regex.IsMatch(input, pattern, RegexOptions.IgnoreCase |RegexOptions.Singleline);
}
///
/// Determines whether [contains] [the specified source] with string comparison.
///
/// The source.
/// To check.
/// The comp.
///
/// true if [contains] [the specified source]; otherwise, false.
///
public static bool Contains(this string source, string toCheck, StringComparison comp)
{
return source.IndexOf(toCheck, comp) >= 0;
}
#endregion //"String Functions"
#region "String Array Functions"
public static string[] ToLower(string[] sArray)
{
for (int i = 0; i < sArray.Length; i++)
{
sArray[i] = sArray[i].ToLower;
}
return sArray;
}
//see also a few methods in http://www.codeproject.com/csharp/StringBuilder\_vs\_String.asp
public static string Join(string separator, params string[] list)
{
return String.Join(separator, list);
}
#endregion //"String Array Functions"
#region "String Brackets Functions"
//
///
/// 'StripBrackets checks that starts from sStart and ends with sEnd (case sensitive).
/// 'If yes, than removes sStart and sEnd.
/// 'Otherwise returns full string unchanges
/// 'See also MidBetween
///
///
///
///
///
public static string StripBrackets(string str, string sStart, string sEnd)
{
if (CheckBrackets(str, sStart, sEnd))
{
str = str.Substring(sStart.Length, (str.Length - sStart.Length) -sEnd.Length);
}
return str;
}
public static bool CheckBrackets(string str, string sStart, string sEnd)
{
bool flag1 = false;
if ((str != null) && (str.StartsWith(sStart) && str.EndsWith(sEnd)))//19/5/ null handling
{
flag1 = true;
}
return flag1;
}
public static string WrapBrackets(string str, string sStartBracket, string sEndBracket)
{
StringBuilder builder1 = new StringBuilder(sStartBracket);
builder1.Append(str);
builder1.Append(sEndBracket);
return builder1.ToString;
}
// 'Concatenates a specified separator String between each element of a specified String array wrapping each element, yielding a single concatenated string
public static string JoinWrapBrackets(string[] aStr, string sDelimeter, string sStartBracket,string sEndBracket)
{
StringBuilder builder1 = new StringBuilder;
string[] textArray1 = aStr;
for (int num1 = 0; num1 < textArray1.Length; num1++)
{
string text2 = textArray1[num1];
builder1.Append(WrapBrackets(text2, sStartBracket, sEndBracket));
builder1.Append(sDelimeter);
}
return TrimEnd(builder1.ToString, sDelimeter);
}
///
///
///
///
///
///
///
///
///
/// // mask XXXXX4488
///requestAsString = requestAsString.ReplaceBetweenTags("", "", CreditCard.MaskedCardNumber);
///mask cvv
///requestAsString = requestAsString.ReplaceBetweenTags("CC::VerificationCode", "", cvv=>"XXX");
///
public static string ReplaceBetweenTags(this string thisString, string openTag, stringcloseTag, Func<string, string> transform)
{
//See also http://stackoverflow.com/questions/1359412/c-sharp-remove-text-in-between-delimiters-in-a-string-regex
string sRet = thisString;
string between = thisString.MidBetween(openTag, closeTag, true);
if (!String.IsNullOrEmpty(between))
sRet=thisString.Replace(openTag + between + closeTag, openTag +transform(between) + closeTag);
return sRet;
}
public static string ReplaceBetweenTags(this string thisString, string openTag, stringcloseTag, string newValue)
{
//See also http://stackoverflow.com/questions/1359412/c-sharp-remove-text-in-between-delimiters-in-a-string-regex
string sRet = thisString;
string between = thisString.MidBetween(openTag, closeTag, true);
if (!String.IsNullOrEmpty(between))
sRet = thisString.Replace(openTag + between + closeTag, openTag + newValue +closeTag);
return sRet;
}
// ' Quote the arguments, in case they have a space in them.
public static string QuotePath(string sPath)
{
return ("\"" + sPath + "\"");
}
public static string DblQuoted(string sWord)
{
sWord = Strings.Replace(sWord, "\"", "\"\"", 1, -1, CompareMethod.Binary);
return ("\"" + sWord + "\"");
}
#endregion //"String Brackets Functions"
///
/// Returns true, if string contains any of substring from the list (case insensitive)
/// See similar (with SqlLikeMatch support) in ResponseMessagePatternsCache
///
///
public static bool IsStringContainsAnyFromList(this string stringToSearch,List<String>stringsToFind)
{
//TODO: create overloads with exact match or case sencitive
if (stringsToFind.IsNullOrEmpty)
{ return false; }
else
{
stringToSearch = stringToSearch.ToUpper;
return stringsToFind.Any(pattern =>stringToSearch.Contains(pattern.ToUpper));
}
}
}
}

New on Geeks with Blogs