Agent skill · Databases

c_heap_file_chunk_management_and_sorting

Implements C functions for managing heap file chunks (retrieval, iteration, printing) and sorting them in-place using quicksort, adhering to specific block arithmetic and HP layer constraints.

ECNU-ICALKgithub.com/ECNU-ICALKGitHub ↗
claude-code
Install
npx skills add ECNU-ICALK/AutoSkill --skill c_heap_file_chunk_management_and_sorting --agent claude-code

Same command for any agent — swap --agent for codex, cursor, copilot.

Facts
Files in the skill folder: 1
SKILL.md size: 4 KB
Bundled scripts: none
Version: 0.1.1
Path: SkillBank/ConvSkill/english_gpt4_8/c_heap_file_chunk_management_and_sorting/SKILL.md
Open the folder on GitHub →
Where it comes from
Stars: 539
Language: Python

Weekly change comes from our own snapshots, not the repository page — it measures attention, not adoption.

From the SKILL.md

# c_heap_file_chunk_management_and_sorting Implements C functions for managing heap file chunks (retrieval, iteration, printing) and sorting them in-place using quicksort, adhering to specific block arithmetic and HP layer constraints. ## Prompt # Role & Objective You are a C Database Systems Developer. Your task is to implement functions for managing 'CHUNK' structures in a heap file system and sorting them. This includes implementing retrieval logic, iteration, printing, and in-place sorting algorithms based on provided headers and specific logic constraints. # Communication & Style Preferences - Provide C code implementations. - Use the provided helper functions (e.g., HP_GetRecord, HP_GetMaxRecordsInBlock) as black boxes unless specified otherwise. - Adhere strictly to the function prototypes provided in the headers. - Ensure code is compatible with standard C libraries (e.g., string.h for strcmp). # Operational Rules & Constraints 1. **Block Assumption**: Always assume that all blocks are full except for the last one. 2. **Sorting Algorithm**: Use the Quicksort algorithm for sorting. 3. **In-Place Sorting**: Do not load all records into a memory array. Perform sorting directly

What's inside
Steps it walks through
  1. Prompt
  2. 1. Chunk Management Implementation
  3. 2. Sorting Implementation
  4. Triggers
More from AutoSkill
All skills →
About this skill
What does the c_heap_file_chunk_management_and_sorting skill do?

Implements C functions for managing heap file chunks (retrieval, iteration, printing) and sorting them in-place using quicksort, adhering to specific block arithmetic and HP layer constraints.

How do I install it?

Run `npx skills add ECNU-ICALK/AutoSkill --skill c_heap_file_chunk_management_and_sorting --agent claude-code` — it drops the skill into your project so the agent can pick it up. Swap the --agent value for codex, cursor or copilot if you use one of those.

Where does this skill come from?

From ECNU-ICALK/AutoSkill, a repository with 539 stars. We read it straight from the repository tree rather than a submitted listing, so what you see here is what is actually published.

Is a popular skill a good skill?

Not necessarily. Stars measure attention, not adoption — a repository can trend for a week and be abandoned. That is why we show the weekly change from our own snapshots next to the total, instead of a single flattering number.

Keep going