Topics / Early exit and pruning

Performance topic

Early exit and pruning

Stop as soon as the answer is known: bounds checks that skip subtrees, cheap filters before expensive tests, short-circuiting scans.

4,376proven techniques
83pitfalls: tried, then slower
1,120repositories
672from papers

Examples from real commits

jlblancoc/nanoflann 28× Replace per-coordinate antipodal minima sum with block-level chordal bound min(sum d+, sum d-) proof: commit → openwall/john 3× Split PBKDF2 into two stages: compute only 2-byte verifier first, then full key only on match proof: commit →

Languages

  • C++1,708
  • C776
  • Rust415
  • Python224
  • CUDA142
  • Go136

Hardware

  • CPU1,246
  • x86460
  • GPU431
  • NVIDIA GPU360
  • ARM152

Fields

  • graphics993
  • data & compression889
  • general889
  • compilers527
  • math345

Where these come from

Repositories with the most techniques on this topic in the database:

torvalds/linux · 23boostorg/geometry · 20RediSearch/RediSearch · 19dotnet/runtime · 17wiredtiger/wiredtiger · 16ClickHouse/ClickHouse · 16postgres/postgres · 15google/brotli · 15community-shaders/skyrim-community-shaders · 15projectcalico/calico · 15

Ask Claude for the full answer

Each technique comes with its bottleneck, measured speedup, trade-offs, conditions and the commit or paper behind it, served to Claude through MCP.

claude mcp add --transport http adtomic https://www.adtomic.co/mcp

Connect Claude Pricing

Related topics

Bit tricks and strength reductionBatchingSpecialization, templates and JITReducing synchronizationPipelining and async overlap