cullmann added a comment.
I think for 2 one still needs a clever way to compute the "short" path. I think the document list tries to create shortest unique "suffixes". For 1) to be efficient one could hash all documents with "filename" => documents with that if file names changes, that would avoid that one needs to iterate always again over all documents to collect duplicates. REPOSITORY R39 KTextEditor REVISION DETAIL https://phabricator.kde.org/D21287 To: loh.tar, #ktexteditor Cc: dhaumann, cullmann, kwrite-devel, kde-frameworks-devel, #ktexteditor, domson, michaelh, ngraham, bruns, demsking, sars
