-
Notifications
You must be signed in to change notification settings - Fork 1k
Expand file tree
/
Copy pathquery.sql.go
More file actions
62 lines (54 loc) · 1.27 KB
/
query.sql.go
File metadata and controls
62 lines (54 loc) · 1.27 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
// Code generated by sqlc. DO NOT EDIT.
// versions:
// sqlc v1.30.0
// source: query.sql
package querytest
import (
"context"
)
const getReferralChain = `-- name: GetReferralChain :many
WITH RECURSIVE referral_chain AS (
SELECT user_id,
referrer_id,
1 AS level
FROM user_referrals r
WHERE r.user_id = $1
UNION ALL
SELECT r.user_id,
r.referrer_id,
rc.level + 1
FROM user_referrals r
JOIN referral_chain rc ON r.user_id = rc.referrer_id
WHERE rc.level < $2
)
SELECT user_id, referrer_id, level
FROM referral_chain
`
type GetReferralChainParams struct {
UserID int64
Level int32
}
type GetReferralChainRow struct {
UserID int64
ReferrerID int64
Level int32
}
func (q *Queries) GetReferralChain(ctx context.Context, arg GetReferralChainParams) ([]GetReferralChainRow, error) {
rows, err := q.db.Query(ctx, getReferralChain, arg.UserID, arg.Level)
if err != nil {
return nil, err
}
defer rows.Close()
var items []GetReferralChainRow
for rows.Next() {
var i GetReferralChainRow
if err := rows.Scan(&i.UserID, &i.ReferrerID, &i.Level); err != nil {
return nil, err
}
items = append(items, i)
}
if err := rows.Err(); err != nil {
return nil, err
}
return items, nil
}