object StringUtil
- Alphabetic
- By Inheritance
- StringUtil
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
addSpacesToCamelCase(str: String): String
Takes in a camel-case string and places a space before any uppercase letter.
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
camelToGnu(in: String): String
Takes in a camel-case string and converts it to a GNU option style string by identifying capital letters and replacing them with a hyphen followed by the lower case letter.
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
columnIt(rows: List[List[String]], delimiter: String = " "): String
A simple version of Unix's
column
utility.A simple version of Unix's
column
utility. This assumes the table is NxM. -
def
enclose(prefix: String, str: String, suffix: String = ""): String
Wraps a given string with a prefix and optional suffix
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
levenshteinDistance(string1: String, string2: String, swap: Int, substitution: Int, insertion: Int, deletion: Int): Int
Computes the levenshtein distance between two strings
Computes the levenshtein distance between two strings
- string1
the first string
- string2
the second string
- swap
the swap penalty
- substitution
the substitution penalty
- insertion
the insertion penalty
- deletion
the deletion penalty
- returns
the levenshtein distance
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
wordWrap(s: String, maxLength: Int): String
Return input string with newlines inserted to ensure that all lines have length <= maxLineLength.
Return input string with newlines inserted to ensure that all lines have length <= maxLineLength. If a word is too long, it is simply broken at maxLineLength. Does not handle tabs intelligently (due to implementer laziness).