MiniMindsLab Key-Value Sort

Deterministically sort flat key-value mappings by key, with optional case-insensitive ordering and stable output for reproducible config/text generation.

Why

When generating config files, fixtures, or canonical text, stable ordering makes diffs and hashes reliable.

Installation

This project is a pure Python library with no runtime dependencies.

Usage

from minimindslab_key_value_sort import sort_key_value_items, sort_key_value_dict

data = {"b": 2, "A": 1, "a": 3}

items = sort_key_value_items(data)
# [('A', 1), ('a', 3), ('b', 2)]

items_ci = sort_key_value_items(data, case_insensitive=True)
# [('A', 1), ('a', 3), ('b', 2)]

ordered_dict = sort_key_value_dict(data, case_insensitive=True)
# {'A': 1, 'a': 3, 'b': 2}

API

• sort_key_value_items(mapping, case_insensitive=False)
  • Returns a list of (key, value) tuples sorted deterministically.
• sort_key_value_dict(mapping, case_insensitive=False)
  • Returns a new dict with insertion order matching deterministic sorted order.

Notes

• Input must be a mapping (collections.abc.Mapping).
• Keys must be strings.
• In case-insensitive mode, ordering is by key.lower() with a stable tie-breaker by original key.

License

MIT