| // Copyright 2022 The Dawn & Tint Authors | |
| // | |
| // Redistribution and use in source and binary forms, with or without | |
| // modification, are permitted provided that the following conditions are met: | |
| // | |
| // 1. Redistributions of source code must retain the above copyright notice, this | |
| // list of conditions and the following disclaimer. | |
| // | |
| // 2. 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. | |
| // | |
| // 3. Neither the name of the copyright holder 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 HOLDER 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 container_test | |
| import ( | |
| "sync" | |
| "testing" | |
| "dawn.googlesource.com/dawn/tools/src/container" | |
| ) | |
| func TestNewMap(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| expectEq(t, "len(m)", len(m), 0) | |
| } | |
| func TestMapAdd(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| m.Add("c", 3) | |
| expectEq(t, "len(m)", len(m), 1) | |
| expectEq(t, `m["a"]`, m["a"], 0) | |
| expectEq(t, `m["b"]`, m["b"], 0) | |
| expectEq(t, `m["c"]`, m["c"], 3) | |
| m.Add("a", 1) | |
| expectEq(t, "len(m)", len(m), 2) | |
| expectEq(t, `m["a"]`, m["a"], 1) | |
| expectEq(t, `m["b"]`, m["b"], 0) | |
| expectEq(t, `m["c"]`, m["c"], 3) | |
| m.Add("b", 2) | |
| expectEq(t, "len(m)", len(m), 3) | |
| expectEq(t, `m["a"]`, m["a"], 1) | |
| expectEq(t, `m["b"]`, m["b"], 2) | |
| expectEq(t, `m["c"]`, m["c"], 3) | |
| } | |
| func TestMapRemove(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| m.Add("a", 1) | |
| m.Add("b", 2) | |
| m.Add("c", 3) | |
| m.Remove("c") | |
| expectEq(t, "len(m)", len(m), 2) | |
| expectEq(t, `m["a"]`, m["a"], 1) | |
| expectEq(t, `m["b"]`, m["b"], 2) | |
| expectEq(t, `m["c"]`, m["c"], 0) | |
| m.Remove("a") | |
| expectEq(t, "len(m)", len(m), 1) | |
| expectEq(t, `m["a"]`, m["a"], 0) | |
| expectEq(t, `m["b"]`, m["b"], 2) | |
| expectEq(t, `m["c"]`, m["c"], 0) | |
| m.Remove("b") | |
| expectEq(t, "len(m)", len(m), 0) | |
| expectEq(t, `m["a"]`, m["a"], 0) | |
| expectEq(t, `m["b"]`, m["b"], 0) | |
| expectEq(t, `m["c"]`, m["c"], 0) | |
| } | |
| func TestMapContains(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| m.Add("c", 3) | |
| expectEq(t, `m.Contains("a")`, m.Contains("a"), false) | |
| expectEq(t, `m.Contains("b")`, m.Contains("b"), false) | |
| expectEq(t, `m.Contains("c")`, m.Contains("c"), true) | |
| m.Add("a", 1) | |
| expectEq(t, `m.Contains("a")`, m.Contains("a"), true) | |
| expectEq(t, `m.Contains("b")`, m.Contains("b"), false) | |
| expectEq(t, `m.Contains("c")`, m.Contains("c"), true) | |
| m.Add("b", 2) | |
| expectEq(t, `m.Contains("a")`, m.Contains("a"), true) | |
| expectEq(t, `m.Contains("b")`, m.Contains("b"), true) | |
| expectEq(t, `m.Contains("c")`, m.Contains("c"), true) | |
| } | |
| func TestMapKeys(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| m.Add("c", 3) | |
| expectEq(t, `m.Keys()`, m.Keys(), []string{"c"}) | |
| m.Add("a", 1) | |
| expectEq(t, `m.Keys()`, m.Keys(), []string{"a", "c"}) | |
| m.Add("b", 2) | |
| expectEq(t, `m.Keys()`, m.Keys(), []string{"a", "b", "c"}) | |
| } | |
| func TestMapValues(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| m.Add("c", 1) | |
| expectEq(t, `m.Values()`, m.Values(), []int{1}) | |
| m.Add("a", 2) | |
| expectEq(t, `m.Values()`, m.Values(), []int{2, 1}) | |
| m.Add("b", 3) | |
| expectEq(t, `m.Values()`, m.Values(), []int{2, 3, 1}) | |
| } | |
| func TestMapGetOrCreate(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| A := m.GetOrCreate("1", func() int { return 1 }) | |
| expectEq(t, "A", A, 1) | |
| B := m.GetOrCreate("2", func() int { return 2 }) | |
| expectEq(t, "B", B, 2) | |
| C := m.GetOrCreate("1", func() int { t.Error("should not be called"); return 0 }) | |
| expectEq(t, "C", C, 1) | |
| D := m.GetOrCreate("2", func() int { t.Error("should not be called"); return 0 }) | |
| expectEq(t, "D", D, 2) | |
| } | |
| func TestMapGetOrCreateLocked(t *testing.T) { | |
| m := container.NewMap[string, int]() | |
| mtx := &sync.RWMutex{} | |
| wg := sync.WaitGroup{} | |
| wg.Add(100) | |
| for i := 0; i < 100; i++ { | |
| go func() { | |
| defer wg.Done() | |
| A := m.GetOrCreateLocked(mtx, "1", func() int { return 1 }) | |
| expectEq(t, "A", A, 1) | |
| B := m.GetOrCreateLocked(mtx, "2", func() int { return 2 }) | |
| expectEq(t, "B", B, 2) | |
| C := m.GetOrCreateLocked(mtx, "1", func() int { t.Error("should not be called"); return 0 }) | |
| expectEq(t, "C", C, 1) | |
| D := m.GetOrCreateLocked(mtx, "2", func() int { t.Error("should not be called"); return 0 }) | |
| expectEq(t, "D", D, 2) | |
| }() | |
| } | |
| wg.Wait() | |
| } |