This repository has been archived by the owner on Nov 5, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 3
/
aggregate.go
142 lines (126 loc) · 2.89 KB
/
aggregate.go
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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
package aggregate
import (
"fmt"
"github.com/ronaksoft/rony/tools"
"hash/crc32"
"strings"
)
/*
Creation Time: 2021 - Jan - 10
Created by: (ehsan)
Maintainers:
1. Ehsan N. Moosa (E2)
Auditor: Ehsan N. Moosa (E2)
Copyright Ronak Software Group 2020
*/
type Aggregate struct {
Type string
Name string
Table Key
Views []Key
ViewParams []string
FieldNames []string
FieldsCql map[string]string
FieldsGo map[string]string
HasIndex bool
}
func (m *Aggregate) FuncArgs(keyPrefix string, key Key) string {
sb := strings.Builder{}
for idx, k := range key.Keys() {
if idx != 0 {
sb.WriteRune(',')
}
sb.WriteString(tools.ToLowerCamel(fmt.Sprintf("%s%s", keyPrefix, k)))
sb.WriteRune(' ')
sb.WriteString(m.FieldsGo[k])
}
return sb.String()
}
func (m *Aggregate) FuncArgsPKs(keyPrefix string, key Key) string {
sb := strings.Builder{}
for idx, k := range key.PKs {
if idx != 0 {
sb.WriteRune(',')
}
sb.WriteString(tools.ToLowerCamel(fmt.Sprintf("%s%s", keyPrefix, k)))
sb.WriteRune(' ')
sb.WriteString(m.FieldsGo[k])
}
return sb.String()
}
func (m *Aggregate) FuncArgsCKs(keyPrefix string, key Key) string {
sb := strings.Builder{}
for idx, k := range key.CKs {
if idx != 0 {
sb.WriteRune(',')
}
sb.WriteString(tools.ToLowerCamel(fmt.Sprintf("%s%s", keyPrefix, k)))
sb.WriteRune(' ')
sb.WriteString(m.FieldsGo[k])
}
return sb.String()
}
type Key struct {
aggregate string
keyType string
PKs []string
CKs []string
Orders []string
}
func (k *Key) Keys() []string {
keys := make([]string, 0, len(k.PKs)+len(k.CKs))
keys = append(keys, k.PKs...)
keys = append(keys, k.CKs...)
return keys
}
func (k *Key) StringPKs(prefix string, sep string, lowerCamel bool) string {
sb := strings.Builder{}
for idx, k := range k.PKs {
if idx != 0 {
sb.WriteString(sep)
}
sb.WriteString(prefix)
if lowerCamel {
sb.WriteString(tools.ToLowerCamel(k))
} else {
sb.WriteString(k)
}
}
return sb.String()
}
func (k *Key) StringCKs(prefix string, sep string, lowerCamel bool) string {
sb := strings.Builder{}
for idx, k := range k.CKs {
if idx != 0 {
sb.WriteString(sep)
}
sb.WriteString(prefix)
if lowerCamel {
sb.WriteString(tools.ToLowerCamel(k))
} else {
sb.WriteString(k)
}
}
return sb.String()
}
func (k *Key) ChecksumPKs(keyPrefix string, sep string, lowerCamel bool) uint32 {
return crc32.ChecksumIEEE(tools.StrToByte(k.StringPKs(keyPrefix, sep, lowerCamel)))
}
func (k *Key) String(prefix string, sep string, lowerCamel bool) string {
sb := strings.Builder{}
for idx, k := range k.Keys() {
if idx != 0 {
sb.WriteString(sep)
}
sb.WriteString(prefix)
if lowerCamel {
sb.WriteString(tools.ToLowerCamel(k))
} else {
sb.WriteString(k)
}
}
return sb.String()
}
func (k *Key) Checksum() uint32 {
return crc32.ChecksumIEEE(tools.StrToByte(k.String("", ",", false)))
}