summaryrefslogtreecommitdiffstats
path: root/hugolib/orderedMap_test.go
blob: fc3d25080f81a3e80e44321b959159c98c671580 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
// Copyright 2018 The Hugo Authors. All rights reserved.
//
// 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 hugolib

import (
	"fmt"
	"sync"
	"testing"

	"github.com/stretchr/testify/require"
)

func TestOrderedMap(t *testing.T) {
	t.Parallel()
	assert := require.New(t)

	m := newOrderedMap()
	m.Add("b", "vb")
	m.Add("c", "vc")
	m.Add("a", "va")
	b, f1 := m.Get("b")

	assert.True(f1)
	assert.Equal(b, "vb")
	assert.True(m.Contains("b"))
	assert.False(m.Contains("e"))

	assert.Equal([]interface{}{"b", "c", "a"}, m.Keys())

}

func TestOrderedMapConcurrent(t *testing.T) {
	t.Parallel()
	assert := require.New(t)

	var wg sync.WaitGroup

	m := newOrderedMap()

	for i := 1; i < 20; i++ {
		wg.Add(1)
		go func(id int) {
			defer wg.Done()
			key := fmt.Sprintf("key%d", id)
			val := key + "val"
			m.Add(key, val)
			v, found := m.Get(key)
			assert.True(found)
			assert.Equal(v, val)
			assert.True(m.Contains(key))
			assert.True(m.Len() > 0)
			assert.True(len(m.Keys()) > 0)
		}(i)

	}

	wg.Wait()
}