-
Notifications
You must be signed in to change notification settings - Fork 4
/
orderedmap.go
144 lines (117 loc) · 3.42 KB
/
orderedmap.go
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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
// Copyright 2018, Goomba project Authors. All rights reserved.
//
// Licensed to the Apache Software Foundation (ASF) under one or more
// contributor license agreements. See the NOTICE file distributed with this
// work for additional information regarding copyright ownership. The ASF
// licenses this file to you 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 orderedmap
import (
"fmt"
"sync"
)
// OrderedMap represents an associative array or map abstract data type.
type OrderedMap struct {
// mu Mutex protects data structures below.
mu sync.Mutex
// keys is the Set list of keys.
keys []interface{}
// store is the Set underlying store of values.
store map[interface{}]interface{}
}
// NewOrderedMap creates a new empty OrderedMap.
func NewOrderedMap() *OrderedMap {
m := &OrderedMap{
keys: make([]interface{}, 0),
store: make(map[interface{}]interface{}),
}
return m
}
// Put adds items to the map.
//
// If a key is found in the map it replaces it value.
func (m *OrderedMap) Put(key interface{}, value interface{}) {
m.mu.Lock()
defer m.mu.Unlock()
if _, ok := m.store[key]; !ok {
m.keys = append(m.keys, key)
}
m.store[key] = value
}
// Get returns the value of a key from the OrderedMap.
func (m *OrderedMap) Get(key interface{}) (value interface{}, found bool) {
m.mu.Lock()
defer m.mu.Unlock()
value, found = m.store[key]
return value, found
}
// Remove deletes a key-value pair from the OrderedMap.
//
// If a key is not found in the map it doesn't fails, just does nothing.
func (m *OrderedMap) Remove(key interface{}) {
m.mu.Lock()
defer m.mu.Unlock()
// Check key exists
if _, found := m.store[key]; !found {
return
}
// Remove the value from the store
delete(m.store, key)
// Remove the key
for i := range m.keys {
if m.keys[i] == key {
m.keys = append(m.keys[:i], m.keys[i+1:]...)
break
}
}
}
// Size return the map number of key-value pairs.
func (m *OrderedMap) Size() int {
m.mu.Lock()
defer m.mu.Unlock()
return len(m.store)
}
// Empty return if the map in empty or not.
func (m *OrderedMap) Empty() bool {
m.mu.Lock()
defer m.mu.Unlock()
return len(m.store) == 0
}
// Keys return the keys in the map in insertion order.
func (m *OrderedMap) Keys() []interface{} {
m.mu.Lock()
defer m.mu.Unlock()
return m.keys
}
// Values return the values in the map in insertion order.
func (m *OrderedMap) Values() []interface{} {
m.mu.Lock()
defer m.mu.Unlock()
values := make([]interface{}, len(m.store))
for i, key := range m.keys {
values[i] = m.store[key]
}
return values
}
// String implements Stringer interface.
//
// Prints the map string representation, a concatenated string of all its
// string representation values in insertion order.
func (m *OrderedMap) String() string {
m.mu.Lock()
defer m.mu.Unlock()
var result []string
for i, key := range m.keys {
result = append(result, fmt.Sprintf("%d:%s", m.keys[i].(int), m.store[key]))
}
return fmt.Sprintf("%s", result)
}