(rel, myidx int, typ *types.Type, n int)
| 153 | } |
| 154 | |
| 155 | func (tr *Tree) addTreeNodes(rel, myidx int, typ *types.Type, n int) { |
| 156 | var stv *Tree |
| 157 | for i := 0; i < n; i++ { |
| 158 | nn := tree.NewOfType(typ) |
| 159 | tr.InsertChild(nn, myidx+i) |
| 160 | nn.AsTree().SetName(fmt.Sprintf("new-%v-%v", typ.IDName, myidx+rel+i)) |
| 161 | ntv := AsTree(nn) |
| 162 | ntv.Update() |
| 163 | if i == n-1 { |
| 164 | stv = ntv |
| 165 | } |
| 166 | } |
| 167 | tr.Update() |
| 168 | tr.Open() |
| 169 | tr.treeChanged(nil) |
| 170 | if stv != nil { |
| 171 | stv.SelectEvent(events.SelectOne) |
| 172 | } |
| 173 | } |
| 174 | |
| 175 | func (tr *Tree) addSyncNodes(rel, myidx int, typ *types.Type, n int) { |
| 176 | parent := tr.SyncNode |
no test coverage detected