performance-oracle

Analyzes code for performance bottlenecks, algorithmic complexity, and database queries.

Updated Jun 28, 2022
One-click install
npx skills add https://github.com/pcasaretto/nix-home --skill performance-oracle-pcasaretto
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: performance-oracle
Source: https://github.com/pcasaretto/nix-home/tree/main/home-manager/modules/common/pi/compound-engineering/skills/performance-oracle
Command: npx skills add https://github.com/pcasaretto/nix-home --skill performance-oracle-pcasaretto

SYSTEM DOCUMENTATION & REQUIREMENTS

What problem does it solve?

This Skill identifies and resolves performance bottlenecks in software, ensuring code runs efficiently and scales effectively.

Core Features & Use Cases

  • Algorithmic Complexity Analysis: Detects inefficient algorithms (e.g., O(n²)).
  • Database Optimization: Flags N+1 queries and missing indexes.
  • Memory Management: Identifies memory leaks and unbounded data structures.
  • Scalability Assessment: Projects performance under increased load.
  • Use Case: After implementing a new feature, use this Skill to analyze its performance, identify potential bottlenecks, and ensure it scales efficiently before deployment.

Quick Start

Analyze the performance of the recently implemented user analytics feature.

Frequently Asked Questions about performance-oracle

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I analyze code for performance bottlenecks after implementing a new feature?

Code review for performance evaluates time and space complexity, database indexing, memory leaks, and caching opportunities to identify inefficiencies and enforce standards for algorithmic efficiency, query performance, and API response times.

How do I detect inefficient algorithms and high algorithmic complexity in my codebase?

Detect inefficient algorithms by evaluating time and space complexity to identify patterns like O(n²) operations, unbounded data structures, and other algorithmic inefficiencies that degrade software performance under load.

What is the best way to optimize database queries and fix N+1 issues?

Optimize database queries by flagging N+1 issues, evaluating database indexing strategies, and enforcing standards for query performance to resolve inefficient data retrieval and improve API response times.

How do I identify memory leaks and unbounded data structures during code review?

Identify memory leaks by analyzing memory usage patterns and unbounded data structures during code review, pinpointing allocation issues and enforcing standards for algorithmic efficiency to ensure scalable applications.

Can I use this approach to assess scalability and performance under increased load?

Yes, you can assess scalability by projecting performance under increased load, evaluating algorithmic complexity, network optimization, and caching opportunities to ensure code runs efficiently and scales effectively.