-
Notifications
You must be signed in to change notification settings - Fork 36
/
Copy pathinterpolate.go
209 lines (193 loc) · 4.53 KB
/
interpolate.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
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
package dbr
import (
"database/sql/driver"
"reflect"
"sort"
"strconv"
"strings"
"time"
_ "unsafe" // needs for reflect.UnsafeAddr
)
type interpolator struct {
Buffer
Dialect
IgnoreBinary bool
N int
}
// InterpolateForDialect replaces placeholder in query with corresponding value in dialect
func InterpolateForDialect(query string, value []interface{}, d Dialect) (string, error) {
i := interpolator{
Buffer: NewBuffer(),
Dialect: d,
}
err := i.interpolate(query, value)
if err != nil {
return "", err
}
return i.String(), nil
}
func (i *interpolator) interpolate(query string, value []interface{}) error {
if strings.Count(query, placeholder) != len(value) {
return ErrPlaceholderCount
}
valueIndex := 0
for {
index := strings.Index(query, placeholder)
if index == -1 {
break
}
i.WriteString(query[:index])
if _, ok := value[valueIndex].([]byte); ok && i.IgnoreBinary {
i.WriteString(i.Placeholder(i.N))
i.N++
i.WriteValue(value[valueIndex])
} else {
err := i.encodePlaceholder(value[valueIndex])
if err != nil {
return err
}
}
query = query[index+len(placeholder):]
valueIndex++
}
// placeholder not found; write remaining query
i.WriteString(query)
return nil
}
func (i *interpolator) encodePlaceholder(value interface{}) error {
if builder, ok := value.(Builder); ok {
pbuf := NewBuffer()
err := builder.Build(i.Dialect, pbuf)
if err != nil {
return err
}
paren := true
switch value.(type) {
case SelectStmt:
case *union:
default:
paren = false
}
if paren {
i.WriteString("(")
}
err = i.interpolate(pbuf.String(), pbuf.Value())
if err != nil {
return err
}
if paren {
i.WriteString(")")
}
return nil
}
if valuer, ok := value.(driver.Valuer); ok {
// get driver.Valuer's data
var err error
value, err = valuer.Value()
if err != nil {
return err
}
}
if value == nil {
i.WriteString("NULL")
return nil
}
v := reflect.ValueOf(value)
switch v.Kind() {
case reflect.String:
i.WriteString(i.EncodeString(v.String()))
return nil
case reflect.Bool:
i.WriteString(i.EncodeBool(v.Bool()))
return nil
case reflect.Int, reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64:
i.WriteString(strconv.FormatInt(v.Int(), 10))
return nil
case reflect.Uint, reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64:
i.WriteString(strconv.FormatUint(v.Uint(), 10))
return nil
case reflect.Float32, reflect.Float64:
i.WriteString(strconv.FormatFloat(v.Float(), 'f', -1, 64))
return nil
case reflect.Struct:
if v.Type() == reflect.TypeOf(time.Time{}) {
i.WriteString(i.EncodeTime(v.Interface().(time.Time)))
return nil
}
case reflect.Slice:
if v.Type().Elem().Kind() == reflect.Uint8 {
// []byte
i.WriteString(i.EncodeBytes(v.Bytes()))
return nil
}
if v.Len() == 0 {
// FIXME: support zero-length slice
return ErrInvalidSliceLength
}
i.WriteString("(")
for n := 0; n < v.Len(); n++ {
if n > 0 {
i.WriteString(",")
}
err := i.encodePlaceholder(v.Index(n).Interface())
if err != nil {
return err
}
}
i.WriteString(")")
return nil
case reflect.Map:
if v.Len() == 0 {
// FIXME: support zero-length slice
return ErrInvalidSliceLength
}
i.WriteString("(")
// we need to sort keys, because in this case it is more chance
// for database cache hit because the query will be same for same values
// and this covers extra cost of sorting
keys := mapKeys(v.MapKeys())
sort.Sort(keys)
for n := 0; n < len(keys); n++ {
if n > 0 {
i.WriteString(",")
}
err := i.encodePlaceholder(keys[n].Interface())
if err != nil {
return err
}
}
i.WriteString(")")
return nil
case reflect.Ptr:
if v.IsNil() {
i.WriteString("NULL")
return nil
}
return i.encodePlaceholder(v.Elem().Interface())
}
return ErrNotSupported
}
type mapKeys []reflect.Value
func (k mapKeys) Len() int {
return len(k)
}
func (k mapKeys) Less(i, j int) bool {
vi, vj := k[i], k[j]
switch vi.Kind() {
case reflect.Bool:
return !vi.Bool() && vj.Bool()
case reflect.Int8, reflect.Int16, reflect.Int32, reflect.Int64, reflect.Int:
return vi.Int() < vj.Int()
case reflect.Uint8, reflect.Uint16, reflect.Uint32, reflect.Uint64, reflect.Uint, reflect.Uintptr:
return vi.Uint() < vj.Uint()
case reflect.Float32, reflect.Float64:
return vi.Float() < vj.Float()
case reflect.String:
return strings.Compare(vi.String(), vj.String()) < 0
default:
return vi.UnsafeAddr() < vj.UnsafeAddr()
}
}
func (k mapKeys) Swap(i, j int) {
k[i], k[j] = k[j], k[i]
}