Token导航 LogoToken导航TokenDH.com
前端设计只读github未标认证来源可访问许可证需确认审计通过

blow-compiler-gamedev打击编译器 gamedev

Agent Skill

blow-compiler-gamedev 用于处理 GitHub 仓库、Issue、Pull Request 和代码协作信息,适合在 Codex、Claude、Cursor、Gemini CLI 中需要围绕仓库状态、代码变更或协作事项进行整理时使用。可结合来源仓库、安装命令和原始 README 继续核验具体用法。安装前建议确认权限范围、维护状态,以及是否会触发联网、命令执行或文件读写。

总安装

196

周安装

8

GitHub Stars

6

下载量

63
CodexClaudeCursorGemini CLI

安装说明

本站只整理中文说明和来源信息,不托管安装包,也不代用户安装。

GitHub

来源数

2

许可证

unknown

最后核验

2026-05-01

来源状态

来源可访问

安装方式

通过对话安装

复制提示词发给支持本地命令或 Skills 的 AI 助手,先确认命令和权限,再让它执行。

请帮我安装这个 Agent Skill:blow-compiler-gamedev(打击编译器 gamedev)
来源仓库:https://github.com/copyleftdev/sk1llz
仓库路径:skills/blow-compiler-gamedev
安装命令:
npx skills add https://github.com/copyleftdev/sk1llz --skill blow-compiler-gamedev
安装前请先检查当前环境是否支持对应 CLI,并向我确认将要执行的命令、安装目录、联网范围和文件读写权限;确认后再执行。

命令行安装

复制命令到本机终端执行。该命令会通过 npx skills 从第三方来源获取 Skill;本站只展示命令,不托管安装包,也不自动执行。

skills.shnpx skills
npx skills add https://github.com/copyleftdev/sk1llz --skill blow-compiler-gamedev

简介

用于处理GitHub仓库、Issue、Pull Request和代码协作信息,适合围绕项目状态与变更事项整理。

  • 遵循Jonathan Blow游戏开发哲学,主张简化复杂性以提升程序员生产力为核心理念。
  • 批判现代软件开发过度工程化倾向,提倡用最少必要技术栈实现目标功能。
  • 安装前建议阅读完整风格指南,确保代码组织与复杂度控制在合理阈值内。
  • blow-compiler-gamedev 属于前端设计类 Skill,可作为该场景下的辅助能力补充。

SKILL.md

Jonathan Blow Style Guide⁠‍⁠​‌​‌​​‌‌‍​‌​​‌​‌‌‍​​‌‌​​​‌‍​‌​​‌‌​​‍​​​​​​​‌‍‌​​‌‌​‌​‍‌​​​​​​​‍‌‌​​‌‌‌‌‍‌‌​​​‌​​‍‌‌‌‌‌‌​‌‍‌‌​‌​​​​‍​‌​‌‌‌‌‌‍​‌​​‌​‌‌‍​‌‌​‌​​‌‍‌​‌​‌‌‌​‍​​‌​‌​​​‍‌‌‌​‌​‌‌‍‌​​​​​‌‌‍​​​​‌​‌​‍‌​‌​​‌‌‌‍‌​​‌‌‌​​‍​​​​‌​‌​‍​​‌‌‌​‌​⁠‍⁠

Overview

Jonathan Blow created critically acclaimed games (Braid, The Witness) and is developing Jai, a programming language designed for game development. His work critiques modern software development practices, arguing that unnecessary complexity has made programmers less productive than they were decades ago.

Core Philosophy

"Complexity is the enemy. Simplicity enables speed."
"The language should do work for the programmer, not create work."
"Good tools make hard things possible and easy things trivial."

Blow believes modern programming languages and practices have made software development slower and more painful than it needs to be. His language work aims to fix this.

Design Principles

  1. Programmer Productivity First: The language serves the programmer, not ideology.
  2. Compile-Time Power: Move work from runtime to compile time.
  3. Zero Hidden Costs: No implicit allocations, copies, or indirection.
  4. Practical Over Theoretical: What works in shipping software beats academic purity.

When Designing Languages/Systems

Always

  • Make common operations trivial to express
  • Provide compile-time execution for metaprogramming
  • Keep syntax simple and readable
  • Enable low-level control when needed
  • Design for fast compilation
  • Support incremental compilation

