comtains 0.1.0

Zero-allocation byte-set matcher generated at compile time
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

# Performance Ideas

The current macro already emits a branch-ordered decision tree, but the following tweaks would shave extra instructions from the hot path:

1. **Unchecked Access:** Replace `candidate.get(depth)` with:
   ```rust
   if len <= depth {
       len == depth && terminal
   } else {
       let byte = unsafe { *candidate.get_unchecked(depth) };
       match byte { ... }
   }
   ```
   This keeps the bounds check but removes the `Option` construction.

2. **Single-Child Nodes:** When a node has exactly one edge, emit a simple `if byte == X { ... } else { false }` rather than a two-arm `match`.

3. **Linear Tail Collapse:** Recognize long chains with no branching and emit a single `candidate.len() == depth + k && candidate[depth..] == [..]` comparison to avoid repeated byte dispatch.

Each idea preserves the zero-allocation property while reducing instruction count for tight loops.