mirror of
https://codeberg.org/forgejo/forgejo.git
synced 2024-11-14 06:39:40 +01:00
c61b902538
* Upgrade xorm to v1.0.0 * small nit * Fix tests * Update xorm * Update xorm * fix go.sum * fix test * Fix bug when dump * Fix bug * update xorm to latest * Fix migration test * update xorm to latest * Fix import order * Use xorm tag
117 lines
2.5 KiB
Go
Vendored
117 lines
2.5 KiB
Go
Vendored
// Copyright 2016 The Xorm Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package builder
|
|
|
|
import (
|
|
"fmt"
|
|
"sort"
|
|
)
|
|
|
|
// Incr implements a type used by Eq
|
|
type Incr int
|
|
|
|
// Decr implements a type used by Eq
|
|
type Decr int
|
|
|
|
// Eq defines equals conditions
|
|
type Eq map[string]interface{}
|
|
|
|
var _ Cond = Eq{}
|
|
|
|
// OpWriteTo writes conditions with special operator
|
|
func (eq Eq) OpWriteTo(op string, w Writer) error {
|
|
var i = 0
|
|
for _, k := range eq.sortedKeys() {
|
|
v := eq[k]
|
|
switch v.(type) {
|
|
case []int, []int64, []string, []int32, []int16, []int8, []uint, []uint64, []uint32, []uint16, []interface{}:
|
|
if err := In(k, v).WriteTo(w); err != nil {
|
|
return err
|
|
}
|
|
case expr:
|
|
if _, err := fmt.Fprintf(w, "%s=(", k); err != nil {
|
|
return err
|
|
}
|
|
|
|
if err := v.(expr).WriteTo(w); err != nil {
|
|
return err
|
|
}
|
|
|
|
if _, err := fmt.Fprintf(w, ")"); err != nil {
|
|
return err
|
|
}
|
|
case *Builder:
|
|
if _, err := fmt.Fprintf(w, "%s=(", k); err != nil {
|
|
return err
|
|
}
|
|
|
|
if err := v.(*Builder).WriteTo(w); err != nil {
|
|
return err
|
|
}
|
|
|
|
if _, err := fmt.Fprintf(w, ")"); err != nil {
|
|
return err
|
|
}
|
|
case Incr:
|
|
if _, err := fmt.Fprintf(w, "%s=%s+?", k, k); err != nil {
|
|
return err
|
|
}
|
|
w.Append(int(v.(Incr)))
|
|
case Decr:
|
|
if _, err := fmt.Fprintf(w, "%s=%s-?", k, k); err != nil {
|
|
return err
|
|
}
|
|
w.Append(int(v.(Decr)))
|
|
case nil:
|
|
if _, err := fmt.Fprintf(w, "%s=null", k); err != nil {
|
|
return err
|
|
}
|
|
default:
|
|
if _, err := fmt.Fprintf(w, "%s=?", k); err != nil {
|
|
return err
|
|
}
|
|
w.Append(v)
|
|
}
|
|
if i != len(eq)-1 {
|
|
if _, err := fmt.Fprint(w, op); err != nil {
|
|
return err
|
|
}
|
|
}
|
|
i = i + 1
|
|
}
|
|
return nil
|
|
}
|
|
|
|
// WriteTo writes SQL to Writer
|
|
func (eq Eq) WriteTo(w Writer) error {
|
|
return eq.OpWriteTo(" AND ", w)
|
|
}
|
|
|
|
// And implements And with other conditions
|
|
func (eq Eq) And(conds ...Cond) Cond {
|
|
return And(eq, And(conds...))
|
|
}
|
|
|
|
// Or implements Or with other conditions
|
|
func (eq Eq) Or(conds ...Cond) Cond {
|
|
return Or(eq, Or(conds...))
|
|
}
|
|
|
|
// IsValid tests if this Eq is valid
|
|
func (eq Eq) IsValid() bool {
|
|
return len(eq) > 0
|
|
}
|
|
|
|
// sortedKeys returns all keys of this Eq sorted with sort.Strings.
|
|
// It is used internally for consistent ordering when generating
|
|
// SQL, see https://gitea.com/xorm/builder/issues/10
|
|
func (eq Eq) sortedKeys() []string {
|
|
keys := make([]string, 0, len(eq))
|
|
for key := range eq {
|
|
keys = append(keys, key)
|
|
}
|
|
sort.Strings(keys)
|
|
return keys
|
|
}
|