snapshot of https://github.com/sqlc-dev/sqlc.git (main, 2026-09-16; blobs > 131072B omitted)

internal/endtoend/testdata/cte_recursive_star/postgresql/pgx/go/db.go

@@ -0,0 +1,32 @@
+// Code generated by sqlc. DO NOT EDIT.
+// versions:
+//   sqlc v1.31.1
+
+package querytest
+
+import (
+	"context"
+
+	"github.com/jackc/pgx/v5"
+	"github.com/jackc/pgx/v5/pgconn"
+)
+
+type DBTX interface {
+	Exec(context.Context, string, ...any) (pgconn.CommandTag, error)
+	Query(context.Context, string, ...any) (pgx.Rows, error)
+	QueryRow(context.Context, string, ...any) pgx.Row
+}
+
+func New(db DBTX) *Queries {
+	return &Queries{db: db}
+}
+
+type Queries struct {
+	db DBTX
+}
+
+func (q *Queries) WithTx(tx pgx.Tx) *Queries {
+	return &Queries{
+		db: tx,
+	}
+}

internal/endtoend/testdata/cte_recursive_star/postgresql/pgx/go/models.go

@@ -0,0 +1,27 @@
+// Code generated by sqlc. DO NOT EDIT.
+// versions:
+//   sqlc v1.31.1
+
+package querytest
+
+import (
+	"github.com/jackc/pgx/v5/pgtype"
+)
+
+type Dict struct {
+	ID         string
+	AppID      string
+	Code       pgtype.Text
+	ParentCode string
+	Label      string
+	Value      pgtype.Text
+	Weight     int32
+	IsDefault  bool
+	IsVirtual  bool
+	Status     int16
+	CreateAt   pgtype.Timestamptz
+	CreateBy   string
+	UpdateAt   pgtype.Timestamptz
+	UpdateBy   pgtype.Text
+	IsDelete   bool
+}

internal/endtoend/testdata/cte_recursive_star/postgresql/pgx/go/query.sql.go

@@ -0,0 +1,59 @@
+// Code generated by sqlc. DO NOT EDIT.
+// versions:
+//   sqlc v1.31.1
+// source: query.sql
+
+package querytest
+
+import (
+	"context"
+
+	"github.com/jackc/pgx/v5/pgtype"
+)
+
+const getDictTree = `-- name: GetDictTree :many
+with recursive dictTree(id, code, parent_code, label, value, path, depth) AS (
+	select id, code, parent_code, label, value, ARRAY[COALESCE((select id from dict where code=''),'virtual_root'), id], 1 as depth from dict where app_id = '1' and parent_code = '' and is_delete=false
+	union
+		select d.id, d.code, d.parent_code, d.label, d.value, t.path || ARRAY[d.id], t.depth+1 as depth from dict d join dictTree t on d.parent_code = t.code and not d.id = ANY(t.path) and d.is_delete=false
+)
+select id, code, parent_code, label, value, path, depth from dictTree d order by depth, parent_code
+`
+
+type GetDictTreeRow struct {
+	ID         string
+	Code       pgtype.Text
+	ParentCode string
+	Label      string
+	Value      pgtype.Text
+	Path       []string
+	Depth      int32
+}
+
+func (q *Queries) GetDictTree(ctx context.Context) ([]GetDictTreeRow, error) {
+	rows, err := q.db.Query(ctx, getDictTree)
+	if err != nil {
+		return nil, err
+	}
+	defer rows.Close()
+	var items []GetDictTreeRow
+	for rows.Next() {
+		var i GetDictTreeRow
+		if err := rows.Scan(
+			&i.ID,
+			&i.Code,
+			&i.ParentCode,
+			&i.Label,
+			&i.Value,
+			&i.Path,
+			&i.Depth,
+		); err != nil {
+			return nil, err
+		}
+		items = append(items, i)
+	}
+	if err := rows.Err(); err != nil {
+		return nil, err
+	}
+	return items, nil
+}