メニュー
SkillsMP は jimmc414/claude-code-plugin-marketplace から 65 件の skill を収集しています。skill を開くとソースと詳細を確認できます。
収集済み skill 65 件中 40 件を表示しています。
Conducts iterative deep research on any topic using web search, progressive exploration, and structured synthesis. Use when asked for comprehensive research, deep investigation, thorough analysis, or multi-source exploration of any topic. Triggers: research,…
原文の言語: 英語
For cross-cutting concerns: add behavior without modifying functions, caching, timing, logging, validation wrappers.
原文の言語: 英語
For performance work: measure before changing, profile to find bottlenecks, compare before and after.
原文の言語: 英語
For symbolic computation: ASTs, mathematical expressions, code that manipulates code structure, expression transformations.
原文の言語: 英語
For ordered processing: A* search, Dijkstra, event simulation, task scheduling. Efficient min/max extraction with heap-based queue.
原文の言語: 英語
For dynamic programming: overlapping subproblems, recursive solutions with repeated computations, memoization to avoid redundant work.
原文の言語: 英語
For persistent state: closures capture outer variables, alternative to classes for simple state, factory functions that remember context.
原文の言語: 英語
For flexible parsing: try multiple type conversions in order, graceful fallback from specific to general types.
原文の言語: 英語
For iteration with errors: catch exceptions during exploration, skip invalid cases, continue to next attempt.
原文の言語: 英語
For hot loop optimization: repeated formula evaluation, regex patterns, expression compilation. Transform string to callable once, call many times.
原文の言語: 英語
For complex behavior: build from tiny functions, chain transformations, make code read like a pipeline of operations.
原文の言語: 英語
For probability and counting: permutations, combinations, sample spaces, Monte Carlo simulation, brute-force enumeration, card/dice problems.
原文の言語: 英語
For new modules: define type aliases as vocabulary, make code self-documenting, create domain-specific language feel.
原文の言語: 英語
For heterogeneous data: pattern matching on type/structure, interpreter eval loops, handling different expression types.
原文の言語: 英語
For 2D debugging: visualize grid/board state, show puzzle progress, make algorithm behavior visible.
原文の言語: 英語
For cross-version support: try/except imports, optional dependencies, graceful degradation across Python versions.
原文の言語: 英語
For computational geometry: convex hull, point enclosure, polygon operations. Uses monotone chain algorithm with stack-based turn detection.
原文の言語: 英語
For pathfinding and search: shortest path, maze solving, game AI, route planning, graph traversal, BFS/DFS, Dijkstra, A* problems.
原文の言語: 英語
For result reporting: tabular output, aligned columns, statistics summaries, human-readable reports.
原文の言語: 英語
For graph exploration: frontier collection with configurable pop order, BFS/DFS/random via strategy change.
原文の言語: 英語
For tree/maze generation: spanning trees, random mazes, graph coverage. Uses frontier-based exploration with configurable traversal order.
原文の言語: 英語
For boundary conditions: empty collections, zero values, recursive base cases, null checks, prevent crashes at edges.
原文の言語: 英語
For fast comparison: ensure only one instance of each symbol, use 'is' instead of '==', symbol tables for interpreters.
原文の言語: 英語
For combinatorial iteration: permutations, combinations, cartesian products, without storing all results in memory.
原文の言語: 英語
For two-sided matching: hospital-resident, stable marriage, college admissions. Gale-Shapley algorithm for stable matching with preferences.
原文の言語: 英語
For NP-hard optimization: TSP, scheduling, assignment problems. Uses greedy construction + local improvement (2-opt, hill climbing).
原文の言語: 英語
For domain-specific languages: operator overloading, make Python look like math/domain notation, expression builders.
原文の言語: 英語
For text processing: extract numbers, words, structured data from messy text using regex patterns, parsing utilities.
原文の言語: 英語
For generic algorithms: strategy pattern, callbacks, configurable behavior. Pass functions as parameters to customize algorithm behavior.
原文の言語: 英語
For static relationships: graph structure, grid neighbors, constraint peers. Calculate once at module load, reference throughout program.
原文の言語: 英語
For constraint problems: eliminate impossibilities before guessing, reduce search space through inference, fail fast on contradictions.
原文の言語: 英語
For long functions: break into smaller pieces, extract helper functions, reduce nesting, improve testability and readability.
原文の言語: 英語
For graceful failure: return None or False instead of exceptions, let caller decide how to handle failure.
原文の言語: 英語
For comparison: display before/after, multiple solutions, diffs side by side for visual comparison.
原文の言語: 英語
For constraint satisfaction: Sudoku, scheduling, N-queens, logic puzzles, SAT-like problems, assignment problems. Uses propagate-then-search pattern.
原文の言語: 英語
For 2D grid problems: mazes, board games, tile maps, pixel grids, coordinate systems, cellular automata, flood fill. Uses dict-based Grid class pattern.
原文の言語: 英語
For search with undo: explicit decision stack, backtracking when paths fail, depth-first exploration with state restoration.
原文の言語: 英語
For data structure validation: test lengths, relationships, constraints that must hold, verify setup is correct.
原文の言語: 英語
For example-driven development: test cases as specifications, input/output pairs, documentation through examples.
原文の言語: 英語
For performance reporting: timing wrappers, throughput calculations, profiling summaries.
原文の言語: 英語