mirror of
https://github.com/samber/lo.git
synced 2026-04-22 15:37:14 +08:00
d-enk
68f827d9bf
* perf: optimize Substring to work directly with strings instead of converting to runes
- Rewrite Substring to iterate over string bytes directly, avoiding full []rune conversion
- Improve performance for long strings by only processing necessary portions
- Add comprehensive test cases for Unicode handling, invalid UTF-8, and edge cases
- Add BenchmarkSubstring to measure performance improvements
- Improve documentation with detailed parameter descriptions
- Handle invalid UTF-8 sequences by converting to []rune when needed
Bencstat:
│ old.txt │ new.txt │
│ sec/op │ sec/op vs base │
Substring/{10_10}-4 558.85n ± 9% 39.75n ± 10% -92.89% (p=0.000 n=8)
Substring/{50_50}-4 783.10n ± 6% 85.15n ± 5% -89.13% (p=0.000 n=8)
Substring/{50_45}-4 773.30n ± 3% 126.5n ± 7% -83.65% (p=0.000 n=8)
Substring/{-50_50}-4 794.00n ± 2% 177.6n ± 7% -77.63% (p=0.000 n=8)
Substring/{-10_10}-4 542.85n ± 20% 41.82n ± 6% -92.30% (p=0.000 n=8)
geomean 680.4n 79.52n -88.31%
│ old.txt │ new.txt │
│ B/op │ B/op vs base │
Substring/{10_10}-4 432.0 ± 0% 0.0 ± 0% -100.00% (p=0.000 n=8)
Substring/{50_50}-4 480.0 ± 0% 0.0 ± 0% -100.00% (p=0.000 n=8)
Substring/{50_45}-4 464.0 ± 0% 0.0 ± 0% -100.00% (p=0.000 n=8)
Substring/{-50_50}-4 480.0 ± 0% 0.0 ± 0% -100.00% (p=0.000 n=8)
Substring/{-10_10}-4 432.0 ± 0% 0.0 ± 0% -100.00% (p=0.000 n=8)
│ old.txt │ new.txt │
│ allocs/op │ allocs/op vs base │
Substring/{10_10}-4 2.000 ± 0% 0.000 ± 0% -100.00% (p=0.000 n=8)
Substring/{50_50}-4 2.000 ± 0% 0.000 ± 0% -100.00% (p=0.000 n=8)
Substring/{50_45}-4 2.000 ± 0% 0.000 ± 0% -100.00% (p=0.000 n=8)
Substring/{-50_50}-4 2.000 ± 0% 0.000 ± 0% -100.00% (p=0.000 n=8)
Substring/{-10_10}-4 2.000 ± 0% 0.000 ± 0% -100.00% (p=0.000 n=8)
* Enhance substring documentation with Unicode details
Returns a substring starting at the given offset with the specified length. Supports negative offsets; out-of-bounds are clamped. Operates on Unicode runes (characters) and is optimized for zero allocations.
---------
Co-authored-by: Samuel Berthe <dev@samuel-berthe.fr>
587 lines
18 KiB
Go
587 lines
18 KiB
Go
package lo
|
||
|
||
import (
|
||
"fmt"
|
||
"math"
|
||
"strings"
|
||
"testing"
|
||
"unicode/utf8"
|
||
|
||
"github.com/stretchr/testify/assert"
|
||
)
|
||
|
||
func TestRandomString(t *testing.T) {
|
||
t.Parallel()
|
||
is := assert.New(t)
|
||
|
||
str1 := RandomString(100, LowerCaseLettersCharset)
|
||
is.Equal(100, RuneLength(str1))
|
||
is.Subset(LowerCaseLettersCharset, []rune(str1))
|
||
|
||
str2 := RandomString(100, LowerCaseLettersCharset)
|
||
is.NotEqual(str1, str2)
|
||
|
||
noneUtf8Charset := []rune("明1好休2林森")
|
||
str3 := RandomString(100, noneUtf8Charset)
|
||
is.Equal(100, RuneLength(str3))
|
||
is.Subset(noneUtf8Charset, []rune(str3))
|
||
|
||
is.PanicsWithValue("lo.RandomString: charset must not be empty", func() { RandomString(100, []rune{}) })
|
||
is.PanicsWithValue("lo.RandomString: size must be greater than 0", func() { RandomString(0, LowerCaseLettersCharset) })
|
||
|
||
str4 := RandomString(10, []rune{65})
|
||
is.Equal(10, RuneLength(str4))
|
||
is.Subset([]rune{65, 65, 65, 65, 65, 65, 65, 65, 65, 65}, []rune(str4))
|
||
}
|
||
|
||
func TestChunkString(t *testing.T) {
|
||
t.Parallel()
|
||
is := assert.New(t)
|
||
|
||
result1 := ChunkString("12345", 2)
|
||
is.Equal([]string{"12", "34", "5"}, result1)
|
||
|
||
result2 := ChunkString("123456", 2)
|
||
is.Equal([]string{"12", "34", "56"}, result2)
|
||
|
||
result3 := ChunkString("123456", 6)
|
||
is.Equal([]string{"123456"}, result3)
|
||
|
||
result4 := ChunkString("123456", 10)
|
||
is.Equal([]string{"123456"}, result4)
|
||
|
||
result5 := ChunkString("", 2)
|
||
is.Equal([]string{""}, result5) // @TODO: should be [] - see https://github.com/samber/lo/issues/788
|
||
|
||
result6 := ChunkString("明1好休2林森", 2)
|
||
is.Equal([]string{"明1", "好休", "2林", "森"}, result6)
|
||
|
||
is.PanicsWithValue("lo.ChunkString: size must be greater than 0", func() {
|
||
ChunkString("12345", 0)
|
||
})
|
||
}
|
||
|
||
func TestSubstring(t *testing.T) {
|
||
t.Parallel()
|
||
is := assert.New(t)
|
||
|
||
str0 := Substring("hello", 5, 10)
|
||
str1 := Substring("hello", 0, 0)
|
||
str2 := Substring("hello", 10, 2)
|
||
str3 := Substring("hello", -10, 2)
|
||
str4 := Substring("hello", 0, 10)
|
||
str5 := Substring("hello", 0, 2)
|
||
str6 := Substring("hello", 2, 2)
|
||
str7 := Substring("hello", 2, 5)
|
||
str8 := Substring("hello", 2, 3)
|
||
str9 := Substring("hello", 2, 4)
|
||
str10 := Substring("hello", -2, 4)
|
||
str11 := Substring("hello", -4, 1)
|
||
str12 := Substring("hello", -4, math.MaxUint)
|
||
str13 := Substring("🏠🐶🐱", 0, 2)
|
||
str14 := Substring("你好，世界", 0, 3)
|
||
str15 := Substring("🏠🐶🐱", 1, 2)
|
||
str16 := Substring("🏠🐶🐱", -2, 2)
|
||
str17 := Substring("🏠🐶🐱", 3, 3)
|
||
str18 := Substring("🏠🐶🐱", 4, 3)
|
||
str19 := Substring("hello", 5, 1)
|
||
str20 := Substring("hello", -5, 5)
|
||
str21 := Substring("hello", -5, 4)
|
||
str22 := Substring("hello", -5, math.MaxUint)
|
||
str23 := Substring("\x00\x00\x00", 0, math.MaxUint)
|
||
str24 := Substring(string(utf8.RuneError), 0, math.MaxUint)
|
||
str25 := Substring("привет"[1:], 0, 6)
|
||
str26 := Substring("привет"[:2*5+1], 0, 6)
|
||
str27 := Substring("привет"[:2*5+1], -2, math.MaxUint)
|
||
str28 := Substring("🏠🐶🐱"[1:], 0, math.MaxUint)
|
||
str29 := Substring("🏠🐶🐱"[1:], 0, 2)
|
||
str30 := Substring("привет", 6, math.MaxUint)
|
||
str31 := Substring("привет", 6+1, math.MaxUint)
|
||
|
||
is.Empty(str0)
|
||
is.Empty(str1)
|
||
is.Empty(str2)
|
||
is.Equal("he", str3)
|
||
is.Equal("hello", str4)
|
||
is.Equal("he", str5)
|
||
is.Equal("ll", str6)
|
||
is.Equal("llo", str7)
|
||
is.Equal("llo", str8)
|
||
is.Equal("llo", str9)
|
||
is.Equal("lo", str10)
|
||
is.Equal("e", str11)
|
||
is.Equal("ello", str12)
|
||
is.Equal("🏠🐶", str13)
|
||
is.Equal("你好，", str14)
|
||
is.Equal("🐶🐱", str15)
|
||
is.Equal("🐶🐱", str16)
|
||
is.Empty(str17)
|
||
is.Empty(str18)
|
||
is.Empty(str19)
|
||
is.Equal("hello", str20)
|
||
is.Equal("hell", str21)
|
||
is.Equal("hello", str22)
|
||
is.Empty(str23)
|
||
is.Equal("�", str24)
|
||
is.Equal("�ривет", str25)
|
||
is.Equal("приве�", str26)
|
||
is.Equal("е�", str27)
|
||
is.Equal("���🐶🐱", str28)
|
||
is.Equal("��", str29)
|
||
is.Empty(str30)
|
||
is.Empty(str31)
|
||
}
|
||
|
||
func BenchmarkSubstring(b *testing.B) {
|
||
str := strings.Repeat("1", 100)
|
||
|
||
for _, test := range []struct {
|
||
offset int
|
||
length uint
|
||
}{
|
||
{10, 10},
|
||
{50, 50},
|
||
{50, 45},
|
||
{-50, 50},
|
||
{-10, 10},
|
||
} {
|
||
fmt.Println(test)
|
||
b.Run(fmt.Sprint(test), func(b *testing.B) {
|
||
for i := 0; i < b.N; i++ {
|
||
_ = Substring(str, test.offset, test.length)
|
||
}
|
||
})
|
||
}
|
||
}
|
||
|
||
func TestRuneLength(t *testing.T) {
|
||
t.Parallel()
|
||
is := assert.New(t)
|
||
|
||
is.Equal(5, RuneLength("hellô"))
|
||
is.Len("hellô", 6)
|
||
}
|
||
|
||
func TestAllCase(t *testing.T) {
|
||
t.Parallel()
|
||
|
||
type output struct {
|
||
PascalCase string
|
||
CamelCase string
|
||
KebabCase string
|
||
SnakeCase string
|
||
}
|
||
testCases := []struct {
|
||
name string
|
||
in string
|
||
want output
|
||
}{
|
||
{want: output{}},
|
||
{in: ".", want: output{}},
|
||
{in: "Hello world!", want: output{
|
||
PascalCase: "HelloWorld",
|
||
CamelCase: "helloWorld",
|
||
KebabCase: "hello-world",
|
||
SnakeCase: "hello_world",
|
||
}},
|
||
{in: "A", want: output{
|
||
PascalCase: "A",
|
||
CamelCase: "a",
|
||
KebabCase: "a",
|
||
SnakeCase: "a",
|
||
}},
|
||
{in: "a", want: output{
|
||
PascalCase: "A",
|
||
CamelCase: "a",
|
||
KebabCase: "a",
|
||
SnakeCase: "a",
|
||
}},
|
||
{in: "foo", want: output{
|
||
PascalCase: "Foo",
|
||
CamelCase: "foo",
|
||
KebabCase: "foo",
|
||
SnakeCase: "foo",
|
||
}},
|
||
{in: "snake_case", want: output{
|
||
PascalCase: "SnakeCase",
|
||
CamelCase: "snakeCase",
|
||
KebabCase: "snake-case",
|
||
SnakeCase: "snake_case",
|
||
}},
|
||
{in: "SNAKE_CASE", want: output{
|
||
PascalCase: "SnakeCase",
|
||
CamelCase: "snakeCase",
|
||
KebabCase: "snake-case",
|
||
SnakeCase: "snake_case",
|
||
}},
|
||
{in: "kebab-case", want: output{
|
||
PascalCase: "KebabCase",
|
||
CamelCase: "kebabCase",
|
||
KebabCase: "kebab-case",
|
||
SnakeCase: "kebab_case",
|
||
}},
|
||
{in: "PascalCase", want: output{
|
||
PascalCase: "PascalCase",
|
||
CamelCase: "pascalCase",
|
||
KebabCase: "pascal-case",
|
||
SnakeCase: "pascal_case",
|
||
}},
|
||
{in: "camelCase", want: output{
|
||
PascalCase: "CamelCase",
|
||
CamelCase: "camelCase",
|
||
KebabCase: `camel-case`,
|
||
SnakeCase: "camel_case",
|
||
}},
|
||
{in: "Title Case", want: output{
|
||
PascalCase: "TitleCase",
|
||
CamelCase: "titleCase",
|
||
KebabCase: "title-case",
|
||
SnakeCase: "title_case",
|
||
}},
|
||
{in: "point.case", want: output{
|
||
PascalCase: "PointCase",
|
||
CamelCase: "pointCase",
|
||
KebabCase: "point-case",
|
||
SnakeCase: "point_case",
|
||
}},
|
||
{in: "snake_case_with_more_words", want: output{
|
||
PascalCase: "SnakeCaseWithMoreWords",
|
||
CamelCase: "snakeCaseWithMoreWords",
|
||
KebabCase: "snake-case-with-more-words",
|
||
SnakeCase: "snake_case_with_more_words",
|
||
}},
|
||
{in: "SNAKE_CASE_WITH_MORE_WORDS", want: output{
|
||
PascalCase: "SnakeCaseWithMoreWords",
|
||
CamelCase: "snakeCaseWithMoreWords",
|
||
KebabCase: "snake-case-with-more-words",
|
||
SnakeCase: "snake_case_with_more_words",
|
||
}},
|
||
{in: "kebab-case-with-more-words", want: output{
|
||
PascalCase: "KebabCaseWithMoreWords",
|
||
CamelCase: "kebabCaseWithMoreWords",
|
||
KebabCase: "kebab-case-with-more-words",
|
||
SnakeCase: "kebab_case_with_more_words",
|
||
}},
|
||
{in: "PascalCaseWithMoreWords", want: output{
|
||
PascalCase: "PascalCaseWithMoreWords",
|
||
CamelCase: "pascalCaseWithMoreWords",
|
||
KebabCase: "pascal-case-with-more-words",
|
||
SnakeCase: "pascal_case_with_more_words",
|
||
}},
|
||
{in: "camelCaseWithMoreWords", want: output{
|
||
PascalCase: "CamelCaseWithMoreWords",
|
||
CamelCase: "camelCaseWithMoreWords",
|
||
KebabCase: "camel-case-with-more-words",
|
||
SnakeCase: "camel_case_with_more_words",
|
||
}},
|
||
{in: "Title Case With More Words", want: output{
|
||
PascalCase: "TitleCaseWithMoreWords",
|
||
CamelCase: "titleCaseWithMoreWords",
|
||
KebabCase: "title-case-with-more-words",
|
||
SnakeCase: "title_case_with_more_words",
|
||
}},
|
||
{in: "point.case.with.more.words", want: output{
|
||
PascalCase: "PointCaseWithMoreWords",
|
||
CamelCase: "pointCaseWithMoreWords",
|
||
KebabCase: "point-case-with-more-words",
|
||
SnakeCase: "point_case_with_more_words",
|
||
}},
|
||
{in: "snake_case__with___multiple____delimiters", want: output{
|
||
PascalCase: "SnakeCaseWithMultipleDelimiters",
|
||
CamelCase: "snakeCaseWithMultipleDelimiters",
|
||
KebabCase: "snake-case-with-multiple-delimiters",
|
||
SnakeCase: "snake_case_with_multiple_delimiters",
|
||
}},
|
||
{in: "SNAKE_CASE__WITH___multiple____DELIMITERS", want: output{
|
||
PascalCase: "SnakeCaseWithMultipleDelimiters",
|
||
CamelCase: "snakeCaseWithMultipleDelimiters",
|
||
KebabCase: "snake-case-with-multiple-delimiters",
|
||
SnakeCase: "snake_case_with_multiple_delimiters",
|
||
}},
|
||
{in: "kebab-case--with---multiple----delimiters", want: output{
|
||
PascalCase: "KebabCaseWithMultipleDelimiters",
|
||
CamelCase: "kebabCaseWithMultipleDelimiters",
|
||
KebabCase: "kebab-case-with-multiple-delimiters",
|
||
SnakeCase: "kebab_case_with_multiple_delimiters",
|
||
}},
|
||
{in: "Title Case With Multiple Delimiters", want: output{
|
||
PascalCase: "TitleCaseWithMultipleDelimiters",
|
||
CamelCase: "titleCaseWithMultipleDelimiters",
|
||
KebabCase: "title-case-with-multiple-delimiters",
|
||
SnakeCase: "title_case_with_multiple_delimiters",
|
||
}},
|
||
{in: "point.case..with...multiple....delimiters", want: output{
|
||
PascalCase: "PointCaseWithMultipleDelimiters",
|
||
CamelCase: "pointCaseWithMultipleDelimiters",
|
||
KebabCase: "point-case-with-multiple-delimiters",
|
||
SnakeCase: "point_case_with_multiple_delimiters",
|
||
}},
|
||
{in: " leading space", want: output{
|
||
PascalCase: "LeadingSpace",
|
||
CamelCase: "leadingSpace",
|
||
KebabCase: "leading-space",
|
||
SnakeCase: "leading_space",
|
||
}},
|
||
{in: " leading spaces", want: output{
|
||
PascalCase: "LeadingSpaces",
|
||
CamelCase: "leadingSpaces",
|
||
KebabCase: "leading-spaces",
|
||
SnakeCase: "leading_spaces",
|
||
}},
|
||
{in: "\t\t\r\n leading whitespaces", want: output{
|
||
PascalCase: "LeadingWhitespaces",
|
||
CamelCase: "leadingWhitespaces",
|
||
KebabCase: "leading-whitespaces",
|
||
SnakeCase: "leading_whitespaces",
|
||
}},
|
||
{in: "trailing space ", want: output{
|
||
PascalCase: "TrailingSpace",
|
||
CamelCase: "trailingSpace",
|
||
KebabCase: "trailing-space",
|
||
SnakeCase: "trailing_space",
|
||
}},
|
||
{in: "trailing spaces ", want: output{
|
||
PascalCase: "TrailingSpaces",
|
||
CamelCase: "trailingSpaces",
|
||
KebabCase: "trailing-spaces",
|
||
SnakeCase: "trailing_spaces",
|
||
}},
|
||
{in: "trailing whitespaces\t\t\r\n", want: output{
|
||
PascalCase: "TrailingWhitespaces",
|
||
CamelCase: "trailingWhitespaces",
|
||
KebabCase: "trailing-whitespaces",
|
||
SnakeCase: "trailing_whitespaces",
|
||
}},
|
||
{in: " on both sides ", want: output{
|
||
PascalCase: "OnBothSides",
|
||
CamelCase: "onBothSides",
|
||
KebabCase: "on-both-sides",
|
||
SnakeCase: "on_both_sides",
|
||
}},
|
||
{in: " many on both sides ", want: output{
|
||
PascalCase: "ManyOnBothSides",
|
||
CamelCase: "manyOnBothSides",
|
||
KebabCase: "many-on-both-sides",
|
||
SnakeCase: "many_on_both_sides",
|
||
}},
|
||
{in: "\r whitespaces on both sides\t\t\r\n", want: output{
|
||
PascalCase: "WhitespacesOnBothSides",
|
||
CamelCase: "whitespacesOnBothSides",
|
||
KebabCase: "whitespaces-on-both-sides",
|
||
SnakeCase: "whitespaces_on_both_sides",
|
||
}},
|
||
{in: " extraSpaces in_This TestCase Of MIXED_CASES\t", want: output{
|
||
PascalCase: "ExtraSpacesInThisTestCaseOfMixedCases",
|
||
CamelCase: "extraSpacesInThisTestCaseOfMixedCases",
|
||
KebabCase: "extra-spaces-in-this-test-case-of-mixed-cases",
|
||
SnakeCase: "extra_spaces_in_this_test_case_of_mixed_cases",
|
||
}},
|
||
{in: "CASEBreak", want: output{
|
||
PascalCase: "CaseBreak",
|
||
CamelCase: "caseBreak",
|
||
KebabCase: "case-break",
|
||
SnakeCase: "case_break",
|
||
}},
|
||
{in: "ID", want: output{
|
||
PascalCase: "Id",
|
||
CamelCase: "id",
|
||
KebabCase: "id",
|
||
SnakeCase: "id",
|
||
}},
|
||
{in: "userID", want: output{
|
||
PascalCase: "UserId",
|
||
CamelCase: "userId",
|
||
KebabCase: "user-id",
|
||
SnakeCase: "user_id",
|
||
}},
|
||
{in: "JSON_blob", want: output{
|
||
PascalCase: "JsonBlob",
|
||
CamelCase: "jsonBlob",
|
||
KebabCase: "json-blob",
|
||
SnakeCase: "json_blob",
|
||
}},
|
||
{in: "HTTPStatusCode", want: output{
|
||
PascalCase: "HttpStatusCode",
|
||
CamelCase: "httpStatusCode",
|
||
KebabCase: "http-status-code",
|
||
SnakeCase: "http_status_code",
|
||
}},
|
||
{in: "FreeBSD and SSLError are not golang initialisms", want: output{
|
||
PascalCase: "FreeBsdAndSslErrorAreNotGolangInitialisms",
|
||
CamelCase: "freeBsdAndSslErrorAreNotGolangInitialisms",
|
||
KebabCase: "free-bsd-and-ssl-error-are-not-golang-initialisms",
|
||
SnakeCase: "free_bsd_and_ssl_error_are_not_golang_initialisms",
|
||
}},
|
||
{in: "David's Computer", want: output{
|
||
PascalCase: "DavidSComputer",
|
||
CamelCase: "davidSComputer",
|
||
KebabCase: "david-s-computer",
|
||
SnakeCase: "david_s_computer",
|
||
}},
|
||
{in: "http200", want: output{
|
||
PascalCase: "Http200",
|
||
CamelCase: "http200",
|
||
KebabCase: "http-200",
|
||
SnakeCase: "http_200",
|
||
}},
|
||
{in: "NumberSplittingVersion1.0r3", want: output{
|
||
PascalCase: "NumberSplittingVersion10R3",
|
||
CamelCase: "numberSplittingVersion10R3",
|
||
KebabCase: "number-splitting-version-1-0-r3",
|
||
SnakeCase: "number_splitting_version_1_0_r3",
|
||
}},
|
||
{in: "When you have a comma, odd results", want: output{
|
||
PascalCase: "WhenYouHaveACommaOddResults",
|
||
CamelCase: "whenYouHaveACommaOddResults",
|
||
KebabCase: "when-you-have-a-comma-odd-results",
|
||
SnakeCase: "when_you_have_a_comma_odd_results",
|
||
}},
|
||
{in: "Ordinal numbers work: 1st 2nd and 3rd place", want: output{
|
||
PascalCase: "OrdinalNumbersWork1St2NdAnd3RdPlace",
|
||
CamelCase: "ordinalNumbersWork1St2NdAnd3RdPlace",
|
||
KebabCase: "ordinal-numbers-work-1-st-2-nd-and-3-rd-place",
|
||
SnakeCase: "ordinal_numbers_work_1_st_2_nd_and_3_rd_place",
|
||
}},
|
||
{in: "BadUTF8\xe2\xe2\xa1", want: output{
|
||
PascalCase: "BadUtf8",
|
||
CamelCase: "badUtf8",
|
||
KebabCase: "bad-utf-8",
|
||
SnakeCase: "bad_utf_8",
|
||
}},
|
||
{in: "IDENT3", want: output{
|
||
PascalCase: "Ident3",
|
||
CamelCase: "ident3",
|
||
KebabCase: "ident-3",
|
||
SnakeCase: "ident_3",
|
||
}},
|
||
{in: "LogRouterS3BucketName", want: output{
|
||
PascalCase: "LogRouterS3BucketName",
|
||
CamelCase: "logRouterS3BucketName",
|
||
KebabCase: "log-router-s3-bucket-name",
|
||
SnakeCase: "log_router_s3_bucket_name",
|
||
}},
|
||
{in: "PINEAPPLE", want: output{
|
||
PascalCase: "Pineapple",
|
||
CamelCase: "pineapple",
|
||
KebabCase: "pineapple",
|
||
SnakeCase: "pineapple",
|
||
}},
|
||
{in: "Int8Value", want: output{
|
||
PascalCase: "Int8Value",
|
||
CamelCase: "int8Value",
|
||
KebabCase: "int-8-value",
|
||
SnakeCase: "int_8_value",
|
||
}},
|
||
{in: "first.last", want: output{
|
||
PascalCase: "FirstLast",
|
||
CamelCase: "firstLast",
|
||
KebabCase: "first-last",
|
||
SnakeCase: "first_last",
|
||
}},
|
||
}
|
||
|
||
for _, tc := range testCases {
|
||
tc := tc
|
||
t.Run(tc.in, func(t *testing.T) {
|
||
t.Parallel()
|
||
is := assert.New(t)
|
||
is.Equalf(tc.want.PascalCase, PascalCase(tc.in), "PascalCase(%v)", tc.in)
|
||
is.Equalf(tc.want.CamelCase, CamelCase(tc.in), "CamelCase(%v)", tc.in)
|
||
is.Equalf(tc.want.KebabCase, KebabCase(tc.in), "KebabCase(%v)", tc.in)
|
||
is.Equalf(tc.want.SnakeCase, SnakeCase(tc.in), "SnakeCase(%v)", tc.in)
|
||
})
|
||
}
|
||
}
|
||
|
||
func TestWords(t *testing.T) {
|
||
t.Parallel()
|
||
|
||
testCases := []struct {
|
||
in string
|
||
want []string
|
||
}{
|
||
{"PascalCase", []string{"Pascal", "Case"}},
|
||
{"camelCase", []string{"camel", "Case"}},
|
||
{"snake_case", []string{"snake", "case"}},
|
||
{"kebab_case", []string{"kebab", "case"}},
|
||
{"_test text_", []string{"test", "text"}},
|
||
{"UPPERCASE", []string{"UPPERCASE"}},
|
||
{"HTTPCode", []string{"HTTP", "Code"}},
|
||
{"Int8Value", []string{"Int", "8", "Value"}},
|
||
}
|
||
for _, tc := range testCases {
|
||
tc := tc
|
||
t.Run(tc.in, func(t *testing.T) {
|
||
t.Parallel()
|
||
assert.Equalf(t, tc.want, Words(tc.in), "Words(%v)", tc.in)
|
||
})
|
||
}
|
||
}
|
||
|
||
func TestCapitalize(t *testing.T) {
|
||
t.Parallel()
|
||
|
||
testCases := []struct {
|
||
name string
|
||
in string
|
||
want string
|
||
}{
|
||
{"lower case", "hello", "Hello"},
|
||
{"mixed case", "heLLO", "Hello"},
|
||
}
|
||
for _, tc := range testCases {
|
||
tc := tc
|
||
t.Run(tc.name, func(t *testing.T) {
|
||
t.Parallel()
|
||
assert.Equalf(t, tc.want, Capitalize(tc.in), "Capitalize(%v)", tc.in)
|
||
})
|
||
}
|
||
}
|
||
|
||
func TestEllipsis(t *testing.T) {
|
||
t.Parallel()
|
||
is := assert.New(t)
|
||
|
||
is.Equal("...", Ellipsis("12", 0))
|
||
is.Equal("...", Ellipsis("12", 1))
|
||
is.Equal("12", Ellipsis("12", 2))
|
||
is.Equal("12", Ellipsis("12", 3))
|
||
is.Equal("12345", Ellipsis("12345", 5))
|
||
is.Equal("1...", Ellipsis("12345", 4))
|
||
is.Equal("1...", Ellipsis(" 12345 ", 4))
|
||
is.Equal("12345", Ellipsis("12345", 6))
|
||
is.Equal("12345", Ellipsis("12345", 10))
|
||
is.Equal("12345", Ellipsis(" 12345 ", 10))
|
||
is.Equal("...", Ellipsis("12345", 3))
|
||
is.Equal("...", Ellipsis("12345", 2))
|
||
is.Equal("...", Ellipsis("12345", -1))
|
||
is.Equal("hello...", Ellipsis(" hello world ", 9))
|
||
|
||
// Unicode: rune-based truncation (not byte-based)
|
||
is.Equal("hello...", Ellipsis("hello 世界! 你好", 8)) // CJK characters: "hello" (5 runes) + "..." = 8 runes
|
||
is.Equal("hello 世界...", Ellipsis("hello 世界! 你好", 11)) // truncate within CJK text
|
||
is.Equal("hello 世界! 你好", Ellipsis("hello 世界! 你好", 12)) // exact length, no truncation
|
||
is.Equal("hello 世界! 你好", Ellipsis("hello 世界! 你好", 20)) // length exceeds string, no truncation
|
||
is.Equal("🏠🐶🐱🌟", Ellipsis("🏠🐶🐱🌟", 5)) // length > rune count, no truncation
|
||
is.Equal("🏠🐶🐱🌟", Ellipsis("🏠🐶🐱🌟", 4)) // exact length, no truncation
|
||
is.Equal("...", Ellipsis("🏠🐶🐱🌟", 3)) // length == 3, returns "..."
|
||
is.Equal("...", Ellipsis("🏠🐶🐱🌟", 2)) // length < 3, returns "..."
|
||
is.Equal("🏠🐶...", Ellipsis("🏠🐶🐱🌟🎉🌈", 5)) // 6 emoji, truncate to 2 + "..."
|
||
is.Equal("café", Ellipsis("café", 4)) // accented char counts as 1 rune
|
||
is.Equal("...", Ellipsis("café", 3)) // length == 3, returns "..."
|
||
is.Equal("ca...", Ellipsis("café au lait", 5)) // mixed ASCII and accented
|
||
|
||
// Combining emoji (Rainbow Flag is 4 runes: U+1F3F3 + U+FE0F + U+200D + U+1F308)
|
||
// "aà😁🏳️🌈pabc" = 1 + 1 + 1 + 4 + 1 + 1 + 1 + 1 = 11 runes total
|
||
is.Equal("...", Ellipsis("aà😁🏳️🌈pabc", 2)) // only "..."
|
||
is.Equal("...", Ellipsis("aà😁🏳️🌈pabc", 3)) // only "..."
|
||
is.Equal("a...", Ellipsis("aà😁🏳️🌈pabc", 4)) // 1 rune + "..."
|
||
is.Equal("aà...", Ellipsis("aà😁🏳️🌈pabc", 5)) // 2 runes + "..."
|
||
is.Equal("aà😁...", Ellipsis("aà😁🏳️🌈pabc", 6)) // 3 runes + "..."
|
||
// @TODO: fix these tests
|
||
// is.Equal("aà😁🏳️🌈...", Ellipsis("aà😁🏳️🌈pabc", 7)) // 4 runes + "..."
|
||
// is.Equal("aà😁🏳️🌈p...", Ellipsis("aà😁🏳️🌈pabc", 8)) // 5 runes + "..."
|
||
// is.Equal("aà😁🏳️🌈pabc", Ellipsis("aà😁🏳️🌈pabc", 9)) // exact length, no truncation
|
||
// is.Equal("aà😁🏳️🌈pabc", Ellipsis("aà😁🏳️🌈pabc", 10)) // length exceeds string, no truncation
|
||
}
|