faraday/db/sqlc/querier.go

// Code generated by sqlc. DO NOT EDIT.
// versions:
//   sqlc v1.25.0

package sqlc

import (
	"context"
	"time"
)

type Querier interface {
	GetChannelByChanPoint(ctx context.Context, channelPoint string) (Channel, error)
	GetChannelByShortChanID(ctx context.Context, shortChannelID int64) (Channel, error)
	GetChannelEvents(ctx context.Context, arg GetChannelEventsParams) ([]ChannelEvent, error)
	GetChannels(ctx context.Context) ([]GetChannelsRow, error)
	GetLatestChannelEventBefore(ctx context.Context, arg GetLatestChannelEventBeforeParams) (ChannelEvent, error)
	GetPeerByPubKey(ctx context.Context, pubkey string) (Peer, error)
	InsertChannel(ctx context.Context, arg InsertChannelParams) (int64, error)
	InsertChannelEvent(ctx context.Context, arg InsertChannelEventParams) error
	InsertPeer(ctx context.Context, pubkey string) (int64, error)
	// PruneChannelEventsByAge enforces the retention window on the channel_events
	// table, returning the number of rows deleted. It deletes any row whose
	// timestamp predates the given cutoff.
	PruneChannelEventsByAge(ctx context.Context, timestamp time.Time) (int64, error)
	// PruneChannelEventsBySize enforces the size ceiling on the channel_events
	// table, returning the number of rows deleted. It keeps the newest rows by
	// deleting everything with a smaller (earlier-inserted) id than the id found at
	// the given offset from the newest row, so an offset of (max-events - 1) keeps
	// exactly max-events rows.
	PruneChannelEventsBySize(ctx context.Context, offset int32) (int64, error)
}

var _ Querier = (*Queries)(nil)
db: add chanevents tables and queries 2025-09-24 10:53:42 +02:00			`// Code generated by sqlc. DO NOT EDIT.`
			`// versions:`
			`// sqlc v1.25.0`

			`package sqlc`

			`import (`
			`"context"`
db: add channel event pruning query and index Add a PruneChannelEvents query that bounds the channel_events table by both size and age in a single statement: an id-keyset offset enforces a maximum event count and a timestamp filter enforces a retention window, OR-joined so each limit applies independently. The query returns the number of rows deleted so callers can surface pruning activity. Add a standalone timestamp index so the global age-based prune does not scan the full table. The existing composite index leads with channel_id and cannot serve a channel-agnostic timestamp filter. 2026-06-22 10:10:00 +02:00			`"time"`
db: add chanevents tables and queries 2025-09-24 10:53:42 +02:00			`)`

			`type Querier interface {`
			`GetChannelByChanPoint(ctx context.Context, channelPoint string) (Channel, error)`
			`GetChannelByShortChanID(ctx context.Context, shortChannelID int64) (Channel, error)`
			`GetChannelEvents(ctx context.Context, arg GetChannelEventsParams) ([]ChannelEvent, error)`
chanevents+db: add scid-to-peer index Add ScidToPeerMap, which materialises a snapshot of every short channel id paired with the pubkey of the channel's remote peer. Forwarding-data sources index events by short channel id, but downstream analyses need to attribute behaviour to the peer, not the channel. The map skips channels whose short channel id is still zero (unconfirmed), so callers see only fully advertised channels. Coverage extends TestStore with a two-channel fixture pinning the join. 2026-05-06 07:05:20 +02:00			`GetChannels(ctx context.Context) ([]GetChannelsRow, error)`
chanevents+db: add latest-event-before lookup Add GetLatestChannelUpdateBefore, which fetches the most recent EventTypeUpdate strictly before a given instant. Forwarding-ability analyses that summarise behaviour over a window must seed their state from the channel's balance at the window's lower bound; without the ability to look back past that bound, the first events in the window have no baseline to compare against. The lookup tolerates missing predecessors by returning (nil, nil), letting callers distinguish "no prior update" from a genuine error. Coverage exercises both the present and absent cases against the existing TestStore fixture. 2026-05-06 07:04:27 +02:00			`GetLatestChannelEventBefore(ctx context.Context, arg GetLatestChannelEventBeforeParams) (ChannelEvent, error)`
db: add chanevents tables and queries 2025-09-24 10:53:42 +02:00			`GetPeerByPubKey(ctx context.Context, pubkey string) (Peer, error)`
			`InsertChannel(ctx context.Context, arg InsertChannelParams) (int64, error)`
			`InsertChannelEvent(ctx context.Context, arg InsertChannelEventParams) error`
			`InsertPeer(ctx context.Context, pubkey string) (int64, error)`
db: add channel event pruning query and index Add a PruneChannelEvents query that bounds the channel_events table by both size and age in a single statement: an id-keyset offset enforces a maximum event count and a timestamp filter enforces a retention window, OR-joined so each limit applies independently. The query returns the number of rows deleted so callers can surface pruning activity. Add a standalone timestamp index so the global age-based prune does not scan the full table. The existing composite index leads with channel_id and cannot serve a channel-agnostic timestamp filter. 2026-06-22 10:10:00 +02:00			`// PruneChannelEventsByAge enforces the retention window on the channel_events`
			`// table, returning the number of rows deleted. It deletes any row whose`
			`// timestamp predates the given cutoff.`
			`PruneChannelEventsByAge(ctx context.Context, timestamp time.Time) (int64, error)`
			`// PruneChannelEventsBySize enforces the size ceiling on the channel_events`
			`// table, returning the number of rows deleted. It keeps the newest rows by`
			`// deleting everything with a smaller (earlier-inserted) id than the id found at`
			`// the given offset from the newest row, so an offset of (max-events - 1) keeps`
			`// exactly max-events rows.`
			`PruneChannelEventsBySize(ctx context.Context, offset int32) (int64, error)`
db: add chanevents tables and queries 2025-09-24 10:53:42 +02:00			`}`

			`var _ Querier = (*Queries)(nil)`