2016-11-19 10:03:41 +00:00
|
|
|
/*
|
2017-05-11 14:39:54 +00:00
|
|
|
*
|
|
|
|
* Copyright 2014, Google Inc.
|
2016-11-19 10:03:41 +00:00
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
* * Neither the name of Google Inc. nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2017-05-11 14:39:54 +00:00
|
|
|
package metadata
|
2016-11-19 10:03:41 +00:00
|
|
|
|
|
|
|
import (
|
2017-05-11 14:39:54 +00:00
|
|
|
"reflect"
|
|
|
|
"testing"
|
2016-11-19 10:03:41 +00:00
|
|
|
)
|
|
|
|
|
2017-05-11 14:39:54 +00:00
|
|
|
func TestPairsMD(t *testing.T) {
|
|
|
|
for _, test := range []struct {
|
|
|
|
// input
|
|
|
|
kv []string
|
|
|
|
// output
|
|
|
|
md MD
|
|
|
|
}{
|
|
|
|
{[]string{}, MD{}},
|
|
|
|
{[]string{"k1", "v1", "k1", "v2"}, MD{"k1": []string{"v1", "v2"}}},
|
|
|
|
} {
|
|
|
|
md := Pairs(test.kv...)
|
|
|
|
if !reflect.DeepEqual(md, test.md) {
|
|
|
|
t.Fatalf("Pairs(%v) = %v, want %v", test.kv, md, test.md)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestCopy(t *testing.T) {
|
|
|
|
const key, val = "key", "val"
|
|
|
|
orig := Pairs(key, val)
|
|
|
|
copy := orig.Copy()
|
|
|
|
if !reflect.DeepEqual(orig, copy) {
|
|
|
|
t.Errorf("copied value not equal to the original, got %v, want %v", copy, orig)
|
|
|
|
}
|
|
|
|
orig[key][0] = "foo"
|
|
|
|
if v := copy[key][0]; v != val {
|
|
|
|
t.Errorf("change in original should not affect copy, got %q, want %q", v, val)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func TestJoin(t *testing.T) {
|
|
|
|
for _, test := range []struct {
|
|
|
|
mds []MD
|
|
|
|
want MD
|
|
|
|
}{
|
|
|
|
{[]MD{}, MD{}},
|
|
|
|
{[]MD{Pairs("foo", "bar")}, Pairs("foo", "bar")},
|
|
|
|
{[]MD{Pairs("foo", "bar"), Pairs("foo", "baz")}, Pairs("foo", "bar", "foo", "baz")},
|
|
|
|
{[]MD{Pairs("foo", "bar"), Pairs("foo", "baz"), Pairs("zip", "zap")}, Pairs("foo", "bar", "foo", "baz", "zip", "zap")},
|
|
|
|
} {
|
|
|
|
md := Join(test.mds...)
|
|
|
|
if !reflect.DeepEqual(md, test.want) {
|
|
|
|
t.Errorf("context's metadata is %v, want %v", md, test.want)
|
|
|
|
}
|
2016-11-19 10:03:41 +00:00
|
|
|
}
|
|
|
|
}
|