Mf2 conversion algorithm
Nobody has claimed this yet.
- Dominant language
- HTML
- Stars
- 12
- Forks
- 4
- PR merge metrics
- No merged PRs in 30d
Description
One of the big missing pieces for jf2 right now seems to be a standard algorithm for finding from mf2. Parsing HTML into mf2 is much more mature and standardized than parsing it into jf2, and many systems store mf2, so formalizing a conversion process would be useful.
May not be easy, since mf2 is so flexible and comes in so many shapes in the wild, but would be useful!
Contributor guide
No contributing guide indexed for this repository
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
No files, tests, or entry points are identified in the issue. Start by reviewing the existing jf2 and mf2 conversion work and the known mf2 shapes, then define the formal conversion requirements; done would mean an agreed standard algorithm, but the issue does not specify acceptance tests.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- html
- Domain
- web-dev
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 25/100