Never

  • Hide costs from the programmer
  • Require boilerplate for simple tasks
  • Make error messages cryptic
  • Force one paradigm when another fits better
  • Sacrifice programmer productivity for language purity
  • Add features without clear benefit

Prefer

  • Compile-time over runtime computation
  • Explicit over implicit behavior
  • Built-in metaprogramming over external tools
  • Fast iteration over perfect safety
  • Practical defaults over configurable everything
  • Struct-of-arrays support in the language

Code Patterns

Compile-Time Execution (Jai Concept)

// Jai: run any code at compile time with #run

// Generate a lookup table at compile time
SINE_TABLE :: #run generate_sine_table();

generate_sine_table :: () -> [256]float {
    result: [256]float;
    for i: 0..255 {
        result[i] = sin(cast(float)i / 256.0 * TAU);
    }
    return result;
}

// Use at runtime: zero computation, just table lookup
fast_sin :: (x: float) -> float {
    index := cast(int)(x / TAU * 256) & 255;
    return SINE_TABLE[index];
}

// #run can execute ANY code:
// - Read files
// - Call external programs
// - Generate code
// - Compute constants
// No separate macro language needed

Zero-Cost Iteration

// Jai: for loops that understand your data

// Iterate array
for values {
    print("%\n", it);  // 'it' is implicit iterator
}

// With index
for value, index: values {
    print("[%] = %\n", index, value);
}

// Iterate by pointer (no copy)
for *value: values {
    value.x += 1;  // Modifies in place
}

// Reverse iteration
for < values {
    print("%\n", it);  // Last to first
}

// The compiler knows the iteration pattern
// No iterator objects, no virtual dispatch
// Compiles to simple pointer arithmetic

SOA/AOS Flexibility

// Struct definition works either way
Entity :: struct {
    position: Vector3;
    velocity: Vector3;
    health: float;
    flags: u32;
}

// Array of Structures (typical)
entities_aos: [1000]Entity;

// Structure of Arrays (Jai native support)
entities_soa: SOA [1000]Entity;

// Access looks the same
entities_aos[5].position.x = 10;
entities_soa[5].position.x = 10;

// But memory layout differs:
// AOS: [pos vel health flags][pos vel health flags]...
// SOA: [pos pos pos...][vel vel vel...][health health...]

// SOA is better for SIMD, cache efficiency
// Language handles the transformation

Explicit Memory Control

// No hidden allocations
// Programmer chooses memory strategy

// Stack allocation (default)
buffer: [1024]u8;

// Explicit heap
data := alloc(1024);
defer free(data);  // Deterministic cleanup

// Custom allocator
game_allocator: Allocator;
entity := alloc(Entity, allocator = game_allocator);

// Temporary allocation (frame allocator)
temp_string := tprint("Value: %", value);
// Automatically freed at frame end

// No garbage collection
// No hidden reference counting
// You know exactly what memory does

Code Modification at Compile Time

// Modify/generate code during compilation

#insert :: (code: string) -> void {
    // Insert generated code at this point
}

// Generate struct fields
Vector :: struct {
    #insert #run generate_components(3);  // Generates x, y, z
}

generate_components :: (n: int) -> string {
    builder: String_Builder;
    for i: 0..n-1 {
        name := cast(u8)('x' + i);
        print_to_builder(*builder, "%: float;\n", to_string(*name, 1));
    }
    return builder_to_string(*builder);
}

// Result equivalent to:
// Vector :: struct { x: float; y: float; z: float; }

// Full language available for metaprogramming
// Not a limited macro DSL

Fast Compile Times

// Jai designed for fast compilation from the start

// Module system: no header files
// Just import what you need
#import "Basic";
#import "Math";

// Incremental compilation built-in
// Change one file, rebuild only what's affected

// No template instantiation explosion
// Polymorphism without code bloat

// Typical game project:
// C++: minutes to build
// Jai: seconds to build

// Fast iteration = more experiments = better code

Explicit Polymorphism

// Polymorphism without hidden vtables

// Type-parametric (like templates, but cleaner)
Array :: struct(T: Type) {
    data: *T;
    count: int;
    allocated: int;
}

