Skip to content

Fix ancestor handling #1646

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
waylan merged 2 commits into from
Sep 30, 2026
Merged

Fix ancestor handling #1646

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
67ab95d
Fix ancestor handling
facelessuser Sep 30, 2026
4ce0baa
Update changelog
facelessuser Sep 30, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
1 change: 1 addition & 0 deletions docs/changelog.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15,6 +15,7 @@ See the [Contributing Guide](contributing.md) for details.
## [Unreleased]

* Update serializer to be non-recursive (#1644).
* Improve ancestor handling in the inline `Treeprocessor` (#1646).

## [3.11.0] - 2026-09-25

Expand Down
4 changes: 3 additions & 1 deletion markdown/treeprocessors.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -371,12 +371,14 @@ def run(self, tree: etree.Element, ancestors: list[str] | None = None) -> etree.

self.parent_map = {c: p for p in tree.iter() for c in p}
stack = [(tree, tree_parents)]
self.__build_ancestors(tree, tree_parents)

while stack:
currElement, parents = stack.pop(0)

self.ancestors = parents
self.__build_ancestors(currElement, self.ancestors)
if currElement is not tree:
self.ancestors.append(currElement.tag.lower())

insertQueue = []
for child in currElement:
Expand Down
Loading