mirror of
https://github.com/unidoc/unioffice.git
synced 2025-04-27 13:48:54 +08:00
42 lines
938 B
Go
42 lines
938 B
Go
// Copyright 2017 Baliance. All rights reserved.
|
|
//
|
|
// Use of this source code is governed by the terms of the Affero GNU General
|
|
// Public License version 3.0 as published by the Free Software Foundation and
|
|
// appearing in the file LICENSE included in the packaging of this file. A
|
|
// commercial license can be purchased by contacting sales@baliance.com.
|
|
|
|
package algo_test
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"baliance.com/gooxml/algo"
|
|
)
|
|
|
|
func TestSort(t *testing.T) {
|
|
|
|
tests := []struct {
|
|
a, b string
|
|
}{
|
|
{"rId1", "rId2"},
|
|
{"rId1", "rId10"},
|
|
{"rId2", "rId10"},
|
|
{"rId5", "rId10"},
|
|
{"rId5", "rId15"},
|
|
{"rId5", "rId51"},
|
|
{"rId1a", "rId1b"},
|
|
}
|
|
|
|
for _, tc := range tests {
|
|
if !algo.NaturalLess(tc.a, tc.b) {
|
|
t.Errorf("bad sort, expected %s < %s", tc.a, tc.b)
|
|
} else {
|
|
// no need to check if it failed the first time
|
|
if algo.NaturalLess(tc.b, tc.a) {
|
|
t.Errorf("bad sort, expected %s > %s", tc.b, tc.a)
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|