Graphql Expert

What it does

This skill assists with reviewing and writing code that utilizes GraphQL, specifically within an oimiragieo backend environment leveraging Apollo Client. It provides guidance on best practices for query construction, schema design, and overall performance optimization. The skill emphasizes secure coding patterns and addresses common anti-patterns to ensure efficient and robust GraphQL implementations.

When to use it

• When developing or reviewing GraphQL queries and mutations in an oimiragieo backend.
• To implement Apollo Client caching and custom hooks for data fetching operations.
• For debugging GraphQL applications using Apollo Client DevTools.
• To ensure secure implementation of GraphQL servers, including query depth/complexity limits and disabling introspection.

Key capabilities

• Apollo Client integration (caching, custom hooks, provider setup)
• GraphQL query component implementation
• Mutation handling for data modifications
• Fragment utilization for reusable query parts
• Error boundary implementation for GraphQL errors
• Adherence to naming conventions for queries, mutations and fragments.
• TypeScript integration for type safety in GraphQL operations
• Enforcement of "Iron Laws" regarding query depth/complexity limits, introspection, DataLoader usage, resolver authorization, and cursor-based pagination.

Example prompts

• “Review this GraphQL mutation for potential performance issues.”
• “How can I implement Apollo Client caching for this data fetching operation?”
• “What are the best practices for securing a GraphQL endpoint in production?”

Tips & gotchas

• This skill is specifically tailored to oimiragieo backends using Apollo Client. Results may vary with other GraphQL implementations.
• Pay close attention to the "Iron Laws" regarding query depth/complexity limits and introspection—failing to implement these can lead to security vulnerabilities or performance degradation.
• DataLoader (or equivalent batching) is crucial for resolvers fetching related entities; neglecting this will likely result in an N+1 problem.