a265574821
- new sort by relevency option for issue search - rework bleve fuzzy search to consider each term rather than matching the entire phrase
72 lines
1.4 KiB
Go
72 lines
1.4 KiB
Go
// Copyright 2023 The Gitea Authors. All rights reserved.
|
|
// SPDX-License-Identifier: MIT
|
|
|
|
package templates
|
|
|
|
import (
|
|
"fmt"
|
|
"html/template"
|
|
"strings"
|
|
|
|
"code.gitea.io/gitea/modules/base"
|
|
)
|
|
|
|
type StringUtils struct{}
|
|
|
|
var stringUtils = StringUtils{}
|
|
|
|
func NewStringUtils() *StringUtils {
|
|
return &stringUtils
|
|
}
|
|
|
|
func (su *StringUtils) Make(arr ...string) []string {
|
|
return arr
|
|
}
|
|
|
|
func (su *StringUtils) HasPrefix(s any, prefix string) bool {
|
|
switch v := s.(type) {
|
|
case string:
|
|
return strings.HasPrefix(v, prefix)
|
|
case template.HTML:
|
|
return strings.HasPrefix(string(v), prefix)
|
|
}
|
|
return false
|
|
}
|
|
|
|
func (su *StringUtils) ToString(v any) string {
|
|
switch v := v.(type) {
|
|
case string:
|
|
return v
|
|
case template.HTML:
|
|
return string(v)
|
|
case fmt.Stringer:
|
|
return v.String()
|
|
default:
|
|
return fmt.Sprint(v)
|
|
}
|
|
}
|
|
|
|
func (su *StringUtils) Contains(s, substr string) bool {
|
|
return strings.Contains(s, substr)
|
|
}
|
|
|
|
func (su *StringUtils) Split(s, sep string) []string {
|
|
return strings.Split(s, sep)
|
|
}
|
|
|
|
func (su *StringUtils) Join(a []string, sep string) string {
|
|
return strings.Join(a, sep)
|
|
}
|
|
|
|
func (su *StringUtils) Cut(s, sep string) []any {
|
|
before, after, found := strings.Cut(s, sep)
|
|
return []any{before, after, found}
|
|
}
|
|
|
|
func (su *StringUtils) EllipsisString(s string, max int) string {
|
|
return base.EllipsisString(s, max)
|
|
}
|
|
|
|
func (su *StringUtils) ToUpper(s string) string {
|
|
return strings.ToUpper(s)
|
|
}
|