mirror of
https://github.com/siyuan-note/siyuan.git
synced 2025-05-03 19:29:32 +08:00
71 lines
1.6 KiB
Go
71 lines
1.6 KiB
Go
// SiYuan - Build Your Eternal Digital Garden
|
|
// Copyright (c) 2020-present, b3log.org
|
|
//
|
|
// This program is free software: you can redistribute it and/or modify
|
|
// it under the terms of the GNU Affero General Public License as published by
|
|
// the Free Software Foundation, either version 3 of the License, or
|
|
// (at your option) any later version.
|
|
//
|
|
// This program is distributed in the hope that it will be useful,
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
// GNU Affero General Public License for more details.
|
|
//
|
|
// You should have received a copy of the GNU Affero General Public License
|
|
// along with this program. If not, see <https://www.gnu.org/licenses/>.
|
|
|
|
package util
|
|
|
|
import (
|
|
"bytes"
|
|
"strings"
|
|
"unicode"
|
|
|
|
"github.com/88250/lute/html"
|
|
)
|
|
|
|
func EscapeHTML(s string) string {
|
|
if strings.Contains(s, "&") {
|
|
return s
|
|
}
|
|
if strings.ContainsAny(s, "<>\"'") {
|
|
return html.EscapeString(s)
|
|
}
|
|
return s
|
|
}
|
|
|
|
func Reverse(s string) string {
|
|
runes := []rune(s)
|
|
for i, j := 0, len(runes)-1; i < j; i, j = i+1, j-1 {
|
|
runes[i], runes[j] = runes[j], runes[i]
|
|
}
|
|
return string(runes)
|
|
}
|
|
|
|
func RemoveRedundantSpace(str string) string {
|
|
buf := bytes.Buffer{}
|
|
lastIsChinese := false
|
|
lastIsSpace := false
|
|
for _, r := range str {
|
|
if unicode.IsSpace(r) {
|
|
if lastIsChinese || lastIsSpace {
|
|
continue
|
|
}
|
|
buf.WriteRune(' ')
|
|
lastIsChinese = false
|
|
lastIsSpace = true
|
|
continue
|
|
}
|
|
|
|
lastIsSpace = false
|
|
buf.WriteRune(r)
|
|
if unicode.Is(unicode.Han, r) {
|
|
lastIsChinese = true
|
|
continue
|
|
} else {
|
|
lastIsChinese = false
|
|
}
|
|
}
|
|
return buf.String()
|
|
}
|