chnage vriable name

master
skanehira 5 years ago
parent d5a9b6c749
commit 6e97b2dd7e

@ -12,8 +12,8 @@ import (
) )
const ( const (
moveToNext int = iota + 1 moveNext int = iota + 1
moveToPre movePre
) )
type Tree struct { type Tree struct {
@ -166,9 +166,9 @@ func (t *Tree) SetKeybindings(g *Gui) {
switch event.Key() { switch event.Key() {
case tcell.KeyCtrlJ: case tcell.KeyCtrlJ:
t.moveParent(moveToNext) t.moveNode(moveNext)
case tcell.KeyCtrlK: case tcell.KeyCtrlK:
t.moveParent(moveToPre) t.moveNode(movePre)
} }
return event return event
@ -189,19 +189,19 @@ func (t *Tree) CollapseValues(node *tview.TreeNode) {
}) })
} }
func (t *Tree) moveParent(movement int) { func (t *Tree) moveNode(movement int) {
current := t.GetCurrentNode() current := t.GetCurrentNode()
t.GetRoot().Walk(func(node, parent *tview.TreeNode) bool { t.GetRoot().Walk(func(node, parent *tview.TreeNode) bool {
if parent != nil { if parent != nil {
children := parent.GetChildren() children := parent.GetChildren()
for i, n := range children { for i, n := range children {
if n.GetReference().(Reference).ID == current.GetReference().(Reference).ID { if n.GetReference().(Reference).ID == current.GetReference().(Reference).ID {
if movement == moveToNext { if movement == moveNext {
if i < len(children)-1 { if i < len(children)-1 {
t.SetCurrentNode(children[i+1]) t.SetCurrentNode(children[i+1])
return false return false
} }
} else if movement == moveToPre { } else if movement == movePre {
if i > 0 { if i > 0 {
t.SetCurrentNode(children[i-1]) t.SetCurrentNode(children[i-1])
return false return false

Loading…
Cancel
Save