1. 1
2. 2
3. 3
4. 4
5. 5
6. 6
7. 7
8. 8
9. 9
10. 10
11. 11
12. 12
13. 13
14. 14
15. 15
16. 16
17. 17
18. 18
19. 19
20. 20
21. 21
22. 22
23. 23
24. 24
25. 25
26. 26
27. 27
28. 28
29. 29
30. 30
31. 31
32. 32
33. 33
34. 34
35. 35
36. 36
37. 37
38. 38
39. 39
40. 40
41. 41
42. 42
43. 43
44. 44
45. 45
46. 46
47. 47
48. 48
49. 49
50. 50
51. 51
52. 52
53. 53
54. 54
55. 55
56. 56
57. 57
58. 58
59. 59
60. 60
61. 61
62. 62
63. 63
64. 64
65. 65
66. 66
67. 67
68. 68
69. 69

// Copyright 2015 go-swagger maintainers
//
// 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.

// +build !go1.9

package swag

import (
	"sort"
	"sync"
)

// indexOfInitialisms is a thread-safe implementation of the sorted index of initialisms.
// Before go1.9, this may be implemented with a mutex on the map.
type indexOfInitialisms struct {
	getMutex *sync.Mutex
	index    map[string]bool
}

func newIndexOfInitialisms() *indexOfInitialisms {
	return &indexOfInitialisms{
		getMutex: new(sync.Mutex),
		index:    make(map[string]bool, 50),
	}
}

func (m *indexOfInitialisms) load(initial map[string]bool) *indexOfInitialisms {
	m.getMutex.Lock()
	defer m.getMutex.Unlock()
	for k, v := range initial {
		m.index[k] = v
	}
	return m
}

func (m *indexOfInitialisms) isInitialism(key string) bool {
	m.getMutex.Lock()
	defer m.getMutex.Unlock()
	_, ok := m.index[key]
	return ok
}

func (m *indexOfInitialisms) add(key string) *indexOfInitialisms {
	m.getMutex.Lock()
	defer m.getMutex.Unlock()
	m.index[key] = true
	return m
}

func (m *indexOfInitialisms) sorted() (result []string) {
	m.getMutex.Lock()
	defer m.getMutex.Unlock()
	for k := range m.index {
		result = append(result, k)
	}
	sort.Sort(sort.Reverse(byInitialism(result)))
	return
}