2019-07-18 18:59:49 +08:00
|
|
|
// Copyright 2019 gf Author(https://github.com/gogf/gf). All Rights Reserved.
|
|
|
|
//
|
|
|
|
// This Source Code Form is subject to the terms of the MIT License.
|
|
|
|
// If a copy of the MIT was not distributed with this file,
|
|
|
|
// You can obtain one at https://github.com/gogf/gf.
|
|
|
|
|
2019-08-10 23:36:38 +08:00
|
|
|
// Package utilstr provides some string functions for internal usage.
|
|
|
|
package utilstr
|
2019-07-18 18:59:49 +08:00
|
|
|
|
|
|
|
import "strings"
|
|
|
|
|
|
|
|
// IsLetterUpper tests whether the given byte b is in upper case.
|
|
|
|
func IsLetterUpper(b byte) bool {
|
|
|
|
if b >= byte('A') && b <= byte('Z') {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// IsLetterLower tests whether the given byte b is in lower case.
|
|
|
|
func IsLetterLower(b byte) bool {
|
|
|
|
if b >= byte('a') && b <= byte('z') {
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
|
|
|
|
// IsNumeric tests whether the given string s is numeric.
|
|
|
|
func IsNumeric(s string) bool {
|
|
|
|
length := len(s)
|
|
|
|
if length == 0 {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
for i := 0; i < len(s); i++ {
|
|
|
|
if s[i] < byte('0') || s[i] > byte('9') {
|
|
|
|
return false
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true
|
|
|
|
}
|
|
|
|
|
|
|
|
// UcFirst returns a copy of the string s with the first letter mapped to its upper case.
|
|
|
|
func UcFirst(s string) string {
|
|
|
|
if len(s) == 0 {
|
|
|
|
return s
|
|
|
|
}
|
|
|
|
if IsLetterLower(s[0]) {
|
|
|
|
return string(s[0]-32) + s[1:]
|
|
|
|
}
|
|
|
|
return s
|
|
|
|
}
|
|
|
|
|
|
|
|
// ReplaceByMap returns a copy of <origin>,
|
|
|
|
// which is replaced by a map in unordered way, case-sensitively.
|
|
|
|
func ReplaceByMap(origin string, replaces map[string]string) string {
|
|
|
|
for k, v := range replaces {
|
|
|
|
origin = strings.Replace(origin, k, v, -1)
|
|
|
|
}
|
|
|
|
return origin
|
|
|
|
}
|