From bfb978334cea775b8ae5c40ceea050ea0660d80a Mon Sep 17 00:00:00 2001
From: Michael Meeks <michael.meeks@collabora.com>
Date: Sat, 28 Jun 2014 20:10:33 +0100
Subject: configmgr: faster / simpler compare for keys.

A surprising amount of time is/was spent comparing keys in the
std::map red/black tree traversing nodes. Since we don't need
the data truly sorted, instead sort in length buckets. Kills
90k rtl_ustring_compare_withLength calls on startup, around
0.9% of headless start.

Change-Id: Ib23aff151ad50d56bbf2ba3e28882cc81898d9ec
---
 configmgr/source/data.hxx | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

(limited to 'configmgr/source/data.hxx')

diff --git a/configmgr/source/data.hxx b/configmgr/source/data.hxx
index 2e564d953d1e..17a0e1dec879 100644
--- a/configmgr/source/data.hxx
+++ b/configmgr/source/data.hxx
@@ -23,7 +23,7 @@
 #include <sal/config.h>
 
 #include <climits>
-#include <map>
+#include "config_map.hxx"
 #include <vector>
 
 #include <boost/noncopyable.hpp>
@@ -86,7 +86,7 @@ struct Data: private boost::noncopyable {
         OUString const & url);
 
 private:
-    typedef std::map< OUString, rtl::Reference< ExtensionXcu > >
+    typedef config_map< rtl::Reference< ExtensionXcu > >
         ExtensionXcuAdditions;
 
     rtl::Reference< Node > root_;
-- 
cgit v1.2.3