-
Notifications
You must be signed in to change notification settings - Fork 1
/
safe.slice.go
189 lines (155 loc) · 4.57 KB
/
safe.slice.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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
// this object referred from dnaeon/gru/utils/slice.go
//
// Copyright (c) 2015-2017 Marin Atanasov Nikolov <dnaeon@gmail.com>
// All rights reserved.
//
// 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
// in this position and unchanged.
// 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.
//
// THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) ``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 AUTHOR(S) 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 elio
import "sync"
// DefaultCapacity default capacity
const DefaultCapacity int = 5000
// SafeSlice safe slice
type SafeSlice struct {
sync.RWMutex
items []interface{}
capacity int
}
// SafeSliceItem contains the index/value pair of an item in a
// concurrent slice
type SafeSliceItem struct {
Index int
Value interface{}
}
// NewSafeSlice creates a new safe slice
func NewSafeSlice(c int) *SafeSlice {
s := &SafeSlice{
items: make([]interface{}, 0, c),
capacity: c,
}
return s
}
// Count count
func (s *SafeSlice) Count() int {
s.Lock()
defer s.Unlock()
return len(s.items)
}
// Prepend prepend an item to the concurrent slice
func (s *SafeSlice) Prepend(item interface{}) {
s.Lock()
defer s.Unlock()
s.items = append([]interface{}{item}, s.items...)
}
// Append adds an item to the concurrent slice
func (s *SafeSlice) Append(item interface{}) {
s.Lock()
defer s.Unlock()
s.items = append(s.items, item)
}
// AppendAll adds an items to the concurrent slice
func (s *SafeSlice) AppendAll(items ...interface{}) {
s.Lock()
defer s.Unlock()
s.items = append(s.items, items...)
}
// Paste paste an items to the concurrent slice
func (s *SafeSlice) Paste(items []interface{}) {
s.Lock()
defer s.Unlock()
s.items = append(s.items, items...)
}
// AppendSlice adds an items to the concurrent slice
func (s *SafeSlice) AppendSlice(ss *SafeSlice) {
s.AppendAll(ss.items...)
}
// OnFilter on filter
type OnFilter func(x interface{}) bool
// FilterOut filter an items out from the concurrent slice
func (s *SafeSlice) FilterOut(f OnFilter) []interface{} {
s.Lock()
defer s.Unlock()
results := s.items[:0]
var filtered []interface{}
for _, d := range s.items {
if false == f(d) {
results = append(results, d)
} else {
filtered = append(filtered, d)
}
}
s.items = results
return filtered
}
// Fetch fetch slice and renew
func (s *SafeSlice) Fetch() []interface{} {
s.Lock()
defer s.Unlock()
old := s.items
s.items = make([]interface{}, 0, s.capacity)
return old
}
// FetchWithLimit fetch slice with limit
func (s *SafeSlice) FetchWithLimit(limit int) []interface{} {
s.Lock()
defer s.Unlock()
var fetch []interface{}
if limit < len(s.items) {
// var prev []interface{}
// fetch = make([]interface{}, 0, limit)
// prev, s.items = s.items[:limit], s.items[limit:]
// fetch = append(fetch, prev...)
fetch, s.items = s.items[:limit], s.items[limit:]
} else {
fetch = s.items
s.items = make([]interface{}, 0, s.capacity)
}
return fetch
}
// Shift shift slice and renew
func (s *SafeSlice) Shift() (front interface{}, count int) {
s.Lock()
defer s.Unlock()
count = len(s.items)
if 0 < count {
var front interface{}
front, s.items = s.items[0], s.items[1:]
return front, (count - 1)
}
return nil, 0
}
// Iterate iterates over the items in the concurrent slice
// Each item is sent over a channel, so that
// we can iterate over the slice using the builin range keyword
func (s *SafeSlice) Iterate() <-chan SafeSliceItem {
c := make(chan SafeSliceItem)
f := func() {
s.Lock()
defer s.Unlock()
for index, value := range s.items {
c <- SafeSliceItem{index, value}
}
close(c)
}
go f()
return c
}