todopulid

README

todo example with PULIDs (Prefixed ULIDs).

PULIDs are an identifier encoding scheme that builds upon the excellent [ULID](Universally Unique Lexicographically Sortable Identifier) scheme. Prefixes should maintain compatibility with base32. If constrained to 2 characters for encoding the entity type, the number of types of entities that can be referenced with this scheme is 2^32 (1024).

Documentation

Index

• func NewExecutableSchema(cfg Config) graphql.ExecutableSchema
• func NewSchema(client *ent.Client) graphql.ExecutableSchema
• type ComplexityRoot
• type Config
• type DirectiveRoot
• type MutationResolver
• type QueryResolver
• type Resolver
  • func (r *Resolver) Mutation() MutationResolver
  • func (r *Resolver) Query() QueryResolver
• type ResolverRoot
• type TodoInput

Functions

func NewExecutableSchema

func NewExecutableSchema(cfg Config) graphql.ExecutableSchema

NewExecutableSchema creates an ExecutableSchema from the ResolverRoot interface.

func NewSchema

func NewSchema(client *ent.Client) graphql.ExecutableSchema

NewSchema creates a graphql executable schema.

Types

type ComplexityRoot

type ComplexityRoot struct {
	Mutation struct {
		ClearTodos func(childComplexity int) int
		CreateTodo func(childComplexity int, todo TodoInput) int
	}

	PageInfo struct {
		EndCursor       func(childComplexity int) int
		HasNextPage     func(childComplexity int) int
		HasPreviousPage func(childComplexity int) int
		StartCursor     func(childComplexity int) int
	}

	Query struct {
		Node  func(childComplexity int, id pulid.ID) int
		Nodes func(childComplexity int, ids []pulid.ID) int
		Todos func(childComplexity int, after *ent.Cursor, first *int, before *ent.Cursor, last *int, orderBy *ent.TodoOrder) int
	}

	Todo struct {
		Children  func(childComplexity int) int
		CreatedAt func(childComplexity int) int
		ID        func(childComplexity int) int
		Parent    func(childComplexity int) int
		Priority  func(childComplexity int) int
		Status    func(childComplexity int) int
		Text      func(childComplexity int) int
	}

	TodoConnection struct {
		Edges      func(childComplexity int) int
		PageInfo   func(childComplexity int) int
		TotalCount func(childComplexity int) int
	}

	TodoEdge struct {
		Cursor func(childComplexity int) int
		Node   func(childComplexity int) int
	}
}

type Config

type Config struct {
	Resolvers  ResolverRoot
	Directives DirectiveRoot
	Complexity ComplexityRoot
}

type DirectiveRoot

type DirectiveRoot struct {
}

type MutationResolver

type MutationResolver interface {
	CreateTodo(ctx context.Context, todo TodoInput) (*ent.Todo, error)
	ClearTodos(ctx context.Context) (int, error)
}

type QueryResolver

type QueryResolver interface {
	Node(ctx context.Context, id pulid.ID) (ent.Noder, error)
	Nodes(ctx context.Context, ids []pulid.ID) ([]ent.Noder, error)
	Todos(ctx context.Context, after *ent.Cursor, first *int, before *ent.Cursor, last *int, orderBy *ent.TodoOrder) (*ent.TodoConnection, error)
}

type Resolver

type Resolver struct {
	// contains filtered or unexported fields
}

Resolver is the resolver root.

func (*Resolver) Mutation

func (r *Resolver) Mutation() MutationResolver

Mutation returns MutationResolver implementation.

func (*Resolver) Query

func (r *Resolver) Query() QueryResolver

Query returns QueryResolver implementation.

type ResolverRoot

type ResolverRoot interface {
	Mutation() MutationResolver
	Query() QueryResolver
}

type TodoInput

type TodoInput struct {
	Status   todo.Status `json:"status"`
	Priority *int        `json:"priority"`
	Text     string      `json:"text"`
	Parent   *pulid.ID   `json:"parent"`
}