forked from limetext/backend
-
Notifications
You must be signed in to change notification settings - Fork 0
/
keybinding.go
187 lines (164 loc) · 4.55 KB
/
keybinding.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
// Copyright 2013 The lime Authors.
// Use of this source code is governed by a 2-clause
// BSD-style license that can be found in the LICENSE file.
package keys
import (
"bytes"
"encoding/json"
"fmt"
. "github.com/limetext/lime-backend/lib/util"
"sort"
)
type (
// A single KeyBinding for which after pressing the given
// sequence of Keys, and the Context matches,
// the Command will be invoked with the provided Args.
KeyBinding struct {
Keys []KeyPress
Command string
Args map[string]interface{}
Context []KeyContext
priority int
}
// An utility struct that(same as HasSettings ) is typically embedded in
// other type structs to make that type implement the KeyBindingsInterface
HasKeyBindings struct {
keybindings KeyBindings
}
// Defines an interface for types that have keybindings
KeyBindingsInterface interface {
KeyBindings() *KeyBindings
}
KeyBindings struct {
Bindings []*KeyBinding
seqIndex int // The index we are in a multiple key sequence keybinding
parent KeyBindingsInterface
}
)
func (k *HasKeyBindings) KeyBindings() *KeyBindings {
return &k.keybindings
}
// Returns the number of KeyBindings.
func (k *KeyBindings) Len() int {
return len(k.Bindings)
}
// Compares one KeyBinding to another for sorting purposes.
func (k *KeyBindings) Less(i, j int) bool {
return k.Bindings[i].Keys[k.seqIndex].Index() < k.Bindings[j].Keys[k.seqIndex].Index()
}
// Swaps the two KeyBindings at the given positions.
func (k *KeyBindings) Swap(i, j int) {
k.Bindings[i], k.Bindings[j] = k.Bindings[j], k.Bindings[i]
}
// Drops all KeyBindings that are a sequence of key presses less or equal
// to the given number.
func (k *KeyBindings) DropLessEqualKeys(count int) {
for {
for i := 0; i < len(k.Bindings); {
if len(k.Bindings[i].Keys) <= count {
k.Bindings[i] = k.Bindings[len(k.Bindings)-1]
k.Bindings = k.Bindings[:len(k.Bindings)-1]
} else {
i++
}
}
sort.Sort(k)
if k.parent == nil {
break
}
k = k.parent.KeyBindings()
}
}
func (k *KeyBindings) UnmarshalJSON(d []byte) error {
if err := json.Unmarshal(d, &k.Bindings); err != nil {
return err
}
for i := range k.Bindings {
k.Bindings[i].priority = i
}
k.DropLessEqualKeys(0)
return nil
}
func (k *KeyBindings) SetParent(p KeyBindingsInterface) {
k.parent = p
// All parents and childs seqIndex must be equal
p.KeyBindings().seqIndex = k.seqIndex
}
func (k *KeyBindings) Parent() KeyBindingsInterface {
return k.parent
}
func (k *KeyBindings) filter(ki int, ret *KeyBindings) {
for {
idx := sort.Search(k.Len(), func(i int) bool {
return k.Bindings[i].Keys[k.seqIndex].Index() >= ki
})
for i := idx; i < len(k.Bindings) && k.Bindings[i].Keys[k.seqIndex].Index() == ki; i++ {
ret.Bindings = append(ret.Bindings, k.Bindings[i])
}
if k.parent == nil {
break
}
k = k.parent.KeyBindings()
if ret.parent == nil {
ret.SetParent(new(HasKeyBindings))
}
ret = ret.parent.KeyBindings()
}
}
// Filters the KeyBindings, returning a new KeyBindings object containing
// a subset of matches for the given key press.
func (k *KeyBindings) Filter(kp KeyPress) (ret KeyBindings) {
p := Prof.Enter("key.filter")
defer p.Exit()
kp.fix()
k.DropLessEqualKeys(k.seqIndex)
ret.seqIndex = k.seqIndex + 1
ki := kp.Index()
k.filter(ki, &ret)
if kp.IsCharacter() {
k.filter(int(Any), &ret)
}
return
}
// Tries to resolve all the current KeyBindings in k to a single
// action. If any action is appropriate as determined by context,
// the return value will be the specific KeyBinding that is possible
// to execute now, otherwise it is nil.
func (k *KeyBindings) Action(qc func(key string, operator Op, operand interface{}, match_all bool) bool) (kb *KeyBinding) {
p := Prof.Enter("key.action")
defer p.Exit()
for {
for i := range k.Bindings {
if len(k.Bindings[i].Keys) > k.seqIndex {
// This key binding is of a key sequence longer than what is currently
// probed for. For example, the binding is for the sequence ['a','b','c'], but
// the user has only pressed ['a','b'] so far.
continue
}
for _, c := range k.Bindings[i].Context {
if !qc(c.Key, c.Operator, c.Operand, c.MatchAll) {
goto skip
}
}
if kb == nil || kb.priority < k.Bindings[i].priority {
kb = k.Bindings[i]
}
skip:
}
if kb != nil || k.parent == nil {
break
}
k = k.parent.KeyBindings()
}
return
}
func (k *KeyBindings) SeqIndex() int {
return k.seqIndex
}
func (k KeyBindings) String() string {
var buf bytes.Buffer
for _, b := range k.Bindings {
buf.WriteString(fmt.Sprintf("%+v\n", b))
}
return buf.String()
}