Skip to content
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.

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

Improve performance, especially in data with many CR-LF #137

Merged
merged 4 commits into from
Sep 28, 2024

Commits on Apr 21, 2024

  1. Improve parsing content with many cr-lf

    Drops the look-behind buffer since the content is always the boundary.
    jhnstrk committed Apr 21, 2024
    Configuration menu
    Copy the full SHA
    473f23c View commit details
    Browse the repository at this point in the history
  2. Improve performance by using built-in bytes.find.

    The Boyer-Moore-Horspool algorithm was removed and replaced with Python's built-in `find` method. This appears to be faster, sometimes by an order of magnitude.
    jhnstrk committed Apr 21, 2024
    Configuration menu
    Copy the full SHA
    f196d40 View commit details
    Browse the repository at this point in the history

Commits on Sep 28, 2024

  1. Configuration menu
    Copy the full SHA
    bd04b2f View commit details
    Browse the repository at this point in the history
  2. Delete unused join_bytes

    Kludex committed Sep 28, 2024
    Configuration menu
    Copy the full SHA
    f08e0c3 View commit details
    Browse the repository at this point in the history