Niels Lohmann 37006318e3 Compare unordered objects by key below the nesting bound ...

Values nested deeper than the nesting bound are compared without the
call stack, walking both objects entry by entry. Two equal objects of a
type that enumerates its entries in no fixed order - std::unordered_map,
say - can be walked in different orders, so they compared unequal, and
a deep copy compared unequal to its original. std::unordered_map's own
operator== does not depend on the order, which is what applies above the
bound.

Where the keys differ, equality now finds the entry by its key instead.
An ordering, and ordered_map, whose operator== compares its entries in
sequence, still decide by the key.

Signed-off-by: Niels Lohmann <mail@nlohmann.me>

2026-09-25 22:06:07 +02:00

..

detail

Write BSON in linear time, without recursing per nesting level (#5553)

2026-09-25 21:56:39 +02:00

thirdparty/hedley

Undefine the four JSON_HEDLEY_* macros that leak after including json.hpp (#5475)

2026-09-09 09:48:17 +02:00

adl_serializer.hpp

📄 adjust year (#5044)

2026-01-01 20:00:39 +01:00

byte_container_with_subtype.hpp

📄 adjust year (#5044)

2026-01-01 20:00:39 +01:00

json_fwd.hpp

📄 adjust year (#5044)

2026-01-01 20:00:39 +01:00

json.hpp

Compare unordered objects by key below the nesting bound

2026-09-25 22:06:07 +02:00

ordered_map.hpp

Add missing overload to ordered_map::find (#5171)

2026-05-18 20:33:47 +02:00