std::map -> std::unordered_map (tdf#149112)

Faster and the ordering is not needed.

Change-Id: I9d9f8ef084f441d24d35dc92ecf060f576d7db2e
Reviewed-on: https://gerrit.libreoffice.org/c/core/+/134414
Tested-by: Jenkins
Reviewed-by: Luboš Luňák <l.lunak@collabora.com>
diff --git a/vcl/source/treelist/treelist.cxx b/vcl/source/treelist/treelist.cxx
index 35125ed..07db41b 100644
--- a/vcl/source/treelist/treelist.cxx
+++ b/vcl/source/treelist/treelist.cxx
@@ -24,10 +24,10 @@
#include <osl/diagnose.h>

#include <memory>
#include <map>
#include <unordered_map>


typedef std::map<SvTreeListEntry*, std::unique_ptr<SvViewDataEntry>> SvDataTable;
typedef std::unordered_map<SvTreeListEntry*, std::unique_ptr<SvViewDataEntry>> SvDataTable;

struct SvListView::Impl
{