1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380
|
// -*- Mode: Go; indent-tabs-mode: t -*-
/*
* Copyright (C) 2014-2020 Canonical Ltd
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 3 as
* published by the Free Software Foundation.
*
* 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
package strutil_test
import (
"bytes"
"math"
"sort"
"testing"
"gopkg.in/check.v1"
"github.com/snapcore/snapd/strutil"
)
func Test(t *testing.T) { check.TestingT(t) }
type strutilSuite struct{}
var _ = check.Suite(&strutilSuite{})
func (*strutilSuite) TestQuoted(c *check.C) {
for _, t := range []struct {
in []string
out string
}{
{nil, ""},
{[]string{}, ""},
{[]string{"one"}, `"one"`},
{[]string{"one", "two"}, `"one", "two"`},
{[]string{"one", `tw"`}, `"one", "tw\""`},
} {
c.Check(strutil.Quoted(t.in), check.Equals, t.out, check.Commentf("expected %#v -> %s", t.in, t.out))
}
}
func (ts *strutilSuite) TestSizeToStr(c *check.C) {
for _, t := range []struct {
size int64
str string
}{
{0, "0B"},
{1, "1B"},
{400, "400B"},
{1000, "1kB"},
{1000 + 1, "1kB"},
{900 * 1000, "900kB"},
{1000 * 1000, "1MB"},
{20 * 1000 * 1000, "20MB"},
{1000 * 1000 * 1000, "1GB"},
{31 * 1000 * 1000 * 1000, "31GB"},
{math.MaxInt64, "9EB"},
} {
c.Check(strutil.SizeToStr(t.size), check.Equals, t.str)
}
}
func (ts *strutilSuite) TestIntsToCommaSeparated(c *check.C) {
for _, t := range []struct {
values []int
str string
}{
{[]int{}, ""},
{nil, ""},
{[]int{0}, "0"},
{[]int{0, -1}, "0,-1"},
{[]int{1, 2, 3}, "1,2,3"},
} {
c.Check(strutil.IntsToCommaSeparated(t.values), check.Equals, t.str)
}
}
func (ts *strutilSuite) TestListContains(c *check.C) {
for _, xs := range [][]string{
{},
nil,
{"foo"},
{"foo", "baz", "barbar"},
} {
c.Check(strutil.ListContains(xs, "bar"), check.Equals, false)
sort.Strings(xs)
c.Check(strutil.SortedListContains(xs, "bar"), check.Equals, false)
}
for _, xs := range [][]string{
{"bar"},
{"foo", "bar", "baz"},
{"bar", "foo", "baz"},
{"foo", "baz", "bar"},
{"bar", "bar", "bar", "bar", "bar", "bar"},
} {
c.Check(strutil.ListContains(xs, "bar"), check.Equals, true)
sort.Strings(xs)
c.Check(strutil.SortedListContains(xs, "bar"), check.Equals, true)
}
}
func (ts *strutilSuite) TestTruncateOutput(c *check.C) {
data := []byte("ab\ncd\nef\ngh\nij")
out := strutil.TruncateOutput(data, 3, 500)
c.Assert(out, check.DeepEquals, []byte("ef\ngh\nij"))
out = strutil.TruncateOutput(data, 1000, 8)
c.Assert(out, check.DeepEquals, []byte("ef\ngh\nij"))
out = strutil.TruncateOutput(data, 1000, 1000)
c.Assert(out, check.DeepEquals, []byte("ab\ncd\nef\ngh\nij"))
out = strutil.TruncateOutput(data, 99, 5)
c.Assert(out, check.DeepEquals, []byte("gh\nij"))
out = strutil.TruncateOutput(data, 99, 6)
c.Assert(out, check.DeepEquals, []byte("\ngh\nij"))
out = strutil.TruncateOutput(data, 5, 1000)
c.Assert(out, check.DeepEquals, []byte("ab\ncd\nef\ngh\nij"))
out = strutil.TruncateOutput(data, 1000, len(data))
c.Assert(out, check.DeepEquals, []byte("ab\ncd\nef\ngh\nij"))
out = strutil.TruncateOutput(data, 1000, 1000)
c.Assert(out, check.DeepEquals, []byte("ab\ncd\nef\ngh\nij"))
out = strutil.TruncateOutput(data, 0, 0)
c.Assert(out, check.HasLen, 0)
}
func (ts *strutilSuite) TestParseByteSizeHappy(c *check.C) {
for _, t := range []struct {
str string
expected int64
}{
{"0B", 0},
{"1B", 1},
{"400B", 400},
{"1kB", 1000},
// note the upper-case
{"1KB", 1000},
{"900kB", 900 * 1000},
{"1MB", 1000 * 1000},
{"20MB", 20 * 1000 * 1000},
{"1GB", 1000 * 1000 * 1000},
{"31GB", 31 * 1000 * 1000 * 1000},
{"4TB", 4 * 1000 * 1000 * 1000 * 1000},
{"6PB", 6 * 1000 * 1000 * 1000 * 1000 * 1000},
{"8EB", 8 * 1000 * 1000 * 1000 * 1000 * 1000 * 1000},
} {
val, err := strutil.ParseByteSize(t.str)
c.Check(err, check.IsNil)
c.Check(val, check.Equals, t.expected, check.Commentf("incorrect result for input %q", t.str))
}
}
func (ts *strutilSuite) TestParseByteSizeUnhappy(c *check.C) {
for _, t := range []struct {
str string
errStr string
}{
{"B", `cannot parse "B": no numerical prefix`},
{"1", `cannot parse "1": need a number with a unit as input`},
{"11", `cannot parse "11": need a number with a unit as input`},
{"400x", `cannot parse "400x": try 'kB' or 'MB'`},
{"400xx", `cannot parse "400xx": try 'kB' or 'MB'`},
{"1k", `cannot parse "1k": try 'kB' or 'MB'`},
{"200KiB", `cannot parse "200KiB": try 'kB' or 'MB'`},
{"-200KB", `cannot parse "-200KB": size cannot be negative`},
{"-200B", `cannot parse "-200B": size cannot be negative`},
{"-B", `cannot parse "-B": "-" is not a number`},
{"-", `cannot parse "-": "-" is not a number`},
{"", `cannot parse "": "" is not a number`},
// Digits outside of Latin1 range
// ARABIC-INDIC DIGIT SEVEN
{"٧kB", `cannot parse "٧kB": no numerical prefix`},
{"1٧kB", `cannot parse "1٧kB": try 'kB' or 'MB'`},
} {
_, err := strutil.ParseByteSize(t.str)
c.Check(err, check.ErrorMatches, t.errStr, check.Commentf("incorrect error for %q", t.str))
}
}
func (strutilSuite) TestCommaSeparatedList(c *check.C) {
table := []struct {
in string
out []string
}{
{"", []string{}},
{",", []string{}},
{"foo,bar", []string{"foo", "bar"}},
{"foo , bar", []string{"foo", "bar"}},
{"foo ,, bar", []string{"foo", "bar"}},
{" foo ,, bar,baz", []string{"foo", "bar", "baz"}},
{" foo bar ,,,baz", []string{"foo bar", "baz"}},
}
for _, test := range table {
c.Check(strutil.CommaSeparatedList(test.in), check.DeepEquals, test.out, check.Commentf("%q", test.in))
}
}
func (strutilSuite) TestMultiCommaSeparatedList(c *check.C) {
table := []struct {
in []string
out []string
}{
{[]string{}, nil},
{[]string{"", ",,", ""}, nil},
{[]string{"foo", "bar"}, []string{"foo", "bar"}},
{[]string{"foo,bar", "bazz,buzz", "x"}, []string{"foo", "bar", "bazz", "buzz", "x"}},
}
for _, test := range table {
c.Check(strutil.MultiCommaSeparatedList(test.in), check.DeepEquals, test.out, check.Commentf("%q", test.in))
}
}
func (strutilSuite) TestEllipt(c *check.C) {
type T struct {
in string
n int
right string
left string
}
for _, t := range []T{
{"", 10, "", ""},
{"", -1, "", ""},
{"hello", -1, "…", "…"},
{"hello", 0, "…", "…"},
{"hello", 1, "…", "…"},
{"hello", 2, "h…", "…o"},
{"hello", 3, "he…", "…lo"},
{"hello", 4, "hel…", "…llo"},
{"hello", 5, "hello", "hello"},
{"hello", 10, "hello", "hello"},
{"héllo", 4, "hé…", "…llo"},
{"héllo", 3, "he…", "…lo"},
{"he🐧lo", 4, "he🐧…", "…🐧lo"},
{"he🐧lo", 3, "he…", "…lo"},
} {
c.Check(strutil.ElliptRight(t.in, t.n), check.Equals, t.right, check.Commentf("%q[:%d] -> %q", t.in, t.n, t.right))
c.Check(strutil.ElliptLeft(t.in, t.n), check.Equals, t.left, check.Commentf("%q[-%d:] -> %q", t.in, t.n, t.left))
}
}
func (strutilSuite) TestSortedListsUniqueMerge(c *check.C) {
l1 := []string{"a", "a", "c", "d", "e", "f", "h", "h"}
l2 := []string{"b", "c", "d", "d", "g"}
l3 := []string{"a", "b", "c", "d", "e", "f", "g", "h"}
tests := []struct {
sl1 []string
sl2 []string
res []string
}{
{nil, nil, nil},
{nil, []string{"a", "a", "b"}, []string{"a", "b"}},
{[]string{"a", "a", "b"}, nil, []string{"a", "b"}},
{l1, l2, l3},
{l2, l1, l3},
{l3, l3, l3},
}
for _, t := range tests {
res := strutil.SortedListsUniqueMerge(t.sl1, t.sl2)
c.Check(res, check.DeepEquals, t.res)
}
}
func (strutilSuite) TestDeduplicate(c *check.C) {
for _, t := range []struct {
input []string
output []string
}{
{input: []string{"a", "b", "c"}, output: []string{"a", "b", "c"}},
{input: []string{"a", "b", "a"}, output: []string{"a", "b"}},
// order of of first occurrence is preserved
{input: []string{"a", "a", "a", "c", "a", "b", "b", "a"}, output: []string{"a", "c", "b"}},
{input: []string{}, output: []string{}},
} {
c.Assert(strutil.Deduplicate(t.input), check.DeepEquals, t.output)
}
}
func (strutilSuite) TestWordWrap(c *check.C) {
for _, t := range []struct {
input string
width int
indent string
indent2 string
output string
}{
{input: "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.", width: 20, indent: "", indent2: "", output: "Lorem ipsum dolor\nsit amet,\nconsectetur\nadipiscing elit, sed\ndo eiusmod tempor\nincididunt ut labore\net dolore magna\naliqua.\n"},
{input: "Lorem ips", width: 20, indent: "", indent2: "", output: "Lorem ips\n"},
{input: "", width: 5, indent: "", indent2: "", output: "\n"},
{input: "", width: 5, indent: " ", indent2: " ", output: " \n"},
{input: "Lorem ipsum", width: 0, indent: "", indent2: "", output: "L\no\nr\ne\nm\ni\np\ns\nu\nm\n"},
{input: "Lorem ipsum", width: -10, indent: "", indent2: "", output: "L\no\nr\ne\nm\ni\np\ns\nu\nm\n"},
{input: "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.", width: 20, indent: " ", indent2: "", output: " Lorem ipsum dolor\nsit amet,\nconsectetur\nadipiscing elit, sed\ndo eiusmod tempor\nincididunt ut labore\net dolore magna\naliqua.\n"},
{input: "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.", width: 20, indent: "", indent2: " ", output: "Lorem ipsum dolor\n sit amet,\n consectetur\n adipiscing elit,\n sed do eiusmod\n tempor incididunt\n ut labore et\n dolore magna\n aliqua.\n"},
} {
buf := new(bytes.Buffer)
err := strutil.WordWrap(buf, []rune(t.input), t.indent, t.indent2, t.width)
c.Assert(err, check.IsNil)
c.Check(buf.String(), check.Equals, t.output)
}
}
func (strutilSuite) TestWordWrapCornerCase(c *check.C) {
// this particular corner case isn't currently reachable from
// printDescr nor printSummary, but best to have it covered
var buf bytes.Buffer
const s = "This is a paragraph indented with leading spaces that are encoded as multiple bytes. All hail EN SPACE."
strutil.WordWrap(&buf, []rune(s), "\u2002\u2002", " ", 30)
c.Check(buf.String(), check.Equals, `
This is a paragraph indented
with leading spaces that are
encoded as multiple bytes.
All hail EN SPACE.
`[1:])
}
func (strutilSuite) TestWordWrapPadded(c *check.C) {
for _, t := range []struct {
input string
width int
padding string
output string
}{
{input: "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.", width: 20, padding: " ", output: " Lorem ipsum dolor\n sit amet,\n consectetur\n adipiscing elit,\n sed do eiusmod\n tempor incididunt\n ut labore et\n dolore magna\n aliqua.\n"},
{input: "Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.", width: 20, padding: "", output: "Lorem ipsum dolor\nsit amet,\nconsectetur\nadipiscing elit, sed\ndo eiusmod tempor\nincididunt ut labore\net dolore magna\naliqua.\n"},
{input: "Lorem ips", width: 20, padding: " ", output: " Lorem ips\n"},
{input: "", width: 5, padding: "", output: "\n"},
{input: "", width: 5, padding: " ", output: " \n"},
// no padding is added when len(padding) == width
{input: "Lorem ipsum", width: 0, padding: "", output: "L\no\nr\ne\nm\ni\np\ns\nu\nm\n"},
// padding gets added when len(padding) is > width, so expect a 4 space padding
{input: "Lorem ipsum", width: 0, padding: " ", output: " L\n o\n r\n e\n m\n i\n p\n s\n u\n m\n"},
// padding should be added here as well as now the width is lower than len(padding)
{input: "Lorem ipsum", width: -10, padding: "", output: " L\n o\n r\n e\n m\n i\n p\n s\n u\n m\n"},
} {
buf := new(bytes.Buffer)
err := strutil.WordWrapPadded(buf, []rune(t.input), t.padding, t.width)
c.Assert(err, check.IsNil)
c.Check(buf.String(), check.Equals, t.output)
}
}
func (strutilSuite) TestJoinNonEmpty(c *check.C) {
for _, t := range []struct {
in []string
out string
}{
{in: []string{}, out: ""},
{in: []string{"", "bar"}, out: "bar"},
{in: []string{"", " ", "bar"}, out: "bar"},
{in: []string{"foo", "", "bar"}, out: "foo bar"},
{in: []string{" val ", " ", " boo"}, out: "val boo"},
} {
c.Check(strutil.JoinNonEmpty(t.in, " "), check.Equals, t.out)
}
}
|