-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathdataquery.go
More file actions
279 lines (231 loc) · 6.31 KB
/
Copy pathdataquery.go
File metadata and controls
279 lines (231 loc) · 6.31 KB
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
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
package goquery
import (
"errors"
"fmt"
"reflect"
)
const selectkey = "select"
//const updatekey = "update"
//const insertkey = "insert"
type RowFunction func(r Rows) error
type Rows interface {
Columns() ([]string, error)
ColumnTypes() ([]reflect.Type, error)
Err() error
Next() bool
Scan(dest ...interface{}) error
ScanStruct(dest interface{}) error
ToMap() (map[string]any, error)
ScanIntoMap(cols []string, targetMap map[string]any) error
Close() error
}
// RowBuffers holds the pre-allocated slices needed for a dynamic scan.
type RowBuffers struct {
Vals []any
ScanDest []any
}
// // Global pool to cache and reuse row scan slices across tens of millions of iterations.
// var rowBuffersPool = sync.Pool{
// New: func() any {
// return &RowBuffers{}
// },
// }
// RowToMapPool parses a dynamic row with near-zero memory allocations.
// To maximize performance, pass an existing map to reuse (targetMap).
func RowToMapBuf(r Rows, cols []string, targetMap map[string]any, buf *RowBuffers) error {
length := len(cols)
// // Ensure the slices are large enough for this query's column count
// if cap(buf.Vals) < length {
// buf.Vals = make([]any, length)
// buf.ScanDest = make([]any, length)
// } else {
// buf.Vals = buf.Vals[:length]
// buf.ScanDest = buf.ScanDest[:length]
// }
// 2. Map pointers to the target slice indices
for i := 0; i < length; i++ {
buf.Vals[i] = nil // Reset old data
buf.ScanDest[i] = &buf.Vals[i]
}
// 3. Scan directly into the pooled pointers
if err := r.Scan(buf.ScanDest...); err != nil {
return err
}
// 4. Map the columns into your target map without reflection
for i, col := range cols {
rawVal := buf.Vals[i]
if rawVal == nil {
targetMap[col] = nil
continue
}
switch v := rawVal.(type) {
case string:
targetMap[col] = v
case int64:
targetMap[col] = v
case float64:
targetMap[col] = v
case bool:
targetMap[col] = v
case []byte:
// Treat byte arrays safely. If it's a string/geometry representation, cast it.
targetMap[col] = string(v)
default:
targetMap[col] = v
}
}
return nil
}
func RowToMap(r Rows) (map[string]any, error) {
cols, err := r.Columns()
if err != nil {
return nil, err
}
colTypes, err := r.ColumnTypes()
if err != nil {
return nil, err
}
vals := make([]any, len(cols))
for i := range vals {
// FIX: Create a pointer to the type first.
// If colTypes[i] is 'string', this makes it '*string'.
ptrType := reflect.PointerTo(colTypes[i])
// reflect.New(ptrType) creates a pointer to that type.
// So we get '**string'. This double-pointer allows 'pgx' to set it to nil on NULL.
pval := reflect.New(ptrType)
vals[i] = pval.Interface()
}
// Now scanning into **Type (e.g., **string)
err = r.Scan(vals...)
if err != nil {
return nil, err
}
valmap := make(map[string]any)
for i, col := range cols {
// val is **string (or **int, etc.)
val := vals[i]
// Dereference the outer pointer to get the inner pointer (*string)
// We use reflection here because we don't know the specific type yet
outerPtr := reflect.ValueOf(val)
innerPtr := outerPtr.Elem() // This is the *string
// CHECK FOR NULL: If the inner pointer is nil, the DB value was NULL
if innerPtr.IsNil() {
valmap[col] = nil
continue
}
// If not nil, we extract the actual *string (or *int) to pass to your switch
actualPtr := innerPtr.Interface()
var concreteVal any
switch v := actualPtr.(type) {
case *string:
concreteVal = *v
case *int64:
concreteVal = *v
case *int32:
concreteVal = *v
case *float64:
concreteVal = *v
case *float32:
concreteVal = *v
case *bool:
concreteVal = *v
default:
// Fallback: dereference the pointer we verified is not nil
concreteVal = reflect.Indirect(reflect.ValueOf(actualPtr)).Interface()
}
valmap[col] = concreteVal
}
return valmap, nil
}
// // converts the current Rows position to a map
// func RowToMapOld(r Rows) (map[string]any, error) {
// cols, err := r.Columns()
// if err != nil {
// return nil, err
// }
// colTypes, err := r.ColumnTypes()
// if err != nil {
// return nil, err
// }
// vals := make([]any, len(cols))
// for i := range vals {
// pval := reflect.New(colTypes[i])
// ival := pval.Interface() //call Elem to dereference the pointer created by reflect.New
// vals[i] = ival
// }
// err = r.Scan(vals...)
// valmap := make(map[string]any)
// //this is pretty gross, but it is significantly faster than reflection which is the fallback
// for i, col := range cols {
// val := vals[i]
// var concreteVal any
// switch v := val.(type) {
// case *string:
// concreteVal = *v
// case *int64:
// concreteVal = *v
// case *int32:
// concreteVal = *v
// case *float64:
// concreteVal = *v
// case *float32:
// concreteVal = *v
// case *bool:
// concreteVal = *v
// default:
// // Fallback to reflection ONLY for unknown types
// concreteVal = reflect.Indirect(reflect.ValueOf(val)).Interface()
// }
// valmap[col] = concreteVal
// }
// return valmap, nil
// }
type DataSet interface {
Entity() string
FieldSlice() interface{} //@depricated. Will be removed in the next version...maybe
Fields() interface{} //@depricated. Will be removed in the next version...maybe
Commands() map[string]string
PutCommand(key string, stmt string)
}
type Statements map[string]string
func (s Statements) Get(key string) (string, error) {
if val, ok := s[key]; ok {
return val, nil
}
return "", errors.New("Invalid statement")
}
func (s Statements) GetOrPanic(key string) string {
if val, ok := s[key]; ok {
return val
}
panic(errors.New("Invalid statement"))
}
type TableDataSet struct {
Name string
Schema string //optional
Statements Statements
TableFields any
}
func (t *TableDataSet) FieldSlice() interface{} {
typ := reflect.TypeOf(t.TableFields)
slice := reflect.New(reflect.SliceOf(typ))
return slice.Interface()
}
func (t *TableDataSet) Fields() interface{} {
return t.TableFields
}
func (t *TableDataSet) Entity() string {
if t.Schema != "" {
return fmt.Sprintf("%s.%s", t.Schema, t.Name)
}
return t.Name
}
func (t *TableDataSet) Commands() map[string]string {
return t.Statements
}
func (t *TableDataSet) PutCommand(key string, stmt string) {
if t.Statements == nil {
t.Statements = make(map[string]string)
}
t.Statements[key] = stmt
}