201 lines
5.5 KiB
Go
201 lines
5.5 KiB
Go
|
// Protocol Buffers for Go with Gadgets
|
||
|
//
|
||
|
// Copyright (c) 2013, The GoGo Authors. All rights reserved.
|
||
|
// http://github.com/gogo/protobuf
|
||
|
//
|
||
|
// Redistribution and use in source and binary forms, with or without
|
||
|
// modification, are permitted provided that the following conditions are
|
||
|
// met:
|
||
|
//
|
||
|
// * Redistributions of source code must retain the above copyright
|
||
|
// notice, this list of conditions and the following disclaimer.
|
||
|
// * Redistributions in binary form must reproduce the above
|
||
|
// copyright notice, this list of conditions and the following disclaimer
|
||
|
// in the documentation and/or other materials provided with the
|
||
|
// distribution.
|
||
|
//
|
||
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
|
|
||
|
package unrecognized
|
||
|
|
||
|
import (
|
||
|
"github.com/gogo/protobuf/proto"
|
||
|
math_rand "math/rand"
|
||
|
"testing"
|
||
|
time "time"
|
||
|
)
|
||
|
|
||
|
func TestNewOld(t *testing.T) {
|
||
|
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
|
||
|
newer := NewPopulatedA(popr, true)
|
||
|
data1, err := proto.Marshal(newer)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
older := &OldA{}
|
||
|
if err = proto.Unmarshal(data1, older); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
data2, err := proto.Marshal(older)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
bluer := &A{}
|
||
|
if err := proto.Unmarshal(data2, bluer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
if err := newer.VerboseEqual(bluer); err != nil {
|
||
|
t.Fatalf("%#v !VerboseProto %#v, since %v", newer, bluer, err)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestOldNew(t *testing.T) {
|
||
|
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
|
||
|
older := NewPopulatedOldA(popr, true)
|
||
|
data1, err := proto.Marshal(older)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
newer := &A{}
|
||
|
if err = proto.Unmarshal(data1, newer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
data2, err := proto.Marshal(newer)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
bluer := &OldA{}
|
||
|
if err := proto.Unmarshal(data2, bluer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
if err := older.VerboseEqual(bluer); err != nil {
|
||
|
t.Fatalf("%#v !VerboseProto %#v, since %v", older, bluer, err)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestOldNewOldNew(t *testing.T) {
|
||
|
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
|
||
|
older := NewPopulatedOldA(popr, true)
|
||
|
data1, err := proto.Marshal(older)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
newer := &A{}
|
||
|
if err = proto.Unmarshal(data1, newer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
data2, err := proto.Marshal(newer)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
bluer := &OldA{}
|
||
|
if err = proto.Unmarshal(data2, bluer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
if err = older.VerboseEqual(bluer); err != nil {
|
||
|
t.Fatalf("%#v !VerboseProto %#v, since %v", older, bluer, err)
|
||
|
}
|
||
|
|
||
|
data3, err := proto.Marshal(bluer)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
purple := &A{}
|
||
|
if err = proto.Unmarshal(data3, purple); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
data4, err := proto.Marshal(purple)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
magenta := &OldA{}
|
||
|
if err := proto.Unmarshal(data4, magenta); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
if err := older.VerboseEqual(magenta); err != nil {
|
||
|
t.Fatalf("%#v !VerboseProto %#v, since %v", older, magenta, err)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestOldUToU(t *testing.T) {
|
||
|
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
|
||
|
older := NewPopulatedOldU(popr, true)
|
||
|
// need optional field to be always initialized, to check it's lost in this test
|
||
|
older.Field1 = proto.String(randStringUnrecognized(popr))
|
||
|
data1, err := proto.Marshal(older)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
|
||
|
newer := &U{}
|
||
|
if err = proto.Unmarshal(data1, newer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
data2, err := proto.Marshal(newer)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
|
||
|
older2 := &OldU{}
|
||
|
if err := proto.Unmarshal(data2, older2); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
|
||
|
// check that Field1 is lost
|
||
|
if older2.Field1 != nil {
|
||
|
t.Fatalf("field must be lost, but it's not, older: %#v, older2: %#v", older, older2)
|
||
|
}
|
||
|
|
||
|
// now restore Field1 and messages should be equal now
|
||
|
older2.Field1 = older.Field1
|
||
|
if err := older.VerboseEqual(older2); err != nil {
|
||
|
t.Fatalf("%#v !VerboseProto %#v, since %v", older, older2, err)
|
||
|
}
|
||
|
}
|
||
|
|
||
|
func TestOldUnoM(t *testing.T) {
|
||
|
popr := math_rand.New(math_rand.NewSource(time.Now().UnixNano()))
|
||
|
older := NewPopulatedOldUnoM(popr, true)
|
||
|
// need optional field to be always initialized, to check it's lost in this test
|
||
|
older.Field1 = proto.String(randStringUnrecognized(popr))
|
||
|
data1, err := proto.Marshal(older)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
|
||
|
newer := &UnoM{}
|
||
|
if err = proto.Unmarshal(data1, newer); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
data2, err := proto.Marshal(newer)
|
||
|
if err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
|
||
|
older2 := &OldUnoM{}
|
||
|
if err := proto.Unmarshal(data2, older2); err != nil {
|
||
|
panic(err)
|
||
|
}
|
||
|
|
||
|
// check that Field1 is lost
|
||
|
if older2.Field1 != nil {
|
||
|
t.Fatalf("field must be lost, but it's not, older: %#v, older2: %#v", older, older2)
|
||
|
}
|
||
|
|
||
|
// now restore Field1 and messages should be equal now
|
||
|
older2.Field1 = older.Field1
|
||
|
if err := older.VerboseEqual(older2); err != nil {
|
||
|
t.Fatalf("%#v !VerboseProto %#v, since %v", older, older2, err)
|
||
|
}
|
||
|
}
|