diff options
Diffstat (limited to 'sort.go')
| -rw-r--r-- | sort.go | 28 |
1 files changed, 5 insertions, 23 deletions
@@ -45,15 +45,16 @@ func (pb *Files) makeNewSortfile(pf *File) error { pf.findFunc(wFind) // attempt to add sort functions for pf.Base - pf.processMessage(pf.Base, wSort, wFind) + pf.processMessage(pf.Bases, wSort, wFind) + // pf.processMessage(pf.Base, wSort, wFind) return nil } func (pf *File) processMessage(msg *MsgName, wSort, wFind io.Writer) error { - log.Printf("%s\n", msg.Name) + log.Printf("ADDING FIND AND SORT FOR MESSAGE %s WITH %+v\n", msg.Name, msg.Vars) for _, v := range msg.Vars { if !v.IsRepeated { - // log.Printf("\tSKIP %s %s\n", v.VarName, v.VarType) + log.Printf("\tSKIP %s %s\n", v.VarName, v.VarType) continue } if err := pf.addSortByMsg(msg, v, wSort, wFind); err != nil { @@ -64,7 +65,7 @@ func (pf *File) processMessage(msg *MsgName, wSort, wFind io.Writer) error { } func (pf *File) addSortByMsg(parent *MsgName, find *MsgVar, wSort, wFind io.Writer) error { - // log.Printf("\tLOOK HERE: %s %s\n", find.VarName, find.VarType) + log.Printf("\tLOOK HERE: %s %s\n", find.VarName, find.VarType) var found *MsgName for _, msg := range pf.MsgNames { if msg.Name == find.VarType { @@ -108,22 +109,3 @@ func (pf *File) addSortByMsg(parent *MsgName, find *MsgVar, wSort, wFind io.Writ } return nil } - -func (pf *File) printMsgTable() { - for _, msg := range pf.MsgNames { - log.Printf("%s\n", msg.Name) - for _, v := range msg.Vars { - var end string - if v.IsRepeated { - end += "(repeated) " - } - if v.HasSort { - end += "(sort) " - } - if v.HasUnique { - end += "(unique) " - } - log.Printf("\t%s %s %s\n", v.VarName, v.VarType, end) - } - } -} |