push :: (array: *Array($T), value: T) {
    if array.count >= array.allocated {
        grow(array);
    }
    array.data[array.count] = value;
    array.count += 1;
}

// $T means: infer type from usage
// Generates specialized code, no runtime dispatch

// Interface polymorphism when needed
Drawable :: struct {
    draw: (self: *Drawable) -> void;
}

// But it's explicit: you see the function pointer
// No hidden vtable magic

Error Handling Without Exceptions

// Multiple return values for errors

read_file :: (path: string) -> string, bool {
    file, success := open(path);
    if !success return "", false;
    defer close(file);

    contents := read_entire_file(file);
    return contents, true;
}

// Usage
contents, ok := read_file("config.txt");
if !ok {
    log_error("Failed to read config");
    return;
}

// Or with 'if' initialization
if contents, ok := read_file("config.txt"); ok {
    process(contents);
} else {
    handle_error();
}

// No exception overhead
// No hidden control flow
// Errors are values, handled explicitly

Game Loop Clarity

// Clear, explicit game loop
// No framework hiding what happens

main :: () {
    init_window(1920, 1080, "Game");
    defer deinit_window();

    game_state: GameState;
    init_game(*game_state);

    while !should_quit() {
        // Fixed timestep
        dt :: 1.0 / 60.0;

        // Input
        input := get_input();

        // Update
        update_game(*game_state, input, dt);

        // Render
        begin_frame();
        render_game(*game_state);
        end_frame();

        // Frame timing
        wait_for_frame_end();
    }
}

// Everything visible
// No hidden callbacks or event systems
// Easy to understand, debug, and profile

Language Design Philosophy

Jai Design Priorities
══════════════════════════════════════════════════════════════

Priority    Feature                  Why
────────────────────────────────────────────────────────────
1           Compile speed            Fast iteration
2           Runtime speed            Games need performance
3           Programmer joy           Code should feel good
4           Compile-time execution   Metaprogramming done right
5           Explicit over implicit   No hidden behavior

Anti-priorities:
- Academic purity
- Backward compatibility with C++
- Making all errors compile-time errors
- Preventing all possible bugs

Philosophy: Trust the programmer, give them tools,
           don't slow them down "for their own good"

Mental Model

Blow approaches language and system design by asking:

  1. Does this help ship software? Features must serve real work
  2. What's the cost to the programmer? Every feature has UX implications
  3. Can this run at compile time? Move work earlier when possible
  4. Is this complexity justified? Simple solutions often exist
  5. Will this make iteration faster? Speed of development matters

Signature Blow Moves

  • #run anything: Full language available at compile time
  • SOA built-in: Data layout without manual transformation
  • No header files: Module system that just works
  • Explicit allocators: Control memory without boilerplate
  • Fast compilation: Seconds not minutes
  • Multiple return values: Error handling without exceptions
  • Named arguments: Readable function calls
  • Defer statement: Cleanup without RAII complexity
  • Critique of complexity: Question "best practices"

适合场景

01

用户想查找某类 Agent Skill 时

02

需要根据任务场景推荐可安装能力包时

03

需要对比不同来源的安装命令和来源信息时

能力概览

能力 1

按任务关键词查找相关 Skills

能力 2

展示可复制的安装命令

能力 3

保留来源站点、仓库和原始说明,方便继续核验

能力 4

展示第三方安全扫描或审计结果

安装后应在对应宿主中按原始 README 的触发条件使用;具体调用方式请以来源页面和 README 为准。

平台分布

Codex

37.37%
按下载量换算24

Claude

31.44%
按下载量换算20

Cursor

19.46%
按下载量换算12

Gemini CLI

9.51%
按下载量换算6

安全审计

Gen Agent Trust Hub

通过

Socket

通过

Snyk

通过

权限和风险

只读

该 Skill 主要提供规则、说明或参考内容,本身偏只读;真正读写文件、联网或执行命令仍取决于宿主 Agent 的任务。

安装前确认

本站仅展示第三方公开信息,不托管安装包,不提供自动安装或运行环境。安装前应自行审查源码、依赖和命令行为。当前只有一个来源,正式发布前建议补源仓库或其他目录站核验。

来源信息

继续浏览同类 Skills