{{/* Copyright 2019-present Facebook Inc. All rights reserved. This source code is licensed under the Apache 2.0 license found in the LICENSE file in the root directory of this source tree. */}} {{ define "dialect/sql/predicate/id" -}} func(s *sql.Selector) { {{- if and $.ID.IsString (not $.ID.UserDefined) }}id, _ := strconv.Atoi(id){{- end }} s.Where(sql.EQ(s.C({{ $.ID.Constant }}), id)) } {{- end }} {{ define "dialect/sql/predicate/id/ops" -}} {{- $op := $.Scope.Op -}} {{- $arg := $.Scope.Arg -}} {{- $storage := $.Scope.Storage -}} {{- $convid := and $.ID.IsString (not $.ID.UserDefined) -}} func(s *sql.Selector) { {{- if $op.Variadic }} // if not arguments were provided, append the FALSE constants, // since we can't apply "IN ()". This will make this predicate falsy. if len({{ $arg }}) == 0 { s.Where(sql.False()) return } v := make([]interface{}, len({{ $arg }})) for i := range v { {{- if $convid }}v[i], _ = strconv.Atoi({{ $arg }}[i]){{ else }}v[i] = {{ $arg }}[i]{{ end }} } {{- else if $convid }} id, _ := strconv.Atoi({{ $arg }}) {{- end }} s.Where(sql.{{ call $storage.OpCode $op }}(s.C({{ $.ID.Constant }}), {{ if $op.Variadic }}v...{{ else }}id{{ end }})) } {{- end }} {{ define "dialect/sql/predicate/field" -}} {{- $f := $.Scope.Field -}} func(s *sql.Selector) { s.Where(sql.EQ(s.C({{ $f.Constant }}), v)) } {{- end }} {{ define "dialect/sql/predicate/field/ops" -}} {{- $f := $.Scope.Field -}} {{- $op := $.Scope.Op -}} {{- $arg := $.Scope.Arg -}} {{- $storage := $.Scope.Storage -}} func(s *sql.Selector) { {{- if $op.Variadic }} // if not arguments were provided, append the FALSE constants, // since we can't apply "IN ()". This will make this predicate falsy. if len({{ $arg }}) == 0 { s.Where(sql.False()) return } {{- end }} s.Where(sql.{{ call $storage.OpCode $op }}(s.C({{ $f.Constant }}){{ if not $op.Niladic }}, v{{ if $op.Variadic }}...{{ end }}{{ end }})) } {{- end }} {{ define "dialect/sql/predicate/edge/has" -}} {{- $e := $.Scope.Edge -}} func(s *sql.Selector) { step := sqlgraph.NewStep( sqlgraph.From(Table, {{ $.ID.Constant }}), sqlgraph.To({{ $e.TableConstant }}, {{ $.ID.Constant }}), sqlgraph.Edge(sqlgraph.{{ $e.Rel.Type }}, {{ $e.IsInverse }}, {{ $e.TableConstant }}, {{- if $e.M2M -}} {{ $e.PKConstant }}... {{- else -}} {{ $e.ColumnConstant }} {{- end -}} ), ) sqlgraph.HasNeighbors(s, step) } {{- end }} {{ define "dialect/sql/predicate/edge/haswith" -}} {{- $e := $.Scope.Edge -}} func(s *sql.Selector) { step := sqlgraph.NewStep( sqlgraph.From(Table, {{ $.ID.Constant }}), sqlgraph.To({{ if ne $.Table $e.Type.Table }}{{ $e.InverseTableConstant }}{{ else }}Table{{ end }}, {{ $.ID.Constant }}), sqlgraph.Edge(sqlgraph.{{ $e.Rel.Type }}, {{ $e.IsInverse }}, {{ $e.TableConstant }}, {{- if $e.M2M -}} {{ $e.PKConstant }}... {{- else -}} {{ $e.ColumnConstant }} {{- end -}} ), ) sqlgraph.HasNeighborsWith(s, step, func(s *sql.Selector) { for _, p := range preds { p(s) } }) } {{- end }} {{ define "dialect/sql/predicate/and" -}} func(s *sql.Selector) { s1 := s.Clone().SetP(nil) for _, p := range predicates { p(s1) } s.Where(s1.P()) } {{- end }} {{ define "dialect/sql/predicate/or" -}} func(s *sql.Selector) { s1 := s.Clone().SetP(nil) for i, p := range predicates { if i > 0 { s1.Or() } p(s1) } s.Where(s1.P()) } {{- end }} {{ define "dialect/sql/predicate/not" -}} func(s *sql.Selector) { p(s.Not()) } {{- end }}