diff options
Diffstat (limited to 'table.go')
| -rw-r--r-- | table.go | 30 |
1 files changed, 15 insertions, 15 deletions
@@ -120,7 +120,7 @@ func (me *TreeInfo) updateTable(t *guipb.Table) { var w int = 0 for _, name := range t.Order { // log.Info("got order:", t.Title, name) - if me.addTableRow(t, grid, name, w) { + if me.addTableCol(t, grid, name, w) { // log.Info("tree:row() COLUMN GOOD", t.Title, name, w, h) } else { log.Info("tree:row() COLOMN FAIL", t.Title, name, w, h) @@ -131,8 +131,8 @@ func (me *TreeInfo) updateTable(t *guipb.Table) { } /* -func (me *TreeInfo) updateRow(t *guipb.Table, name string) { - for _, r := range t.StringRows { +func (me *TreeInfo) updateCol(t *guipb.Table, name string) { + for _, r := range t.StringCols { if name == r.Header.Name { // debugging code // id := r.Header.Id @@ -140,10 +140,10 @@ func (me *TreeInfo) updateRow(t *guipb.Table, name string) { // if n == nil { // log.Info("could not find widget id", id) // } - log.Info("tree.updateRow(string)", r.Header, "len =", len(r.Widgets)) + log.Info("tree.updateCol(string)", r.Header, "len =", len(r.Widgets)) // if r.Header.Name == "Hostname" { // } - // log.Info("tree.updateRow() found Hostnames", r.Vals) + // log.Info("tree.updateCol() found Hostnames", r.Vals) for i, v := range r.Vals { // log.Info("tree: Hostname Widget", i, v, w.Name) w := r.Widgets[i] @@ -164,11 +164,11 @@ func (me *TreeInfo) updateRow(t *guipb.Table, name string) { } } - for _, r := range t.TimeRows { + for _, r := range t.TimeCols { if name != r.Header.Name { continue } - log.Info("tree.updateRow(time)", r.Header, "len =", len(r.Widgets)) + log.Info("tree.updateCol(time)", r.Header, "len =", len(r.Widgets)) for i, _ := range r.Vals { // log.Info("tree: Hostname Widget", i, v, w.Name) w := r.Widgets[i] @@ -215,7 +215,7 @@ func (me *TreeInfo) makeTable(t *guipb.Table) { var w int = 0 for _, name := range t.Order { // log.Info("got order:", t.Title, name) - if me.addTableRow(t, grid, name, w) { + if me.addTableCol(t, grid, name, w) { // log.Info("tree:row() COLUMN GOOD", t.Title, name, w, h) } else { log.Log(TREEWARN, "tree:row() COLOMN FAIL", t.Title, name, w, h) @@ -225,9 +225,9 @@ func (me *TreeInfo) makeTable(t *guipb.Table) { } } -func (me *TreeInfo) addTableRow(t *guipb.Table, grid *Node, name string, w int) bool { +func (me *TreeInfo) addTableCol(t *guipb.Table, grid *Node, name string, w int) bool { var h int = 0 - for _, r := range t.StringRows { + for _, r := range t.StringCols { if name != r.Header.Name { // log.Info("skip string row:", r.Header.Name, "!=", name) continue @@ -245,7 +245,7 @@ func (me *TreeInfo) addTableRow(t *guipb.Table, grid *Node, name string, w int) return true } - for _, r := range t.ButtonRows { + for _, r := range t.ButtonCols { if name != r.Header.Name { // log.Info("skip string row:", r.Header.Name, "!=", name) continue @@ -263,7 +263,7 @@ func (me *TreeInfo) addTableRow(t *guipb.Table, grid *Node, name string, w int) return true } - for _, r := range t.IntRows { + for _, r := range t.IntCols { if name != r.Header.Name { // log.Info("skip sint row:", r.Header.Name, "!=", name) continue @@ -286,7 +286,7 @@ func (me *TreeInfo) addTableRow(t *guipb.Table, grid *Node, name string, w int) return true } - for _, r := range t.TimeRows { + for _, r := range t.TimeCols { if name != r.Header.Name { // log.Info("skip sint row:", r.Header.Name, "!=", name) continue @@ -349,13 +349,13 @@ func dumpTable(t *guipb.Table) { for i, o := range t.Order { log.Info("got order:", t.Title, i, o) } - for i, r := range t.StringRows { + for i, r := range t.StringCols { log.Info("got string row:", t.Title, i, r.Header.Name, r.Vals) for _, v := range r.Widgets { log.Info("tree: got string widget:", v.Id, v.Name) } } - for i, r := range t.IntRows { + for i, r := range t.IntCols { log.Info("got int row:", t.Title, i, r.Header.Name, r.Vals) for _, v := range r.Widgets { log.Info("tree: got int widget:", v.Id, v.Val) |