summaryrefslogtreecommitdiff
path: root/generate.go
diff options
context:
space:
mode:
authorJeff Carr <[email protected]>2025-01-12 09:55:09 -0600
committerJeff Carr <[email protected]>2025-01-12 09:55:09 -0600
commitb5002b158b10db3bf89cb6157700390911d53bea (patch)
treecb7c8edfe12721509e9fa3cb01431bcda152e12d /generate.go
parent4e0b3b8f3873e1784b8ad43394c1ad8f8a9fb4fb (diff)
more cleanups
Diffstat (limited to 'generate.go')
-rw-r--r--generate.go63
1 files changed, 10 insertions, 53 deletions
diff --git a/generate.go b/generate.go
index 3e26aa8..a1f7ca9 100644
--- a/generate.go
+++ b/generate.go
@@ -25,7 +25,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
// add iterators for all the structs to be used
for _, msg := range pf.allMsg() {
funcdef := newIter(wSort, msg)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
// log.Printf("START COMPARE\n")
@@ -41,7 +41,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
}
VARNAME := v.VarName
funcdef := newSortType(wSort, PARENT, VARNAME)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
}
@@ -59,7 +59,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
}
funcdef := msg.newIterAll(wSort, FRUIT, APPLE, APPLES, LOCK)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
// log.Printf("START SELECT\n")
@@ -76,7 +76,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
}
funcdef := msg.addSelectAll(wSort, PARENT, CHILD, VARNAME, LOCK)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
// log.Printf("END SELECT\n")
@@ -113,7 +113,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
sortname := s.VarType + v.VarName
selectName := "selectAll" + VARNAME
funcdef := newSortBy(wSort, PARENT, s.VarType, sortname, sortby, selectName, v.VarName)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
} else {
// funcdef := "func (x *" + FUNCTYPE + ") SortBy" + v.VarName + "(" + v.VarType + ") *[]iter" + s.VarType + " # can not do this yet"
}
@@ -138,7 +138,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
// special case
funcdef := addLenFunc(wSort, PARENT, VARNAME, LOCK) // + " " + v.VarType + " name:" + v.VarName
funcdef += " # is special struct=varname"
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
if PARENT == VARNAME {
// FUNCNAME := "Append"
@@ -159,7 +159,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
if PARENT == VARNAME {
funcdef := addAllFunc(wSort, PARENT, CHILD, VARNAME)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
/*
@@ -208,7 +208,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
funcdef := msg.generateFindBy(wSort, FUNCNAME, PARENT, VARNAME, s.VarType, v.VarName)
// func (msg *MsgName) generateFindBy(w io.Writer, FUNCNAME, STRUCT, VARNAME, VARTYPE, COLOR string) string {
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
} else {
if v.VarType == "string" {
// probably dumb. move to a database if you need this
@@ -245,7 +245,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
} else {
funcdef = msg.deleteBy(wSort, FRUIT, APPLES, APPLE, COLOR, FUNCNAME, v.VarName)
}
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
// AppendBy() functions. todo: fix these so Append() is for simple things and Insert() is for unique keys
@@ -265,7 +265,7 @@ func (pb *Files) makeNewSortfile(pf *File) error {
} else {
FUNCNAME = "Append" + VARNAME + "By" + v.VarName
funcdef := msg.addAppendBy(wSort, PARENT, FUNCNAME, VARNAME, v.VarName, s.VarType)
- log.Printf("%20s %s\n", "", funcdef)
+ log.Printf("Adding %s\n", funcdef)
}
}
@@ -320,46 +320,3 @@ func (pf *File) specialBases(wFind io.Writer) {
pf.Bases.simpleAppend(wFind, FRUIT, APPLES, APPLE)
}
-
-/*
-func (parent *MsgName) addInsertByMsg(w io.Writer, FRUIT, APPLES, APPLE string) {
- // log.Printf("\tINSERT: %s %s for %s\n", APPLES, APPLE, FRUIT)
- for _, v := range parent.Vars {
- if v.HasUnique {
- var COLOR string = cases.Title(language.English, cases.NoLower).String(v.VarName)
- log.Printf("\tINSERT: (x %s) InsertBy%s(string) *%s\n", FRUIT, COLOR, APPLE)
- parent.insertBy(w, FRUIT, APPLES, APPLE, COLOR)
- }
- }
-}
-
-func (parent *MsgName) addAppendByMsg(w io.Writer, FRUIT, APPLES, APPLE string) {
- // log.Printf("\tAPPEND!: %s %s for %s\n", APPLES, APPLE, FRUIT)
- var COLORS []string
-
- for _, v := range parent.Vars {
- if v.HasUnique {
- var COLOR string = cases.Title(language.English, cases.NoLower).String(v.VarName)
- COLORS = append(COLORS, COLOR)
-
- log.Printf("\tAPPEND: (x %s) AppendUniqueBy%s(%s)\n", FRUIT, COLOR, APPLE)
- parent.appendUniqueCOLOR(w, FRUIT, APPLES, APPLE, COLOR)
- }
- }
- if len(COLORS) > 0 {
- parent.appendUnique(w, FRUIT, APPLES, APPLE, COLORS)
- }
-}
-
-func (parent *MsgName) addSortByMsg(w io.Writer, FRUIT, APPLES, APPLE string) {
- log.Printf("\tSORT!: %s %s for %s\n", APPLES, APPLE, FRUIT)
-
- for _, v := range parent.Vars {
- if v.HasSort {
- // log.Printf("\tSort!: %s %s for %s\n", APPLES, APPLE, v.VarName)
- newS := cases.Title(language.English, cases.NoLower).String(v.VarName)
- log.Printf("\t\t(x %s) SortdBy%s() *%sIter\n", FRUIT, newS, APPLE)
- }
- }
-}
-*/