StringUtil

Value Members

1. final def !=(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

2. final def ##(): Int

   

   Definition Classes

   AnyRef → Any

3. final def ==(arg0: Any): Boolean

   

   Definition Classes

   AnyRef → Any

4. def addSpacesToCamelCase(str: String): String

   

   Takes in a camel-case string and places a space before any uppercase letter.

5. final def asInstanceOf[T0]: T0

   

   Definition Classes

   Any

6. 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.

7. def clone(): AnyRef

   

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

8. 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.

9. def enclose(prefix: String, str: String, suffix: String = ""): String

   

   Wraps a given string with a prefix and optional suffix

10. final def eq(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

11. def equals(arg0: Any): Boolean

    

    Definition Classes

    AnyRef → Any

12. def finalize(): Unit

    

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. final def getClass(): Class[_]

    

    Definition Classes

    AnyRef → Any

14. def hashCode(): Int

    

    Definition Classes

    AnyRef → Any

15. final def isInstanceOf[T0]: Boolean

    

    Definition Classes

    Any

16. 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

17. final def ne(arg0: AnyRef): Boolean

    

    Definition Classes

    AnyRef

18. final def notify(): Unit

    

    Definition Classes

    AnyRef

19. final def notifyAll(): Unit

    

    Definition Classes

    AnyRef

20. final def synchronized[T0](arg0: ⇒ T0): T0

    

    Definition Classes

    AnyRef

21. def toString(): String

    

    Definition Classes

    AnyRef → Any

22. final def wait(): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

23. final def wait(arg0: Long, arg1: Int): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

24. final def wait(arg0: Long): Unit

    

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

25. 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).