-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathctype.go
More file actions
118 lines (103 loc) · 2.21 KB
/
ctype.go
File metadata and controls
118 lines (103 loc) · 2.21 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
// Copyright (c) 2022-2023 The Go-Curses Authors
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use 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 cdk
import (
"fmt"
"github.com/go-curses/cdk/lib/sync"
)
const (
TypeNil CTypeTag = ""
)
type Type interface {
New() interface{}
Buildable() (hasConstructor bool)
Items() []interface{}
Add(item interface{})
Remove(item TypeItem) error
Aliases() []string
Lock()
Unlock()
RLock()
RUnlock()
}
type CType struct {
tag TypeTag
items []interface{}
new func() interface{}
alias []string
sync.RWMutex
}
func NewType(tag TypeTag, constructor func() interface{}, aliases ...string) Type {
return &CType{
tag: tag,
items: make([]interface{}, 0),
new: constructor,
alias: aliases,
}
}
func (t *CType) New() interface{} {
if t.new != nil {
return t.new()
}
return nil
}
func (t *CType) Aliases() (aliases []string) {
t.RLock()
defer t.RUnlock()
for _, alias := range t.alias {
aliases = append(aliases, alias)
}
return
}
func (t *CType) Buildable() (hasConstructor bool) {
t.RLock()
defer t.RUnlock()
return t.new != nil
}
func (t *CType) Items() []interface{} {
t.RLock()
defer t.RUnlock()
return t.items
}
func (t *CType) Add(item interface{}) {
t.Lock()
defer t.Unlock()
t.items = append(t.items, item)
return
}
func (t *CType) Remove(item TypeItem) error {
t.Lock()
defer t.Unlock()
var idx int
var itm interface{}
for idx, itm = range t.items {
if tt, ok := itm.(TypeItem); ok {
if tt.ObjectID() == item.ObjectID() {
break
}
}
}
count := len(t.items)
if count > 0 && idx >= count {
return fmt.Errorf("item not found")
} else if count > 1 {
t.items = append(
t.items[:idx],
t.items[idx+1:]...,
)
} else {
t.items = []interface{}{}
}
return nil
}