114 lines
3.5 KiB
Go
114 lines
3.5 KiB
Go
|
/*
|
||
|
* The MIT License (MIT)
|
||
|
*
|
||
|
* Copyright (c) 2015 Ian Coleman
|
||
|
* Copyright (c) 2018 Ma_124, <github.com/Ma124>
|
||
|
*
|
||
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||
|
* of this software and associated documentation files (the "Software"), to deal
|
||
|
* in the Software without restriction, including without limitation the rights
|
||
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||
|
* copies of the Software, and to permit persons to whom the Software is
|
||
|
* furnished to do so, Subject to the following conditions:
|
||
|
*
|
||
|
* The above copyright notice and this permission notice shall be included in all
|
||
|
* copies or Substantial portions of the Software.
|
||
|
*
|
||
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||
|
* SOFTWARE.
|
||
|
*/
|
||
|
|
||
|
package strcase
|
||
|
|
||
|
import (
|
||
|
"strings"
|
||
|
)
|
||
|
|
||
|
// ToSnake converts a string to snake_case
|
||
|
func ToSnake(s string) string {
|
||
|
|
||
|
return ToDelimited(s, '_')
|
||
|
}
|
||
|
func ToSnakeWithIgnore(s string, ignore uint8) string {
|
||
|
|
||
|
return ToScreamingDelimited(s, '_', ignore, false)
|
||
|
}
|
||
|
|
||
|
// ToScreamingSnake converts a string to SCREAMING_SNAKE_CASE
|
||
|
func ToScreamingSnake(s string) string {
|
||
|
return ToScreamingDelimited(s, '_', 0, true)
|
||
|
}
|
||
|
|
||
|
// ToKebab converts a string to kebab-case
|
||
|
func ToKebab(s string) string {
|
||
|
return ToDelimited(s, '-')
|
||
|
}
|
||
|
|
||
|
// ToScreamingKebab converts a string to SCREAMING-KEBAB-CASE
|
||
|
func ToScreamingKebab(s string) string {
|
||
|
return ToScreamingDelimited(s, '-', 0, true)
|
||
|
}
|
||
|
|
||
|
// ToDelimited converts a string to delimited.snake.case
|
||
|
// (in this case `delimiter = '.'`)
|
||
|
func ToDelimited(s string, delimiter uint8) string {
|
||
|
return ToScreamingDelimited(s, delimiter, 0, false)
|
||
|
}
|
||
|
|
||
|
// ToScreamingDelimited converts a string to SCREAMING.DELIMITED.SNAKE.CASE
|
||
|
// (in this case `delimiter = '.'; screaming = true`)
|
||
|
// or delimited.snake.case
|
||
|
// (in this case `delimiter = '.'; screaming = false`)
|
||
|
func ToScreamingDelimited(s string, delimiter uint8, ignore uint8, screaming bool) string {
|
||
|
s = addWordBoundariesToNumbers(s)
|
||
|
s = strings.Trim(s, " ")
|
||
|
n := ""
|
||
|
for i, v := range s {
|
||
|
// treat acronyms as words, eg for JSONData -> JSON is a whole word
|
||
|
nextCaseIsChanged := false
|
||
|
if i+1 < len(s) {
|
||
|
next := s[i+1]
|
||
|
vIsCap := v >= 'A' && v <= 'Z'
|
||
|
vIsLow := v >= 'a' && v <= 'z'
|
||
|
nextIsCap := next >= 'A' && next <= 'Z'
|
||
|
nextIsLow := next >= 'a' && next <= 'z'
|
||
|
if (vIsCap && nextIsLow) || (vIsLow && nextIsCap) {
|
||
|
nextCaseIsChanged = true
|
||
|
}
|
||
|
if ignore > 0 && i-1 >= 0 && s[i-1] == ignore && nextCaseIsChanged {
|
||
|
nextCaseIsChanged = false
|
||
|
}
|
||
|
}
|
||
|
|
||
|
if i > 0 && n[len(n)-1] != delimiter && nextCaseIsChanged {
|
||
|
// add underscore if next letter case type is changed
|
||
|
if v >= 'A' && v <= 'Z' {
|
||
|
n += string(delimiter) + string(v)
|
||
|
} else if v >= 'a' && v <= 'z' {
|
||
|
n += string(v) + string(delimiter)
|
||
|
}
|
||
|
} else if v == ' ' || v == '_' || v == '-' {
|
||
|
// replace spaces/underscores with delimiters
|
||
|
if uint8(v) == ignore {
|
||
|
n += string(v)
|
||
|
} else {
|
||
|
n += string(delimiter)
|
||
|
}
|
||
|
} else {
|
||
|
n = n + string(v)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
if screaming {
|
||
|
n = strings.ToUpper(n)
|
||
|
} else {
|
||
|
n = strings.ToLower(n)
|
||
|
}
|
||
|
return n
|
||
|
}
|