-
Notifications
You must be signed in to change notification settings - Fork 8
Expand file tree
/
Copy patharray_int.go
More file actions
122 lines (88 loc) · 1.79 KB
/
array_int.go
File metadata and controls
122 lines (88 loc) · 1.79 KB
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
// Copyright 2013-2016 lessgo Author, 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 types
import (
"sync"
)
var (
ar_int_mu sync.Mutex
)
type ArrayInt []int
func (ar *ArrayInt) Has(ui int) bool {
for _, v := range *ar {
if v == ui {
return true
}
}
return false
}
func (ar *ArrayInt) Set(ui int) bool {
ar_int_mu.Lock()
defer ar_int_mu.Unlock()
for _, v := range *ar {
if v == ui {
return false
}
}
*ar = append(*ar, ui)
return true
}
func (ar *ArrayInt) Del(ui int) {
ar_int_mu.Lock()
defer ar_int_mu.Unlock()
for i, v := range *ar {
if v == ui {
*ar = append((*ar)[:i], (*ar)[i+1:]...)
return
}
}
}
func (ar *ArrayInt) Equal(ar2 ArrayInt) bool {
if len(*ar) != len(ar2) {
return false
}
for _, v := range *ar {
hit := false
for _, v2 := range ar2 {
if v == v2 {
hit = true
break
}
}
if !hit {
return false
}
}
return true
}
func (ar *ArrayInt) MatchAny(ar2 ArrayInt) bool {
for _, v2 := range ar2 {
for _, v := range *ar {
if v == v2 {
return true
}
}
}
return false
}
// sort.Interface
func (ar ArrayInt) Len() int {
return len(ar)
}
func (ar ArrayInt) Less(i, j int) bool {
return ar[i] < ar[j]
}
func (ar ArrayInt) Swap(i, j int) {
ar[i], ar[j] = ar[j], ar[i]
}