generated

package
v0.9.5 Latest Latest
Warning

This package is not in the latest version of its module.

Go to latest
Published: Jul 23, 2021 License: MIT Imports: 12 Imported by: 0

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

func NewExecutableSchema

func NewExecutableSchema(cfg Config) graphql.ExecutableSchema

NewExecutableSchema creates an ExecutableSchema from the ResolverRoot interface.

Types

type ComplexityRoot

type ComplexityRoot struct {
	MemPoolTx struct {
		From         func(childComplexity int) int
		Gas          func(childComplexity int) int
		GasPrice     func(childComplexity int) int
		GasPriceGwei func(childComplexity int) int
		Hash         func(childComplexity int) int
		Input        func(childComplexity int) int
		Nonce        func(childComplexity int) int
		PendingFor   func(childComplexity int) int
		Pool         func(childComplexity int) int
		QueuedFor    func(childComplexity int) int
		R            func(childComplexity int) int
		S            func(childComplexity int) int
		To           func(childComplexity int) int
		V            func(childComplexity int) int
		Value        func(childComplexity int) int
	}

	Query struct {
		PendingDuplicates           func(childComplexity int, hash string) int
		PendingForLessThan          func(childComplexity int, x string) int
		PendingForMoreThan          func(childComplexity int, x string) int
		PendingFrom                 func(childComplexity int, addr string) int
		PendingTo                   func(childComplexity int, addr string) int
		PendingWithLessThan         func(childComplexity int, x float64) int
		PendingWithMoreThan         func(childComplexity int, x float64) int
		QueuedDuplicates            func(childComplexity int, hash string) int
		QueuedForLessThan           func(childComplexity int, x string) int
		QueuedForMoreThan           func(childComplexity int, x string) int
		QueuedFrom                  func(childComplexity int, addr string) int
		QueuedTo                    func(childComplexity int, addr string) int
		QueuedWithLessThan          func(childComplexity int, x float64) int
		QueuedWithMoreThan          func(childComplexity int, x float64) int
		TopXPendingWithHighGasPrice func(childComplexity int, x int) int
		TopXPendingWithLowGasPrice  func(childComplexity int, x int) int
		TopXQueuedWithHighGasPrice  func(childComplexity int, x int) int
		TopXQueuedWithLowGasPrice   func(childComplexity int, x int) int
	}

	Subscription struct {
		MemPool                 func(childComplexity int) int
		NewConfirmedTx          func(childComplexity int) int
		NewConfirmedTxFrom      func(childComplexity int, address string) int
		NewConfirmedTxTo        func(childComplexity int, address string) int
		NewPendingTx            func(childComplexity int) int
		NewPendingTxFrom        func(childComplexity int, address string) int
		NewPendingTxTo          func(childComplexity int, address string) int
		NewQueuedTx             func(childComplexity int) int
		NewQueuedTxFrom         func(childComplexity int, address string) int
		NewQueuedTxTo           func(childComplexity int, address string) int
		NewTxFromAInMemPool     func(childComplexity int, address string) int
		NewTxFromAInPendingPool func(childComplexity int, address string) int
		NewTxFromAInQueuedPool  func(childComplexity int, address string) int
		NewTxToAInMemPool       func(childComplexity int, address string) int
		NewTxToAInPendingPool   func(childComplexity int, address string) int
		NewTxToAInQueuedPool    func(childComplexity int, address string) int
		NewUnstuckTx            func(childComplexity int) int
		NewUnstuckTxFrom        func(childComplexity int, address string) int
		NewUnstuckTxTo          func(childComplexity int, address string) int
		PendingPool             func(childComplexity int) int
		QueuedPool              func(childComplexity int) int
		WatchTx                 func(childComplexity int, hash string) int
	}
}

type Config

type Config struct {
	Resolvers  ResolverRoot
	Directives DirectiveRoot
	Complexity ComplexityRoot
}

type DirectiveRoot

type DirectiveRoot struct {
}

type QueryResolver

type QueryResolver interface {
	PendingForMoreThan(ctx context.Context, x string) ([]*model.MemPoolTx, error)
	PendingForLessThan(ctx context.Context, x string) ([]*model.MemPoolTx, error)
	QueuedForMoreThan(ctx context.Context, x string) ([]*model.MemPoolTx, error)
	QueuedForLessThan(ctx context.Context, x string) ([]*model.MemPoolTx, error)
	PendingFrom(ctx context.Context, addr string) ([]*model.MemPoolTx, error)
	PendingTo(ctx context.Context, addr string) ([]*model.MemPoolTx, error)
	QueuedFrom(ctx context.Context, addr string) ([]*model.MemPoolTx, error)
	QueuedTo(ctx context.Context, addr string) ([]*model.MemPoolTx, error)
	TopXPendingWithHighGasPrice(ctx context.Context, x int) ([]*model.MemPoolTx, error)
	TopXQueuedWithHighGasPrice(ctx context.Context, x int) ([]*model.MemPoolTx, error)
	TopXPendingWithLowGasPrice(ctx context.Context, x int) ([]*model.MemPoolTx, error)
	TopXQueuedWithLowGasPrice(ctx context.Context, x int) ([]*model.MemPoolTx, error)
	PendingDuplicates(ctx context.Context, hash string) ([]*model.MemPoolTx, error)
	QueuedDuplicates(ctx context.Context, hash string) ([]*model.MemPoolTx, error)
	PendingWithMoreThan(ctx context.Context, x float64) ([]*model.MemPoolTx, error)
	PendingWithLessThan(ctx context.Context, x float64) ([]*model.MemPoolTx, error)
	QueuedWithMoreThan(ctx context.Context, x float64) ([]*model.MemPoolTx, error)
	QueuedWithLessThan(ctx context.Context, x float64) ([]*model.MemPoolTx, error)
}

type ResolverRoot

type ResolverRoot interface {
	Query() QueryResolver
	Subscription() SubscriptionResolver
}

type SubscriptionResolver added in v0.3.0

type SubscriptionResolver interface {
	NewPendingTx(ctx context.Context) (<-chan *model.MemPoolTx, error)
	NewQueuedTx(ctx context.Context) (<-chan *model.MemPoolTx, error)
	NewConfirmedTx(ctx context.Context) (<-chan *model.MemPoolTx, error)
	NewUnstuckTx(ctx context.Context) (<-chan *model.MemPoolTx, error)
	PendingPool(ctx context.Context) (<-chan *model.MemPoolTx, error)
	QueuedPool(ctx context.Context) (<-chan *model.MemPoolTx, error)
	MemPool(ctx context.Context) (<-chan *model.MemPoolTx, error)
	NewPendingTxFrom(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewQueuedTxFrom(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewConfirmedTxFrom(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewUnstuckTxFrom(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewTxFromAInPendingPool(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewTxFromAInQueuedPool(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewTxFromAInMemPool(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewPendingTxTo(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewQueuedTxTo(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewConfirmedTxTo(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewUnstuckTxTo(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewTxToAInPendingPool(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewTxToAInQueuedPool(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	NewTxToAInMemPool(ctx context.Context, address string) (<-chan *model.MemPoolTx, error)
	WatchTx(ctx context.Context, hash string) (<-chan *model.MemPoolTx, error)
}

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL