Skip to content
Permalink

Comparing changes

Choose two branches to see what’s changed or to start a new pull request. If you need to, you can also or learn more about diff comparisons.

Open a pull request

Create a new pull request by comparing changes across two branches. If you need to, you can also . Learn more about diff comparisons here.
base repository: python-rapidjson/python-rapidjson
Failed to load repositories. Confirm that selected base ref is valid, then try again.
Loading
base: v1.22
Choose a base ref
...
head repository: python-rapidjson/python-rapidjson
Failed to load repositories. Confirm that selected head ref is valid, then try again.
Loading
compare: v1.23
Choose a head ref
  • 3 commits
  • 5 files changed
  • 1 contributor

Commits on Dec 4, 2025

  1. Use a std::string to hold the dictionary keys to be sorted

    For some reason, certainly beyond my early morning understanding of C++
    behaviour, the call to std::sort() on the std::vector<DictItem>
    scrambles the items data, and indeed the array after the call contains
    items matching the effective output shown in the issue #229, that is,
    the first two items have the same key, "2025-11-11".
    
    This replaces low level C string, a pointer to char plus the length,
    with a std::string value, to hold the dictionary keys being sorted,
    and apparently this cures the problem.
    lelit committed Dec 4, 2025
    Configuration menu
    Copy the full SHA
    b13394e View commit details
    Browse the repository at this point in the history

Commits on Dec 7, 2025

  1. Update CHANGES.rst

    lelit committed Dec 7, 2025
    Configuration menu
    Copy the full SHA
    278934e View commit details
    Browse the repository at this point in the history
  2. Release 1.23

    lelit committed Dec 7, 2025
    Configuration menu
    Copy the full SHA
    93ed158 View commit details
    Browse the repository at this point in the history
Loading