How does this skill improve game FPS?

It reduces the workload on the Garbage Collector by preventing the creation of temporary objects and arrays, which are the primary cause of frame 'hiccups' or stutters in managed languages.

What is 'in-place filtering' in game development?

In-place filtering is a technique where an array is modified directly using a swap-and-truncate method instead of creating a new array, saving memory and processing time.

Can this skill help with large-scale entity interactions?

Yes, it provides implementation patterns for spatial hash grids, which allow you to perform proximity queries (like finding nearby enemies) in O(n) time instead of O(n²).

When should I activate the game-perf skill?

You should use this skill proactively whenever you are editing code that executes every frame, such as tick handlers, physics updates, AI behaviors, or render functions.

Game Performance Optimizer

Name: Game Performance Optimizer
Author: rbergman

byrbergman

•

Game Development

Optimizes game logic and rendering code to reduce garbage collection pressure and ensure high-frame-rate performance.

About

The game-perf skill provides a comprehensive set of patterns and best practices for writing high-performance, allocation-free game code. It specifically targets 'hot paths' in game development—such as update loops, physics calculations, and render cycles—where minor allocations can lead to frame stutters due to garbage collection. By identifying common anti-patterns like array spread operators or frequent object creation and providing production-ready alternatives like scratch buffers, in-place filtering, and spatial hashing, this skill helps developers maintain smooth 60+ FPS performance in complex web and desktop games.

Key Features

Offers object pooling strategies for frequent entity creation and destruction
Provides zero-allocation alternatives for array filtering and mapping
1 GitHub stars
Standardizes the use of scratch buffers and readonly signals for transient data
Implements spatial partitioning patterns for optimized proximity queries
Identifies GC-heavy anti-patterns in high-frequency game loops

Use Cases

Reducing frame stuttering caused by frequent garbage collection in JavaScript engines
Refactoring collision detection logic to use spatial hashing for better scaling
Optimizing render and update loops for high-performance web games

About

Key Features

Offers object pooling strategies for frequent entity creation and destruction
Provides zero-allocation alternatives for array filtering and mapping
1 GitHub stars
Standardizes the use of scratch buffers and readonly signals for transient data
Implements spatial partitioning patterns for optimized proximity queries
Identifies GC-heavy anti-patterns in high-frequency game loops

Use Cases

Reducing frame stuttering caused by frequent garbage collection in JavaScript engines
Refactoring collision detection logic to use spatial hashing for better scaling
Optimizing render and update loops for high-performance web games