https://bugs.kde.org/show_bug.cgi?id=460315
--- Comment #10 from Thomas Fischer <fisc...@unix-ag.uni-kl.de> --- Git commit f3f7b16ac93eab91033a20f7b7a227ca98dfd187 by Thomas Fischer. Committed on 22/10/2022 at 20:52. Pushed by thomasfischer into branch 'master'. Making detection of sorting less sensitive Previous commit eb510bdfdc46afaa520a9 introduced a heuristic to detect whether entries and macros in a BibTeX file where (partially) sorted and then tried to impose a complete sorting on the file when writing back to disk. As it turned out, the chosen threshold for detecting sorting was too sensitive thus sorting bibliographies that are not meant to be (forcefully) sorted, e.g. to keep the difference between two Git commits small. This commit here decreases the sensitivity to a (still arbitrary) value that seems to be a good compromise that still detects (partially) sorted bibliographies, but does not errornously assess almost unsorted bibliographies as sorted. M +1 -1 src/io/fileimporterbibtex.cpp https://invent.kde.org/office/kbibtex/commit/f3f7b16ac93eab91033a20f7b7a227ca98dfd187 -- You are receiving this mail because: You are watching all bug changes.
