Heading rewriting
Open
planning
- Dominant language
- C#
- Stars
- 6
- Forks
- 2
- Avg merge
- 3d 8h
- Merged PRs (30d)
- 4
Description
- Find min(H)
- Apply a D to all H, so that min(H) = 2
- If H < PrevH, then H <= PrevH - 1
```
H1 H2
H2 > H3
H2 H3
```
```
H3 H2 H2
H5 > H4 > H3
H4 H3 H3
```
Contributor guide
No contributing guide indexed for this repository
Research direction
The issue names no file, test, or entry point; start by locating the existing heading-processing logic and its tests. Compare its output with the two examples and implement the stated normalization and decrement rules, with tests showing the resulting heading levels.
Written by the indexing model from the issue text.
Assessment
- Domain
- content
- Issue type
- Feature
- Difficulty
- 3/5
- Estimated time
- 1-2 days
- Activity status
- Quiet
- Clarity
- Needs clarification
- Newbie friendliness
- 45/100