93 lines
2.2 KiB
Go
93 lines
2.2 KiB
Go
/*
|
|
* Copyright (c) 2020 Alex aka mailoman <alex@webz.asia>
|
|
*
|
|
* Licensed under the Apache License, Version 2.0 (the "License");
|
|
* you may not use this file except in compliance with the License.
|
|
* You may obtain a copy of the License at
|
|
*
|
|
* http://www.apache.org/licenses/LICENSE-2.0
|
|
*
|
|
* Unless required by applicable law or agreed to in writing, software
|
|
* distributed under the License is distributed on an "AS IS" BASIS,
|
|
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
* See the License for the specific language governing permissions and
|
|
* limitations under the License.
|
|
*
|
|
* @author Alex aka mailoman <alex@webz.asia>
|
|
* @copyright Copyright (c) 2020 Alex aka mailoman <alex@webz.asia>
|
|
* @since 08.01.2020
|
|
*
|
|
*/
|
|
|
|
package gormgoose
|
|
|
|
import (
|
|
"testing"
|
|
)
|
|
|
|
func TestMigrationMapSortUp(t *testing.T) {
|
|
|
|
ms := migrationSorter{}
|
|
|
|
// insert in any order
|
|
ms = append(ms, newMigration(20120000, "test"))
|
|
ms = append(ms, newMigration(20128000, "test"))
|
|
ms = append(ms, newMigration(20129000, "test"))
|
|
ms = append(ms, newMigration(20127000, "test"))
|
|
|
|
ms.Sort(true) // sort Upwards
|
|
|
|
sorted := []int64{20120000, 20127000, 20128000, 20129000}
|
|
|
|
validateMigrationSort(t, ms, sorted)
|
|
}
|
|
|
|
func TestMigrationMapSortDown(t *testing.T) {
|
|
|
|
ms := migrationSorter{}
|
|
|
|
// insert in any order
|
|
ms = append(ms, newMigration(20120000, "test"))
|
|
ms = append(ms, newMigration(20128000, "test"))
|
|
ms = append(ms, newMigration(20129000, "test"))
|
|
ms = append(ms, newMigration(20127000, "test"))
|
|
|
|
ms.Sort(false) // sort Downwards
|
|
|
|
sorted := []int64{20129000, 20128000, 20127000, 20120000}
|
|
|
|
validateMigrationSort(t, ms, sorted)
|
|
}
|
|
|
|
func validateMigrationSort(t *testing.T, ms migrationSorter, sorted []int64) {
|
|
|
|
for i, m := range ms {
|
|
if sorted[i] != m.Version {
|
|
t.Error("incorrect sorted version")
|
|
}
|
|
|
|
var next, prev int64
|
|
|
|
if i == 0 {
|
|
prev = -1
|
|
next = ms[i+1].Version
|
|
} else if i == len(ms)-1 {
|
|
prev = ms[i-1].Version
|
|
next = -1
|
|
} else {
|
|
prev = ms[i-1].Version
|
|
next = ms[i+1].Version
|
|
}
|
|
|
|
if m.Next != next {
|
|
t.Errorf("mismatched Next. v: %v, got %v, wanted %v\n", m, m.Next, next)
|
|
}
|
|
|
|
if m.Previous != prev {
|
|
t.Errorf("mismatched Previous v: %v, got %v, wanted %v\n", m, m.Previous, prev)
|
|
}
|
|
}
|
|
|
|
t.Log(ms)
|
|
}
|