copy(l.parent.children[splitIndex+1:], l.parent.children[splitIndex:])
l.parent.children[splitIndex] = NewLeafNode(newView, l.parent)
- tab.views = append(tab.views, nil)
- copy(tab.views[splitIndex+1:], tab.views[splitIndex:])
- tab.views[splitIndex] = newView
+ tab.Views = append(tab.Views, nil)
+ copy(tab.Views[splitIndex+1:], tab.Views[splitIndex:])
+ tab.Views[splitIndex] = newView
tab.CurView = splitIndex
} else {
l.parent.children[search(l.parent.children, l)] = s
l.parent = s
- tab.views = append(tab.views, nil)
- copy(tab.views[splitIndex+1:], tab.views[splitIndex:])
- tab.views[splitIndex] = newView
+ tab.Views = append(tab.Views, nil)
+ copy(tab.Views[splitIndex+1:], tab.Views[splitIndex:])
+ tab.Views[splitIndex] = newView
tab.CurView = splitIndex
}
copy(l.parent.children[splitIndex+1:], l.parent.children[splitIndex:])
l.parent.children[splitIndex] = NewLeafNode(newView, l.parent)
- tab.views = append(tab.views, nil)
- copy(tab.views[splitIndex+1:], tab.views[splitIndex:])
- tab.views[splitIndex] = newView
+ tab.Views = append(tab.Views, nil)
+ copy(tab.Views[splitIndex+1:], tab.Views[splitIndex:])
+ tab.Views[splitIndex] = newView
tab.CurView = splitIndex
} else {
s.parent = l.parent
newView := NewView(buf)
newView.TabNum = l.parent.tabNum
- newView.Num = len(tab.views)
+ newView.Num = len(tab.Views)
if splitIndex == 1 {
s.children = []Node{l, NewLeafNode(newView, s)}
} else {
l.parent.children[search(l.parent.children, l)] = s
l.parent = s
- tab.views = append(tab.views, nil)
- copy(tab.views[splitIndex+1:], tab.views[splitIndex:])
- tab.views[splitIndex] = newView
+ tab.Views = append(tab.Views, nil)
+ copy(tab.Views[splitIndex+1:], tab.Views[splitIndex:])
+ tab.Views[splitIndex] = newView
tab.CurView = splitIndex
}
l.parent.children = l.parent.children[:len(l.parent.children)-1]
tab := tabs[l.parent.tabNum]
- j := findView(tab.views, l.view)
- copy(tab.views[j:], tab.views[j+1:])
- tab.views[len(tab.views)-1] = nil // or the zero value of T
- tab.views = tab.views[:len(tab.views)-1]
+ j := findView(tab.Views, l.view)
+ copy(tab.Views[j:], tab.Views[j+1:])
+ tab.Views[len(tab.Views)-1] = nil // or the zero value of T
+ tab.Views = tab.Views[:len(tab.Views)-1]
- for i, v := range tab.views {
+ for i, v := range tab.Views {
v.Num = i
}
if tab.CurView > 0 {
}
n.view.ToggleTabbar()
- n.view.matches = Match(n.view)
} else if n, ok := node.(*SplitTree); ok {
if s.kind == VerticalSplit {
if !n.lockWidth {