summaryrefslogtreecommitdiff
path: root/newsort.go
blob: 1fba9be6d86942b82987a1e1f06939aea756fa08 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package main

import (
	"os"
	"strings"

	"go.wit.com/log"
)

func (pb *Files) makeNewSortfile(pf *File) {
	f, _ := os.OpenFile(pf.Filebase+".newsort.pb.go", os.O_WRONLY|os.O_CREATE|os.O_TRUNC, 0644)

	header(f, pf)

	for _, msg := range pf.MsgNames {
		if msg.DoMutex {
			msg.syncLock(f, msg.Lockname)
			for _, key := range msg.Sort {
				pf.iterTop(f, key)
				pf.iterNext(f, key)
			}
		} else {
			log.Info("Skipping syncLock() for", msg.Name, "DoMutex = false")
		}
		pf.appendUnique(f, msg, sortmap) // Append() enforce no unique keys
	}

	return
	// iterSortAll(f, sortmap)

	if argv.Append != "" {
		sortmap["append"] = string(argv.Append)
		iterAppend(f, sortmap) // Append() enforce unique key argv.Append
	}

	for _, s := range uniqueKeys {
		// log.Info("found unique key in .proto", s)
		sortmap["sortBy"] = s
		sortmap["sortKey"] = s

		iterSortBy(f, sortmap)

		sortmap["append"] = sortmap["sortKey"]
		iterAppend(f, sortmap) // Append() enforce unique key argv.Append

		iterDelete(f, sortmap)
		iterReplace(f, sortmap)
		iterFind(f, sortmap)
	}

	for _, s := range argv.Sort {
		sortparts := strings.Split(s, ",")
		sortmap["sortBy"] = sortparts[0]
		sortmap["sortKey"] = sortparts[1]

		iterSortBy(f, sortmap)

		sortmap["append"] = sortmap["sortKey"]
		iterAppend(f, sortmap) // Append() enforce unique key argv.Append

		iterDelete(f, sortmap)
		iterReplace(f, sortmap)
		iterFind(f, sortmap)
	}
	iterEnd(f, sortmap)
}