diff options
Diffstat (limited to 'generate.go')
| -rw-r--r-- | generate.go | 276 |
1 files changed, 247 insertions, 29 deletions
diff --git a/generate.go b/generate.go index b22b3f7..418513f 100644 --- a/generate.go +++ b/generate.go @@ -15,19 +15,212 @@ import ( func (pb *Files) makeNewSortfile(pf *File) error { wSort, _ := os.OpenFile(pf.Filebase+".sort.pb.go", os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644) defer wSort.Close() - wFind, _ := os.OpenFile(pf.Filebase+".find.pb.go", os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644) - defer wFind.Close() header(wSort, pf) + pf.syncLock(wSort) - // pf.Base.iterTop(wSort) - // pf.Base.iterNext(wSort) - // pf.selectAllFunc(wSort) - // pf.iterSelect(wSort) + log.Printf("START ITERATORS\n") + // add iterators for all the structs to be used + for i, msg := range pf.allMsg() { + PARENT := msg.Name + LOCK := msg.Lockname - // pf.sortByFunc(wSort, pf.Bases, pf.Base) - pf.newGenerateSort(wSort, pf.Bases) - pf.newGenerateSort(wSort, pf.Base) + funcdef := newIter(wSort, msg) + log.Printf("ITER: %-2d %20s %20s %20s %20s %s\n", i, PARENT, "", "", LOCK, funcdef) + } + log.Printf("END ITERATORS\n") + log.Printf("\n") + + log.Printf("START COMPARE\n") + for i, msg := range pf.allMsg() { + PARENT := msg.Name + for _, v := range msg.Vars { + if !v.HasSort { + continue + } + VARNAME := v.VarName + funcdef := newSortType(wSort, PARENT, VARNAME) + log.Printf("TYPE: %-2d %20s %20s %20s %10s %s\n", i, PARENT, "", "", "", funcdef) + } + } + log.Printf("END COMPARE\n") + log.Printf("\n") + + // add selectAll() functions for all the sort combinations that will be used + for i, s := range pf.ToSort { + // log.Printf("SORT: %-2d %20s %20s %20s %20s\n", i, s.MsgName, s.VarType, s.VarName, s.Lockname) + FRUIT := s.MsgName + APPLE := s.VarType + APPLES := s.VarName + LOCK := s.Lockname + funcdef := newIterAll(wSort, FRUIT, APPLE, APPLES, LOCK) + log.Printf("JUNK: %-2d %20s %20s %20s %20s %s\n", i, FRUIT, APPLE, "", LOCK, funcdef) + } + log.Printf("\n") + + // make the sort iterators selectAll() + for i, s := range pf.ToSort { + PARENT := s.MsgName + CHILD := s.VarType + VARNAME := s.VarName + LOCK := s.Lockname + + funcdef := addSelectAll(wSort, PARENT, CHILD, VARNAME, LOCK) + log.Printf("SORT: %-2d %20s %20s %20s %20s %s\n", i, PARENT, CHILD, VARNAME, LOCK, funcdef) + } + log.Printf("\n") + + // make Len() + for _, msg := range pf.allMsg() { + PARENT := msg.Name + LOCK := msg.Lockname + + for i, v := range msg.Vars { + if v.IsRepeated { + CHILD := v.VarType + VARNAME := v.VarName + // funcdef := "func (x *" + PARENT + ") Len" + VARNAME + "() int " + CHILD + " name:" + VARNAME + + if PARENT == VARNAME { + // special case + funcdef := addLenFunc(wSort, PARENT, VARNAME, LOCK) // + " " + v.VarType + " name:" + v.VarName + funcdef += " # is special struct=varname" + log.Printf("LEN: %-2d %20s %20s %20s %20s %s\n", i, PARENT, CHILD, VARNAME, LOCK, funcdef) + } + } + } + } + + log.Printf("\n") + log.Printf(" %-2s %20s %20s %20s %20s\n", "", "PARENT STRUCT", "VAR STRUCT TYPE", "VAR NAME", "LOCK") + // for i, s := range slices.Backward(pf.ToSort) { + for i, s := range pf.ToSort { + var funcname string + PARENT := s.MsgName + CHILD := s.VarType + VARNAME := s.VarName + LOCK := s.Lockname + + log.Printf("SORT: %-2d %20s %20s %20s %20s %s\n", i, PARENT, CHILD, VARNAME, LOCK, "") + + var FUNCTYPE string + if PARENT == VARNAME { + FUNCTYPE = PARENT + } else { + FUNCTYPE = VARNAME + } + + if PARENT == VARNAME { + funcname := addAllFunc(wSort, PARENT, CHILD, VARNAME) + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "done", "", funcname) + } + if s.VarType+"s" == s.VarName { + funcname = "func (x *" + FUNCTYPE + ") All() *[]iter" + s.VarType + } else { + funcname = "func (x *" + FUNCTYPE + ") all" + s.VarName + "() *[]iter" + s.VarType + } + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + msg := pf.findMsg(s.VarType) + if msg == nil { + return fmt.Errorf("failed to find struct %s", s.VarType) + } + for _, v := range msg.Vars { + if v.HasSort { + funcname := "func (x *" + FUNCTYPE + ") SortBy" + v.VarName + "(" + v.VarType + ") *[]iter" + s.VarType + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + // funcdef := "func (x *"+FRUIT+") SortBy"+COLOR+"() *"+APPLE+"Iterator" + + if v.VarType == "string" { + funcdef := newSortBy(wSort, FUNCTYPE, CHILD, VARNAME, v.VarName) + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcdef) + } else { + funcname := "func (x *" + FUNCTYPE + ") SortBy" + v.VarName + "(" + v.VarType + ") *[]iter" + s.VarType + " # can not do this yet" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } + } + } + + var ucount int + for _, v := range msg.Vars { + if v.HasUnique { + ucount += 1 + funcname := "func (x *" + FUNCTYPE + ") AppendUnique" + v.VarName + "(" + v.VarType + ")" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } + } + for _, v := range msg.Vars { + if v.HasUnique { + funcname := "func (x *" + FUNCTYPE + ") DeleteBy" + v.VarName + "(" + v.VarType + ") bool" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } + } + + for _, v := range msg.Vars { + if v.HasUnique { + funcname = "func (x *" + FUNCTYPE + ") FindBy" + v.VarName + "(a " + v.VarType + ") *" + s.VarType + "(using" + v.VarName + ")" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } else { + if v.VarType == "string" { + funcname = "func (x *" + FUNCTYPE + ") FindBy" + v.VarName + "(a string) []*" + s.VarType + " ???" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } + } + } + if ucount == 1 { + for _, v := range msg.Vars { + if !v.HasUnique { + continue + } + funcname = "func (x *" + FUNCTYPE + ") Insert(a *" + v.VarType + ") (*" + CHILD + ", isNew bool)" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } + } + if ucount > 1 { + funcname = "func (x *" + FUNCTYPE + ") Insert(a *" + CHILD + ") (*" + CHILD + ", isNew bool)" + log.Printf(" %-2s %20s %20s %20s %s %s\n", "", "", "", "", "", funcname) + } + + } + + /* + // everything struct used in here needs a sort iterator (but just one) + for FRUIT, APPLE := range pf.IterMap { + msg := pf.findMsg(FRUIT) + if msg == nil { + return fmt.Errorf("failed to find struct %s", FRUIT) + } + log.Printf("Add newIter() message %s\n", FRUIT) + newIter(wSort, msg) + + child := pf.findMsg(APPLE) + if child == nil { + return fmt.Errorf("failed to find struct %s", APPLE) + } + log.Printf("Add newIter() message %s\n", APPLE) + newIter(wSort, child) + + // now add the allKEY() functions + msg.newIterAll(wSort, FRUIT, APPLE) + } + */ + + /* + log.Info("START") + log.Printf("Add all() FRUIT=%s APPLE=%s\n", FRUIT, APPLE) + addAllFunc(w, FRUIT, APPLE, LOCK) + log.Printf("Add len() FRUIT=%s APPLES=%s\n", FRUIT, APPLES) + addLenFunc(w, FRUIT, APPLES, LOCK) + log.Printf("Add selectAll() FRUIT=%s APPLE=%s APPLES=%s\n", FRUIT, APPLE, APPLES) + addSelectAll(w, FRUIT, APPLE, APPLES, LOCK) + // newIter(w, FRUIT, APPLE, APPLES, LOCK) + log.Info("END") + */ + + /* + return nil + pf.newGenerateSort(wSort, pf.Bases) + pf.newGenerateSort(wSort, pf.Base) + */ /* pf.appendUnique(wFind) // Append() enforce no unique keys @@ -39,25 +232,34 @@ func (pb *Files) makeNewSortfile(pf *File) error { pf.findFunc(wFind) */ - header(wFind, pf) - pf.syncLock(wFind) - pf.specialBases(wFind) + /* + wFind, _ := os.OpenFile(pf.Filebase+".find.pb.go", os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644) + defer wFind.Close() + header(wFind, pf) + pf.specialBases(wFind) - // attempt to add sort functions for pf.Base - if err := pf.processMessage(pf.Bases, wSort, wFind); err != nil { - return err - } - if err := pf.processMessage(pf.Base, wSort, wFind); err != nil { - return err - } + // attempt to add sort functions for pf.Base + if err := pf.processMessage(pf.Bases, wSort, wFind); err != nil { + return err + } + if err := pf.processMessage(pf.Base, wSort, wFind); err != nil { + return err + } + */ return nil } -func (pf *File) newGenerateSort(w io.Writer, parent *MsgName) error { +/* +func addIterNew(w io.Write, msg *MsgName { var FRUIT string = parent.Name var LOCK string = parent.Lockname + newIter(w, FRUIT, APPLE, APPLES, LOCK) +} +*/ - var allLen bool +func (pf *File) newGenerateSort(w io.Writer, parent *MsgName) error { + var FRUIT string = parent.Name + var LOCK string = parent.Lockname for _, v := range parent.Vars { if !v.IsRepeated { @@ -65,18 +267,24 @@ func (pf *File) newGenerateSort(w io.Writer, parent *MsgName) error { } var APPLES string = v.VarName var APPLE string = v.VarType - if !allLen { - // only can run these once for now - addAllFunc(w, FRUIT, APPLE, LOCK) - addLenFunc(w, FRUIT, APPLES, LOCK) - allLen = true - } - addSelectAll(w, FRUIT, APPLE, APPLES, LOCK) - newIter(w, FRUIT, APPLE, APPLES, LOCK) msg := pf.findMsg(APPLE) if msg == nil { return fmt.Errorf("failed to find struct %s", APPLE) } + if msg.NeedIter { + parent.NeedIter = false + // only can run these once for now + log.Info("START") + log.Printf("Add all() FRUIT=%s APPLE=%s\n", FRUIT, APPLE) + // addAllFunc(w, FRUIT, APPLE, LOCK) + log.Printf("Add len() FRUIT=%s APPLES=%s\n", FRUIT, APPLES) + addLenFunc(w, FRUIT, APPLES, LOCK) + log.Printf("Add selectAll() FRUIT=%s APPLE=%s APPLES=%s\n", FRUIT, APPLE, APPLES) + addSelectAll(w, FRUIT, APPLE, APPLES, LOCK) + // newIter(w, FRUIT, APPLE, APPLES, LOCK) + log.Info("END") + } + for _, v := range msg.Vars { if !v.HasSort { continue @@ -104,6 +312,16 @@ func (pf *File) findMsg(s string) *MsgName { return nil } +func (pf *File) allMsg() []*MsgName { + var all []*MsgName + all = append(all, pf.Bases) + all = append(all, pf.Base) + for _, msg := range pf.MsgNames { + all = append(all, msg) + } + return all +} + func (pf *File) specialBases(wFind io.Writer) { var FRUIT string = cases.Title(language.English, cases.NoLower).String(pf.Bases.Name) var APPLES string = cases.Title(language.English, cases.NoLower).String(pf.Bases.Name) |