93 lines
2.5 KiB
Go
93 lines
2.5 KiB
Go
/*
|
|
Copyright © Brian Buller <brian@bullercodeworks.com>
|
|
|
|
Permission is hereby granted, free of charge, to any person obtaining a copy
|
|
of this software and associated documentation files (the "Software"), to deal
|
|
in the Software without restriction, including without limitation the rights
|
|
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
|
copies of the Software, and to permit persons to whom the Software is
|
|
furnished to do so, subject to the following conditions:
|
|
|
|
The above copyright notice and this permission notice shall be included in
|
|
all copies or substantial portions of the Software.
|
|
|
|
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
|
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
|
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
|
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
|
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
|
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
|
THE SOFTWARE.
|
|
*/
|
|
package widgets
|
|
|
|
import "github.com/gdamore/tcell"
|
|
|
|
type KeyMap struct {
|
|
Keys map[tcell.Key]func(*tcell.EventKey) bool
|
|
Runes map[rune]func(*tcell.EventKey) bool
|
|
}
|
|
|
|
func BlankKeyMap() KeyMap {
|
|
return KeyMap{
|
|
Keys: make(map[tcell.Key]func(*tcell.EventKey) bool),
|
|
Runes: make(map[rune]func(*tcell.EventKey) bool),
|
|
}
|
|
}
|
|
|
|
func NewKeyMap(m map[tcell.Key]func(*tcell.EventKey) bool) KeyMap {
|
|
return KeyMap{
|
|
Keys: m,
|
|
Runes: make(map[rune]func(*tcell.EventKey) bool),
|
|
}
|
|
}
|
|
|
|
func NewRuneMap(m map[rune]func(*tcell.EventKey) bool) KeyMap {
|
|
return KeyMap{
|
|
Keys: make(map[tcell.Key]func(*tcell.EventKey) bool),
|
|
Runes: m,
|
|
}
|
|
}
|
|
|
|
func (m KeyMap) Add(k tcell.Key, do func(*tcell.EventKey) bool) { m.Keys[k] = do }
|
|
func (m KeyMap) Remove(k tcell.Key) {
|
|
if _, ok := m.Keys[k]; ok {
|
|
delete(m.Keys, k)
|
|
}
|
|
}
|
|
|
|
func (m KeyMap) AddAll(all map[tcell.Key]func(*tcell.EventKey) bool) {
|
|
for k, v := range all {
|
|
m.Add(k, v)
|
|
}
|
|
}
|
|
func (m KeyMap) AddRune(k rune, do func(*tcell.EventKey) bool) { m.Runes[k] = do }
|
|
func (m KeyMap) RemoveRune(k rune) {
|
|
if _, ok := m.Runes[k]; ok {
|
|
delete(m.Runes, k)
|
|
}
|
|
}
|
|
|
|
func (m KeyMap) AddRunes(all map[rune]func(*tcell.EventKey) bool) {
|
|
for k, v := range all {
|
|
m.AddRune(k, v)
|
|
}
|
|
}
|
|
|
|
func (m KeyMap) Handle(ev *tcell.EventKey) bool {
|
|
if ev.Key() == tcell.KeyRune {
|
|
for k, v := range m.Runes {
|
|
if ev.Rune() == k {
|
|
return v(ev)
|
|
}
|
|
}
|
|
} else {
|
|
for k, v := range m.Keys {
|
|
if ev.Key() == k {
|
|
return v(ev)
|
|
}
|
|
}
|
|
}
|
|
return false
|
|
}
|