forked from root/public
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
80 lines
1.4 KiB
80 lines
1.4 KiB
package main |
|
|
|
import ( |
|
"strconv" |
|
|
|
student "student" |
|
|
|
"func/correct" |
|
|
|
"lib" |
|
) |
|
|
|
type Node3 = student.NodeL |
|
type List3 = correct.List |
|
type NodeS3 = correct.NodeL |
|
type ListS3 = student.List |
|
|
|
func listToStringStu9(l *ListS3) string { |
|
var res string |
|
it := l.Head |
|
for it != nil { |
|
switch it.Data.(type) { |
|
case int: |
|
res += strconv.Itoa(it.Data.(int)) + "-> " |
|
case string: |
|
res += it.Data.(string) + "-> " |
|
} |
|
it = it.Next |
|
} |
|
res += "<nil>" |
|
return res |
|
} |
|
|
|
// inserts node on two lists |
|
func listPushBackTest3(l *ListS3, l1 *List3, data interface{}) { |
|
n := &Node3{Data: data} |
|
n1 := &NodeS3{Data: data} |
|
if l.Head == nil { |
|
l.Head = n |
|
l.Tail = n |
|
} else { |
|
l.Tail.Next = n |
|
l.Tail = n |
|
} |
|
if l1.Head == nil { |
|
l1.Head = n1 |
|
l1.Tail = n1 |
|
} else { |
|
l1.Tail.Next = n1 |
|
l1.Tail = n1 |
|
} |
|
} |
|
|
|
// last element of the correct.ListS |
|
func main() { |
|
link1 := &List3{} |
|
link2 := &ListS3{} |
|
table := []correct.NodeTest{} |
|
|
|
table = correct.ElementsToTest(table) |
|
table = append(table, |
|
correct.NodeTest{ |
|
Data: []interface{}{3, 2, 1}, |
|
}, |
|
) |
|
for _, arg := range table { |
|
for i := 0; i < len(arg.Data); i++ { |
|
listPushBackTest3(link2, link1, arg.Data[i]) |
|
} |
|
aux1 := correct.ListLast(link1) |
|
aux2 := student.ListLast(link2) |
|
|
|
if aux1 != aux2 { |
|
lib.Fatalf("\nlist:%s\n\nListLast() == %v instead of %v\n\n", |
|
listToStringStu9(link2), aux2, aux1) |
|
} |
|
link1 = &List3{} |
|
link2 = &ListS3{} |
|
} |
|
}
|
|
|