| // Copyright 2018 The gVisor Authors. |
| // |
| // 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. |
| |
| // Package buffer_test contains tests for the VectorisedView type. |
| package buffer |
| |
| import ( |
| "reflect" |
| "testing" |
| ) |
| |
| // copy returns a deep-copy of the vectorised view. |
| func (vv VectorisedView) copy() VectorisedView { |
| uu := VectorisedView{ |
| views: make([]View, 0, len(vv.views)), |
| size: vv.size, |
| } |
| for _, v := range vv.views { |
| uu.views = append(uu.views, append(View(nil), v...)) |
| } |
| return uu |
| } |
| |
| // vv is an helper to build VectorisedView from different strings. |
| func vv(size int, pieces ...string) VectorisedView { |
| views := make([]View, len(pieces)) |
| for i, p := range pieces { |
| views[i] = []byte(p) |
| } |
| |
| return NewVectorisedView(size, views) |
| } |
| |
| var capLengthTestCases = []struct { |
| comment string |
| in VectorisedView |
| length int |
| want VectorisedView |
| }{ |
| { |
| comment: "Simple case", |
| in: vv(2, "12"), |
| length: 1, |
| want: vv(1, "1"), |
| }, |
| { |
| comment: "Case spanning across two Views", |
| in: vv(4, "123", "4"), |
| length: 2, |
| want: vv(2, "12"), |
| }, |
| { |
| comment: "Corner case with negative length", |
| in: vv(1, "1"), |
| length: -1, |
| want: vv(0), |
| }, |
| { |
| comment: "Corner case with length = 0", |
| in: vv(3, "12", "3"), |
| length: 0, |
| want: vv(0), |
| }, |
| { |
| comment: "Corner case with length = size", |
| in: vv(1, "1"), |
| length: 1, |
| want: vv(1, "1"), |
| }, |
| { |
| comment: "Corner case with length > size", |
| in: vv(1, "1"), |
| length: 2, |
| want: vv(1, "1"), |
| }, |
| } |
| |
| func TestCapLength(t *testing.T) { |
| for _, c := range capLengthTestCases { |
| orig := c.in.copy() |
| c.in.CapLength(c.length) |
| if !reflect.DeepEqual(c.in, c.want) { |
| t.Errorf("Test \"%s\" failed when calling CapLength(%d) on %v. Got %v. Want %v", |
| c.comment, c.length, orig, c.in, c.want) |
| } |
| } |
| } |
| |
| var trimFrontTestCases = []struct { |
| comment string |
| in VectorisedView |
| count int |
| want VectorisedView |
| }{ |
| { |
| comment: "Simple case", |
| in: vv(2, "12"), |
| count: 1, |
| want: vv(1, "2"), |
| }, |
| { |
| comment: "Case where we trim an entire View", |
| in: vv(2, "1", "2"), |
| count: 1, |
| want: vv(1, "2"), |
| }, |
| { |
| comment: "Case spanning across two Views", |
| in: vv(3, "1", "23"), |
| count: 2, |
| want: vv(1, "3"), |
| }, |
| { |
| comment: "Corner case with negative count", |
| in: vv(1, "1"), |
| count: -1, |
| want: vv(1, "1"), |
| }, |
| { |
| comment: " Corner case with count = 0", |
| in: vv(1, "1"), |
| count: 0, |
| want: vv(1, "1"), |
| }, |
| { |
| comment: "Corner case with count = size", |
| in: vv(1, "1"), |
| count: 1, |
| want: vv(0), |
| }, |
| { |
| comment: "Corner case with count > size", |
| in: vv(1, "1"), |
| count: 2, |
| want: vv(0), |
| }, |
| } |
| |
| func TestTrimFront(t *testing.T) { |
| for _, c := range trimFrontTestCases { |
| orig := c.in.copy() |
| c.in.TrimFront(c.count) |
| if !reflect.DeepEqual(c.in, c.want) { |
| t.Errorf("Test \"%s\" failed when calling TrimFront(%d) on %v. Got %v. Want %v", |
| c.comment, c.count, orig, c.in, c.want) |
| } |
| } |
| } |
| |
| var toViewCases = []struct { |
| comment string |
| in VectorisedView |
| want View |
| }{ |
| { |
| comment: "Simple case", |
| in: vv(2, "12"), |
| want: []byte("12"), |
| }, |
| { |
| comment: "Case with multiple views", |
| in: vv(2, "1", "2"), |
| want: []byte("12"), |
| }, |
| { |
| comment: "Empty case", |
| in: vv(0), |
| want: []byte(""), |
| }, |
| } |
| |
| func TestToView(t *testing.T) { |
| for _, c := range toViewCases { |
| got := c.in.ToView() |
| if !reflect.DeepEqual(got, c.want) { |
| t.Errorf("Test \"%s\" failed when calling ToView() on %v. Got %v. Want %v", |
| c.comment, c.in, got, c.want) |
| } |
| } |
| } |
| |
| var toCloneCases = []struct { |
| comment string |
| inView VectorisedView |
| inBuffer []View |
| }{ |
| { |
| comment: "Simple case", |
| inView: vv(1, "1"), |
| inBuffer: make([]View, 1), |
| }, |
| { |
| comment: "Case with multiple views", |
| inView: vv(2, "1", "2"), |
| inBuffer: make([]View, 2), |
| }, |
| { |
| comment: "Case with buffer too small", |
| inView: vv(2, "1", "2"), |
| inBuffer: make([]View, 1), |
| }, |
| { |
| comment: "Case with buffer larger than needed", |
| inView: vv(1, "1"), |
| inBuffer: make([]View, 2), |
| }, |
| { |
| comment: "Case with nil buffer", |
| inView: vv(1, "1"), |
| inBuffer: nil, |
| }, |
| } |
| |
| func TestToClone(t *testing.T) { |
| for _, c := range toCloneCases { |
| t.Run(c.comment, func(t *testing.T) { |
| got := c.inView.Clone(c.inBuffer) |
| if !reflect.DeepEqual(got, c.inView) { |
| t.Fatalf("got (%+v).Clone(%+v) = %+v, want = %+v", |
| c.inView, c.inBuffer, got, c.inView) |
| } |
| }) |
| } |
| } |