{"id":13961503,"url":"https://github.com/baskerville/paragraph-breaker","last_synced_at":"2025-07-21T06:31:01.092Z","repository":{"id":57652740,"uuid":"120349874","full_name":"baskerville/paragraph-breaker","owner":"baskerville","description":"An implementation of the Knuth-Plass algorithm for breaking paragraphs into lines","archived":false,"fork":false,"pushed_at":"2021-05-01T09:45:12.000Z","size":26,"stargazers_count":18,"open_issues_count":1,"forks_count":0,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-06-09T01:05:11.115Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Rust","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/baskerville.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE-MIT","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2018-02-05T19:17:02.000Z","updated_at":"2025-04-14T07:41:50.000Z","dependencies_parsed_at":"2022-08-25T20:20:35.926Z","dependency_job_id":null,"html_url":"https://github.com/baskerville/paragraph-breaker","commit_stats":null,"previous_names":[],"tags_count":15,"template":false,"template_full_name":null,"purl":"pkg:github/baskerville/paragraph-breaker","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/baskerville%2Fparagraph-breaker","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/baskerville%2Fparagraph-breaker/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/baskerville%2Fparagraph-breaker/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/baskerville%2Fparagraph-breaker/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/baskerville","download_url":"https://codeload.github.com/baskerville/paragraph-breaker/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/baskerville%2Fparagraph-breaker/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":266253498,"owners_count":23900051,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-08-08T17:01:12.105Z","updated_at":"2025-07-21T06:31:00.840Z","avatar_url":"https://github.com/baskerville.png","language":"Rust","funding_links":[],"categories":["Rust"],"sub_categories":[],"readme":"The algorithms implemented in this library, *total fit* and *standard fit*, are described in \u003ccite\u003e\u003ci\u003eBreaking Paragraphs into Lines\u003c/i\u003e (1981) by Donald Knuth and Michael Plass\u003c/cite\u003e. The *standard fit* algorithm is only provided as a fallback to *total fit*.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbaskerville%2Fparagraph-breaker","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbaskerville%2Fparagraph-breaker","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbaskerville%2Fparagraph-breaker/lists"}