View | Details | Raw Unified | Return to issue 121585
Collapse All | Expand All

(-)sal/rtl/source/unload.cxx (-3 / +3 lines)
Lines 27-33 Link Here
27
#include <rtl/alloc.h>
27
#include <rtl/alloc.h>
28
#include <rtl/ustring.hxx>
28
#include <rtl/ustring.hxx>
29
#include <osl/mutex.hxx>
29
#include <osl/mutex.hxx>
30
#include <hash_map>
30
#include <boost/unordered_map.hpp>
31
#include "rtl/allocator.hxx"
31
#include "rtl/allocator.hxx"
32
32
33
#include <functional>
33
#include <functional>
Lines 152-158 Link Here
152
	}
152
	}
153
};
153
};
154
154
155
typedef std::hash_map<
155
typedef boost::unordered_map<
156
    oslModule,
156
    oslModule,
157
	std::pair<sal_uInt32, component_canUnloadFunc>,
157
	std::pair<sal_uInt32, component_canUnloadFunc>,
158
	hashModule,
158
	hashModule,
Lines 301-307 Link Here
301
	}
301
	}
302
};
302
};
303
303
304
typedef std::hash_map<
304
typedef boost::unordered_map<
305
    sal_Int32,
305
    sal_Int32,
306
	std::pair<rtl_unloadingListenerFunc, void*>,
306
	std::pair<rtl_unloadingListenerFunc, void*>,
307
	hashListener,
307
	hashListener,
(-)sal/rtl/source/hash.cxx (-2 / +2 lines)
Lines 29-35 Link Here
29
#include "strimp.h"
29
#include "strimp.h"
30
30
31
31
32
#include <hash_set>
32
#include <boost/unordered_set.hpp>
33
33
34
namespace {
34
namespace {
35
35
Lines 53-59 Link Here
53
    }
53
    }
54
};
54
};
55
55
56
typedef std::hash_set< rtl_uString *, UStringHash, UStringEqual,
56
typedef boost::unordered_set< rtl_uString *, UStringHash, UStringEqual,
57
                       rtl::Allocator<rtl_uString *> > StringHashTable;
57
                       rtl::Allocator<rtl_uString *> > StringHashTable;
58
58
59
StringHashTable *
59
StringHashTable *
(-)sal/rtl/source/bootstrap.cxx (-2 / +2 lines)
Lines 45-51 Link Here
45
45
46
#include "macro.hxx"
46
#include "macro.hxx"
47
47
48
#include <hash_map>
48
#include <boost/unordered_map.hpp>
49
#include <list>
49
#include <list>
50
50
51
#define MY_STRING_(x) # x
51
#define MY_STRING_(x) # x
Lines 607-613 Link Here
607
struct bootstrap_map {
607
struct bootstrap_map {
608
    // map<> may be preferred here, but hash_map<> is implemented fully inline,
608
    // map<> may be preferred here, but hash_map<> is implemented fully inline,
609
    // thus there is no need to link against the stlport:
609
    // thus there is no need to link against the stlport:
610
    typedef std::hash_map<
610
    typedef boost::unordered_map<
611
        rtl::OUString, Bootstrap_Impl *,
611
        rtl::OUString, Bootstrap_Impl *,
612
        rtl::OUStringHash, std::equal_to< rtl::OUString >,
612
        rtl::OUStringHash, std::equal_to< rtl::OUString >,
613
        rtl::Allocator< OUString > > t;
613
        rtl::Allocator< OUString > > t;
(-)sal/inc/osl/diagnose.hxx (-2 / +2 lines)
Lines 38-44 Link Here
38
#if ! defined(_RTL_INSTANCE_HXX_)
38
#if ! defined(_RTL_INSTANCE_HXX_)
39
#include "rtl/instance.hxx"
39
#include "rtl/instance.hxx"
40
#endif
40
#endif
41
#include <hash_set>
41
#include <boost/unordered_set.hpp>
42
#include <functional>
42
#include <functional>
43
#include <typeinfo>
43
#include <typeinfo>
44
44
Lines 91-97 Link Here
91
    }
91
    }
92
};
92
};
93
93
94
typedef ::std::hash_set<void const*, VoidPtrHash, ::std::equal_to<void const*>,
94
typedef ::boost::unordered_set<void const*, VoidPtrHash, ::std::equal_to<void const*>,
95
                        ::rtl::Allocator<void const*> > VoidPointerSet;
95
                        ::rtl::Allocator<void const*> > VoidPointerSet;
96
96
97
struct ObjectRegistryData {
97
struct ObjectRegistryData {
(-)cppu/source/LogBridge/LogBridge.cxx (-1 / +1 lines)
Lines 34-40 Link Here
34
#include "rtl/logfile.hxx"
34
#include "rtl/logfile.hxx"
35
#include "uno/environment.hxx"
35
#include "uno/environment.hxx"
36
#include <com/sun/star/uno/Type.hxx>
36
#include <com/sun/star/uno/Type.hxx>
37
#include <hash_map>
37
#include <boost/unordered_map.hpp>
38
#include <memory>
38
#include <memory>
39
39
40
namespace
40
namespace
(-)cppu/source/uno/lbmap.cxx (-1 / +1 lines)
Lines 26-32 Link Here
26
26
27
#include "IdentityMapping.hxx"
27
#include "IdentityMapping.hxx"
28
28
29
#include <hash_map>
29
#include <boost/unordered_map.hpp>
30
#include <set>
30
#include <set>
31
#include <algorithm>
31
#include <algorithm>
32
32
(-)cppu/source/uno/lbenv.cxx (-4 / +4 lines)
Lines 46-52 Link Here
46
#include "destr.hxx"
46
#include "destr.hxx"
47
#include "loadmodule.hxx"
47
#include "loadmodule.hxx"
48
48
49
#include <hash_map>
49
#include <boost/unordered_map.hpp>
50
#include <vector>
50
#include <vector>
51
#include <stdio.h>
51
#include <stdio.h>
52
52
Lines 115-130 Link Here
115
};
115
};
116
116
117
// mapping from environment name to environment
117
// mapping from environment name to environment
118
typedef ::std::hash_map<
118
typedef ::boost::unordered_map<
119
    OUString, uno_Environment *, FctOUStringHash,
119
    OUString, uno_Environment *, FctOUStringHash,
120
    ::std::equal_to< OUString > > OUString2EnvironmentMap;
120
    ::std::equal_to< OUString > > OUString2EnvironmentMap;
121
121
122
// mapping from ptr to object entry
122
// mapping from ptr to object entry
123
typedef ::std::hash_map<
123
typedef ::boost::unordered_map<
124
    void *, ObjectEntry *, FctPtrHash,
124
    void *, ObjectEntry *, FctPtrHash,
125
    ::std::equal_to< void * > > Ptr2ObjectMap;
125
    ::std::equal_to< void * > > Ptr2ObjectMap;
126
// mapping from oid to object entry
126
// mapping from oid to object entry
127
typedef ::std::hash_map<
127
typedef ::boost::unordered_map<
128
    OUString, ObjectEntry *, FctOUStringHash,
128
    OUString, ObjectEntry *, FctOUStringHash,
129
    ::std::equal_to< OUString > > OId2ObjectMap;
129
    ::std::equal_to< OUString > > OId2ObjectMap;
130
130
(-)cppu/source/uno/EnvStack.cxx (-2 / +2 lines)
Lines 29-35 Link Here
29
#include "osl/thread.h"
29
#include "osl/thread.h"
30
#include "osl/mutex.hxx"
30
#include "osl/mutex.hxx"
31
31
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
33
34
34
35
using namespace com::sun::star;
35
using namespace com::sun::star;
Lines 58-64 Link Here
58
	return s1;
58
	return s1;
59
}
59
}
60
60
61
typedef ::std::hash_map<oslThreadIdentifier,
61
typedef ::boost::unordered_map<oslThreadIdentifier,
62
						uno_Environment *,
62
						uno_Environment *,
63
						oslThreadIdentifier_hash,
63
						oslThreadIdentifier_hash,
64
						oslThreadIdentifier_equal>  ThreadMap;
64
						oslThreadIdentifier_equal>  ThreadMap;
(-)cppu/source/threadpool/threadpool.cxx (-2 / +2 lines)
Lines 23-29 Link Here
23
23
24
// MARKER(update_precomp.py): autogen include statement, do not remove
24
// MARKER(update_precomp.py): autogen include statement, do not remove
25
#include "precompiled_cppu.hxx"
25
#include "precompiled_cppu.hxx"
26
#include <hash_set>
26
#include <boost/unordered_set.hpp>
27
#include <stdio.h>
27
#include <stdio.h>
28
28
29
#include <osl/diagnose.h>
29
#include <osl/diagnose.h>
Lines 400-406 Link Here
400
400
401
401
402
402
403
typedef ::std::hash_map< uno_ThreadPool, ThreadPoolHolder, uno_ThreadPool_Hash, uno_ThreadPool_Equal > ThreadpoolHashSet;
403
typedef ::boost::unordered_map< uno_ThreadPool, ThreadPoolHolder, uno_ThreadPool_Hash, uno_ThreadPool_Equal > ThreadpoolHashSet;
404
404
405
static ThreadpoolHashSet *g_pThreadpoolHashSet;
405
static ThreadpoolHashSet *g_pThreadpoolHashSet;
406
406
(-)cppu/source/threadpool/threadpool.hxx (-2 / +2 lines)
Lines 20-26 Link Here
20
 *************************************************************/
20
 *************************************************************/
21
21
22
22
23
#include <hash_map>
23
#include <boost/unordered_map.hpp>
24
24
25
#include <osl/conditn.h>
25
#include <osl/conditn.h>
26
26
Lines 55-61 Link Here
55
			}
55
			}
56
	};
56
	};
57
57
58
	typedef	::std::hash_map
58
	typedef	::boost::unordered_map
59
	<
59
	<
60
	    ByteSequence, // ThreadID 
60
	    ByteSequence, // ThreadID 
61
		::std::pair < JobQueue * , JobQueue * >,
61
		::std::pair < JobQueue * , JobQueue * >,
(-)cppu/source/typelib/typelib.cxx (-1 / +1 lines)
Lines 24-30 Link Here
24
// MARKER(update_precomp.py): autogen include statement, do not remove
24
// MARKER(update_precomp.py): autogen include statement, do not remove
25
#include "precompiled_cppu.hxx"
25
#include "precompiled_cppu.hxx"
26
 
26
 
27
#include <hash_map>
27
#include <boost/unordered_map.hpp>
28
#include <list>
28
#include <list>
29
#include <set>
29
#include <set>
30
#include <vector>
30
#include <vector>
(-)oox/source/export/shapes.cxx (-2 / +2 lines)
Lines 315-321 Link Here
315
    }
315
    }
316
};
316
};
317
317
318
typedef std::hash_map< const char*, const char*, std::hash<const char*>, StringCheck> CustomShapeTypeTranslationHashMap;
318
typedef boost::unordered_map< const char*, const char*, boost::hash<const char*>, StringCheck> CustomShapeTypeTranslationHashMap;
319
static CustomShapeTypeTranslationHashMap* pCustomShapeTypeTranslationHashMap = NULL;
319
static CustomShapeTypeTranslationHashMap* pCustomShapeTypeTranslationHashMap = NULL;
320
320
321
static const char* lcl_GetPresetGeometry( const char* sShapeType )
321
static const char* lcl_GetPresetGeometry( const char* sShapeType )
Lines 869-875 Link Here
869
}
869
}
870
870
871
typedef ShapeExport& (ShapeExport::*ShapeConverter)( Reference< XShape > );
871
typedef ShapeExport& (ShapeExport::*ShapeConverter)( Reference< XShape > );
872
typedef std::hash_map< const char*, ShapeConverter, std::hash<const char*>, StringCheck> NameToConvertMapType;
872
typedef boost::unordered_map< const char*, ShapeConverter, boost::hash<const char*>, StringCheck> NameToConvertMapType;
873
873
874
static const NameToConvertMapType& lcl_GetConverters()
874
static const NameToConvertMapType& lcl_GetConverters()
875
{
875
{
(-)oox/source/drawingml/customshapegeometry.cxx (-2 / +2 lines)
Lines 25-31 Link Here
25
25
26
#include <com/sun/star/xml/sax/FastToken.hpp>
26
#include <com/sun/star/xml/sax/FastToken.hpp>
27
#include <comphelper/stl_types.hxx>
27
#include <comphelper/stl_types.hxx>
28
#include <hash_map>
28
#include <boost/unordered_map.hpp>
29
#include "oox/helper/helper.hxx"
29
#include "oox/helper/helper.hxx"
30
#include "oox/helper/attributelist.hxx"
30
#include "oox/helper/attributelist.hxx"
31
#include "oox/helper/propertymap.hxx"
31
#include "oox/helper/propertymap.hxx"
Lines 86-92 Link Here
86
	{ "val",	FC_VAL }
86
	{ "val",	FC_VAL }
87
87
88
};
88
};
89
typedef std::hash_map< rtl::OUString, FormularCommand, comphelper::UStringHash, comphelper::UStringEqual > FormulaCommandHMap;
89
typedef boost::unordered_map< rtl::OUString, FormularCommand, comphelper::UStringHash, comphelper::UStringEqual > FormulaCommandHMap;
90
90
91
static const FormulaCommandHMap* pCommandHashMap;
91
static const FormulaCommandHMap* pCommandHashMap;
92
92
(-)oox/inc/oox/export/shapes.hxx (-3 / +3 lines)
Lines 29-35 Link Here
29
#include <oox/export/drawingml.hxx>
29
#include <oox/export/drawingml.hxx>
30
#include <sax/fshelper.hxx>
30
#include <sax/fshelper.hxx>
31
#include <vcl/mapmod.hxx>
31
#include <vcl/mapmod.hxx>
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
33
34
namespace com { namespace sun { namespace star {
34
namespace com { namespace sun { namespace star {
35
namespace beans {
35
namespace beans {
Lines 62-73 Link Here
62
62
63
    struct ShapeHash
63
    struct ShapeHash
64
    {
64
    {
65
        std::hash<const char*> maHashFunction;
65
        boost::hash<const char*> maHashFunction;
66
66
67
        size_t operator()( const ::com::sun::star::uno::Reference < ::com::sun::star::drawing::XShape > ) const;
67
        size_t operator()( const ::com::sun::star::uno::Reference < ::com::sun::star::drawing::XShape > ) const;
68
    };
68
    };
69
69
70
    typedef std::hash_map< const ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape>, sal_Int32, ShapeHash, ShapeCheck> ShapeHashMap;
70
    typedef boost::unordered_map< const ::com::sun::star::uno::Reference< ::com::sun::star::drawing::XShape>, sal_Int32, ShapeHash, ShapeCheck> ShapeHashMap;
71
    ShapeHashMap maShapeMap;
71
    ShapeHashMap maShapeMap;
72
72
73
public:
73
public:
(-)dbaccess/source/core/inc/column.hxx (-2 / +2 lines)
Lines 57-63 Link Here
57
#include <cppuhelper/propshlp.hxx>
57
#include <cppuhelper/propshlp.hxx>
58
#include <osl/diagnose.h>
58
#include <osl/diagnose.h>
59
59
60
#include <hash_map>
60
#include <boost/unordered_map.hpp>
61
61
62
namespace dbaccess
62
namespace dbaccess
63
{
63
{
Lines 153-159 Link Here
153
	//= general columns map, could be used for readonly access
153
	//= general columns map, could be used for readonly access
154
	//= no appending and dropping is supported
154
	//= no appending and dropping is supported
155
	//============================================================
155
	//============================================================
156
	typedef ::std::hash_map<rtl::OUString, OColumn*, ::comphelper::UStringMixHash, ::comphelper::UStringMixEqual> OColumnMap;
156
	typedef ::boost::unordered_map<rtl::OUString, OColumn*, ::comphelper::UStringMixHash, ::comphelper::UStringMixEqual> OColumnMap;
157
	typedef ::std::vector<OColumn*> OColumnArray;
157
	typedef ::std::vector<OColumn*> OColumnArray;
158
158
159
	class OContainerMediator;
159
	class OContainerMediator;
(-)dbaccess/source/core/recovery/subcomponents.hxx (-2 / +2 lines)
Lines 32-38 Link Here
32
32
33
#include <rtl/ustring.hxx>
33
#include <rtl/ustring.hxx>
34
34
35
#include <hash_map>
35
#include <boost/unordered_map.hpp>
36
#include <map>
36
#include <map>
37
37
38
//........................................................................
38
//........................................................................
Lines 75-81 Link Here
75
    };
75
    };
76
76
77
    // -------------------------------------------------------------------
77
    // -------------------------------------------------------------------
78
    typedef ::std::hash_map< ::rtl::OUString, SubComponentDescriptor, ::rtl::OUStringHash > MapStringToCompDesc;
78
    typedef ::boost::unordered_map< ::rtl::OUString, SubComponentDescriptor, ::rtl::OUStringHash > MapStringToCompDesc;
79
    typedef ::std::map< SubComponentType, MapStringToCompDesc > MapCompTypeToCompDescs;
79
    typedef ::std::map< SubComponentType, MapStringToCompDesc > MapCompTypeToCompDescs;
80
80
81
81
(-)dbaccess/source/ui/app/subcomponentmanager.cxx (-1 / +1 lines)
Lines 41-47 Link Here
41
#include <vcl/svapp.hxx>
41
#include <vcl/svapp.hxx>
42
#include <vos/mutex.hxx>
42
#include <vos/mutex.hxx>
43
43
44
#include <hash_map>
44
#include <boost/unordered_map.hpp>
45
#include <algorithm>
45
#include <algorithm>
46
#include <functional>
46
#include <functional>
47
47
(-)dbaccess/source/ui/browser/genericcontroller.cxx (-2 / +2 lines)
Lines 122-128 Link Here
122
#include <rtl/logfile.hxx>
122
#include <rtl/logfile.hxx>
123
#endif
123
#endif
124
#include <algorithm>
124
#include <algorithm>
125
#include <hash_map>
125
#include <boost/unordered_map.hpp>
126
#include <cppuhelper/implbase1.hxx>
126
#include <cppuhelper/implbase1.hxx>
127
#include <limits>
127
#include <limits>
128
128
Lines 148-154 Link Here
148
#define LAST_USER_DEFINED_FEATURE   ( ::std::numeric_limits< sal_uInt16 >::max()        )
148
#define LAST_USER_DEFINED_FEATURE   ( ::std::numeric_limits< sal_uInt16 >::max()        )
149
149
150
// -------------------------------------------------------------------------
150
// -------------------------------------------------------------------------
151
typedef ::std::hash_map< sal_Int16, sal_Int16 > CommandHashMap;
151
typedef ::boost::unordered_map< sal_Int16, sal_Int16 > CommandHashMap;
152
typedef ::std::list< DispatchInformation > DispatchInfoList;
152
typedef ::std::list< DispatchInformation > DispatchInfoList;
153
153
154
154
(-)vcl/unx/gtk/gdi/salnativewidgets-gtk.cxx (-2 / +2 lines)
Lines 39-45 Link Here
39
#include <cmath>
39
#include <cmath>
40
#include <vector>
40
#include <vector>
41
#include <algorithm>
41
#include <algorithm>
42
#include <hash_map>
42
#include <boost/unordered_map.hpp>
43
43
44
typedef struct _cairo_font_options cairo_font_options_t;
44
typedef struct _cairo_font_options cairo_font_options_t;
45
45
Lines 144-150 Link Here
144
// Keep a hash table of Widgets->default flags so that we can
144
// Keep a hash table of Widgets->default flags so that we can
145
// easily and quickly reset each to a default state before using
145
// easily and quickly reset each to a default state before using
146
// them
146
// them
147
static std::hash_map<long, guint>	gWidgetDefaultFlags;
147
static boost::unordered_map<long, guint>	gWidgetDefaultFlags;
148
static std::vector<NWFWidgetData>   gWidgetData;
148
static std::vector<NWFWidgetData>   gWidgetData;
149
149
150
static const GtkBorder aDefDefBorder		= { 1, 1, 1, 1 };
150
static const GtkBorder aDefDefBorder		= { 1, 1, 1, 1 };
(-)vcl/unx/gtk/a11y/atkeditabletext.cxx (-1 / +1 lines)
Lines 31-37 Link Here
31
#include <com/sun/star/accessibility/TextSegment.hpp>
31
#include <com/sun/star/accessibility/TextSegment.hpp>
32
32
33
// #include <functional>
33
// #include <functional>
34
// #include <hash_map>
34
// #include <boost/unordered_map.hpp>
35
35
36
#include <stdio.h>
36
#include <stdio.h>
37
#include <string.h>
37
#include <string.h>
(-)vcl/unx/headless/svpelement.cxx (-3 / +3 lines)
Lines 38-44 Link Here
38
#include "svpframe.hxx"
38
#include "svpframe.hxx"
39
39
40
#include <list>
40
#include <list>
41
#include <hash_map>
41
#include <boost/unordered_map.hpp>
42
42
43
#include <sys/types.h>
43
#include <sys/types.h>
44
#include <sys/socket.h>
44
#include <sys/socket.h>
Lines 169-182 Link Here
169
    rtl::OString aCommand( aBuf.makeStringAndClear() );
169
    rtl::OString aCommand( aBuf.makeStringAndClear() );
170
    if( aCommand.compareTo( "list", 4 ) == 0 )
170
    if( aCommand.compareTo( "list", 4 ) == 0 )
171
    {
171
    {
172
        std::hash_map< rtl::OString, std::list<SvpElement*>, rtl::OStringHash > aMap;
172
        boost::unordered_map< rtl::OString, std::list<SvpElement*>, rtl::OStringHash > aMap;
173
        for( std::list< SvpElement* >::const_iterator it = m_aElements.begin();
173
        for( std::list< SvpElement* >::const_iterator it = m_aElements.begin();
174
             it != m_aElements.end(); ++it )
174
             it != m_aElements.end(); ++it )
175
        {
175
        {
176
            std::list<SvpElement*>& rList = aMap[matchType(*it)];
176
            std::list<SvpElement*>& rList = aMap[matchType(*it)];
177
            rList.push_back( *it );
177
            rList.push_back( *it );
178
        }
178
        }
179
        for( std::hash_map< rtl::OString, std::list<SvpElement*>, rtl::OStringHash>::const_iterator hash_it = aMap.begin();
179
        for( boost::unordered_map< rtl::OString, std::list<SvpElement*>, rtl::OStringHash>::const_iterator hash_it = aMap.begin();
180
             hash_it != aMap.end(); ++hash_it )
180
             hash_it != aMap.end(); ++hash_it )
181
        {
181
        {
182
            aAnswer.append( "ElementType: " );
182
            aAnswer.append( "ElementType: " );
(-)vcl/unx/headless/svpprn.cxx (-4 / +4 lines)
Lines 332-338 Link Here
332
332
333
        // set/clear backwards compatibility flag
333
        // set/clear backwards compatibility flag
334
        bool bStrictSO52Compatibility = false;
334
        bool bStrictSO52Compatibility = false;
335
        std::hash_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
335
        boost::unordered_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
336
            pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
336
            pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
337
        if( compat_it != pJobSetup->maValueMap.end() )
337
        if( compat_it != pJobSetup->maValueMap.end() )
338
        {
338
        {
Lines 536-542 Link Here
536
536
537
    // set/clear backwards compatibility flag
537
    // set/clear backwards compatibility flag
538
    bool bStrictSO52Compatibility = false;
538
    bool bStrictSO52Compatibility = false;
539
    std::hash_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
539
    boost::unordered_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
540
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
540
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
541
    if( compat_it != pJobSetup->maValueMap.end() )
541
    if( compat_it != pJobSetup->maValueMap.end() )
542
    {
542
    {
Lines 878-884 Link Here
878
			m_aTmpFile = getTmpName();
878
			m_aTmpFile = getTmpName();
879
            nMode = S_IRUSR | S_IWUSR;
879
            nMode = S_IRUSR | S_IWUSR;
880
880
881
			::std::hash_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
881
			::boost::unordered_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
882
			it = pJobSetup->maValueMap.find( ::rtl::OUString::createFromAscii( "FAX#" ) );
882
			it = pJobSetup->maValueMap.find( ::rtl::OUString::createFromAscii( "FAX#" ) );
883
			if( it != pJobSetup->maValueMap.end() )
883
			if( it != pJobSetup->maValueMap.end() )
884
				m_aFaxNr = it->second;
884
				m_aFaxNr = it->second;
Lines 908-914 Link Here
908
908
909
    // set/clear backwards compatibility flag
909
    // set/clear backwards compatibility flag
910
    bool bStrictSO52Compatibility = false;
910
    bool bStrictSO52Compatibility = false;
911
    std::hash_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
911
    boost::unordered_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
912
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
912
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
913
    if( compat_it != pJobSetup->maValueMap.end() )
913
    if( compat_it != pJobSetup->maValueMap.end() )
914
    {
914
    {
(-)vcl/unx/headless/svppspgraphics.cxx (-1 / +1 lines)
Lines 807-813 Link Here
807
    const psp::PrinterInfo& rInfo = psp::PrinterInfoManager::get().getPrinterInfo( m_pJobData->m_aPrinterName );
807
    const psp::PrinterInfo& rInfo = psp::PrinterInfoManager::get().getPrinterInfo( m_pJobData->m_aPrinterName );
808
    if( rInfo.m_bPerformFontSubstitution )
808
    if( rInfo.m_bPerformFontSubstitution )
809
    {
809
    {
810
        for( std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator it = rInfo.m_aFontSubstitutes.begin(); it != rInfo.m_aFontSubstitutes.end(); ++it )
810
        for( boost::unordered_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator it = rInfo.m_aFontSubstitutes.begin(); it != rInfo.m_aFontSubstitutes.end(); ++it )
811
            AddDevFontSubstitute( pOutDev, it->first, it->second, FONT_SUBSTITUTE_ALWAYS );
811
            AddDevFontSubstitute( pOutDev, it->first, it->second, FONT_SUBSTITUTE_ALWAYS );
812
    }
812
    }
813
}
813
}
(-)vcl/unx/generic/printer/ppdparser.cxx (-7 / +7 lines)
Lines 27-33 Link Here
27
#include <stdlib.h>
27
#include <stdlib.h>
28
#include <stdio.h>
28
#include <stdio.h>
29
29
30
#include <hash_map>
30
#include <boost/unordered_map.hpp>
31
31
32
#include "vcl/ppdparser.hxx"
32
#include "vcl/ppdparser.hxx"
33
#include "vcl/strhelper.hxx"
33
#include "vcl/strhelper.hxx"
Lines 73-80 Link Here
73
            }
73
            }
74
        };
74
        };
75
        
75
        
76
        typedef std::hash_map< com::sun::star::lang::Locale, rtl::OUString, LocaleHash, LocaleEqual > translation_map;
76
        typedef boost::unordered_map< com::sun::star::lang::Locale, rtl::OUString, LocaleHash, LocaleEqual > translation_map;
77
        typedef std::hash_map< rtl::OUString, translation_map, rtl::OUStringHash > key_translation_map;
77
        typedef boost::unordered_map< rtl::OUString, translation_map, rtl::OUStringHash > key_translation_map;
78
        
78
        
79
        key_translation_map     m_aTranslations;
79
        key_translation_map     m_aTranslations;
80
        public:
80
        public:
Lines 253-259 Link Here
253
#endif
253
#endif
254
254
255
std::list< PPDParser* > PPDParser::aAllParsers;
255
std::list< PPDParser* > PPDParser::aAllParsers;
256
std::hash_map< OUString, OUString, OUStringHash >* PPDParser::pAllPPDFiles = NULL;
256
boost::unordered_map< OUString, OUString, OUStringHash >* PPDParser::pAllPPDFiles = NULL;
257
257
258
class PPDDecompressStream
258
class PPDDecompressStream
259
{
259
{
Lines 455-461 Link Here
455
    if( pAllPPDFiles )
455
    if( pAllPPDFiles )
456
        return;
456
        return;
457
457
458
    pAllPPDFiles = new std::hash_map< OUString, OUString, OUStringHash >();
458
    pAllPPDFiles = new boost::unordered_map< OUString, OUString, OUStringHash >();
459
459
460
    // check installation directories
460
    // check installation directories
461
    std::list< OUString > aPathList;
461
    std::list< OUString > aPathList;
Lines 495-501 Link Here
495
    initPPDFiles();
495
    initPPDFiles();
496
    o_rDrivers.clear();
496
    o_rDrivers.clear();
497
    
497
    
498
    std::hash_map< OUString, OUString, OUStringHash >::const_iterator it;
498
    boost::unordered_map< OUString, OUString, OUStringHash >::const_iterator it;
499
    for( it = pAllPPDFiles->begin(); it != pAllPPDFiles->end(); ++it )
499
    for( it = pAllPPDFiles->begin(); it != pAllPPDFiles->end(); ++it )
500
        o_rDrivers.push_back( it->first );
500
        o_rDrivers.push_back( it->first );
501
}
501
}
Lines 507-513 Link Here
507
    PPDDecompressStream aStream( aPPD.PathToFileName() );
507
    PPDDecompressStream aStream( aPPD.PathToFileName() );
508
    if( ! aStream.IsOpen() )
508
    if( ! aStream.IsOpen() )
509
    {
509
    {
510
        std::hash_map< OUString, OUString, OUStringHash >::const_iterator it;
510
        boost::unordered_map< OUString, OUString, OUStringHash >::const_iterator it;
511
        
511
        
512
        bool bRetry = true;
512
        bool bRetry = true;
513
        do
513
        do
(-)vcl/unx/generic/printer/cupsmgr.cxx (-10 / +10 lines)
Lines 584-590 Link Here
584
        // behaviour
584
        // behaviour
585
        aPrinter.m_aInfo.m_pParser = NULL;
585
        aPrinter.m_aInfo.m_pParser = NULL;
586
        aPrinter.m_aInfo.m_aContext.setParser( NULL );
586
        aPrinter.m_aInfo.m_aContext.setParser( NULL );
587
        std::hash_map< OUString, PPDContext, OUStringHash >::const_iterator c_it = m_aDefaultContexts.find( aPrinterName );
587
        boost::unordered_map< OUString, PPDContext, OUStringHash >::const_iterator c_it = m_aDefaultContexts.find( aPrinterName );
588
        if( c_it != m_aDefaultContexts.end() )
588
        if( c_it != m_aDefaultContexts.end() )
589
        {
589
        {
590
            aPrinter.m_aInfo.m_pParser = c_it->second.getParser();
590
            aPrinter.m_aInfo.m_pParser = c_it->second.getParser();
Lines 602-608 Link Here
602
    // remove everything that is not a CUPS printer and not
602
    // remove everything that is not a CUPS printer and not
603
    // a special purpose printer (PDF, Fax)
603
    // a special purpose printer (PDF, Fax)
604
    std::list< OUString > aRemovePrinters;
604
    std::list< OUString > aRemovePrinters;
605
    for( std::hash_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.begin();
605
    for( boost::unordered_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.begin();
606
         it != m_aPrinters.end(); ++it )
606
         it != m_aPrinters.end(); ++it )
607
    {
607
    {
608
        if( m_aCUPSDestMap.find( it->first ) != m_aCUPSDestMap.end() )
608
        if( m_aCUPSDestMap.find( it->first ) != m_aCUPSDestMap.end() )
Lines 689-695 Link Here
689
    {
689
    {
690
        if( m_nDests && m_pDests && ! isCUPSDisabled() )
690
        if( m_nDests && m_pDests && ! isCUPSDisabled() )
691
        {
691
        {
692
            std::hash_map< OUString, int, OUStringHash >::iterator dest_it =
692
            boost::unordered_map< OUString, int, OUStringHash >::iterator dest_it =
693
            m_aCUPSDestMap.find( aPrinter );
693
            m_aCUPSDestMap.find( aPrinter );
694
            if( dest_it != m_aCUPSDestMap.end() )
694
            if( dest_it != m_aCUPSDestMap.end() )
695
            {
695
            {
Lines 785-797 Link Here
785
)
785
)
786
{
786
{
787
#ifdef ENABLE_CUPS
787
#ifdef ENABLE_CUPS
788
    std::hash_map< OUString, int, OUStringHash >::iterator dest_it =
788
    boost::unordered_map< OUString, int, OUStringHash >::iterator dest_it =
789
        m_aCUPSDestMap.find( rData.m_aPrinterName );
789
        m_aCUPSDestMap.find( rData.m_aPrinterName );
790
790
791
    if( dest_it == m_aCUPSDestMap.end() )
791
    if( dest_it == m_aCUPSDestMap.end() )
792
        return PrinterInfoManager::setupJobContextData( rData );
792
        return PrinterInfoManager::setupJobContextData( rData );
793
793
794
    std::hash_map< OUString, Printer, OUStringHash >::iterator p_it =
794
    boost::unordered_map< OUString, Printer, OUStringHash >::iterator p_it =
795
        m_aPrinters.find( rData.m_aPrinterName );
795
        m_aPrinters.find( rData.m_aPrinterName );
796
    if( p_it == m_aPrinters.end() ) // huh ?
796
    if( p_it == m_aPrinters.end() ) // huh ?
797
    {
797
    {
Lines 910-916 Link Here
910
910
911
    osl::MutexGuard aGuard( m_aCUPSMutex );
911
    osl::MutexGuard aGuard( m_aCUPSMutex );
912
    
912
    
913
    std::hash_map< OUString, int, OUStringHash >::iterator dest_it =
913
    boost::unordered_map< OUString, int, OUStringHash >::iterator dest_it =
914
        m_aCUPSDestMap.find( rPrintername );
914
        m_aCUPSDestMap.find( rPrintername );
915
    if( dest_it == m_aCUPSDestMap.end() )
915
    if( dest_it == m_aCUPSDestMap.end() )
916
    {
916
    {
Lines 919-925 Link Here
919
    }
919
    }
920
920
921
    #ifdef ENABLE_CUPS
921
    #ifdef ENABLE_CUPS
922
    std::hash_map< FILE*, OString, FPtrHash >::const_iterator it = m_aSpoolFiles.find( pFile );
922
    boost::unordered_map< FILE*, OString, FPtrHash >::const_iterator it = m_aSpoolFiles.find( pFile );
923
    if( it != m_aSpoolFiles.end() )
923
    if( it != m_aSpoolFiles.end() )
924
    {
924
    {
925
        fclose( pFile );
925
        fclose( pFile );
Lines 1046-1052 Link Here
1046
{
1046
{
1047
    bool bSuccess = false;
1047
    bool bSuccess = false;
1048
#ifdef ENABLE_CUPS
1048
#ifdef ENABLE_CUPS
1049
    std::hash_map< OUString, int, OUStringHash >::iterator nit =
1049
    boost::unordered_map< OUString, int, OUStringHash >::iterator nit =
1050
        m_aCUPSDestMap.find( rName );
1050
        m_aCUPSDestMap.find( rName );
1051
    if( nit != m_aCUPSDestMap.end() && m_aCUPSMutex.tryToAcquire() )
1051
    if( nit != m_aCUPSDestMap.end() && m_aCUPSMutex.tryToAcquire() )
1052
    {
1052
    {
Lines 1072-1081 Link Here
1072
    bool bDestModified = false;
1072
    bool bDestModified = false;
1073
    rtl_TextEncoding aEncoding = osl_getThreadTextEncoding();
1073
    rtl_TextEncoding aEncoding = osl_getThreadTextEncoding();
1074
1074
1075
    for( std::hash_map< OUString, Printer, OUStringHash >::iterator prt =
1075
    for( boost::unordered_map< OUString, Printer, OUStringHash >::iterator prt =
1076
             m_aPrinters.begin(); prt != m_aPrinters.end(); ++prt )
1076
             m_aPrinters.begin(); prt != m_aPrinters.end(); ++prt )
1077
    {
1077
    {
1078
        std::hash_map< OUString, int, OUStringHash >::iterator nit =
1078
        boost::unordered_map< OUString, int, OUStringHash >::iterator nit =
1079
            m_aCUPSDestMap.find( prt->first );
1079
            m_aCUPSDestMap.find( prt->first );
1080
        if( nit == m_aCUPSDestMap.end() )
1080
        if( nit == m_aCUPSDestMap.end() )
1081
            continue;
1081
            continue;
(-)vcl/unx/generic/printer/printerinfomanager.cxx (-19 / +19 lines)
Lines 52-58 Link Here
52
// the group of the global defaults
52
// the group of the global defaults
53
#define GLOBAL_DEFAULTS_GROUP "__Global_Printer_Defaults__"
53
#define GLOBAL_DEFAULTS_GROUP "__Global_Printer_Defaults__"
54
54
55
#include <hash_set>
55
#include <boost/unordered_set.hpp>
56
56
57
using namespace psp;
57
using namespace psp;
58
using namespace rtl;
58
using namespace rtl;
Lines 547-553 Link Here
547
                FileBase::getFileURLFromSystemPath( aFile.PathToFileName(), aPrinter.m_aFile );
547
                FileBase::getFileURLFromSystemPath( aFile.PathToFileName(), aPrinter.m_aFile );
548
                aPrinter.m_bModified    = false;
548
                aPrinter.m_bModified    = false;
549
                aPrinter.m_aGroup       = aConfig.GetGroupName( nGroup );
549
                aPrinter.m_aGroup       = aConfig.GetGroupName( nGroup );
550
                std::hash_map< OUString, Printer, OUStringHash >::const_iterator find_it =
550
                boost::unordered_map< OUString, Printer, OUStringHash >::const_iterator find_it =
551
                m_aPrinters.find( aPrinterName );
551
                m_aPrinters.find( aPrinterName );
552
                if( find_it != m_aPrinters.end() )
552
                if( find_it != m_aPrinters.end() )
553
                {
553
                {
Lines 626-632 Link Here
626
626
627
void PrinterInfoManager::listPrinters( ::std::list< OUString >& rList ) const
627
void PrinterInfoManager::listPrinters( ::std::list< OUString >& rList ) const
628
{
628
{
629
    ::std::hash_map< OUString, Printer, OUStringHash >::const_iterator it;
629
    ::boost::unordered_map< OUString, Printer, OUStringHash >::const_iterator it;
630
    rList.clear();
630
    rList.clear();
631
    for( it = m_aPrinters.begin(); it != m_aPrinters.end(); ++it )
631
    for( it = m_aPrinters.begin(); it != m_aPrinters.end(); ++it )
632
        rList.push_back( it->first );
632
        rList.push_back( it->first );
Lines 637-643 Link Here
637
const PrinterInfo& PrinterInfoManager::getPrinterInfo( const OUString& rPrinter ) const
637
const PrinterInfo& PrinterInfoManager::getPrinterInfo( const OUString& rPrinter ) const
638
{
638
{
639
    static PrinterInfo aEmptyInfo;
639
    static PrinterInfo aEmptyInfo;
640
    ::std::hash_map< OUString, Printer, OUStringHash >::const_iterator it = m_aPrinters.find( rPrinter );
640
    ::boost::unordered_map< OUString, Printer, OUStringHash >::const_iterator it = m_aPrinters.find( rPrinter );
641
    
641
    
642
    DBG_ASSERT( it != m_aPrinters.end(), "Do not ask for info about nonexistent printers" );
642
    DBG_ASSERT( it != m_aPrinters.end(), "Do not ask for info about nonexistent printers" );
643
    
643
    
Lines 648-654 Link Here
648
648
649
void PrinterInfoManager::changePrinterInfo( const OUString& rPrinter, const PrinterInfo& rNewInfo )
649
void PrinterInfoManager::changePrinterInfo( const OUString& rPrinter, const PrinterInfo& rNewInfo )
650
{
650
{
651
    ::std::hash_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.find( rPrinter );
651
    ::boost::unordered_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.find( rPrinter );
652
    
652
    
653
    DBG_ASSERT( it != m_aPrinters.end(), "Do not change nonexistant printers" );
653
    DBG_ASSERT( it != m_aPrinters.end(), "Do not change nonexistant printers" );
654
    
654
    
Lines 679-687 Link Here
679
bool PrinterInfoManager::writePrinterConfig()
679
bool PrinterInfoManager::writePrinterConfig()
680
{
680
{
681
    // find at least one writeable config
681
    // find at least one writeable config
682
    ::std::hash_map< OUString, Config*, OUStringHash > files;
682
    ::boost::unordered_map< OUString, Config*, OUStringHash > files;
683
    ::std::hash_map< OUString, int, OUStringHash > rofiles;
683
    ::boost::unordered_map< OUString, int, OUStringHash > rofiles;
684
    ::std::hash_map< OUString, Config*, OUStringHash >::iterator file_it;
684
    ::boost::unordered_map< OUString, Config*, OUStringHash >::iterator file_it;
685
    
685
    
686
    for( ::std::list< WatchFile >::const_iterator wit = m_aWatchFiles.begin(); wit != m_aWatchFiles.end(); ++wit )
686
    for( ::std::list< WatchFile >::const_iterator wit = m_aWatchFiles.begin(); wit != m_aWatchFiles.end(); ++wit )
687
    {
687
    {
Lines 699-705 Link Here
699
    pGlobal->SetGroup( GLOBAL_DEFAULTS_GROUP );
699
    pGlobal->SetGroup( GLOBAL_DEFAULTS_GROUP );
700
    pGlobal->WriteKey( "DisableCUPS", m_bDisableCUPS ? "true" : "false" );
700
    pGlobal->WriteKey( "DisableCUPS", m_bDisableCUPS ? "true" : "false" );
701
    
701
    
702
    ::std::hash_map< OUString, Printer, OUStringHash >::iterator it;
702
    ::boost::unordered_map< OUString, Printer, OUStringHash >::iterator it;
703
    for( it = m_aPrinters.begin(); it != m_aPrinters.end(); ++it )
703
    for( it = m_aPrinters.begin(); it != m_aPrinters.end(); ++it )
704
    {
704
    {
705
        if( ! it->second.m_bModified )
705
        if( ! it->second.m_bModified )
Lines 802-808 Link Here
802
            
802
            
803
            // write font substitution table
803
            // write font substitution table
804
            pConfig->WriteKey( "PerformFontSubstitution", it->second.m_aInfo.m_bPerformFontSubstitution ? "true" : "false" );
804
            pConfig->WriteKey( "PerformFontSubstitution", it->second.m_aInfo.m_bPerformFontSubstitution ? "true" : "false" );
805
            for( ::std::hash_map< OUString, OUString, OUStringHash >::const_iterator subst = it->second.m_aInfo.m_aFontSubstitutes.begin();
805
            for( ::boost::unordered_map< OUString, OUString, OUStringHash >::const_iterator subst = it->second.m_aInfo.m_aFontSubstitutes.begin();
806
            subst != it->second.m_aInfo.m_aFontSubstitutes.end(); ++subst )
806
            subst != it->second.m_aInfo.m_aFontSubstitutes.end(); ++subst )
807
            {
807
            {
808
                ByteString aKey( "SubstFont_" );
808
                ByteString aKey( "SubstFont_" );
Lines 882-888 Link Here
882
{
882
{
883
    bool bSuccess = true;
883
    bool bSuccess = true;
884
    
884
    
885
    ::std::hash_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.find( rPrinterName );
885
    ::boost::unordered_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.find( rPrinterName );
886
    if( it != m_aPrinters.end() )
886
    if( it != m_aPrinters.end() )
887
    {
887
    {
888
        if( it->second.m_aFile.getLength() )
888
        if( it->second.m_aFile.getLength() )
Lines 936-942 Link Here
936
{
936
{
937
    bool bSuccess = false;
937
    bool bSuccess = false;
938
    
938
    
939
    ::std::hash_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.find( rPrinterName );
939
    ::boost::unordered_map< OUString, Printer, OUStringHash >::iterator it = m_aPrinters.find( rPrinterName );
940
    if( it != m_aPrinters.end() )
940
    if( it != m_aPrinters.end() )
941
    {
941
    {
942
        bSuccess = true;
942
        bSuccess = true;
Lines 967-973 Link Here
967
    return;
967
    return;
968
    
968
    
969
    ::std::list< FastPrintFontInfo > aFonts;
969
    ::std::list< FastPrintFontInfo > aFonts;
970
    ::std::hash_map< OUString, ::std::list< FastPrintFontInfo >, OUStringHash > aPrinterFonts;
970
    ::boost::unordered_map< OUString, ::std::list< FastPrintFontInfo >, OUStringHash > aPrinterFonts;
971
    rFontManager.getFontListWithFastInfo( aFonts, rInfo.m_pParser );
971
    rFontManager.getFontListWithFastInfo( aFonts, rInfo.m_pParser );
972
    
972
    
973
    // get builtin fonts
973
    // get builtin fonts
Lines 977-984 Link Here
977
            aPrinterFonts[ it->m_aFamilyName.toAsciiLowerCase() ].push_back( *it );
977
            aPrinterFonts[ it->m_aFamilyName.toAsciiLowerCase() ].push_back( *it );
978
    
978
    
979
    // map lower case, so build a local copy of the font substitutions
979
    // map lower case, so build a local copy of the font substitutions
980
    ::std::hash_map< OUString, OUString, OUStringHash > aSubstitutions;
980
    ::boost::unordered_map< OUString, OUString, OUStringHash > aSubstitutions;
981
    ::std::hash_map< OUString, OUString, OUStringHash >::const_iterator subst;
981
    ::boost::unordered_map< OUString, OUString, OUStringHash >::const_iterator subst;
982
    for( subst = rInfo.m_aFontSubstitutes.begin(); subst != rInfo.m_aFontSubstitutes.end(); ++subst )
982
    for( subst = rInfo.m_aFontSubstitutes.begin(); subst != rInfo.m_aFontSubstitutes.end(); ++subst )
983
    {
983
    {
984
        OUString aFamily( subst->first.toAsciiLowerCase() );
984
        OUString aFamily( subst->first.toAsciiLowerCase() );
Lines 1119-1125 Link Here
1119
1119
1120
void PrinterInfoManager::setupJobContextData( JobData& rData )
1120
void PrinterInfoManager::setupJobContextData( JobData& rData )
1121
{
1121
{
1122
    std::hash_map< OUString, Printer, OUStringHash >::iterator it =
1122
    boost::unordered_map< OUString, Printer, OUStringHash >::iterator it =
1123
    m_aPrinters.find( rData.m_aPrinterName );
1123
    m_aPrinters.find( rData.m_aPrinterName );
1124
    if( it != m_aPrinters.end() )
1124
    if( it != m_aPrinters.end() )
1125
    {
1125
    {
Lines 1233-1240 Link Here
1233
    const SystemCommandParameters* )
1233
    const SystemCommandParameters* )
1234
{
1234
{
1235
    rtl_TextEncoding aEncoding = osl_getThreadTextEncoding();
1235
    rtl_TextEncoding aEncoding = osl_getThreadTextEncoding();
1236
    std::hash_set< OUString, OUStringHash > aUniqueSet;
1236
    boost::unordered_set< OUString, OUStringHash > aUniqueSet;
1237
    std::hash_set< OUString, OUStringHash > aOnlySet;
1237
    boost::unordered_set< OUString, OUStringHash > aOnlySet;
1238
    aUniqueSet.insert( OUString( RTL_CONSTASCII_USTRINGPARAM( "_all" ) ) );
1238
    aUniqueSet.insert( OUString( RTL_CONSTASCII_USTRINGPARAM( "_all" ) ) );
1239
    aUniqueSet.insert( OUString( RTL_CONSTASCII_USTRINGPARAM( "_default" ) ) );
1239
    aUniqueSet.insert( OUString( RTL_CONSTASCII_USTRINGPARAM( "_default" ) ) );
1240
    
1240
    
Lines 1330-1336 Link Here
1330
    const SystemCommandParameters* i_pParms)
1330
    const SystemCommandParameters* i_pParms)
1331
{
1331
{
1332
    rtl_TextEncoding aEncoding = osl_getThreadTextEncoding();
1332
    rtl_TextEncoding aEncoding = osl_getThreadTextEncoding();
1333
    std::hash_set< OUString, OUStringHash > aUniqueSet;
1333
    boost::unordered_set< OUString, OUStringHash > aUniqueSet;
1334
    rtl::OString aForeToken( i_pParms->pForeToken );
1334
    rtl::OString aForeToken( i_pParms->pForeToken );
1335
    rtl::OString aAftToken( i_pParms->pAftToken );
1335
    rtl::OString aAftToken( i_pParms->pAftToken );
1336
    /* Normal Unix print queue discovery, also used for Darwin 5 LPR printing
1336
    /* Normal Unix print queue discovery, also used for Darwin 5 LPR printing
(-)vcl/unx/generic/printergfx/text_gfx.cxx (-2 / +2 lines)
Lines 698-704 Link Here
698
{
698
{
699
    if( mpFontSubstitutes )
699
    if( mpFontSubstitutes )
700
    {
700
    {
701
        ::std::hash_map< fontID, fontID >::const_iterator it = 
701
        ::boost::unordered_map< fontID, fontID >::const_iterator it = 
702
              mpFontSubstitutes->find( mnFontID );
702
              mpFontSubstitutes->find( mnFontID );
703
        if( it != mpFontSubstitutes->end() )
703
        if( it != mpFontSubstitutes->end() )
704
            return it->second;
704
            return it->second;
Lines 742-748 Link Here
742
    fontID nFont = mnFontID;
742
    fontID nFont = mnFontID;
743
    if( mpFontSubstitutes )
743
    if( mpFontSubstitutes )
744
    {
744
    {
745
        ::std::hash_map< fontID, fontID >::const_iterator it =
745
        ::boost::unordered_map< fontID, fontID >::const_iterator it =
746
              mpFontSubstitutes->find( mnFontID );
746
              mpFontSubstitutes->find( mnFontID );
747
        if( it != mpFontSubstitutes->end() )
747
        if( it != mpFontSubstitutes->end() )
748
            nFont = it->second;
748
            nFont = it->second;
(-)vcl/unx/generic/printergfx/common_gfx.cxx (-5 / +5 lines)
Lines 67-75 Link Here
67
    rPrinterJob.GetScale (mfScaleX, mfScaleY);
67
    rPrinterJob.GetScale (mfScaleX, mfScaleY);
68
    const PrinterInfo& rInfo( PrinterInfoManager::get().getPrinterInfo( rPrinterJob.GetPrinterName() ) );
68
    const PrinterInfo& rInfo( PrinterInfoManager::get().getPrinterInfo( rPrinterJob.GetPrinterName() ) );
69
    if( mpFontSubstitutes )
69
    if( mpFontSubstitutes )
70
        delete const_cast< ::std::hash_map<fontID,fontID>* >(mpFontSubstitutes);
70
        delete const_cast< ::boost::unordered_map<fontID,fontID>* >(mpFontSubstitutes);
71
    if( rInfo.m_bPerformFontSubstitution )
71
    if( rInfo.m_bPerformFontSubstitution )
72
        mpFontSubstitutes = new ::std::hash_map< fontID, fontID >( rInfo.m_aFontSubstitutions );
72
        mpFontSubstitutes = new ::boost::unordered_map< fontID, fontID >( rInfo.m_aFontSubstitutions );
73
    else
73
    else
74
        mpFontSubstitutes = NULL;
74
        mpFontSubstitutes = NULL;
75
    mbUploadPS42Fonts = rInfo.m_pParser ? ( rInfo.m_pParser->isType42Capable() ? sal_True : sal_False ) : sal_False;
75
    mbUploadPS42Fonts = rInfo.m_pParser ? ( rInfo.m_pParser->isType42Capable() ? sal_True : sal_False ) : sal_False;
Lines 91-99 Link Here
91
    mfScaleY        = (double)72.0 / (double)mnDpi;
91
    mfScaleY        = (double)72.0 / (double)mnDpi;
92
    const PrinterInfo& rInfo( PrinterInfoManager::get().getPrinterInfo( rData.m_aPrinterName ) );
92
    const PrinterInfo& rInfo( PrinterInfoManager::get().getPrinterInfo( rData.m_aPrinterName ) );
93
    if( mpFontSubstitutes )
93
    if( mpFontSubstitutes )
94
        delete const_cast< ::std::hash_map<fontID,fontID>* >(mpFontSubstitutes);
94
        delete const_cast< ::boost::unordered_map<fontID,fontID>* >(mpFontSubstitutes);
95
    if( rInfo.m_bPerformFontSubstitution )
95
    if( rInfo.m_bPerformFontSubstitution )
96
        mpFontSubstitutes = new ::std::hash_map< fontID, fontID >( rInfo.m_aFontSubstitutions );
96
        mpFontSubstitutes = new ::boost::unordered_map< fontID, fontID >( rInfo.m_aFontSubstitutions );
97
    else
97
    else
98
        mpFontSubstitutes = NULL;
98
        mpFontSubstitutes = NULL;
99
    mbUploadPS42Fonts = rInfo.m_pParser ? ( rInfo.m_pParser->isType42Capable() ? sal_True : sal_False ) : sal_False;
99
    mbUploadPS42Fonts = rInfo.m_pParser ? ( rInfo.m_pParser->isType42Capable() ? sal_True : sal_False ) : sal_False;
Lines 147-153 Link Here
147
     *  Alas, this is not always done real time. So we keep a local copy of
147
     *  Alas, this is not always done real time. So we keep a local copy of
148
     *  the font substitutes now in case of bad timing.
148
     *  the font substitutes now in case of bad timing.
149
     */
149
     */
150
    delete const_cast< ::std::hash_map<fontID,fontID>* >(mpFontSubstitutes);
150
    delete const_cast< ::boost::unordered_map<fontID,fontID>* >(mpFontSubstitutes);
151
}
151
}
152
152
153
void
153
void
(-)vcl/unx/generic/printergfx/glyphset.hxx (-3 / +3 lines)
Lines 33-39 Link Here
33
#include "tools/gen.hxx"
33
#include "tools/gen.hxx"
34
34
35
#include <list>
35
#include <list>
36
#include <hash_map>
36
#include <boost/unordered_map.hpp>
37
37
38
namespace psp {
38
namespace psp {
39
39
Lines 51-59 Link Here
51
    rtl_TextEncoding    mnBaseEncoding;
51
    rtl_TextEncoding    mnBaseEncoding;
52
    bool				mbUseFontEncoding;
52
    bool				mbUseFontEncoding;
53
53
54
    typedef std::hash_map< sal_Unicode, sal_uInt8 > char_map_t;
54
    typedef boost::unordered_map< sal_Unicode, sal_uInt8 > char_map_t;
55
    typedef std::list< char_map_t > char_list_t;
55
    typedef std::list< char_map_t > char_list_t;
56
    typedef std::hash_map< sal_uInt32, sal_uInt8 > glyph_map_t;
56
    typedef boost::unordered_map< sal_uInt32, sal_uInt8 > glyph_map_t;
57
    typedef std::list< glyph_map_t > glyph_list_t;
57
    typedef std::list< glyph_map_t > glyph_list_t;
58
58
59
    char_list_t		maCharList;
59
    char_list_t		maCharList;
(-)vcl/unx/generic/dtrans/X11_selection.cxx (-27 / +27 lines)
Lines 210-218 Link Here
210
210
211
// ------------------------------------------------------------------------
211
// ------------------------------------------------------------------------
212
212
213
::std::hash_map< OUString, SelectionManager*, OUStringHash >& SelectionManager::getInstances()
213
::boost::unordered_map< OUString, SelectionManager*, OUStringHash >& SelectionManager::getInstances()
214
{
214
{
215
    static ::std::hash_map< OUString, SelectionManager*, OUStringHash > aInstances;
215
    static ::boost::unordered_map< OUString, SelectionManager*, OUStringHash > aInstances;
216
    return aInstances;
216
    return aInstances;
217
}
217
}
218
218
Lines 491-497 Link Here
491
	{
491
	{
492
		MutexGuard aGuard( *Mutex::getGlobalMutex() );
492
		MutexGuard aGuard( *Mutex::getGlobalMutex() );
493
493
494
		::std::hash_map< OUString, SelectionManager*, OUStringHash >::iterator it;
494
		::boost::unordered_map< OUString, SelectionManager*, OUStringHash >::iterator it;
495
		for( it = getInstances().begin(); it != getInstances().end(); ++it )
495
		for( it = getInstances().begin(); it != getInstances().end(); ++it )
496
			if( it->second == this )
496
			if( it->second == this )
497
			{
497
			{
Lines 556-562 Link Here
556
556
557
SelectionAdaptor* SelectionManager::getAdaptor( Atom selection )
557
SelectionAdaptor* SelectionManager::getAdaptor( Atom selection )
558
{
558
{
559
	::std::hash_map< Atom, Selection* >::iterator it =
559
	::boost::unordered_map< Atom, Selection* >::iterator it =
560
		  m_aSelections.find( selection );
560
		  m_aSelections.find( selection );
561
	return it != m_aSelections.end() ? it->second->m_pAdaptor : NULL;
561
	return it != m_aSelections.end() ? it->second->m_pAdaptor : NULL;
562
}
562
}
Lines 723-729 Link Here
723
        aDisplayName = OStringToOUString( getenv( "DISPLAY" ), RTL_TEXTENCODING_ISO_8859_1 );
723
        aDisplayName = OStringToOUString( getenv( "DISPLAY" ), RTL_TEXTENCODING_ISO_8859_1 );
724
	SelectionManager* pInstance = NULL;
724
	SelectionManager* pInstance = NULL;
725
725
726
	::std::hash_map< OUString, SelectionManager*, OUStringHash >::iterator it = getInstances().find( aDisplayName );
726
	::boost::unordered_map< OUString, SelectionManager*, OUStringHash >::iterator it = getInstances().find( aDisplayName );
727
	if( it != getInstances().end() )
727
	if( it != getInstances().end() )
728
		pInstance = it->second;
728
		pInstance = it->second;
729
	else pInstance = getInstances()[ aDisplayName ] = new SelectionManager();
729
	else pInstance = getInstances()[ aDisplayName ] = new SelectionManager();
Lines 737-743 Link Here
737
{
737
{
738
	MutexGuard aGuard(m_aMutex);
738
	MutexGuard aGuard(m_aMutex);
739
739
740
	::std::hash_map< Atom, OUString >::const_iterator it;
740
	::boost::unordered_map< Atom, OUString >::const_iterator it;
741
	if( ( it = m_aAtomToString.find( aAtom ) ) == m_aAtomToString.end() )
741
	if( ( it = m_aAtomToString.find( aAtom ) ) == m_aAtomToString.end() )
742
	{
742
	{
743
		static OUString aEmpty;
743
		static OUString aEmpty;
Lines 758-764 Link Here
758
{
758
{
759
	MutexGuard aGuard(m_aMutex);
759
	MutexGuard aGuard(m_aMutex);
760
760
761
	::std::hash_map< OUString, Atom, OUStringHash >::const_iterator it;
761
	::boost::unordered_map< OUString, Atom, OUStringHash >::const_iterator it;
762
	if( ( it = m_aStringToAtom.find( rString ) ) == m_aStringToAtom.end() )
762
	if( ( it = m_aStringToAtom.find( rString ) ) == m_aStringToAtom.end() )
763
	{
763
	{
764
        static Atom nNoDisplayAtoms = 1;
764
        static Atom nNoDisplayAtoms = 1;
Lines 917-923 Link Here
917
bool SelectionManager::getPasteData( Atom selection, Atom type, Sequence< sal_Int8 >& rData )
917
bool SelectionManager::getPasteData( Atom selection, Atom type, Sequence< sal_Int8 >& rData )
918
{
918
{
919
    ResettableMutexGuard aGuard(m_aMutex);
919
    ResettableMutexGuard aGuard(m_aMutex);
920
	::std::hash_map< Atom, Selection* >::iterator it;
920
	::boost::unordered_map< Atom, Selection* >::iterator it;
921
	bool bSuccess = false;
921
	bool bSuccess = false;
922
922
923
#if OSL_DEBUG_LEVEL > 1
923
#if OSL_DEBUG_LEVEL > 1
Lines 1058-1064 Link Here
1058
	int nFormat;
1058
	int nFormat;
1059
	bool bSuccess = false;
1059
	bool bSuccess = false;
1060
1060
1061
    ::std::hash_map< Atom, Selection* >::iterator it;
1061
    ::boost::unordered_map< Atom, Selection* >::iterator it;
1062
    {
1062
    {
1063
        MutexGuard aGuard(m_aMutex);
1063
        MutexGuard aGuard(m_aMutex);
1064
1064
Lines 1267-1273 Link Here
1267
1267
1268
bool SelectionManager::getPasteDataTypes( Atom selection, Sequence< DataFlavor >& rTypes )
1268
bool SelectionManager::getPasteDataTypes( Atom selection, Sequence< DataFlavor >& rTypes )
1269
{
1269
{
1270
	::std::hash_map< Atom, Selection* >::iterator it;
1270
	::boost::unordered_map< Atom, Selection* >::iterator it;
1271
	{
1271
	{
1272
		MutexGuard aGuard(m_aMutex);
1272
		MutexGuard aGuard(m_aMutex);
1273
1273
Lines 1473-1479 Link Here
1473
1473
1474
PixmapHolder* SelectionManager::getPixmapHolder( Atom selection )
1474
PixmapHolder* SelectionManager::getPixmapHolder( Atom selection )
1475
{
1475
{
1476
    std::hash_map< Atom, Selection* >::const_iterator it = m_aSelections.find( selection );
1476
    boost::unordered_map< Atom, Selection* >::const_iterator it = m_aSelections.find( selection );
1477
    if( it == m_aSelections.end() )
1477
    if( it == m_aSelections.end() )
1478
        return NULL;
1478
        return NULL;
1479
    if( ! it->second->m_pPixmap )
1479
    if( ! it->second->m_pPixmap )
Lines 1595-1604 Link Here
1595
        {
1595
        {
1596
#if OSL_DEBUG_LEVEL > 1
1596
#if OSL_DEBUG_LEVEL > 1
1597
            fprintf( stderr, "using INCR protocol\n" );
1597
            fprintf( stderr, "using INCR protocol\n" );
1598
            std::hash_map< XLIB_Window, std::hash_map< Atom, IncrementalTransfer > >::const_iterator win_it = m_aIncrementals.find( requestor );
1598
            boost::unordered_map< XLIB_Window, boost::unordered_map< Atom, IncrementalTransfer > >::const_iterator win_it = m_aIncrementals.find( requestor );
1599
            if( win_it != m_aIncrementals.end() )
1599
            if( win_it != m_aIncrementals.end() )
1600
            {
1600
            {
1601
                std::hash_map< Atom, IncrementalTransfer >::const_iterator inc_it = win_it->second.find( property );
1601
                boost::unordered_map< Atom, IncrementalTransfer >::const_iterator inc_it = win_it->second.find( property );
1602
                if( inc_it != win_it->second.end() )
1602
                if( inc_it != win_it->second.end() )
1603
                {
1603
                {
1604
                    const IncrementalTransfer& rInc = inc_it->second;
1604
                    const IncrementalTransfer& rInc = inc_it->second;
Lines 1869-1875 Link Here
1869
#endif
1869
#endif
1870
    bool bHandled = false;
1870
    bool bHandled = false;
1871
1871
1872
	::std::hash_map< Atom, Selection* >::iterator it =
1872
	::boost::unordered_map< Atom, Selection* >::iterator it =
1873
		  m_aSelections.find( rNotify.atom );
1873
		  m_aSelections.find( rNotify.atom );
1874
	if( it != m_aSelections.end() &&
1874
	if( it != m_aSelections.end() &&
1875
		rNotify.state == PropertyNewValue &&
1875
		rNotify.state == PropertyNewValue &&
Lines 1994-2006 Link Here
1994
    // feed incrementals
1994
    // feed incrementals
1995
    if( rNotify.state == PropertyDelete )
1995
    if( rNotify.state == PropertyDelete )
1996
    {
1996
    {
1997
        std::hash_map< XLIB_Window, std::hash_map< Atom, IncrementalTransfer > >::iterator it;
1997
        boost::unordered_map< XLIB_Window, boost::unordered_map< Atom, IncrementalTransfer > >::iterator it;
1998
        it = m_aIncrementals.find( rNotify.window );
1998
        it = m_aIncrementals.find( rNotify.window );
1999
        if( it != m_aIncrementals.end() )
1999
        if( it != m_aIncrementals.end() )
2000
        {
2000
        {
2001
            bHandled = true;
2001
            bHandled = true;
2002
            int nCurrentTime = time( NULL );
2002
            int nCurrentTime = time( NULL );
2003
            std::hash_map< Atom, IncrementalTransfer >::iterator inc_it;
2003
            boost::unordered_map< Atom, IncrementalTransfer >::iterator inc_it;
2004
            // throw out aborted transfers
2004
            // throw out aborted transfers
2005
            std::list< Atom > aTimeouts;
2005
            std::list< Atom > aTimeouts;
2006
            for( inc_it = it->second.begin(); inc_it != it->second.end(); ++inc_it )
2006
            for( inc_it = it->second.begin(); inc_it != it->second.end(); ++inc_it )
Lines 2098-2104 Link Here
2098
    if( rNotify.requestor != m_aWindow && rNotify.requestor != m_aCurrentDropWindow )
2098
    if( rNotify.requestor != m_aWindow && rNotify.requestor != m_aCurrentDropWindow )
2099
        fprintf( stderr, "Warning: selection notify for unknown window 0x%lx\n", rNotify.requestor );
2099
        fprintf( stderr, "Warning: selection notify for unknown window 0x%lx\n", rNotify.requestor );
2100
#endif
2100
#endif
2101
	::std::hash_map< Atom, Selection* >::iterator it =
2101
	::boost::unordered_map< Atom, Selection* >::iterator it =
2102
		  m_aSelections.find( rNotify.selection );
2102
		  m_aSelections.find( rNotify.selection );
2103
    if (
2103
    if (
2104
        (rNotify.requestor == m_aWindow || rNotify.requestor == m_aCurrentDropWindow) &&
2104
        (rNotify.requestor == m_aWindow || rNotify.requestor == m_aCurrentDropWindow) &&
Lines 2181-2187 Link Here
2181
2181
2182
    bool bHandled = false;
2182
    bool bHandled = false;
2183
2183
2184
	::std::hash_map< XLIB_Window, DropTargetEntry >::iterator it =
2184
	::boost::unordered_map< XLIB_Window, DropTargetEntry >::iterator it =
2185
		  m_aDropTargets.find( aTarget );
2185
		  m_aDropTargets.find( aTarget );
2186
2186
2187
#if OSL_DEBUG_LEVEL > 1
2187
#if OSL_DEBUG_LEVEL > 1
Lines 2557-2563 Link Here
2557
    if( m_bDropSent )
2557
    if( m_bDropSent )
2558
        return;
2558
        return;
2559
2559
2560
	::std::hash_map< XLIB_Window, DropTargetEntry >::const_iterator it =
2560
	::boost::unordered_map< XLIB_Window, DropTargetEntry >::const_iterator it =
2561
		  m_aDropTargets.find( m_aDropWindow );
2561
		  m_aDropTargets.find( m_aDropWindow );
2562
	if( it != m_aDropTargets.end() )
2562
	if( it != m_aDropTargets.end() )
2563
	{
2563
	{
Lines 2620-2626 Link Here
2620
    bool bHandled = false;
2620
    bool bHandled = false;
2621
2621
2622
	// for shortcut
2622
	// for shortcut
2623
	::std::hash_map< XLIB_Window, DropTargetEntry >::const_iterator it =
2623
	::boost::unordered_map< XLIB_Window, DropTargetEntry >::const_iterator it =
2624
		  m_aDropTargets.find( m_aDropWindow );
2624
		  m_aDropTargets.find( m_aDropWindow );
2625
#if OSL_DEBUG_LEVEL > 1
2625
#if OSL_DEBUG_LEVEL > 1
2626
	switch( rMessage.type )
2626
	switch( rMessage.type )
Lines 3122-3128 Link Here
3122
	dsde.DropAction			= nNewProtocolVersion >= 0 ? m_nUserDragAction : DNDConstants::ACTION_COPY;
3122
	dsde.DropAction			= nNewProtocolVersion >= 0 ? m_nUserDragAction : DNDConstants::ACTION_COPY;
3123
	dsde.UserAction			= nNewProtocolVersion >= 0 ? m_nUserDragAction : DNDConstants::ACTION_COPY;
3123
	dsde.UserAction			= nNewProtocolVersion >= 0 ? m_nUserDragAction : DNDConstants::ACTION_COPY;
3124
3124
3125
	::std::hash_map< XLIB_Window, DropTargetEntry >::const_iterator it;
3125
	::boost::unordered_map< XLIB_Window, DropTargetEntry >::const_iterator it;
3126
	if( aNewCurrentWindow != m_aDropWindow )
3126
	if( aNewCurrentWindow != m_aDropWindow )
3127
	{
3127
	{
3128
#if OSL_DEBUG_LEVEL > 1
3128
#if OSL_DEBUG_LEVEL > 1
Lines 3277-3283 Link Here
3277
        int root_x, root_y, win_x, win_y;
3277
        int root_x, root_y, win_x, win_y;
3278
        unsigned int mask;
3278
        unsigned int mask;
3279
3279
3280
		::std::hash_map< XLIB_Window, DropTargetEntry >::const_iterator it;
3280
		::boost::unordered_map< XLIB_Window, DropTargetEntry >::const_iterator it;
3281
		it = m_aDropTargets.begin();
3281
		it = m_aDropTargets.begin();
3282
		while( it != m_aDropTargets.end() )
3282
		while( it != m_aDropTargets.end() )
3283
		{
3283
		{
Lines 3682-3688 Link Here
3682
					 );
3682
					 );
3683
#endif
3683
#endif
3684
			SelectionAdaptor* pAdaptor = getAdaptor( rEvent.xselectionclear.selection );
3684
			SelectionAdaptor* pAdaptor = getAdaptor( rEvent.xselectionclear.selection );
3685
            std::hash_map< Atom, Selection* >::iterator it( m_aSelections.find( rEvent.xselectionclear.selection ) );
3685
            boost::unordered_map< Atom, Selection* >::iterator it( m_aSelections.find( rEvent.xselectionclear.selection ) );
3686
            if( it != m_aSelections.end() )
3686
            if( it != m_aSelections.end() )
3687
                it->second->m_bOwner = false;
3687
                it->second->m_bOwner = false;
3688
            aGuard.clear();
3688
            aGuard.clear();
Lines 3810-3816 Link Here
3810
            ClearableMutexGuard aGuard(This->m_aMutex);
3810
            ClearableMutexGuard aGuard(This->m_aMutex);
3811
            std::list< std::pair< SelectionAdaptor*, css::uno::Reference< XInterface > > > aChangeList;
3811
            std::list< std::pair< SelectionAdaptor*, css::uno::Reference< XInterface > > > aChangeList;
3812
3812
3813
            for( std::hash_map< Atom, Selection* >::iterator it = This->m_aSelections.begin(); it != This->m_aSelections.end(); ++it )
3813
            for( boost::unordered_map< Atom, Selection* >::iterator it = This->m_aSelections.begin(); it != This->m_aSelections.end(); ++it )
3814
            {
3814
            {
3815
                if( it->first != This->m_nXdndSelection && ! it->second->m_bOwner )
3815
                if( it->first != This->m_nXdndSelection && ! it->second->m_bOwner )
3816
                {
3816
                {
Lines 3962-3968 Link Here
3962
{
3962
{
3963
	MutexGuard aGuard(m_aMutex);
3963
	MutexGuard aGuard(m_aMutex);
3964
3964
3965
	::std::hash_map< Atom, Selection* >::iterator it =
3965
	::boost::unordered_map< Atom, Selection* >::iterator it =
3966
		  m_aSelections.find( selection );
3966
		  m_aSelections.find( selection );
3967
	if( it != m_aSelections.end() )
3967
	if( it != m_aSelections.end() )
3968
	{
3968
	{
Lines 3991-3997 Link Here
3991
	MutexGuard aGuard(m_aMutex);
3991
	MutexGuard aGuard(m_aMutex);
3992
3992
3993
	// sanity check
3993
	// sanity check
3994
	::std::hash_map< XLIB_Window, DropTargetEntry >::const_iterator it =
3994
	::boost::unordered_map< XLIB_Window, DropTargetEntry >::const_iterator it =
3995
		  m_aDropTargets.find( aWindow );
3995
		  m_aDropTargets.find( aWindow );
3996
	if( it != m_aDropTargets.end() )
3996
	if( it != m_aDropTargets.end() )
3997
		OSL_ASSERT( "attempt to register window as drop target twice" );
3997
		OSL_ASSERT( "attempt to register window as drop target twice" );
Lines 4038-4044 Link Here
4038
    if( aWindow == m_aDragSourceWindow && m_aDragRunning.check() )
4038
    if( aWindow == m_aDragSourceWindow && m_aDragRunning.check() )
4039
    {
4039
    {
4040
        // abort drag
4040
        // abort drag
4041
        std::hash_map< XLIB_Window, DropTargetEntry >::const_iterator it =
4041
        boost::unordered_map< XLIB_Window, DropTargetEntry >::const_iterator it =
4042
            m_aDropTargets.find( m_aDropWindow );
4042
            m_aDropTargets.find( m_aDropWindow );
4043
        if( it != m_aDropTargets.end() )
4043
        if( it != m_aDropTargets.end() )
4044
        {
4044
        {
(-)vcl/unx/generic/dtrans/X11_selection.hxx (-7 / +7 lines)
Lines 40-46 Link Here
40
#include <osl/conditn.hxx>
40
#include <osl/conditn.hxx>
41
#endif
41
#endif
42
42
43
#include <hash_map>
43
#include <boost/unordered_map.hpp>
44
#include <list>
44
#include <list>
45
45
46
#include "tools/prex.h"
46
#include "tools/prex.h"
Lines 160-166 Link Here
160
		>,
160
		>,
161
		public SelectionAdaptor
161
		public SelectionAdaptor
162
	{
162
	{
163
        static ::std::hash_map< ::rtl::OUString, SelectionManager*, ::rtl::OUStringHash >& getInstances();
163
        static ::boost::unordered_map< ::rtl::OUString, SelectionManager*, ::rtl::OUStringHash >& getInstances();
164
164
165
		// for INCR type selection transfer
165
		// for INCR type selection transfer
166
		// INCR protocol is used if the data cannot
166
		// INCR protocol is used if the data cannot
Lines 332-338 Link Here
332
		// drag and drop
332
		// drag and drop
333
333
334
		int							m_nCurrentProtocolVersion;
334
		int							m_nCurrentProtocolVersion;
335
		::std::hash_map< XLIB_Window, DropTargetEntry >
335
		::boost::unordered_map< XLIB_Window, DropTargetEntry >
336
									m_aDropTargets;
336
									m_aDropTargets;
337
337
338
338
Lines 363-378 Link Here
363
		Atom						m_nXdndActionPrivate;
363
		Atom						m_nXdndActionPrivate;
364
364
365
		// caching for atoms
365
		// caching for atoms
366
		::std::hash_map< Atom, ::rtl::OUString >
366
		::boost::unordered_map< Atom, ::rtl::OUString >
367
									m_aAtomToString;
367
									m_aAtomToString;
368
		::std::hash_map< ::rtl::OUString, Atom, ::rtl::OUStringHash >
368
		::boost::unordered_map< ::rtl::OUString, Atom, ::rtl::OUStringHash >
369
									m_aStringToAtom;
369
									m_aStringToAtom;
370
370
371
		// the registered selections
371
		// the registered selections
372
		::std::hash_map< Atom, Selection* >
372
		::boost::unordered_map< Atom, Selection* >
373
									m_aSelections;
373
									m_aSelections;
374
		// IncrementalTransfers in progress
374
		// IncrementalTransfers in progress
375
		std::hash_map< XLIB_Window, std::hash_map< Atom, IncrementalTransfer > >
375
		boost::unordered_map< XLIB_Window, boost::unordered_map< Atom, IncrementalTransfer > >
376
									m_aIncrementals;
376
									m_aIncrementals;
377
		
377
		
378
		// do not use X11 multithreading capabilities
378
		// do not use X11 multithreading capabilities
(-)vcl/unx/generic/dtrans/X11_service.cxx (-3 / +3 lines)
Lines 73-79 Link Here
73
73
74
css::uno::Reference< XInterface > X11SalInstance::CreateClipboard( const Sequence< Any >& arguments )
74
css::uno::Reference< XInterface > X11SalInstance::CreateClipboard( const Sequence< Any >& arguments )
75
{
75
{
76
    static std::hash_map< OUString, ::std::hash_map< Atom, css::uno::Reference< XClipboard > >, ::rtl::OUStringHash > m_aInstances;
76
    static boost::unordered_map< OUString, ::boost::unordered_map< Atom, css::uno::Reference< XClipboard > >, ::rtl::OUStringHash > m_aInstances;
77
77
78
	OUString aDisplayName;
78
	OUString aDisplayName;
79
    Atom nSelection;
79
    Atom nSelection;
Lines 109-116 Link Here
109
        nSelection = rManager.getAtom( OUString::createFromAscii( "CLIPBOARD" ) );
109
        nSelection = rManager.getAtom( OUString::createFromAscii( "CLIPBOARD" ) );
110
    }
110
    }
111
    
111
    
112
	::std::hash_map< Atom, css::uno::Reference< XClipboard > >& rMap( m_aInstances[ aDisplayName ] );
112
	::boost::unordered_map< Atom, css::uno::Reference< XClipboard > >& rMap( m_aInstances[ aDisplayName ] );
113
	::std::hash_map< Atom, css::uno::Reference< XClipboard > >::iterator it = rMap.find( nSelection );
113
	::boost::unordered_map< Atom, css::uno::Reference< XClipboard > >::iterator it = rMap.find( nSelection );
114
	if( it != rMap.end() )
114
	if( it != rMap.end() )
115
		return it->second;
115
		return it->second;
116
116
(-)vcl/unx/generic/fontmanager/fontconfig.cxx (-6 / +6 lines)
Lines 255-262 Link Here
255
255
256
public: // TODO: cleanup
256
public: // TODO: cleanup
257
    FcResult FamilyFromPattern(FcPattern* pPattern, FcChar8 **family);
257
    FcResult FamilyFromPattern(FcPattern* pPattern, FcChar8 **family);
258
    std::hash_map< rtl::OString, rtl::OString, rtl::OStringHash > m_aFontNameToLocalized;
258
    boost::unordered_map< rtl::OString, rtl::OString, rtl::OStringHash > m_aFontNameToLocalized;
259
    std::hash_map< rtl::OString, rtl::OString, rtl::OStringHash > m_aLocalizedToCanonical;
259
    boost::unordered_map< rtl::OString, rtl::OString, rtl::OStringHash > m_aLocalizedToCanonical;
260
};
260
};
261
261
262
oslGenericFunction FontCfgWrapper::loadSymbol( const char* pSymbol )
262
oslGenericFunction FontCfgWrapper::loadSymbol( const char* pSymbol )
Lines 698-704 Link Here
698
    }
698
    }
699
}
699
}
700
700
701
int PrintFontManager::countFontconfigFonts( std::hash_map<rtl::OString, int, rtl::OStringHash>& o_rVisitedPaths )
701
int PrintFontManager::countFontconfigFonts( boost::unordered_map<rtl::OString, int, rtl::OStringHash>& o_rVisitedPaths )
702
{
702
{
703
    int nFonts = 0;
703
    int nFonts = 0;
704
704
Lines 1063-1069 Link Here
1063
            if( eFileRes == FcResultMatch )
1063
            if( eFileRes == FcResultMatch )
1064
            {
1064
            {
1065
                OString sFamily((sal_Char*)family);
1065
                OString sFamily((sal_Char*)family);
1066
                std::hash_map< rtl::OString, rtl::OString, rtl::OStringHash >::const_iterator aI = rWrapper.m_aFontNameToLocalized.find(sFamily);
1066
                boost::unordered_map< rtl::OString, rtl::OString, rtl::OStringHash >::const_iterator aI = rWrapper.m_aFontNameToLocalized.find(sFamily);
1067
                if (aI != rWrapper.m_aFontNameToLocalized.end())
1067
                if (aI != rWrapper.m_aFontNameToLocalized.end())
1068
                    sFamily = aI->second;
1068
                    sFamily = aI->second;
1069
                aName = rtl::OStringToOUString( sFamily, RTL_TEXTENCODING_UTF8 );
1069
                aName = rtl::OStringToOUString( sFamily, RTL_TEXTENCODING_UTF8 );
Lines 1123-1129 Link Here
1123
1123
1124
    OString sFamily = OUStringToOString( rInfo.m_aFamilyName, RTL_TEXTENCODING_UTF8 );
1124
    OString sFamily = OUStringToOString( rInfo.m_aFamilyName, RTL_TEXTENCODING_UTF8 );
1125
1125
1126
    std::hash_map< rtl::OString, rtl::OString, rtl::OStringHash >::const_iterator aI = rWrapper.m_aLocalizedToCanonical.find(sFamily);
1126
    boost::unordered_map< rtl::OString, rtl::OString, rtl::OStringHash >::const_iterator aI = rWrapper.m_aLocalizedToCanonical.find(sFamily);
1127
    if (aI != rWrapper.m_aLocalizedToCanonical.end())
1127
    if (aI != rWrapper.m_aLocalizedToCanonical.end())
1128
        sFamily = aI->second;
1128
        sFamily = aI->second;
1129
    if( sFamily.getLength() )
1129
    if( sFamily.getLength() )
Lines 1264-1270 Link Here
1264
    return false;
1264
    return false;
1265
}
1265
}
1266
1266
1267
int PrintFontManager::countFontconfigFonts( std::hash_map<rtl::OString, int, rtl::OStringHash>& )
1267
int PrintFontManager::countFontconfigFonts( boost::unordered_map<rtl::OString, int, rtl::OStringHash>& )
1268
{
1268
{
1269
    return 0;
1269
    return 0;
1270
}
1270
}
(-)vcl/unx/generic/fontmanager/fontmanager.cxx (-43 / +43 lines)
Lines 67-73 Link Here
67
#include "sal/alloca.h"
67
#include "sal/alloca.h"
68
68
69
#include <set>
69
#include <set>
70
#include <hash_set>
70
#include <boost/unordered_set.hpp>
71
#include <algorithm>
71
#include <algorithm>
72
72
73
#include "adobeenc.tab" // get encoding table for AFM metrics
73
#include "adobeenc.tab" // get encoding table for AFM metrics
Lines 485-492 Link Here
485
            if( pImplTTFont->nkern && pImplTTFont->kerntype == KT_MICROSOFT )
485
            if( pImplTTFont->nkern && pImplTTFont->kerntype == KT_MICROSOFT )
486
            {
486
            {
487
                // create a glyph -> character mapping
487
                // create a glyph -> character mapping
488
                ::std::hash_map< sal_uInt16, sal_Unicode > aGlyphMap;
488
                ::boost::unordered_map< sal_uInt16, sal_Unicode > aGlyphMap;
489
                ::std::hash_map< sal_uInt16, sal_Unicode >::iterator left, right;
489
                ::boost::unordered_map< sal_uInt16, sal_Unicode >::iterator left, right;
490
                for( i = 21; i < 0xfffd; i++ )
490
                for( i = 21; i < 0xfffd; i++ )
491
                {
491
                {
492
                    sal_uInt16 nGlyph = MapChar( pTTFont, (sal_Unicode)i, 0 ); // kerning for horz only
492
                    sal_uInt16 nGlyph = MapChar( pTTFont, (sal_Unicode)i, 0 ); // kerning for horz only
Lines 585-592 Link Here
585
            if( pImplTTFont->nkern && pImplTTFont->kerntype == KT_APPLE_NEW )
585
            if( pImplTTFont->nkern && pImplTTFont->kerntype == KT_APPLE_NEW )
586
            {
586
            {
587
                // create a glyph -> character mapping
587
                // create a glyph -> character mapping
588
                ::std::hash_map< sal_uInt16, sal_Unicode > aGlyphMap;
588
                ::boost::unordered_map< sal_uInt16, sal_Unicode > aGlyphMap;
589
                ::std::hash_map< sal_uInt16, sal_Unicode >::iterator left, right;
589
                ::boost::unordered_map< sal_uInt16, sal_Unicode >::iterator left, right;
590
                for( i = 21; i < 0xfffd; i++ )
590
                for( i = 21; i < 0xfffd; i++ )
591
                {
591
                {
592
                    sal_uInt16 nGlyph = MapChar( pTTFont, (sal_Unicode)i, 0 ); // kerning for horz only
592
                    sal_uInt16 nGlyph = MapChar( pTTFont, (sal_Unicode)i, 0 ); // kerning for horz only
Lines 729-735 Link Here
729
*/
729
*/
730
static bool familyNameOverride( const OUString& i_rPSname, OUString& o_rFamilyName )
730
static bool familyNameOverride( const OUString& i_rPSname, OUString& o_rFamilyName )
731
{
731
{
732
    static std::hash_map< OUString, OUString, OUStringHash > aPSNameToFamily( 16 );
732
    static boost::unordered_map< OUString, OUString, OUStringHash > aPSNameToFamily( 16 );
733
    if( aPSNameToFamily.empty() ) // initialization
733
    if( aPSNameToFamily.empty() ) // initialization
734
    {
734
    {
735
        aPSNameToFamily[ OUString( RTL_CONSTASCII_USTRINGPARAM( "Helvetica-Narrow" ) ) ] =
735
        aPSNameToFamily[ OUString( RTL_CONSTASCII_USTRINGPARAM( "Helvetica-Narrow" ) ) ] =
Lines 741-747 Link Here
741
        aPSNameToFamily[ OUString( RTL_CONSTASCII_USTRINGPARAM( "Helvetica-Narrow-Oblique" ) ) ] =
741
        aPSNameToFamily[ OUString( RTL_CONSTASCII_USTRINGPARAM( "Helvetica-Narrow-Oblique" ) ) ] =
742
                         OUString( RTL_CONSTASCII_USTRINGPARAM( "Helvetica Narrow" ) );
742
                         OUString( RTL_CONSTASCII_USTRINGPARAM( "Helvetica Narrow" ) );
743
    }
743
    }
744
    std::hash_map<OUString,OUString,OUStringHash>::const_iterator it =
744
    boost::unordered_map<OUString,OUString,OUStringHash>::const_iterator it =
745
       aPSNameToFamily.find( i_rPSname );
745
       aPSNameToFamily.find( i_rPSname );
746
    bool bReplaced = (it != aPSNameToFamily.end() );
746
    bool bReplaced = (it != aPSNameToFamily.end() );
747
    if( bReplaced )
747
    if( bReplaced )
Lines 1081-1088 Link Here
1081
                }
1081
                }
1082
                else if( pChar->code != -1 )
1082
                else if( pChar->code != -1 )
1083
                {
1083
                {
1084
                    ::std::pair< ::std::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator,
1084
                    ::std::pair< ::boost::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator,
1085
                          ::std::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator >
1085
                          ::boost::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator >
1086
                          aCodes = rManager.getUnicodeFromAdobeCode( pChar->code );
1086
                          aCodes = rManager.getUnicodeFromAdobeCode( pChar->code );
1087
                    while( aCodes.first != aCodes.second )
1087
                    while( aCodes.first != aCodes.second )
1088
                    {
1088
                    {
Lines 1189-1200 Link Here
1189
{
1189
{
1190
    for( unsigned int i = 0; i < sizeof( aAdobeCodes )/sizeof( aAdobeCodes[0] ); i++ )
1190
    for( unsigned int i = 0; i < sizeof( aAdobeCodes )/sizeof( aAdobeCodes[0] ); i++ )
1191
    {
1191
    {
1192
        m_aUnicodeToAdobename.insert( ::std::hash_multimap< sal_Unicode, ::rtl::OString >::value_type( aAdobeCodes[i].aUnicode, aAdobeCodes[i].pAdobename ) );
1192
        m_aUnicodeToAdobename.insert( ::boost::hash_multimap< sal_Unicode, ::rtl::OString >::value_type( aAdobeCodes[i].aUnicode, aAdobeCodes[i].pAdobename ) );
1193
        m_aAdobenameToUnicode.insert( ::std::hash_multimap< ::rtl::OString, sal_Unicode, ::rtl::OStringHash >::value_type( aAdobeCodes[i].pAdobename, aAdobeCodes[i].aUnicode ) );
1193
        m_aAdobenameToUnicode.insert( ::boost::hash_multimap< ::rtl::OString, sal_Unicode, ::rtl::OStringHash >::value_type( aAdobeCodes[i].pAdobename, aAdobeCodes[i].aUnicode ) );
1194
        if( aAdobeCodes[i].aAdobeStandardCode )
1194
        if( aAdobeCodes[i].aAdobeStandardCode )
1195
        {
1195
        {
1196
            m_aUnicodeToAdobecode.insert( ::std::hash_multimap< sal_Unicode, sal_uInt8 >::value_type( aAdobeCodes[i].aUnicode, aAdobeCodes[i].aAdobeStandardCode ) );
1196
            m_aUnicodeToAdobecode.insert( ::boost::hash_multimap< sal_Unicode, sal_uInt8 >::value_type( aAdobeCodes[i].aUnicode, aAdobeCodes[i].aAdobeStandardCode ) );
1197
            m_aAdobecodeToUnicode.insert( ::std::hash_multimap< sal_uInt8, sal_Unicode >::value_type( aAdobeCodes[i].aAdobeStandardCode, aAdobeCodes[i].aUnicode ) );
1197
            m_aAdobecodeToUnicode.insert( ::boost::hash_multimap< sal_uInt8, sal_Unicode >::value_type( aAdobeCodes[i].aAdobeStandardCode, aAdobeCodes[i].aUnicode ) );
1198
        }
1198
        }
1199
#if 0
1199
#if 0
1200
        m_aUnicodeToAdobename[ aAdobeCodes[i].aUnicode ] = aAdobeCodes[i].pAdobename;
1200
        m_aUnicodeToAdobename[ aAdobeCodes[i].aUnicode ] = aAdobeCodes[i].pAdobename;
Lines 1213-1219 Link Here
1213
PrintFontManager::~PrintFontManager()
1213
PrintFontManager::~PrintFontManager()
1214
{
1214
{
1215
    deinitFontconfig();
1215
    deinitFontconfig();
1216
    for( ::std::hash_map< fontID, PrintFont* >::const_iterator it = m_aFonts.begin(); it != m_aFonts.end(); ++it )
1216
    for( ::boost::unordered_map< fontID, PrintFont* >::const_iterator it = m_aFonts.begin(); it != m_aFonts.end(); ++it )
1217
        delete (*it).second;
1217
        delete (*it).second;
1218
    delete m_pAtoms;
1218
    delete m_pAtoms;
1219
    if( m_pFontCache )
1219
    if( m_pFontCache )
Lines 1224-1230 Link Here
1224
1224
1225
const OString& PrintFontManager::getDirectory( int nAtom ) const
1225
const OString& PrintFontManager::getDirectory( int nAtom ) const
1226
{
1226
{
1227
    ::std::hash_map< int, OString >::const_iterator it( m_aAtomToDir.find( nAtom ) );
1227
    ::boost::unordered_map< int, OString >::const_iterator it( m_aAtomToDir.find( nAtom ) );
1228
    return it != m_aAtomToDir.end() ? it->second : s_aEmptyOString;
1228
    return it != m_aAtomToDir.end() ? it->second : s_aEmptyOString;
1229
}
1229
}
1230
1230
Lines 1233-1239 Link Here
1233
int PrintFontManager::getDirectoryAtom( const OString& rDirectory, bool bCreate )
1233
int PrintFontManager::getDirectoryAtom( const OString& rDirectory, bool bCreate )
1234
{
1234
{
1235
    int nAtom = 0;
1235
    int nAtom = 0;
1236
    ::std::hash_map< OString, int, OStringHash >::const_iterator it
1236
    ::boost::unordered_map< OString, int, OStringHash >::const_iterator it
1237
          ( m_aDirToAtom.find( rDirectory ) );
1237
          ( m_aDirToAtom.find( rDirectory ) );
1238
    if( it != m_aDirToAtom.end() )
1238
    if( it != m_aDirToAtom.end() )
1239
        nAtom = it->second;
1239
        nAtom = it->second;
Lines 1417-1423 Link Here
1417
fontID PrintFontManager::findFontBuiltinID( int nPSNameAtom ) const
1417
fontID PrintFontManager::findFontBuiltinID( int nPSNameAtom ) const
1418
{
1418
{
1419
    fontID nID = 0;
1419
    fontID nID = 0;
1420
    ::std::hash_map< fontID, PrintFont* >::const_iterator it;
1420
    ::boost::unordered_map< fontID, PrintFont* >::const_iterator it;
1421
    for( it = m_aFonts.begin(); nID == 0 && it != m_aFonts.end(); ++it )
1421
    for( it = m_aFonts.begin(); nID == 0 && it != m_aFonts.end(); ++it )
1422
    {
1422
    {
1423
        if( it->second->m_eType == fonttype::Builtin &&
1423
        if( it->second->m_eType == fonttype::Builtin &&
Lines 1433-1444 Link Here
1433
{
1433
{
1434
    fontID nID = 0;
1434
    fontID nID = 0;
1435
1435
1436
    ::std::hash_map< OString, ::std::set< fontID >, OStringHash >::const_iterator set_it = m_aFontFileToFontID.find( rFontFile );
1436
    ::boost::unordered_map< OString, ::std::set< fontID >, OStringHash >::const_iterator set_it = m_aFontFileToFontID.find( rFontFile );
1437
    if( set_it != m_aFontFileToFontID.end() )
1437
    if( set_it != m_aFontFileToFontID.end() )
1438
    {
1438
    {
1439
        for( ::std::set< fontID >::const_iterator font_it = set_it->second.begin(); font_it != set_it->second.end() && ! nID; ++font_it )
1439
        for( ::std::set< fontID >::const_iterator font_it = set_it->second.begin(); font_it != set_it->second.end() && ! nID; ++font_it )
1440
        {
1440
        {
1441
            ::std::hash_map< fontID, PrintFont* >::const_iterator it = m_aFonts.find( *font_it );
1441
            ::boost::unordered_map< fontID, PrintFont* >::const_iterator it = m_aFonts.find( *font_it );
1442
            if( it != m_aFonts.end() )
1442
            if( it != m_aFonts.end() )
1443
            {
1443
            {
1444
                switch( it->second->m_eType )
1444
                switch( it->second->m_eType )
Lines 2100-2106 Link Here
2100
2100
2101
    // initialize may be called twice in the future
2101
    // initialize may be called twice in the future
2102
    {
2102
    {
2103
        for( ::std::hash_map< fontID, PrintFont* >::const_iterator it = m_aFonts.begin(); it != m_aFonts.end(); ++it )
2103
        for( ::boost::unordered_map< fontID, PrintFont* >::const_iterator it = m_aFonts.begin(); it != m_aFonts.end(); ++it )
2104
            delete (*it).second;
2104
            delete (*it).second;
2105
        m_nNextFontID = 1;
2105
        m_nNextFontID = 1;
2106
        m_aFonts.clear();
2106
        m_aFonts.clear();
Lines 2152-2158 Link Here
2152
    }
2152
    }
2153
2153
2154
    // protect against duplicate paths
2154
    // protect against duplicate paths
2155
    std::hash_map< OString, int, OStringHash > visited_dirs;
2155
    boost::unordered_map< OString, int, OStringHash > visited_dirs;
2156
2156
2157
    // now that all global and local font dirs are known to fontconfig
2157
    // now that all global and local font dirs are known to fontconfig
2158
    // check that there are fonts actually managed by fontconfig
2158
    // check that there are fonts actually managed by fontconfig
Lines 2218-2224 Link Here
2218
        if( pDIR )
2218
        if( pDIR )
2219
        {
2219
        {
2220
            // read fonts.dir if possible
2220
            // read fonts.dir if possible
2221
            ::std::hash_map< OString, ::std::list<OString>, OStringHash > aFontsDir;
2221
            ::boost::unordered_map< OString, ::std::list<OString>, OStringHash > aFontsDir;
2222
            int nDirID = getDirectoryAtom( aPath, true );
2222
            int nDirID = getDirectoryAtom( aPath, true );
2223
            // #i38367# no fonts.dir in our own directories anymore
2223
            // #i38367# no fonts.dir in our own directories anymore
2224
            std::list< int >::const_iterator priv_dir;
2224
            std::list< int >::const_iterator priv_dir;
Lines 2266-2272 Link Here
2266
                    if( findFontFileID( nDirID, aFileName ) == 0 )
2266
                    if( findFontFileID( nDirID, aFileName ) == 0 )
2267
                    {
2267
                    {
2268
                        ::std::list<OString> aXLFDs;
2268
                        ::std::list<OString> aXLFDs;
2269
                        ::std::hash_map< OString, ::std::list<OString>, OStringHash >::const_iterator it =
2269
                        ::boost::unordered_map< OString, ::std::list<OString>, OStringHash >::const_iterator it =
2270
                              aFontsDir.find( aFileName );
2270
                              aFontsDir.find( aFileName );
2271
                        if( it != aFontsDir.end() )
2271
                        if( it != aFontsDir.end() )
2272
                            aXLFDs = (*it).second;
2272
                            aXLFDs = (*it).second;
Lines 2397-2406 Link Here
2397
#endif
2397
#endif
2398
2398
2399
    // part three - fill in family styles
2399
    // part three - fill in family styles
2400
    ::std::hash_map< fontID, PrintFont* >::iterator font_it;
2400
    ::boost::unordered_map< fontID, PrintFont* >::iterator font_it;
2401
    for (font_it = m_aFonts.begin(); font_it != m_aFonts.end(); ++font_it)
2401
    for (font_it = m_aFonts.begin(); font_it != m_aFonts.end(); ++font_it)
2402
    {
2402
    {
2403
        ::std::hash_map< int, family::type >::const_iterator it =
2403
        ::boost::unordered_map< int, family::type >::const_iterator it =
2404
              m_aFamilyTypes.find( font_it->second->m_nFamilyName );
2404
              m_aFamilyTypes.find( font_it->second->m_nFamilyName );
2405
        if (it != m_aFamilyTypes.end())
2405
        if (it != m_aFamilyTypes.end())
2406
            continue;
2406
            continue;
Lines 2498-2504 Link Here
2498
void PrintFontManager::getFontList( ::std::list< fontID >& rFontIDs, const PPDParser* pParser, bool bUseOverrideMetrics )
2498
void PrintFontManager::getFontList( ::std::list< fontID >& rFontIDs, const PPDParser* pParser, bool bUseOverrideMetrics )
2499
{
2499
{
2500
    rFontIDs.clear();
2500
    rFontIDs.clear();
2501
    std::hash_map< fontID, PrintFont* >::const_iterator it;
2501
    boost::unordered_map< fontID, PrintFont* >::const_iterator it;
2502
    
2502
    
2503
    /*
2503
    /*
2504
    * Note: there are two easy steps making this faster:
2504
    * Note: there are two easy steps making this faster:
Lines 2520-2526 Link Here
2520
    if( pParser )
2520
    if( pParser )
2521
    {
2521
    {
2522
        std::set<int> aBuiltinPSNames;
2522
        std::set<int> aBuiltinPSNames;
2523
        std::hash_set< BuiltinFontIdentifier,
2523
        boost::unordered_set< BuiltinFontIdentifier,
2524
                       BuiltinFontIdentifierHash
2524
                       BuiltinFontIdentifierHash
2525
                       > aBuiltinFonts;
2525
                       > aBuiltinFonts;
2526
2526
Lines 2531-2537 Link Here
2531
            for( std::vector<fontID>::const_iterator over = m_aOverrideFonts.begin();
2531
            for( std::vector<fontID>::const_iterator over = m_aOverrideFonts.begin();
2532
                 over != m_aOverrideFonts.end(); ++over )
2532
                 over != m_aOverrideFonts.end(); ++over )
2533
            {
2533
            {
2534
                std::hash_map<fontID,PrintFont*>::const_iterator font_it = m_aFonts.find( *over );
2534
                boost::unordered_map<fontID,PrintFont*>::const_iterator font_it = m_aFonts.find( *over );
2535
                DBG_ASSERT( font_it != m_aFonts.end(), "override to nonexistant font" );
2535
                DBG_ASSERT( font_it != m_aFonts.end(), "override to nonexistant font" );
2536
                if( font_it != m_aFonts.end() )
2536
                if( font_it != m_aFonts.end() )
2537
                    aOverridePSNames[ font_it->second->m_nPSName ] = *over;
2537
                    aOverridePSNames[ font_it->second->m_nPSName ] = *over;
Lines 2621-2627 Link Here
2621
2621
2622
void PrintFontManager::fillPrintFontInfo( PrintFont* pFont, FastPrintFontInfo& rInfo ) const
2622
void PrintFontManager::fillPrintFontInfo( PrintFont* pFont, FastPrintFontInfo& rInfo ) const
2623
{
2623
{
2624
    ::std::hash_map< int, family::type >::const_iterator style_it =
2624
    ::boost::unordered_map< int, family::type >::const_iterator style_it =
2625
          m_aFamilyTypes.find( pFont->m_nFamilyName );
2625
          m_aFamilyTypes.find( pFont->m_nFamilyName );
2626
    rInfo.m_eType           = pFont->m_eType;
2626
    rInfo.m_eType           = pFont->m_eType;
2627
    rInfo.m_aFamilyName     = m_pAtoms->getString( ATOM_FAMILYNAME, pFont->m_nFamilyName );
2627
    rInfo.m_aFamilyName     = m_pAtoms->getString( ATOM_FAMILYNAME, pFont->m_nFamilyName );
Lines 2838-2844 Link Here
2838
    if( !pFont )
2838
    if( !pFont )
2839
        return family::Unknown;
2839
        return family::Unknown;
2840
2840
2841
    ::std::hash_map< int, family::type >::const_iterator it =
2841
    ::boost::unordered_map< int, family::type >::const_iterator it =
2842
          m_aFamilyTypes.find( pFont->m_nFamilyName );
2842
          m_aFamilyTypes.find( pFont->m_nFamilyName );
2843
    return (it != m_aFamilyTypes.end()) ? it->second : family::Unknown;
2843
    return (it != m_aFamilyTypes.end()) ? it->second : family::Unknown;
2844
}
2844
}
Lines 2892-2898 Link Here
2892
    if( pFont && pFont->m_eType == fonttype::Type1 )
2892
    if( pFont && pFont->m_eType == fonttype::Type1 )
2893
    {
2893
    {
2894
        Type1FontFile* pPSFont = static_cast< Type1FontFile* >(pFont);
2894
        Type1FontFile* pPSFont = static_cast< Type1FontFile* >(pFont);
2895
        ::std::hash_map< int, OString >::const_iterator it = m_aAtomToDir.find( pPSFont->m_nDirectory );
2895
        ::boost::unordered_map< int, OString >::const_iterator it = m_aAtomToDir.find( pPSFont->m_nDirectory );
2896
        aPath = it->second;
2896
        aPath = it->second;
2897
        aPath += "/";
2897
        aPath += "/";
2898
        aPath += pPSFont->m_aFontFile;
2898
        aPath += pPSFont->m_aFontFile;
Lines 2900-2906 Link Here
2900
    else if( pFont && pFont->m_eType == fonttype::TrueType )
2900
    else if( pFont && pFont->m_eType == fonttype::TrueType )
2901
    {
2901
    {
2902
        TrueTypeFontFile* pTTFont = static_cast< TrueTypeFontFile* >(pFont);
2902
        TrueTypeFontFile* pTTFont = static_cast< TrueTypeFontFile* >(pFont);
2903
        ::std::hash_map< int, OString >::const_iterator it = m_aAtomToDir.find( pTTFont->m_nDirectory );
2903
        ::boost::unordered_map< int, OString >::const_iterator it = m_aAtomToDir.find( pTTFont->m_nDirectory );
2904
        aPath = it->second;
2904
        aPath = it->second;
2905
        aPath += "/";
2905
        aPath += "/";
2906
        aPath += pTTFont->m_aFontFile;
2906
        aPath += pTTFont->m_aFontFile;
Lines 3014-3020 Link Here
3014
            if( ! pFont->m_pMetrics ||
3014
            if( ! pFont->m_pMetrics ||
3015
                ! ( pFont->m_pMetrics->m_aPages[ code >> 11 ] & ( 1 << ( ( code >> 8 ) & 7 ) ) ) )
3015
                ! ( pFont->m_pMetrics->m_aPages[ code >> 11 ] & ( 1 << ( ( code >> 8 ) & 7 ) ) ) )
3016
                pFont->queryMetricPage( code >> 8, m_pAtoms );
3016
                pFont->queryMetricPage( code >> 8, m_pAtoms );
3017
            ::std::hash_map< sal_Unicode, bool >::const_iterator it = pFont->m_pMetrics->m_bVerticalSubstitutions.find( code );
3017
            ::boost::unordered_map< sal_Unicode, bool >::const_iterator it = pFont->m_pMetrics->m_bVerticalSubstitutions.find( code );
3018
            pHasSubst[i] = it != pFont->m_pMetrics->m_bVerticalSubstitutions.end();
3018
            pHasSubst[i] = it != pFont->m_pMetrics->m_bVerticalSubstitutions.end();
3019
        }
3019
        }
3020
    }
3020
    }
Lines 3119-3125 Link Here
3119
        {
3119
        {
3120
            int effectiveCode = pString[i];
3120
            int effectiveCode = pString[i];
3121
            effectiveCode |= bVertical ? 1 << 16 : 0;
3121
            effectiveCode |= bVertical ? 1 << 16 : 0;
3122
            ::std::hash_map< int, CharacterMetric >::const_iterator it =
3122
            ::boost::unordered_map< int, CharacterMetric >::const_iterator it =
3123
                  pFont->m_pMetrics->m_aMetrics.find( effectiveCode );
3123
                  pFont->m_pMetrics->m_aMetrics.find( effectiveCode );
3124
	    // if no vertical metrics are available assume rotated horizontal metrics
3124
	    // if no vertical metrics are available assume rotated horizontal metrics
3125
	    if( bVertical && (it == pFont->m_pMetrics->m_aMetrics.end()) )
3125
	    if( bVertical && (it == pFont->m_pMetrics->m_aMetrics.end()) )
Lines 3164-3170 Link Here
3164
        {
3164
        {
3165
            int effectiveCode = code;
3165
            int effectiveCode = code;
3166
            effectiveCode |= bVertical ? 1 << 16 : 0;
3166
            effectiveCode |= bVertical ? 1 << 16 : 0;
3167
            ::std::hash_map< int, CharacterMetric >::const_iterator it =
3167
            ::boost::unordered_map< int, CharacterMetric >::const_iterator it =
3168
                  pFont->m_pMetrics->m_aMetrics.find( effectiveCode );
3168
                  pFont->m_pMetrics->m_aMetrics.find( effectiveCode );
3169
            // if no vertical metrics are available assume rotated horizontal metrics
3169
            // if no vertical metrics are available assume rotated horizontal metrics
3170
            if( bVertical && (it == pFont->m_pMetrics->m_aMetrics.end()) )
3170
            if( bVertical && (it == pFont->m_pMetrics->m_aMetrics.end()) )
Lines 3323-3329 Link Here
3323
            {
3323
            {
3324
                // remove all fonts for the same file
3324
                // remove all fonts for the same file
3325
                // discarding their font ids
3325
                // discarding their font ids
3326
                ::std::hash_map< fontID, PrintFont* >::iterator current, next;
3326
                ::boost::unordered_map< fontID, PrintFont* >::iterator current, next;
3327
                current = m_aFonts.begin();
3327
                current = m_aFonts.begin();
3328
                OString aFileName( OUStringToOString( aTo.GetName(), aEncoding ) );
3328
                OString aFileName( OUStringToOString( aTo.GetName(), aEncoding ) );
3329
                while( current != m_aFonts.end() )
3329
                while( current != m_aFonts.end() )
Lines 3479-3485 Link Here
3479
    if( ! aFile.getLength() )
3479
    if( ! aFile.getLength() )
3480
        return false;
3480
        return false;
3481
3481
3482
    for( ::std::hash_map< fontID, PrintFont* >::const_iterator it = m_aFonts.begin(); it != m_aFonts.end(); ++it )
3482
    for( ::boost::unordered_map< fontID, PrintFont* >::const_iterator it = m_aFonts.begin(); it != m_aFonts.end(); ++it )
3483
    {
3483
    {
3484
        if( nFont != it->first )
3484
        if( nFont != it->first )
3485
        {
3485
        {
Lines 3502-3508 Link Here
3502
    ::std::list< fontID > aDuplicates;
3502
    ::std::list< fontID > aDuplicates;
3503
    for( ::std::list< fontID >::const_iterator it = rFonts.begin(); it != rFonts.end(); ++it )
3503
    for( ::std::list< fontID >::const_iterator it = rFonts.begin(); it != rFonts.end(); ++it )
3504
    {
3504
    {
3505
        ::std::hash_map< fontID, PrintFont* >::const_iterator haveFont = m_aFonts.find( *it );
3505
        ::boost::unordered_map< fontID, PrintFont* >::const_iterator haveFont = m_aFonts.find( *it );
3506
        if( haveFont == m_aFonts.end() )
3506
        if( haveFont == m_aFonts.end() )
3507
            continue;
3507
            continue;
3508
3508
Lines 3838-3844 Link Here
3838
            rUnicodeEnc.clear();
3838
            rUnicodeEnc.clear();
3839
            rWidths.clear();
3839
            rWidths.clear();
3840
            rWidths.reserve( pFont->m_pMetrics->m_aMetrics.size() );
3840
            rWidths.reserve( pFont->m_pMetrics->m_aMetrics.size() );
3841
            for( std::hash_map< int, CharacterMetric >::const_iterator it = 
3841
            for( boost::unordered_map< int, CharacterMetric >::const_iterator it = 
3842
                 pFont->m_pMetrics->m_aMetrics.begin();
3842
                 pFont->m_pMetrics->m_aMetrics.begin();
3843
                 it != pFont->m_pMetrics->m_aMetrics.end(); ++it )
3843
                 it != pFont->m_pMetrics->m_aMetrics.end(); ++it )
3844
            {
3844
            {
Lines 3875-3882 Link Here
3875
3875
3876
std::list< OString > PrintFontManager::getAdobeNameFromUnicode( sal_Unicode aChar ) const
3876
std::list< OString > PrintFontManager::getAdobeNameFromUnicode( sal_Unicode aChar ) const
3877
{
3877
{
3878
    std::pair< std::hash_multimap< sal_Unicode, rtl::OString >::const_iterator,
3878
    std::pair< boost::hash_multimap< sal_Unicode, rtl::OString >::const_iterator,
3879
        std::hash_multimap< sal_Unicode, rtl::OString >::const_iterator > range
3879
        boost::hash_multimap< sal_Unicode, rtl::OString >::const_iterator > range
3880
        =  m_aUnicodeToAdobename.equal_range( aChar );
3880
        =  m_aUnicodeToAdobename.equal_range( aChar );
3881
3881
3882
    std::list< OString > aRet;
3882
    std::list< OString > aRet;
Lines 3896-3903 Link Here
3896
// -------------------------------------------------------------------------
3896
// -------------------------------------------------------------------------
3897
std::list< sal_Unicode >  PrintFontManager::getUnicodeFromAdobeName( const rtl::OString& rName ) const
3897
std::list< sal_Unicode >  PrintFontManager::getUnicodeFromAdobeName( const rtl::OString& rName ) const
3898
{
3898
{
3899
    std::pair< std::hash_multimap< rtl::OString, sal_Unicode, rtl::OStringHash >::const_iterator,
3899
    std::pair< boost::hash_multimap< rtl::OString, sal_Unicode, rtl::OStringHash >::const_iterator,
3900
        std::hash_multimap< rtl::OString, sal_Unicode, rtl::OStringHash >::const_iterator > range
3900
        boost::hash_multimap< rtl::OString, sal_Unicode, rtl::OStringHash >::const_iterator > range
3901
        =  m_aAdobenameToUnicode.equal_range( rName );
3901
        =  m_aAdobenameToUnicode.equal_range( rName );
3902
3902
3903
    std::list< sal_Unicode > aRet;
3903
    std::list< sal_Unicode > aRet;
(-)vcl/unx/generic/gdi/salgdi3.cxx (-1 / +1 lines)
Lines 71-77 Link Here
71
#include "outdev.h"
71
#include "outdev.h"
72
72
73
73
74
#include <hash_set>
74
#include <boost/unordered_set.hpp>
75
75
76
#ifdef ENABLE_GRAPHITE
76
#ifdef ENABLE_GRAPHITE
77
#include <graphite_layout.hxx>
77
#include <graphite_layout.hxx>
(-)vcl/unx/generic/gdi/salprnpsp.cxx (-4 / +4 lines)
Lines 395-401 Link Here
395
        
395
        
396
        // set/clear backwards compatibility flag
396
        // set/clear backwards compatibility flag
397
        bool bStrictSO52Compatibility = false;
397
        bool bStrictSO52Compatibility = false;
398
        std::hash_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
398
        boost::unordered_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
399
            pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
399
            pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
400
           
400
           
401
        if( compat_it != pJobSetup->maValueMap.end() )
401
        if( compat_it != pJobSetup->maValueMap.end() )
Lines 632-638 Link Here
632
{
632
{
633
    // set/clear backwards compatibility flag
633
    // set/clear backwards compatibility flag
634
    bool bStrictSO52Compatibility = false;
634
    bool bStrictSO52Compatibility = false;
635
    std::hash_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
635
    boost::unordered_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
636
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
636
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
637
637
638
    if( compat_it != pJobSetup->maValueMap.end() )
638
    if( compat_it != pJobSetup->maValueMap.end() )
Lines 990-996 Link Here
990
			m_aTmpFile = getTmpName();
990
			m_aTmpFile = getTmpName();
991
            nMode = S_IRUSR | S_IWUSR;
991
            nMode = S_IRUSR | S_IWUSR;
992
992
993
			::std::hash_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
993
			::boost::unordered_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
994
			it = pJobSetup->maValueMap.find( ::rtl::OUString::createFromAscii( "FAX#" ) );
994
			it = pJobSetup->maValueMap.find( ::rtl::OUString::createFromAscii( "FAX#" ) );
995
			if( it != pJobSetup->maValueMap.end() )
995
			if( it != pJobSetup->maValueMap.end() )
996
				m_aFaxNr = it->second;
996
				m_aFaxNr = it->second;
Lines 1020-1026 Link Here
1020
    
1020
    
1021
    // set/clear backwards compatibility flag
1021
    // set/clear backwards compatibility flag
1022
    bool bStrictSO52Compatibility = false;
1022
    bool bStrictSO52Compatibility = false;
1023
    std::hash_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
1023
    boost::unordered_map<rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator compat_it =
1024
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
1024
        pJobSetup->maValueMap.find( rtl::OUString( RTL_CONSTASCII_USTRINGPARAM( "StrictSO52Compatibility" ) ) );
1025
1025
1026
    if( compat_it != pJobSetup->maValueMap.end() )
1026
    if( compat_it != pJobSetup->maValueMap.end() )
(-)vcl/unx/generic/gdi/pspgraphics.cxx (-1 / +1 lines)
Lines 909-915 Link Here
909
    const psp::PrinterInfo& rInfo = psp::PrinterInfoManager::get().getPrinterInfo( m_pJobData->m_aPrinterName );
909
    const psp::PrinterInfo& rInfo = psp::PrinterInfoManager::get().getPrinterInfo( m_pJobData->m_aPrinterName );
910
    if( rInfo.m_bPerformFontSubstitution )
910
    if( rInfo.m_bPerformFontSubstitution )
911
    {
911
    {
912
        for( std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator it = rInfo.m_aFontSubstitutes.begin(); it != rInfo.m_aFontSubstitutes.end(); ++it )
912
        for( boost::unordered_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >::const_iterator it = rInfo.m_aFontSubstitutes.begin(); it != rInfo.m_aFontSubstitutes.end(); ++it )
913
            pOutDev->ImplAddDevFontSubstitute( it->first, it->second, FONT_SUBSTITUTE_ALWAYS );
913
            pOutDev->ImplAddDevFontSubstitute( it->first, it->second, FONT_SUBSTITUTE_ALWAYS );
914
    }
914
    }
915
}
915
}
(-)vcl/aqua/source/dtrans/DataFlavorMapping.hxx (-2 / +2 lines)
Lines 33-39 Link Here
33
#import <Cocoa/Cocoa.h>
33
#import <Cocoa/Cocoa.h>
34
#include <postmac.h>
34
#include <postmac.h>
35
35
36
#include <hash_map>
36
#include <boost/unordered_map.hpp>
37
#include <memory>
37
#include <memory>
38
#include <boost/shared_ptr.hpp>
38
#include <boost/shared_ptr.hpp>
39
39
Lines 136-142 Link Here
136
136
137
private:
137
private:
138
  ::com::sun::star::uno::Reference< ::com::sun::star::datatransfer::XMimeContentTypeFactory> mrXMimeCntFactory;
138
  ::com::sun::star::uno::Reference< ::com::sun::star::datatransfer::XMimeContentTypeFactory> mrXMimeCntFactory;
139
  typedef std::hash_map< rtl::OUString, NSString*, rtl::OUStringHash > OfficeOnlyTypes;
139
  typedef boost::unordered_map< rtl::OUString, NSString*, rtl::OUStringHash > OfficeOnlyTypes;
140
  mutable OfficeOnlyTypes maOfficeOnlyTypes;
140
  mutable OfficeOnlyTypes maOfficeOnlyTypes;
141
};
141
};
142
142
(-)vcl/aqua/source/a11y/documentfocuslistener.hxx (-1 / +1 lines)
Lines 91-94 Link Here
91
    AquaA11yFocusTracker& m_aFocusTracker;
91
    AquaA11yFocusTracker& m_aFocusTracker;
92
};
92
};
93
93
94
#endif // _DOCUMENTFOCUSLISTENER_HXX_
94
#endif // _DOCUMENTFOCUSLISTENER_HXX_
(-)vcl/aqua/source/a11y/aqua11yfocuslistener.hxx (-1 / +1 lines)
Lines 55-58 Link Here
55
    virtual oslInterlockedCount SAL_CALL release() SAL_THROW(());	
55
    virtual oslInterlockedCount SAL_CALL release() SAL_THROW(());	
56
};
56
};
57
57
58
#endif // _AQUA11YFOCUSLISTENER_HXX_
58
#endif // _AQUA11YFOCUSLISTENER_HXX_
(-)vcl/win/source/app/salinfo.cxx (-3 / +3 lines)
Lines 39-45 Link Here
39
39
40
#include "svdata.hxx"
40
#include "svdata.hxx"
41
41
42
#include <hash_map>
42
#include <boost/unordered_map.hpp>
43
43
44
SalSystem* WinSalInstance::CreateSalSystem()
44
SalSystem* WinSalInstance::CreateSalSystem()
45
{
45
{
Lines 139-145 Link Here
139
            DISPLAY_DEVICEW aDev;
139
            DISPLAY_DEVICEW aDev;
140
            aDev.cb = sizeof( aDev );
140
            aDev.cb = sizeof( aDev );
141
            DWORD nDevice = 0;
141
            DWORD nDevice = 0;
142
			std::hash_map< rtl::OUString, int, rtl::OUStringHash > aDeviceStringCount;
142
			boost::unordered_map< rtl::OUString, int, rtl::OUStringHash > aDeviceStringCount;
143
            while( EnumDisplayDevicesW( NULL, nDevice++, &aDev, 0 ) )
143
            while( EnumDisplayDevicesW( NULL, nDevice++, &aDev, 0 ) )
144
            {
144
            {
145
                if( (aDev.StateFlags & DISPLAY_DEVICE_ACTIVE)
145
                if( (aDev.StateFlags & DISPLAY_DEVICE_ACTIVE)
Lines 165-171 Link Here
165
            EnumDisplayMonitors( aDesktopRC, NULL, ImplEnumMonitorProc, reinterpret_cast<LPARAM>(this) );
165
            EnumDisplayMonitors( aDesktopRC, NULL, ImplEnumMonitorProc, reinterpret_cast<LPARAM>(this) );
166
166
167
			// append monitor numbers to name strings
167
			// append monitor numbers to name strings
168
			std::hash_map< rtl::OUString, int, rtl::OUStringHash > aDevCount( aDeviceStringCount );
168
			boost::unordered_map< rtl::OUString, int, rtl::OUStringHash > aDevCount( aDeviceStringCount );
169
			unsigned int nMonitors = m_aMonitors.size();
169
			unsigned int nMonitors = m_aMonitors.size();
170
			for( unsigned int i = 0; i < nMonitors; i++ )
170
			for( unsigned int i = 0; i < nMonitors; i++ )
171
			{
171
			{
(-)vcl/win/source/gdi/winlayout.cxx (-2 / +2 lines)
Lines 58-67 Link Here
58
#include <winver.h>
58
#include <winver.h>
59
#endif // USE_UNISCRIBE
59
#endif // USE_UNISCRIBE
60
60
61
#include <hash_map>
61
#include <boost/unordered_map.hpp>
62
#include <set>
62
#include <set>
63
63
64
typedef std::hash_map<int,int> IntMap;
64
typedef boost::unordered_map<int,int> IntMap;
65
typedef std::set<int> IntSet;
65
typedef std::set<int> IntSet;
66
66
67
// Graphite headers
67
// Graphite headers
(-)vcl/source/helper/canvastools.cxx (-3 / +3 lines)
Lines 67-73 Link Here
67
67
68
#include <canvasbitmap.hxx>
68
#include <canvasbitmap.hxx>
69
#include <vcl/canvastools.hxx>
69
#include <vcl/canvastools.hxx>
70
#include <hash_map>
70
#include <boost/unordered_map.hpp>
71
71
72
72
73
using namespace ::com::sun::star;
73
using namespace ::com::sun::star;
Lines 182-189 Link Here
182
182
183
        const uno::Sequence< sal_Int8 > getTunnelIdentifier( TunnelIdentifierType eType )
183
        const uno::Sequence< sal_Int8 > getTunnelIdentifier( TunnelIdentifierType eType )
184
        {
184
        {
185
            static std::hash_map< int, uno::Sequence< sal_Int8 > > aIds;
185
            static boost::unordered_map< int, uno::Sequence< sal_Int8 > > aIds;
186
            std::hash_map< int, uno::Sequence< sal_Int8 > >::iterator it =
186
            boost::unordered_map< int, uno::Sequence< sal_Int8 > >::iterator it =
187
                aIds.find( eType );
187
                aIds.find( eType );
188
            if( it == aIds.end() )
188
            if( it == aIds.end() )
189
            {
189
            {
(-)vcl/source/control/tabctrl.cxx (-5 / +5 lines)
Lines 42-48 Link Here
42
#include "svdata.hxx"
42
#include "svdata.hxx"
43
#include "window.h"
43
#include "window.h"
44
44
45
#include <hash_map>
45
#include <boost/unordered_map.hpp>
46
#include <vector>
46
#include <vector>
47
47
48
// =======================================================================
48
// =======================================================================
Lines 72-79 Link Here
72
72
73
struct ImplTabCtrlData
73
struct ImplTabCtrlData
74
{
74
{
75
    std::hash_map< int, int >		maLayoutPageIdToLine;
75
    boost::unordered_map< int, int >		maLayoutPageIdToLine;
76
    std::hash_map< int, int >		maLayoutLineToPageId;
76
    boost::unordered_map< int, int >		maLayoutLineToPageId;
77
    std::vector< Rectangle >		maTabRectangles;
77
    std::vector< Rectangle >		maTabRectangles;
78
    Point                           maItemsOffset;       // offset of the tabitems
78
    Point                           maItemsOffset;       // offset of the tabitems
79
    std::vector< ImplTabItem >      maItemList;
79
    std::vector< ImplTabItem >      maItemList;
Lines 2079-2085 Link Here
2079
2079
2080
    if( HasLayoutData() )
2080
    if( HasLayoutData() )
2081
    {
2081
    {
2082
        std::hash_map< int, int >::const_iterator it = mpTabCtrlData->maLayoutPageIdToLine.find( (int)nPageId );
2082
        boost::unordered_map< int, int >::const_iterator it = mpTabCtrlData->maLayoutPageIdToLine.find( (int)nPageId );
2083
        if( it != mpTabCtrlData->maLayoutPageIdToLine.end() )
2083
        if( it != mpTabCtrlData->maLayoutPageIdToLine.end() )
2084
        {
2084
        {
2085
            Pair aPair = mpControlData->mpLayoutData->GetLineStartEnd( it->second );
2085
            Pair aPair = mpControlData->mpLayoutData->GetLineStartEnd( it->second );
Lines 2144-2150 Link Here
2144
2144
2145
    if( HasLayoutData() )
2145
    if( HasLayoutData() )
2146
    {
2146
    {
2147
        std::hash_map< int, int >::const_iterator it = mpTabCtrlData->maLayoutPageIdToLine.find( (int)nPage );
2147
        boost::unordered_map< int, int >::const_iterator it = mpTabCtrlData->maLayoutPageIdToLine.find( (int)nPage );
2148
        if( it != mpTabCtrlData->maLayoutPageIdToLine.end() )
2148
        if( it != mpTabCtrlData->maLayoutPageIdToLine.end() )
2149
        {
2149
        {
2150
            if( it->second >= 0 && it->second < static_cast<int>(mpTabCtrlData->maTabRectangles.size()) )
2150
            if( it->second >= 0 && it->second < static_cast<int>(mpTabCtrlData->maTabRectangles.size()) )
(-)vcl/source/gdi/outdev3.cxx (-2 / +2 lines)
Lines 1000-1007 Link Here
1000
1000
1001
size_t ImplFontEntry::GFBCacheKey_Hash::operator()( const GFBCacheKey& rData ) const
1001
size_t ImplFontEntry::GFBCacheKey_Hash::operator()( const GFBCacheKey& rData ) const
1002
{
1002
{
1003
    std::hash<sal_UCS4> a;
1003
    boost::hash<sal_UCS4> a;
1004
    std::hash<int > b;
1004
    boost::hash<int > b;
1005
    return a(rData.first) ^ b(rData.second);
1005
    return a(rData.first) ^ b(rData.second);
1006
}
1006
}
1007
1007
(-)vcl/source/gdi/impimagetree.cxx (-1 / +1 lines)
Lines 29-35 Link Here
29
#include <memory>
29
#include <memory>
30
#include <utility>
30
#include <utility>
31
#include <vector>
31
#include <vector>
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
33
34
#include "com/sun/star/container/XNameAccess.hpp"
34
#include "com/sun/star/container/XNameAccess.hpp"
35
#include "com/sun/star/io/XInputStream.hpp"
35
#include "com/sun/star/io/XInputStream.hpp"
(-)vcl/source/gdi/print3.cxx (-14 / +14 lines)
Lines 46-53 Link Here
46
#include "com/sun/star/awt/Size.hpp"
46
#include "com/sun/star/awt/Size.hpp"
47
#include "comphelper/processfactory.hxx"
47
#include "comphelper/processfactory.hxx"
48
48
49
#include <hash_map>
49
#include <boost/unordered_map.hpp>
50
#include <hash_set>
50
#include <boost/unordered_set.hpp>
51
51
52
using namespace com::sun::star;
52
using namespace com::sun::star;
53
using namespace com::sun::star::uno;
53
using namespace com::sun::star::uno;
Lines 145-153 Link Here
145
        ControlDependency() : mnDependsOnEntry( -1 ) {}
145
        ControlDependency() : mnDependsOnEntry( -1 ) {}
146
    };
146
    };
147
    
147
    
148
    typedef std::hash_map< rtl::OUString, size_t, rtl::OUStringHash > PropertyToIndexMap;
148
    typedef boost::unordered_map< rtl::OUString, size_t, rtl::OUStringHash > PropertyToIndexMap;
149
    typedef std::hash_map< rtl::OUString, ControlDependency, rtl::OUStringHash > ControlDependencyMap;
149
    typedef boost::unordered_map< rtl::OUString, ControlDependency, rtl::OUStringHash > ControlDependencyMap;
150
    typedef std::hash_map< rtl::OUString, Sequence< sal_Bool >, rtl::OUStringHash > ChoiceDisableMap;
150
    typedef boost::unordered_map< rtl::OUString, Sequence< sal_Bool >, rtl::OUStringHash > ChoiceDisableMap;
151
    
151
    
152
    boost::shared_ptr<Printer>                                  mpPrinter;
152
    boost::shared_ptr<Printer>                                  mpPrinter;
153
    Sequence< PropertyValue >                                   maUIOptions;
153
    Sequence< PropertyValue >                                   maUIOptions;
Lines 1281-1287 Link Here
1281
1281
1282
Sequence< PropertyValue > PrinterController::getJobProperties( const Sequence< PropertyValue >& i_rMergeList ) const
1282
Sequence< PropertyValue > PrinterController::getJobProperties( const Sequence< PropertyValue >& i_rMergeList ) const
1283
{
1283
{
1284
    std::hash_set< rtl::OUString, rtl::OUStringHash > aMergeSet;
1284
    boost::unordered_set< rtl::OUString, rtl::OUStringHash > aMergeSet;
1285
    size_t nResultLen = size_t(i_rMergeList.getLength()) + mpImplData->maUIProperties.size() + 3; 
1285
    size_t nResultLen = size_t(i_rMergeList.getLength()) + mpImplData->maUIProperties.size() + 3; 
1286
    for( int i = 0; i < i_rMergeList.getLength(); i++ )
1286
    for( int i = 0; i < i_rMergeList.getLength(); i++ )
1287
        aMergeSet.insert( i_rMergeList[i].Name );
1287
        aMergeSet.insert( i_rMergeList[i].Name );
Lines 1330-1343 Link Here
1330
1330
1331
beans::PropertyValue* PrinterController::getValue( const rtl::OUString& i_rProperty )
1331
beans::PropertyValue* PrinterController::getValue( const rtl::OUString& i_rProperty )
1332
{
1332
{
1333
    std::hash_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1333
    boost::unordered_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1334
        mpImplData->maPropertyToIndex.find( i_rProperty );
1334
        mpImplData->maPropertyToIndex.find( i_rProperty );
1335
    return it != mpImplData->maPropertyToIndex.end() ? &mpImplData->maUIProperties[it->second] : NULL;
1335
    return it != mpImplData->maPropertyToIndex.end() ? &mpImplData->maUIProperties[it->second] : NULL;
1336
}
1336
}
1337
1337
1338
const beans::PropertyValue* PrinterController::getValue( const rtl::OUString& i_rProperty ) const
1338
const beans::PropertyValue* PrinterController::getValue( const rtl::OUString& i_rProperty ) const
1339
{
1339
{
1340
    std::hash_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1340
    boost::unordered_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1341
        mpImplData->maPropertyToIndex.find( i_rProperty );
1341
        mpImplData->maPropertyToIndex.find( i_rProperty );
1342
    return it != mpImplData->maPropertyToIndex.end() ? &mpImplData->maUIProperties[it->second] : NULL;
1342
    return it != mpImplData->maPropertyToIndex.end() ? &mpImplData->maUIProperties[it->second] : NULL;
1343
}
1343
}
Lines 1367-1373 Link Here
1367
1367
1368
void PrinterController::setValue( const beans::PropertyValue& i_rValue )
1368
void PrinterController::setValue( const beans::PropertyValue& i_rValue )
1369
{
1369
{
1370
    std::hash_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1370
    boost::unordered_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1371
        mpImplData->maPropertyToIndex.find( i_rValue.Name );
1371
        mpImplData->maPropertyToIndex.find( i_rValue.Name );
1372
    if( it != mpImplData->maPropertyToIndex.end() )
1372
    if( it != mpImplData->maPropertyToIndex.end() )
1373
        mpImplData->maUIProperties[ it->second ] = i_rValue;
1373
        mpImplData->maUIProperties[ it->second ] = i_rValue;
Lines 1446-1452 Link Here
1446
1446
1447
void PrinterController::enableUIOption( const rtl::OUString& i_rProperty, bool i_bEnable )
1447
void PrinterController::enableUIOption( const rtl::OUString& i_rProperty, bool i_bEnable )
1448
{
1448
{
1449
    std::hash_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1449
    boost::unordered_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator it =
1450
        mpImplData->maPropertyToIndex.find( i_rProperty );
1450
        mpImplData->maPropertyToIndex.find( i_rProperty );
1451
    if( it != mpImplData->maPropertyToIndex.end() )
1451
    if( it != mpImplData->maPropertyToIndex.end() )
1452
    {
1452
    {
Lines 1464-1470 Link Here
1464
bool PrinterController::isUIOptionEnabled( const rtl::OUString& i_rProperty ) const
1464
bool PrinterController::isUIOptionEnabled( const rtl::OUString& i_rProperty ) const
1465
{
1465
{
1466
    bool bEnabled = false;
1466
    bool bEnabled = false;
1467
    std::hash_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator prop_it =
1467
    boost::unordered_map< rtl::OUString, size_t, rtl::OUStringHash >::const_iterator prop_it =
1468
        mpImplData->maPropertyToIndex.find( i_rProperty );
1468
        mpImplData->maPropertyToIndex.find( i_rProperty );
1469
    if( prop_it != mpImplData->maPropertyToIndex.end() )
1469
    if( prop_it != mpImplData->maPropertyToIndex.end() )
1470
    {
1470
    {
Lines 1694-1700 Link Here
1694
Any PrinterOptionsHelper::getValue( const rtl::OUString& i_rPropertyName ) const
1694
Any PrinterOptionsHelper::getValue( const rtl::OUString& i_rPropertyName ) const
1695
{
1695
{
1696
    Any aRet;
1696
    Any aRet;
1697
    std::hash_map< rtl::OUString, Any, rtl::OUStringHash >::const_iterator it =
1697
    boost::unordered_map< rtl::OUString, Any, rtl::OUStringHash >::const_iterator it =
1698
        m_aPropertyMap.find( i_rPropertyName );
1698
        m_aPropertyMap.find( i_rPropertyName );
1699
    if( it != m_aPropertyMap.end() )
1699
    if( it != m_aPropertyMap.end() )
1700
        aRet = it->second;
1700
        aRet = it->second;
Lines 1709-1715 Link Here
1709
bool PrinterOptionsHelper::hasProperty( const rtl::OUString& i_rPropertyName ) const
1709
bool PrinterOptionsHelper::hasProperty( const rtl::OUString& i_rPropertyName ) const
1710
{
1710
{
1711
    Any aRet;
1711
    Any aRet;
1712
    std::hash_map< rtl::OUString, Any, rtl::OUStringHash >::const_iterator it =
1712
    boost::unordered_map< rtl::OUString, Any, rtl::OUStringHash >::const_iterator it =
1713
        m_aPropertyMap.find( i_rPropertyName );
1713
        m_aPropertyMap.find( i_rPropertyName );
1714
    return it != m_aPropertyMap.end();
1714
    return it != m_aPropertyMap.end();
1715
}
1715
}
Lines 1749-1755 Link Here
1749
    for( sal_Int32 i = 0; i < nElements; i++ )
1749
    for( sal_Int32 i = 0; i < nElements; i++ )
1750
    {
1750
    {
1751
        bool bElementChanged = false;
1751
        bool bElementChanged = false;
1752
        std::hash_map< rtl::OUString, Any, rtl::OUStringHash >::iterator it =
1752
        boost::unordered_map< rtl::OUString, Any, rtl::OUStringHash >::iterator it =
1753
            m_aPropertyMap.find( pVals[ i ].Name );
1753
            m_aPropertyMap.find( pVals[ i ].Name );
1754
        if( it != m_aPropertyMap.end() )
1754
        if( it != m_aPropertyMap.end() )
1755
        {
1755
        {
(-)vcl/source/gdi/pdfwriter_impl.cxx (-8 / +8 lines)
Lines 708-714 Link Here
708
            // find or create a hierarchical field
708
            // find or create a hierarchical field
709
            // first find the fully qualified name up to this field
709
            // first find the fully qualified name up to this field
710
            aDomain = aFullName.copy( 0, nTokenIndex-1 );
710
            aDomain = aFullName.copy( 0, nTokenIndex-1 );
711
            std::hash_map< rtl::OString, sal_Int32, rtl::OStringHash >::const_iterator it = m_aFieldNameMap.find( aDomain );
711
            boost::unordered_map< rtl::OString, sal_Int32, rtl::OStringHash >::const_iterator it = m_aFieldNameMap.find( aDomain );
712
            if( it == m_aFieldNameMap.end() )
712
            if( it == m_aFieldNameMap.end() )
713
            {
713
            {
714
                 // create new hierarchy field
714
                 // create new hierarchy field
Lines 769-775 Link Here
769
    // insert widget into its hierarchy field
769
    // insert widget into its hierarchy field
770
    if( aDomain.getLength() )
770
    if( aDomain.getLength() )
771
    {
771
    {
772
        std::hash_map< rtl::OString, sal_Int32, rtl::OStringHash >::const_iterator it = m_aFieldNameMap.find( aDomain );
772
        boost::unordered_map< rtl::OString, sal_Int32, rtl::OStringHash >::const_iterator it = m_aFieldNameMap.find( aDomain );
773
        if( it != m_aFieldNameMap.end() )
773
        if( it != m_aFieldNameMap.end() )
774
        {
774
        {
775
            OSL_ENSURE( it->second >= 0 && it->second < sal_Int32( m_aWidgets.size() ), "invalid field index" );
775
            OSL_ENSURE( it->second >= 0 && it->second < sal_Int32( m_aWidgets.size() ), "invalid field index" );
Lines 796-806 Link Here
796
796
797
    if( ! m_aContext.AllowDuplicateFieldNames )
797
    if( ! m_aContext.AllowDuplicateFieldNames )
798
    {
798
    {
799
        std::hash_map<OString, sal_Int32, OStringHash>::iterator it = m_aFieldNameMap.find( aFullName );
799
        boost::unordered_map<OString, sal_Int32, OStringHash>::iterator it = m_aFieldNameMap.find( aFullName );
800
    
800
    
801
        if( it != m_aFieldNameMap.end() ) // not unique
801
        if( it != m_aFieldNameMap.end() ) // not unique
802
        {
802
        {
803
            std::hash_map< OString, sal_Int32, OStringHash >::const_iterator check_it;
803
            boost::unordered_map< OString, sal_Int32, OStringHash >::const_iterator check_it;
804
            OString aTry;
804
            OString aTry;
805
            sal_Int32 nTry = 2;
805
            sal_Int32 nTry = 2;
806
            do
806
            do
Lines 2872-2878 Link Here
2872
        if( ! m_aRoleMap.empty() )
2872
        if( ! m_aRoleMap.empty() )
2873
        {
2873
        {
2874
            aLine.append( "/RoleMap<<" );
2874
            aLine.append( "/RoleMap<<" );
2875
            for( std::hash_map<OString,OString,OStringHash>::const_iterator
2875
            for( boost::unordered_map<OString,OString,OStringHash>::const_iterator
2876
                 it = m_aRoleMap.begin(); it != m_aRoleMap.end(); ++it )
2876
                 it = m_aRoleMap.begin(); it != m_aRoleMap.end(); ++it )
2877
            {
2877
            {
2878
                aLine.append( '/' );
2878
                aLine.append( '/' );
Lines 6672-6678 Link Here
6672
{
6672
{
6673
    // sort widget annotations on each page as per their
6673
    // sort widget annotations on each page as per their
6674
    // TabOrder attribute
6674
    // TabOrder attribute
6675
    std::hash_map< sal_Int32, AnnotSortContainer > sorted;
6675
    boost::unordered_map< sal_Int32, AnnotSortContainer > sorted;
6676
    int nWidgets = m_aWidgets.size();
6676
    int nWidgets = m_aWidgets.size();
6677
    for( int nW = 0; nW < nWidgets; nW++ )
6677
    for( int nW = 0; nW < nWidgets; nW++ )
6678
    {
6678
    {
Lines 6692-6698 Link Here
6692
            }
6692
            }
6693
        }
6693
        }
6694
    }
6694
    }
6695
    for( std::hash_map< sal_Int32, AnnotSortContainer >::iterator it = sorted.begin(); it != sorted.end(); ++it )
6695
    for( boost::unordered_map< sal_Int32, AnnotSortContainer >::iterator it = sorted.begin(); it != sorted.end(); ++it )
6696
    {
6696
    {
6697
        // append entries for non widget annotations
6697
        // append entries for non widget annotations
6698
        PDFPage& rPage = m_aPages[ it->first ];
6698
        PDFPage& rPage = m_aPages[ it->first ];
Lines 11828-11834 Link Here
11828
    {
11828
    {
11829
        PDFWidget& rGroupWidget = m_aWidgets[ group->second ];
11829
        PDFWidget& rGroupWidget = m_aWidgets[ group->second ];
11830
        // check whether all kids have a unique OnValue
11830
        // check whether all kids have a unique OnValue
11831
        std::hash_map< OUString, sal_Int32, OUStringHash > aOnValues;
11831
        boost::unordered_map< OUString, sal_Int32, OUStringHash > aOnValues;
11832
        int nChildren = rGroupWidget.m_aKidsIndex.size();
11832
        int nChildren = rGroupWidget.m_aKidsIndex.size();
11833
        bool bIsUnique = true;
11833
        bool bIsUnique = true;
11834
        for( int nKid = 0; nKid < nChildren && bIsUnique; nKid++ )
11834
        for( int nKid = 0; nKid < nChildren && bIsUnique; nKid++ )
(-)vcl/source/gdi/jobset.cxx (-2 / +2 lines)
Lines 211-217 Link Here
211
{
211
{
212
	if( mpData )
212
	if( mpData )
213
	{
213
	{
214
		::std::hash_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
214
		::boost::unordered_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
215
		it = mpData->maValueMap.find( rKey );
215
		it = mpData->maValueMap.find( rKey );
216
		return it != mpData->maValueMap.end() ? String( it->second ) : String();
216
		return it != mpData->maValueMap.end() ? String( it->second ) : String();
217
	}
217
	}
Lines 429-435 Link Here
429
			rOStream.Write( (char*)&aOldData, sizeof( aOldData ) );
429
			rOStream.Write( (char*)&aOldData, sizeof( aOldData ) );
430
			rOStream.Write( (char*)&aOldJobData, nOldJobDataSize );
430
			rOStream.Write( (char*)&aOldJobData, nOldJobDataSize );
431
			rOStream.Write( (char*)pJobData->mpDriverData, pJobData->mnDriverDataLen );
431
			rOStream.Write( (char*)pJobData->mpDriverData, pJobData->mnDriverDataLen );
432
			::std::hash_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
432
			::boost::unordered_map< ::rtl::OUString, ::rtl::OUString, ::rtl::OUStringHash >::const_iterator it;
433
			for( it = pJobData->maValueMap.begin(); it != pJobData->maValueMap.end(); ++it )
433
			for( it = pJobData->maValueMap.begin(); it != pJobData->maValueMap.end(); ++it )
434
			{
434
			{
435
				rOStream.WriteByteString( it->first, RTL_TEXTENCODING_UTF8 );
435
				rOStream.WriteByteString( it->first, RTL_TEXTENCODING_UTF8 );
(-)vcl/source/gdi/pdfwriter_impl.hxx (-5 / +5 lines)
Lines 45-51 Link Here
45
45
46
#include <vector>
46
#include <vector>
47
#include <map>
47
#include <map>
48
#include <hash_map>
48
#include <boost/unordered_map.hpp>
49
#include <list>
49
#include <list>
50
50
51
#include <boost/shared_array.hpp>
51
#include <boost/shared_array.hpp>
Lines 435-442 Link Here
435
        {}
435
        {}
436
    };
436
    };
437
437
438
    typedef std::hash_map< rtl::OString, SvMemoryStream*, rtl::OStringHash > PDFAppearanceStreams;
438
    typedef boost::unordered_map< rtl::OString, SvMemoryStream*, rtl::OStringHash > PDFAppearanceStreams;
439
    typedef std::hash_map< rtl::OString, PDFAppearanceStreams, rtl::OStringHash > PDFAppearanceMap;
439
    typedef boost::unordered_map< rtl::OString, PDFAppearanceStreams, rtl::OStringHash > PDFAppearanceMap;
440
440
441
    struct PDFWidget : public PDFAnnotation
441
    struct PDFWidget : public PDFAnnotation
442
    {
442
    {
Lines 643-649 Link Here
643
    bool								m_bEmitStructure;
643
    bool								m_bEmitStructure;
644
    bool								m_bNewMCID;
644
    bool								m_bNewMCID;
645
    /* role map of struct tree root */
645
    /* role map of struct tree root */
646
    std::hash_map< rtl::OString, rtl::OString, rtl::OStringHash >
646
    boost::unordered_map< rtl::OString, rtl::OString, rtl::OStringHash >
647
                                        m_aRoleMap;
647
                                        m_aRoleMap;
648
648
649
    /* contains all widgets used in the PDF
649
    /* contains all widgets used in the PDF
Lines 654-660 Link Here
654
    /* used to store control id during beginControlAppearance/endControlAppearance */
654
    /* used to store control id during beginControlAppearance/endControlAppearance */
655
    sal_Int32							m_nCurrentControl;
655
    sal_Int32							m_nCurrentControl;
656
    /* hash_map for field names, used to ensure unique field names */
656
    /* hash_map for field names, used to ensure unique field names */
657
    std::hash_map< rtl::OString, sal_Int32, rtl::OStringHash > m_aFieldNameMap;
657
    boost::unordered_map< rtl::OString, sal_Int32, rtl::OStringHash > m_aFieldNameMap;
658
658
659
    /* contains Bitmaps for gradient functions until they are written
659
    /* contains Bitmaps for gradient functions until they are written
660
     *  to the file stream */
660
     *  to the file stream */
(-)vcl/source/gdi/configsettings.cxx (-2 / +2 lines)
Lines 86-92 Link Here
86
    if( ! IsValidConfigMgr() )
86
    if( ! IsValidConfigMgr() )
87
        return;
87
        return;
88
88
89
    std::hash_map< OUString, SmallOUStrMap, rtl::OUStringHash >::const_iterator group;
89
    boost::unordered_map< OUString, SmallOUStrMap, rtl::OUStringHash >::const_iterator group;
90
90
91
    for( group = m_aSettings.begin(); group != m_aSettings.end(); ++group )
91
    for( group = m_aSettings.begin(); group != m_aSettings.end(); ++group )
92
    {
92
    {
Lines 178-184 Link Here
178
178
179
const OUString& SettingsConfigItem::getValue( const OUString& rGroup, const OUString& rKey ) const
179
const OUString& SettingsConfigItem::getValue( const OUString& rGroup, const OUString& rKey ) const
180
{
180
{
181
    ::std::hash_map< OUString, SmallOUStrMap, rtl::OUStringHash >::const_iterator group = m_aSettings.find( rGroup );
181
    ::boost::unordered_map< OUString, SmallOUStrMap, rtl::OUStringHash >::const_iterator group = m_aSettings.find( rGroup );
182
    if( group == m_aSettings.end() || group->second.find( rKey ) == group->second.end() )
182
    if( group == m_aSettings.end() || group->second.find( rKey ) == group->second.end() )
183
    {
183
    {
184
        static OUString aEmpty;
184
        static OUString aEmpty;
(-)vcl/source/gdi/print.cxx (-4 / +4 lines)
Lines 335-341 Link Here
335
335
336
void ImplPrnQueueList::Add( SalPrinterQueueInfo* pData )
336
void ImplPrnQueueList::Add( SalPrinterQueueInfo* pData )
337
{
337
{
338
    std::hash_map< rtl::OUString, sal_Int32, rtl::OUStringHash >::iterator it =
338
    boost::unordered_map< rtl::OUString, sal_Int32, rtl::OUStringHash >::iterator it =
339
        m_aNameToIndex.find( pData->maPrinterName );
339
        m_aNameToIndex.find( pData->maPrinterName );
340
    if( it == m_aNameToIndex.end() )
340
    if( it == m_aNameToIndex.end() )
341
    {
341
    {
Lines 360-366 Link Here
360
ImplPrnQueueData* ImplPrnQueueList::Get( const rtl::OUString& rPrinter )
360
ImplPrnQueueData* ImplPrnQueueList::Get( const rtl::OUString& rPrinter )
361
{
361
{
362
    ImplPrnQueueData* pData = NULL;
362
    ImplPrnQueueData* pData = NULL;
363
    std::hash_map<rtl::OUString,sal_Int32,rtl::OUStringHash>::iterator it =
363
    boost::unordered_map<rtl::OUString,sal_Int32,rtl::OUStringHash>::iterator it =
364
        m_aNameToIndex.find( rPrinter );
364
        m_aNameToIndex.find( rPrinter );
365
    if( it != m_aNameToIndex.end() )
365
    if( it != m_aNameToIndex.end() )
366
        pData = &m_aQueueInfos[it->second];
366
        pData = &m_aQueueInfos[it->second];
Lines 1281-1287 Link Here
1281
    ImplSVData* pSVData = ImplGetSVData();
1281
    ImplSVData* pSVData = ImplGetSVData();
1282
    if( ! pSVData->mpPaperNames )
1282
    if( ! pSVData->mpPaperNames )
1283
    {
1283
    {
1284
        pSVData->mpPaperNames = new std::hash_map< int, rtl::OUString >();
1284
        pSVData->mpPaperNames = new boost::unordered_map< int, rtl::OUString >();
1285
        if( ImplGetResMgr() )
1285
        if( ImplGetResMgr() )
1286
        {
1286
        {
1287
            ResStringArray aPaperStrings( VclResId( RID_STR_PAPERNAMES ) );
1287
            ResStringArray aPaperStrings( VclResId( RID_STR_PAPERNAMES ) );
Lines 1301-1307 Link Here
1301
        }
1301
        }
1302
    }
1302
    }
1303
    
1303
    
1304
    std::hash_map<int,rtl::OUString>::const_iterator it = pSVData->mpPaperNames->find( (int)ePaper );
1304
    boost::unordered_map<int,rtl::OUString>::const_iterator it = pSVData->mpPaperNames->find( (int)ePaper );
1305
    return (it != pSVData->mpPaperNames->end()) ? it->second : rtl::OUString();
1305
    return (it != pSVData->mpPaperNames->end()) ? it->second : rtl::OUString();
1306
}
1306
}
1307
1307
(-)vcl/source/glyphs/graphite_adaptors.cxx (-1 / +1 lines)
Lines 61-67 Link Here
61
    inline float from_hinted(const int x) {
61
    inline float from_hinted(const int x) {
62
        return static_cast<float>(x + 32) / 64.0;
62
        return static_cast<float>(x + 32) / 64.0;
63
    }
63
    }
64
    typedef std::hash_map<long,bool> SilfMap;
64
    typedef boost::unordered_map<long,bool> SilfMap;
65
    SilfMap sSilfMap;
65
    SilfMap sSilfMap;
66
}
66
}
67
extern FT_Error (*pFTEmbolden)(FT_GlyphSlot);
67
extern FT_Error (*pFTEmbolden)(FT_GlyphSlot);
(-)vcl/source/glyphs/gcach_ftyp.cxx (-2 / +2 lines)
Lines 132-138 Link Here
132
static bool bEnableSizeFT = false;
132
static bool bEnableSizeFT = false;
133
133
134
struct EqStr{ bool operator()(const char* a, const char* b) const { return !strcmp(a,b); } };
134
struct EqStr{ bool operator()(const char* a, const char* b) const { return !strcmp(a,b); } };
135
typedef ::std::hash_map<const char*,FtFontFile*,::std::hash<const char*>, EqStr> FontFileList;
135
typedef ::boost::unordered_map<const char*,FtFontFile*,::boost::hash<const char*>, EqStr> FontFileList;
136
namespace { struct vclFontFileList : public rtl::Static< FontFileList, vclFontFileList > {}; }
136
namespace { struct vclFontFileList : public rtl::Static< FontFileList, vclFontFileList > {}; }
137
137
138
// -----------------------------------------------------------------------
138
// -----------------------------------------------------------------------
Lines 2054-2060 Link Here
2054
        // prepare glyphindex to character mapping
2054
        // prepare glyphindex to character mapping
2055
        // TODO: this is needed to support VCL's existing kerning infrastructure,
2055
        // TODO: this is needed to support VCL's existing kerning infrastructure,
2056
        // eliminate it up by redesigning kerning infrastructure to work with glyph indizes
2056
        // eliminate it up by redesigning kerning infrastructure to work with glyph indizes
2057
        typedef std::hash_multimap<sal_uInt16,sal_Unicode> Cmap;
2057
        typedef boost::hash_multimap<sal_uInt16,sal_Unicode> Cmap;
2058
        Cmap aCmap;
2058
        Cmap aCmap;
2059
        for( sal_Unicode aChar = 0x0020; aChar < 0xFFFE; ++aChar )
2059
        for( sal_Unicode aChar = 0x0020; aChar < 0xFFFE; ++aChar )
2060
        {
2060
        {
(-)vcl/source/glyphs/gcach_ftyp.hxx (-3 / +3 lines)
Lines 111-117 Link Here
111
111
112
    // cache unicode->glyphid mapping because looking it up is expensive
112
    // cache unicode->glyphid mapping because looking it up is expensive
113
    // TODO: change to hash_multimap when a use case requires a m:n mapping
113
    // TODO: change to hash_multimap when a use case requires a m:n mapping
114
    typedef ::std::hash_map<int,int> Int2IntMap;
114
    typedef ::boost::unordered_map<int,int> Int2IntMap;
115
    mutable Int2IntMap* mpChar2Glyph;
115
    mutable Int2IntMap* mpChar2Glyph;
116
    mutable Int2IntMap* mpGlyph2Char;
116
    mutable Int2IntMap* mpGlyph2Char;
117
    void InitHashes() const;
117
    void InitHashes() const;
Lines 157-163 Link Here
157
    FreetypeServerFont* CreateFont( const ImplFontSelectData& );
157
    FreetypeServerFont* CreateFont( const ImplFontSelectData& );
158
158
159
private:
159
private:
160
    typedef ::std::hash_map<sal_IntPtr,FtFontInfo*> FontList;
160
    typedef ::boost::unordered_map<sal_IntPtr,FtFontInfo*> FontList;
161
    FontList            maFontList;
161
    FontList            maFontList;
162
162
163
    sal_IntPtr          mnMaxFontId;
163
    sal_IntPtr          mnMaxFontId;
Lines 224-230 Link Here
224
    bool			mbArtBold;
224
    bool			mbArtBold;
225
    bool			mbUseGamma;
225
    bool			mbUseGamma;
226
226
227
    typedef ::std::hash_map<int,int> GlyphSubstitution;
227
    typedef ::boost::unordered_map<int,int> GlyphSubstitution;
228
    GlyphSubstitution           maGlyphSubstitution;
228
    GlyphSubstitution           maGlyphSubstitution;
229
    rtl_UnicodeToTextConverter  maRecodeConverter;
229
    rtl_UnicodeToTextConverter  maRecodeConverter;
230
230
(-)vcl/os2/source/gdi/os2layout.cxx (-2 / +2 lines)
Lines 52-59 Link Here
52
    #include <algorithm>
52
    #include <algorithm>
53
#endif // GCP_KERN_HACK
53
#endif // GCP_KERN_HACK
54
54
55
#include <hash_map>
55
#include <boost/unordered_map.hpp>
56
typedef std::hash_map<int,int> IntMap;
56
typedef boost::unordered_map<int,int> IntMap;
57
57
58
#define DROPPED_OUTGLYPH 0xFFFF
58
#define DROPPED_OUTGLYPH 0xFFFF
59
59
(-)vcl/inc/vcl/lazydelete.hxx (-2 / +2 lines)
Lines 27-33 Link Here
27
#include "dllapi.h"
27
#include "dllapi.h"
28
28
29
#include <vector>
29
#include <vector>
30
#include <hash_map>
30
#include <boost/unordered_map.hpp>
31
#include <algorithm>
31
#include <algorithm>
32
32
33
#if OSL_DEBUG_LEVEL > 2
33
#if OSL_DEBUG_LEVEL > 2
Lines 120-126 Link Here
120
        };
120
        };
121
        
121
        
122
        std::vector< DeleteObjectEntry >    m_aObjects;
122
        std::vector< DeleteObjectEntry >    m_aObjects;
123
        typedef std::hash_map< sal_IntPtr, unsigned int > PtrToIndexMap;
123
        typedef boost::unordered_map< sal_IntPtr, unsigned int > PtrToIndexMap;
124
        PtrToIndexMap                       m_aPtrToIndex;
124
        PtrToIndexMap                       m_aPtrToIndex;
125
        
125
        
126
        /** strict weak ordering funtion to bring objects to be destroyed lazily
126
        /** strict weak ordering funtion to bring objects to be destroyed lazily
(-)vcl/inc/vcl/configsettings.hxx (-3 / +3 lines)
Lines 28-41 Link Here
28
#include <unotools/configitem.hxx>
28
#include <unotools/configitem.hxx>
29
#include <vcl/dllapi.h>
29
#include <vcl/dllapi.h>
30
30
31
#include <hash_map>
31
#include <boost/unordered_map.hpp>
32
32
33
//........................................................................
33
//........................................................................
34
namespace vcl
34
namespace vcl
35
{
35
{
36
//........................................................................
36
//........................................................................
37
37
38
    typedef std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash > OUStrMap;
38
    typedef boost::unordered_map< rtl::OUString, rtl::OUString, rtl::OUStringHash > OUStrMap;
39
    class SmallOUStrMap : public OUStrMap { public: SmallOUStrMap() : OUStrMap(1) {} };
39
    class SmallOUStrMap : public OUStrMap { public: SmallOUStrMap() : OUStrMap(1) {} };
40
40
41
	//====================================================================
41
	//====================================================================
Lines 44-50 Link Here
44
    class VCL_DLLPUBLIC SettingsConfigItem : public ::utl::ConfigItem
44
    class VCL_DLLPUBLIC SettingsConfigItem : public ::utl::ConfigItem
45
    {
45
    {
46
46
47
        std::hash_map< rtl::OUString, SmallOUStrMap, rtl::OUStringHash > m_aSettings;
47
        boost::unordered_map< rtl::OUString, SmallOUStrMap, rtl::OUStringHash > m_aSettings;
48
48
49
        virtual void Notify( const com::sun::star::uno::Sequence< rtl::OUString >& rPropertyNames );
49
        virtual void Notify( const com::sun::star::uno::Sequence< rtl::OUString >& rPropertyNames );
50
50
(-)vcl/inc/vcl/printerinfomanager.hxx (-4 / +4 lines)
Lines 24-30 Link Here
24
#ifndef _PSPRINT_PRINTERINFOMANAGER_HXX_
24
#ifndef _PSPRINT_PRINTERINFOMANAGER_HXX_
25
#define _PSPRINT_PRINTERINFOMANAGER_HXX_
25
#define _PSPRINT_PRINTERINFOMANAGER_HXX_
26
26
27
#include <hash_map>
27
#include <boost/unordered_map.hpp>
28
#include <list>
28
#include <list>
29
29
30
#include "vcl/dllapi.h"
30
#include "vcl/dllapi.h"
Lines 65-73 Link Here
65
    // this vector is currently implicitly given by the adobe
65
    // this vector is currently implicitly given by the adobe
66
    // standard encoding
66
    // standard encoding
67
    bool                        m_bPerformFontSubstitution;
67
    bool                        m_bPerformFontSubstitution;
68
    std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >
68
    boost::unordered_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >
69
    m_aFontSubstitutes;
69
    m_aFontSubstitutes;
70
    std::hash_map< fontID, fontID >
70
    boost::unordered_map< fontID, fontID >
71
    m_aFontSubstitutions;
71
    m_aFontSubstitutions;
72
72
73
    PrinterInfo() :
73
    PrinterInfo() :
Lines 117-123 Link Here
117
        PrinterInfo             m_aInfo;
117
        PrinterInfo             m_aInfo;
118
    };
118
    };
119
119
120
    std::hash_map< rtl::OUString, Printer, rtl::OUStringHash > m_aPrinters;
120
    boost::unordered_map< rtl::OUString, Printer, rtl::OUStringHash > m_aPrinters;
121
    PrinterInfo                         m_aGlobalDefaults;
121
    PrinterInfo                         m_aGlobalDefaults;
122
    std::list< WatchFile >            m_aWatchFiles;
122
    std::list< WatchFile >            m_aWatchFiles;
123
    rtl::OUString                     m_aDefaultPrinter;
123
    rtl::OUString                     m_aDefaultPrinter;
(-)vcl/inc/vcl/print.hxx (-2 / +2 lines)
Lines 38-44 Link Here
38
#include "com/sun/star/view/PrintableState.hpp"
38
#include "com/sun/star/view/PrintableState.hpp"
39
39
40
#include <boost/shared_ptr.hpp>
40
#include <boost/shared_ptr.hpp>
41
#include <hash_map>
41
#include <boost/unordered_map.hpp>
42
#include <set>
42
#include <set>
43
43
44
struct SalPrinterInfoQueue;
44
struct SalPrinterInfoQueue;
Lines 552-558 Link Here
552
class VCL_DLLPUBLIC PrinterOptionsHelper
552
class VCL_DLLPUBLIC PrinterOptionsHelper
553
{
553
{
554
    protected:
554
    protected:
555
    std::hash_map< rtl::OUString, com::sun::star::uno::Any, rtl::OUStringHash >        m_aPropertyMap;
555
    boost::unordered_map< rtl::OUString, com::sun::star::uno::Any, rtl::OUStringHash >        m_aPropertyMap;
556
    com::sun::star::uno::Sequence< com::sun::star::beans::PropertyValue >              m_aUIProperties;
556
    com::sun::star::uno::Sequence< com::sun::star::beans::PropertyValue >              m_aUIProperties;
557
557
558
    public:
558
    public:
(-)vcl/inc/vcl/fontmanager.hxx (-18 / +18 lines)
Lines 24-30 Link Here
24
#ifndef _PSPRINT_FONTMANAGER_HXX_
24
#ifndef _PSPRINT_FONTMANAGER_HXX_
25
#define _PSPRINT_FONTMANAGER_HXX_
25
#define _PSPRINT_FONTMANAGER_HXX_
26
26
27
#include <hash_map>
27
#include <boost/unordered_map.hpp>
28
#include <map>
28
#include <map>
29
#include <list>
29
#include <list>
30
#include <set>
30
#include <set>
Lines 237-243 Link Here
237
        // upper byte contains: 0 for horizontal metric
237
        // upper byte contains: 0 for horizontal metric
238
        //                      1 for vertical metric
238
        //                      1 for vertical metric
239
        // highest byte: 0 for now
239
        // highest byte: 0 for now
240
        std::hash_map< int, CharacterMetric >     m_aMetrics;
240
        boost::unordered_map< int, CharacterMetric >     m_aMetrics;
241
        // contains the unicode blocks for which metrics were queried
241
        // contains the unicode blocks for which metrics were queried
242
        // this implies that metrics should be queried in terms of
242
        // this implies that metrics should be queried in terms of
243
        // unicode blocks. here a unicode block is identified
243
        // unicode blocks. here a unicode block is identified
Lines 252-258 Link Here
252
        bool                                        m_bKernPairsQueried;
252
        bool                                        m_bKernPairsQueried;
253
        std::list< KernPair >                     m_aXKernPairs;
253
        std::list< KernPair >                     m_aXKernPairs;
254
        std::list< KernPair >                     m_aYKernPairs;
254
        std::list< KernPair >                     m_aYKernPairs;
255
        std::hash_map< sal_Unicode, bool >		m_bVerticalSubstitutions;
255
        boost::unordered_map< sal_Unicode, bool >		m_bVerticalSubstitutions;
256
256
257
        PrintFontMetrics() : m_bKernPairsQueried( false ) {}
257
        PrintFontMetrics() : m_bKernPairsQueried( false ) {}
258
        
258
        
Lines 366-373 Link Here
366
    static rtl::OString s_aEmptyOString;
366
    static rtl::OString s_aEmptyOString;
367
367
368
    fontID                                      m_nNextFontID;
368
    fontID                                      m_nNextFontID;
369
    std::hash_map< fontID, PrintFont* >       m_aFonts;
369
    boost::unordered_map< fontID, PrintFont* >       m_aFonts;
370
    std::hash_map< int, family::type >        m_aFamilyTypes;
370
    boost::unordered_map< int, family::type >        m_aFamilyTypes;
371
    std::list< rtl::OUString >              m_aPrinterDrivers;
371
    std::list< rtl::OUString >              m_aPrinterDrivers;
372
    std::list< rtl::OString >               m_aFontDirectories;
372
    std::list< rtl::OString >               m_aFontDirectories;
373
    std::list< int >							m_aPrivateFontDirectories;
373
    std::list< int >							m_aPrivateFontDirectories;
Lines 375-394 Link Here
375
    m_aXLFD_Aliases;
375
    m_aXLFD_Aliases;
376
    utl::MultiAtomProvider*                   m_pAtoms;
376
    utl::MultiAtomProvider*                   m_pAtoms;
377
    // for speeding up findFontFileID
377
    // for speeding up findFontFileID
378
    std::hash_map< rtl::OString, std::set< fontID >, rtl::OStringHash >
378
    boost::unordered_map< rtl::OString, std::set< fontID >, rtl::OStringHash >
379
    											m_aFontFileToFontID;
379
    											m_aFontFileToFontID;
380
380
381
    std::hash_map< rtl::OString, int, rtl::OStringHash >
381
    boost::unordered_map< rtl::OString, int, rtl::OStringHash >
382
    m_aDirToAtom;
382
    m_aDirToAtom;
383
    std::hash_map< int, rtl::OString >     m_aAtomToDir;
383
    boost::unordered_map< int, rtl::OString >     m_aAtomToDir;
384
    int                                        m_nNextDirAtom;
384
    int                                        m_nNextDirAtom;
385
385
386
    std::hash_multimap< rtl::OString, sal_Unicode, rtl::OStringHash >
386
    boost::hash_multimap< rtl::OString, sal_Unicode, rtl::OStringHash >
387
    	m_aAdobenameToUnicode;
387
    	m_aAdobenameToUnicode;
388
    std::hash_multimap< sal_Unicode, rtl::OString >
388
    boost::hash_multimap< sal_Unicode, rtl::OString >
389
    	m_aUnicodeToAdobename;
389
    	m_aUnicodeToAdobename;
390
    std::hash_multimap< sal_Unicode, sal_uInt8 >	m_aUnicodeToAdobecode;
390
    boost::hash_multimap< sal_Unicode, sal_uInt8 >	m_aUnicodeToAdobecode;
391
    std::hash_multimap< sal_uInt8, sal_Unicode >	m_aAdobecodeToUnicode;
391
    boost::hash_multimap< sal_uInt8, sal_Unicode >	m_aAdobecodeToUnicode;
392
392
393
    mutable FontCache*                                                        m_pFontCache;
393
    mutable FontCache*                                                        m_pFontCache;
394
    bool m_bFontconfigSuccess;
394
    bool m_bFontconfigSuccess;
Lines 413-419 Link Here
413
413
414
    PrintFont* getFont( fontID nID ) const
414
    PrintFont* getFont( fontID nID ) const
415
    {
415
    {
416
        std::hash_map< fontID, PrintFont* >::const_iterator it;
416
        boost::unordered_map< fontID, PrintFont* >::const_iterator it;
417
        it = m_aFonts.find( nID );
417
        it = m_aFonts.find( nID );
418
        return it == m_aFonts.end() ? NULL : it->second;
418
        return it == m_aFonts.end() ? NULL : it->second;
419
    }
419
    }
Lines 433-439 Link Here
433
    false else (e.g. no libfontconfig found)
433
    false else (e.g. no libfontconfig found)
434
    */
434
    */
435
    bool initFontconfig();
435
    bool initFontconfig();
436
    int  countFontconfigFonts( std::hash_map<rtl::OString, int, rtl::OStringHash>& o_rVisitedPaths );
436
    int  countFontconfigFonts( boost::unordered_map<rtl::OString, int, rtl::OStringHash>& o_rVisitedPaths );
437
    /* deinitialize fontconfig
437
    /* deinitialize fontconfig
438
     */
438
     */
439
    void deinitFontconfig();
439
    void deinitFontconfig();
Lines 613-627 Link Here
613
    // helper for type 1 fonts
613
    // helper for type 1 fonts
614
    std::list< rtl::OString > getAdobeNameFromUnicode( sal_Unicode aChar ) const;
614
    std::list< rtl::OString > getAdobeNameFromUnicode( sal_Unicode aChar ) const;
615
615
616
    std::pair< std::hash_multimap< sal_Unicode, sal_uInt8 >::const_iterator,
616
    std::pair< boost::hash_multimap< sal_Unicode, sal_uInt8 >::const_iterator,
617
               std::hash_multimap< sal_Unicode, sal_uInt8 >::const_iterator >
617
               boost::hash_multimap< sal_Unicode, sal_uInt8 >::const_iterator >
618
    getAdobeCodeFromUnicode( sal_Unicode aChar ) const
618
    getAdobeCodeFromUnicode( sal_Unicode aChar ) const
619
    {
619
    {
620
        return m_aUnicodeToAdobecode.equal_range( aChar );
620
        return m_aUnicodeToAdobecode.equal_range( aChar );
621
    }
621
    }
622
    std::list< sal_Unicode >  getUnicodeFromAdobeName( const rtl::OString& rName ) const;
622
    std::list< sal_Unicode >  getUnicodeFromAdobeName( const rtl::OString& rName ) const;
623
    std::pair< std::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator,
623
    std::pair< boost::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator,
624
                 std::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator >
624
                 boost::hash_multimap< sal_uInt8, sal_Unicode >::const_iterator >
625
    getUnicodeFromAdobeCode( sal_uInt8 aChar ) const
625
    getUnicodeFromAdobeCode( sal_uInt8 aChar ) const
626
    {
626
    {
627
        return m_aAdobecodeToUnicode.equal_range( aChar );
627
        return m_aAdobecodeToUnicode.equal_range( aChar );
(-)vcl/inc/vcl/ppdparser.hxx (-5 / +5 lines)
Lines 25-31 Link Here
25
25
26
#include <list>
26
#include <list>
27
#include <vector>
27
#include <vector>
28
#include <hash_map>
28
#include <boost/unordered_map.hpp>
29
29
30
#include "tools/string.hxx"
30
#include "tools/string.hxx"
31
#include "tools/stream.hxx"
31
#include "tools/stream.hxx"
Lines 60-66 Link Here
60
{
60
{
61
    friend class PPDParser;
61
    friend class PPDParser;
62
62
63
    typedef ::std::hash_map< ::rtl::OUString, PPDValue, ::rtl::OUStringHash > hash_type;
63
    typedef ::boost::unordered_map< ::rtl::OUString, PPDValue, ::rtl::OUStringHash > hash_type;
64
    typedef ::std::vector< PPDValue* > value_type;
64
    typedef ::std::vector< PPDValue* > value_type;
65
65
66
    String          	m_aKey;
66
    String          	m_aKey;
Lines 123-129 Link Here
123
    friend class PPDContext;
123
    friend class PPDContext;
124
    friend class CUPSManager;
124
    friend class CUPSManager;
125
125
126
    typedef ::std::hash_map< ::rtl::OUString, PPDKey*, ::rtl::OUStringHash > hash_type;
126
    typedef ::boost::unordered_map< ::rtl::OUString, PPDKey*, ::rtl::OUStringHash > hash_type;
127
    typedef ::std::vector< PPDKey* > value_type;
127
    typedef ::std::vector< PPDKey* > value_type;
128
128
129
    void insertKey( const String& rKey, PPDKey* pKey );
129
    void insertKey( const String& rKey, PPDKey* pKey );
Lines 140-146 Link Here
140
private:
140
private:
141
141
142
    static ::std::list< PPDParser* >           aAllParsers;
142
    static ::std::list< PPDParser* >           aAllParsers;
143
    static ::std::hash_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >*
143
    static ::boost::unordered_map< rtl::OUString, rtl::OUString, rtl::OUStringHash >*
144
    											pAllPPDFiles;
144
    											pAllPPDFiles;
145
145
146
    hash_type									m_aKeys;
146
    hash_type									m_aKeys;
Lines 296-302 Link Here
296
296
297
class VCL_DLLPUBLIC PPDContext
297
class VCL_DLLPUBLIC PPDContext
298
{
298
{
299
    typedef ::std::hash_map< const PPDKey*, const PPDValue*, PPDKeyhash > hash_type;
299
    typedef ::boost::unordered_map< const PPDKey*, const PPDValue*, PPDKeyhash > hash_type;
300
    hash_type m_aCurrentValues;
300
    hash_type m_aCurrentValues;
301
    const PPDParser*                                    m_pParser;
301
    const PPDParser*                                    m_pParser;
302
302
(-)vcl/inc/printergfx.hxx (-2 / +2 lines)
Lines 30-36 Link Here
30
#include "tools/gen.hxx"
30
#include "tools/gen.hxx"
31
31
32
#include <list>
32
#include <list>
33
#include <hash_map>
33
#include <boost/unordered_map.hpp>
34
34
35
namespace psp {
35
namespace psp {
36
36
Lines 248-254 Link Here
248
248
249
    /* font / font substitution */
249
    /* font / font substitution */
250
    friend class Font3;
250
    friend class Font3;
251
    const ::std::hash_map< fontID, fontID >*    mpFontSubstitutes;
251
    const ::boost::unordered_map< fontID, fontID >*    mpFontSubstitutes;
252
    int             getCharWidth (sal_Bool b_vert, sal_Unicode n_char, 
252
    int             getCharWidth (sal_Bool b_vert, sal_Unicode n_char, 
253
                                  CharacterMetric *p_bbox);
253
                                  CharacterMetric *p_bbox);
254
    fontID          getCharMetric (const Font3 &rFont, sal_Unicode n_char, 
254
    fontID          getCharMetric (const Font3 &rFont, sal_Unicode n_char, 
(-)vcl/inc/glyphcache.hxx (-5 / +5 lines)
Lines 38-45 Link Here
38
class ImplFontOptions;
38
class ImplFontOptions;
39
39
40
#include <tools/gen.hxx>
40
#include <tools/gen.hxx>
41
#include <hash_map>
41
#include <boost/unordered_map.hpp>
42
#include <hash_set>
42
#include <boost/unordered_set.hpp>
43
43
44
namespace basegfx { class B2DPolyPolygon; }
44
namespace basegfx { class B2DPolyPolygon; }
45
45
Lines 92-98 Link Here
92
    // the FontList key's mpFontData member is reinterpreted as integer font id
92
    // the FontList key's mpFontData member is reinterpreted as integer font id
93
    struct IFSD_Equal{  bool operator()( const ImplFontSelectData&, const ImplFontSelectData& ) const; };
93
    struct IFSD_Equal{  bool operator()( const ImplFontSelectData&, const ImplFontSelectData& ) const; };
94
    struct IFSD_Hash{ size_t operator()( const ImplFontSelectData& ) const; };
94
    struct IFSD_Hash{ size_t operator()( const ImplFontSelectData& ) const; };
95
    typedef ::std::hash_map<ImplFontSelectData,ServerFont*,IFSD_Hash,IFSD_Equal > FontList;
95
    typedef ::boost::unordered_map<ImplFontSelectData,ServerFont*,IFSD_Hash,IFSD_Equal > FontList;
96
    FontList                    maFontList;
96
    FontList                    maFontList;
97
    sal_uLong                       mnMaxSize;      // max overall cache size in bytes
97
    sal_uLong                       mnMaxSize;      // max overall cache size in bytes
98
    mutable sal_uLong               mnBytesUsed;
98
    mutable sal_uLong               mnBytesUsed;
Lines 221-227 Link Here
221
    virtual ServerFontLayoutEngine* GetLayoutEngine() { return NULL; }
221
    virtual ServerFontLayoutEngine* GetLayoutEngine() { return NULL; }
222
222
223
private:
223
private:
224
    typedef ::std::hash_map<int,GlyphData> GlyphList;
224
    typedef ::boost::unordered_map<int,GlyphData> GlyphList;
225
    mutable GlyphList           maGlyphList;
225
    mutable GlyphList           maGlyphList;
226
226
227
    const ImplFontSelectData    maFontSelData;
227
    const ImplFontSelectData    maFontSelData;
Lines 367-373 Link Here
367
                          { return (rA.mnChar1 == rB.mnChar1) && (rA.mnChar2 == rB.mnChar2); } };
367
                          { return (rA.mnChar1 == rB.mnChar1) && (rA.mnChar2 == rB.mnChar2); } };
368
    struct PairHash{ int operator()(const ImplKernPairData& rA) const
368
    struct PairHash{ int operator()(const ImplKernPairData& rA) const
369
                         { return (rA.mnChar1) * 256 ^ rA.mnChar2; } };
369
                         { return (rA.mnChar1) * 256 ^ rA.mnChar2; } };
370
    typedef std::hash_set< ImplKernPairData, PairHash, PairEqual > UnicodeKernPairs;
370
    typedef boost::unordered_set< ImplKernPairData, PairHash, PairEqual > UnicodeKernPairs;
371
    mutable UnicodeKernPairs maUnicodeKernPairs;
371
    mutable UnicodeKernPairs maUnicodeKernPairs;
372
};
372
};
373
373
(-)vcl/inc/unx/saldisp.hxx (-2 / +2 lines)
Lines 42-48 Link Here
42
#endif
42
#endif
43
#include <vector>
43
#include <vector>
44
#include <list>
44
#include <list>
45
#include <hash_map>
45
#include <boost/unordered_map.hpp>
46
#include <tools/gen.hxx>
46
#include <tools/gen.hxx>
47
#include <salwtype.hxx>
47
#include <salwtype.hxx>
48
48
Lines 285-291 Link Here
285
        RenderEntry() : m_aPixmap( 0 ), m_aPicture( 0 ) {}
285
        RenderEntry() : m_aPixmap( 0 ), m_aPicture( 0 ) {}
286
    };
286
    };
287
287
288
    typedef std::hash_map<int,RenderEntry> RenderEntryMap;
288
    typedef boost::unordered_map<int,RenderEntry> RenderEntryMap;
289
289
290
    struct ScreenData
290
    struct ScreenData
291
    {
291
    {
(-)vcl/inc/outfont.hxx (-3 / +3 lines)
Lines 33-39 Link Here
33
#include <unotools/fontdefs.hxx>
33
#include <unotools/fontdefs.hxx>
34
#include <vcl/vclenum.hxx>
34
#include <vcl/vclenum.hxx>
35
35
36
#include <hash_map>
36
#include <boost/unordered_map.hpp>
37
37
38
class ImplDevFontListData;
38
class ImplDevFontListData;
39
class ImplGetDevFontList;
39
class ImplGetDevFontList;
Lines 188-194 Link Here
188
    mutable bool            mbMatchData;    // true if matching attributes are initialized
188
    mutable bool            mbMatchData;    // true if matching attributes are initialized
189
    bool                    mbMapNames;     // true if MapNames are available
189
    bool                    mbMapNames;     // true if MapNames are available
190
190
191
    typedef std::hash_map<const String, ImplDevFontListData*,FontNameHash> DevFontList;
191
    typedef boost::unordered_map<const String, ImplDevFontListData*,FontNameHash> DevFontList;
192
    DevFontList             maDevFontList;
192
    DevFontList             maDevFontList;
193
193
194
    ImplPreMatchFontSubstitution* mpPreMatchHook;       // device specific prematch substitution
194
    ImplPreMatchFontSubstitution* mpPreMatchHook;       // device specific prematch substitution
Lines 347-353 Link Here
347
    // TODO: at least the ones which just differ in orientation, stretching or height
347
    // TODO: at least the ones which just differ in orientation, stretching or height
348
    typedef ::std::pair<sal_UCS4,FontWeight> GFBCacheKey;
348
    typedef ::std::pair<sal_UCS4,FontWeight> GFBCacheKey;
349
    struct GFBCacheKey_Hash{ size_t operator()( const GFBCacheKey& ) const; };
349
    struct GFBCacheKey_Hash{ size_t operator()( const GFBCacheKey& ) const; };
350
    typedef ::std::hash_map<GFBCacheKey,String,GFBCacheKey_Hash> UnicodeFallbackList;
350
    typedef ::boost::unordered_map<GFBCacheKey,String,GFBCacheKey_Hash> UnicodeFallbackList;
351
    UnicodeFallbackList* mpUnicodeFallbackList;
351
    UnicodeFallbackList* mpUnicodeFallbackList;
352
};
352
};
353
353
(-)vcl/inc/impimagetree.hxx (-3 / +3 lines)
Lines 30-36 Link Here
30
#include <utility>
30
#include <utility>
31
#include <vector>
31
#include <vector>
32
32
33
#include <hash_map>
33
#include <boost/unordered_map.hpp>
34
34
35
#include "boost/noncopyable.hpp"
35
#include "boost/noncopyable.hpp"
36
#include "com/sun/star/uno/Reference.hxx"
36
#include "com/sun/star/uno/Reference.hxx"
Lines 67-75 Link Here
67
            com::sun::star::uno::Reference<
67
            com::sun::star::uno::Reference<
68
                com::sun::star::container::XNameAccess > > > Zips;
68
                com::sun::star::container::XNameAccess > > > Zips;
69
69
70
    typedef std::hash_map<
70
    typedef boost::unordered_map<
71
        rtl::OUString, bool, rtl::OUStringHash > CheckStyleCache;
71
        rtl::OUString, bool, rtl::OUStringHash > CheckStyleCache;
72
    typedef std::hash_map<
72
    typedef boost::unordered_map<
73
        rtl::OUString, std::pair< bool, BitmapEx >, rtl::OUStringHash > IconCache;
73
        rtl::OUString, std::pair< bool, BitmapEx >, rtl::OUStringHash > IconCache;
74
74
75
    rtl::OUString m_style;
75
    rtl::OUString m_style;
(-)vcl/inc/fontcache.hxx (-3 / +3 lines)
Lines 29-35 Link Here
29
29
30
#include "tools/string.hxx"
30
#include "tools/string.hxx"
31
31
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
33
34
namespace psp
34
namespace psp
35
{
35
{
Lines 47-53 Link Here
47
        FontCacheEntry		m_aEntry;
47
        FontCacheEntry		m_aEntry;
48
    };
48
    };
49
49
50
    typedef std::hash_map< ::rtl::OString, FontFile, ::rtl::OStringHash > FontDirMap;
50
    typedef boost::unordered_map< ::rtl::OString, FontFile, ::rtl::OStringHash > FontDirMap;
51
    struct FontDir
51
    struct FontDir
52
    {
52
    {
53
        sal_Int64	m_nTimestamp;
53
        sal_Int64	m_nTimestamp;
Lines 58-64 Link Here
58
        FontDir() : m_nTimestamp(0), m_bNoFiles(false), m_bUserOverrideOnly( false ) {}
58
        FontDir() : m_nTimestamp(0), m_bNoFiles(false), m_bUserOverrideOnly( false ) {}
59
    };
59
    };
60
    
60
    
61
    typedef std::hash_map< int, FontDir > FontCacheData;
61
    typedef boost::unordered_map< int, FontDir > FontCacheData;
62
    FontCacheData	m_aCache;
62
    FontCacheData	m_aCache;
63
    String			m_aCacheFile;
63
    String			m_aCacheFile;
64
    bool			m_bDoFlush;
64
    bool			m_bDoFlush;
(-)vcl/inc/cupsmgr.hxx (-3 / +3 lines)
Lines 44-56 Link Here
44
class CUPSManager : public PrinterInfoManager
44
class CUPSManager : public PrinterInfoManager
45
{
45
{
46
    CUPSWrapper*												m_pCUPSWrapper;
46
    CUPSWrapper*												m_pCUPSWrapper;
47
    std::hash_map< FILE*, rtl::OString, FPtrHash >				m_aSpoolFiles;
47
    boost::unordered_map< FILE*, rtl::OString, FPtrHash >				m_aSpoolFiles;
48
    int															m_nDests;
48
    int															m_nDests;
49
    void*														m_pDests;
49
    void*														m_pDests;
50
    bool														m_bNewDests;
50
    bool														m_bNewDests;
51
    std::hash_map< rtl::OUString, int, rtl::OUStringHash >		m_aCUPSDestMap;
51
    boost::unordered_map< rtl::OUString, int, rtl::OUStringHash >		m_aCUPSDestMap;
52
52
53
    std::hash_map< rtl::OUString, PPDContext, rtl::OUStringHash > m_aDefaultContexts;
53
    boost::unordered_map< rtl::OUString, PPDContext, rtl::OUStringHash > m_aDefaultContexts;
54
54
55
    rtl::OString												m_aUser;
55
    rtl::OString												m_aUser;
56
    // this is a security risk, but the CUPS API demands
56
    // this is a security risk, but the CUPS API demands
(-)vcl/inc/aqua/saldata.hxx (-4 / +4 lines)
Lines 38-44 Link Here
38
#include <list>
38
#include <list>
39
#include <vector>
39
#include <vector>
40
#include <map>
40
#include <map>
41
#include <hash_set>
41
#include <boost/unordered_set.hpp>
42
42
43
#include <cstdio>
43
#include <cstdio>
44
#include <cstdarg>
44
#include <cstdarg>
Lines 66-75 Link Here
66
// -----------
66
// -----------
67
67
68
class AquaSalFrame;
68
class AquaSalFrame;
69
struct FrameHash : public std::hash<sal_IntPtr>
69
struct FrameHash : public boost::hash<sal_IntPtr>
70
{
70
{
71
    size_t operator()(const AquaSalFrame* frame) const
71
    size_t operator()(const AquaSalFrame* frame) const
72
    { return std::hash<sal_IntPtr>::operator()( reinterpret_cast<const sal_IntPtr>(frame) ); }
72
    { return boost::hash<sal_IntPtr>::operator()( reinterpret_cast<const sal_IntPtr>(frame) ); }
73
};
73
};
74
74
75
#define INVALID_CURSOR_PTR (NSCursor*)0xdeadbeef
75
#define INVALID_CURSOR_PTR (NSCursor*)0xdeadbeef
Lines 80-86 Link Here
80
	SALTIMERPROC                                  mpTimerProc;		// timer callback proc
80
	SALTIMERPROC                                  mpTimerProc;		// timer callback proc
81
	AquaSalInstance                              *mpFirstInstance;	// pointer of first instance
81
	AquaSalInstance                              *mpFirstInstance;	// pointer of first instance
82
	std::list<AquaSalFrame*>                      maFrames;	        // list of all frames
82
	std::list<AquaSalFrame*>                      maFrames;	        // list of all frames
83
    std::hash_set<const AquaSalFrame*,FrameHash>  maFrameCheck;     // for fast check of frame existance
83
    boost::unordered_set<const AquaSalFrame*,FrameHash>  maFrameCheck;     // for fast check of frame existance
84
	std::list<AquaSalFrame*>                      maPresentationFrames;  // list of frames in presentation mode
84
	std::list<AquaSalFrame*>                      maPresentationFrames;  // list of frames in presentation mode
85
	SalObject                                    *mpFirstObject;	// pointer of first object window
85
	SalObject                                    *mpFirstObject;	// pointer of first object window
86
	SalVirtualDevice                             *mpFirstVD;    	// first VirDev
86
	SalVirtualDevice                             *mpFirstVD;    	// first VirDev
(-)vcl/inc/aqua/aqua11ylistener.hxx (-1 / +1 lines)
Lines 58-61 Link Here
58
    ::com::sun::star::awt::Rectangle m_oldBounds;
58
    ::com::sun::star::awt::Rectangle m_oldBounds;
59
};
59
};
60
60
61
#endif // _AQUA11YLISTENER_HXX_
61
#endif // _AQUA11YLISTENER_HXX_
(-)vcl/inc/aqua/salatsuifontutils.hxx (-1 / +1 lines)
Lines 49-55 Link Here
49
    ATSUFontFallbacks maFontFallbacks;
49
    ATSUFontFallbacks maFontFallbacks;
50
50
51
private:
51
private:
52
    typedef std::hash_map<ATSUFontID,ImplMacFontData*> MacFontContainer;
52
    typedef boost::unordered_map<ATSUFontID,ImplMacFontData*> MacFontContainer;
53
    MacFontContainer maFontContainer;
53
    MacFontContainer maFontContainer;
54
54
55
    void InitGlyphFallbacks();	
55
    void InitGlyphFallbacks();	
(-)vcl/inc/aqua/keyboardfocuslistener.hxx (-1 / +1 lines)
Lines 40-43 Link Here
40
    virtual void SAL_CALL focusedObjectChanged(const ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible >& xAccessible) = 0;
40
    virtual void SAL_CALL focusedObjectChanged(const ::com::sun::star::uno::Reference< ::com::sun::star::accessibility::XAccessible >& xAccessible) = 0;
41
};
41
};
42
42
43
#endif // _KEYBOARDFOCUSLISTENER_HXX_
43
#endif // _KEYBOARDFOCUSLISTENER_HXX_
(-)vcl/inc/svdata.hxx (-2 / +2 lines)
Lines 46-52 Link Here
46
46
47
#include "com/sun/star/uno/Reference.hxx"
47
#include "com/sun/star/uno/Reference.hxx"
48
48
49
#include <hash_map>
49
#include <boost/unordered_map.hpp>
50
50
51
namespace com {
51
namespace com {
52
namespace sun {
52
namespace sun {
Lines 372-378 Link Here
372
    com::sun::star::uno::Reference< com::sun::star::frame::XSessionManagerClient > xSMClient;
372
    com::sun::star::uno::Reference< com::sun::star::frame::XSessionManagerClient > xSMClient;
373
    ::vcl::SettingsConfigItem*			mpSettingsConfigItem;
373
    ::vcl::SettingsConfigItem*			mpSettingsConfigItem;
374
    std::list< vcl::DeleteOnDeinitBase* >*   mpDeinitDeleteList;
374
    std::list< vcl::DeleteOnDeinitBase* >*   mpDeinitDeleteList;
375
    std::hash_map< int, rtl::OUString >*     mpPaperNames;
375
    boost::unordered_map< int, rtl::OUString >*     mpPaperNames;
376
};
376
};
377
377
378
void        ImplInitSVData();
378
void        ImplInitSVData();
(-)vcl/inc/graphite_cache.hxx (-4 / +4 lines)
Lines 33-39 Link Here
33
#define GRCACHE_REUSE_VECTORS 1
33
#define GRCACHE_REUSE_VECTORS 1
34
34
35
//#include <rope>
35
//#include <rope>
36
#include <hash_map>
36
#include <boost/unordered_map.hpp>
37
37
38
class TextSourceAdaptor;
38
class TextSourceAdaptor;
39
/**
39
/**
Lines 92-99 Link Here
92
    friend class GraphiteSegmentCache;
92
    friend class GraphiteSegmentCache;
93
};
93
};
94
94
95
typedef std::hash_map<long, GrSegRecord*, std::hash<long> > GraphiteSegMap;
95
typedef boost::unordered_map<long, GrSegRecord*, boost::hash<long> > GraphiteSegMap;
96
typedef std::hash_multimap<size_t, GrSegRecord*> GraphiteRopeMap;
96
typedef boost::hash_multimap<size_t, GrSegRecord*> GraphiteRopeMap;
97
typedef std::pair<GraphiteRopeMap::iterator, GraphiteRopeMap::iterator> GrRMEntry;
97
typedef std::pair<GraphiteRopeMap::iterator, GraphiteRopeMap::iterator> GrRMEntry;
98
98
99
/**
99
/**
Lines 226-232 Link Here
226
  const xub_Unicode * m_prevKey;
226
  const xub_Unicode * m_prevKey;
227
};
227
};
228
228
229
typedef std::hash_map<int, GraphiteSegmentCache *, std::hash<int> > GraphiteCacheMap;
229
typedef boost::unordered_map<int, GraphiteSegmentCache *, boost::hash<int> > GraphiteCacheMap;
230
230
231
/**
231
/**
232
* GraphiteCacheHandler maps a particular font, style, size to a GraphiteSegmentCache
232
* GraphiteCacheHandler maps a particular font, style, size to a GraphiteSegmentCache
(-)sc/source/filter/xml/xmldpimp.hxx (-2 / +2 lines)
Lines 35-41 Link Here
35
#include "dpsave.hxx"
35
#include "dpsave.hxx"
36
#include "queryparam.hxx"
36
#include "queryparam.hxx"
37
37
38
#include <hash_set>
38
#include <boost/unordered_set.hpp>
39
39
40
class ScXMLImport;
40
class ScXMLImport;
41
class ScDPSaveNumGroupDimension;
41
class ScDPSaveNumGroupDimension;
Lines 75-81 Link Here
75
75
76
class ScXMLDataPilotTableContext : public SvXMLImportContext
76
class ScXMLDataPilotTableContext : public SvXMLImportContext
77
{
77
{
78
    typedef ::std::hash_set< ::rtl::OUString, ::rtl::OUStringHash > StringSet;
78
    typedef ::boost::unordered_set< ::rtl::OUString, ::rtl::OUStringHash > StringSet;
79
    StringSet       maHiddenMemberFields;
79
    StringSet       maHiddenMemberFields;
80
80
81
    struct GrandTotalItem
81
    struct GrandTotalItem
(-)sc/source/filter/xml/xmlexprt.hxx (-2 / +2 lines)
Lines 35-41 Link Here
35
	namespace beans { class XPropertySet; }
35
	namespace beans { class XPropertySet; }
36
} } }
36
} } }
37
37
38
#include <hash_map>
38
#include <boost/unordered_map.hpp>
39
39
40
class ScOutlineArray;
40
class ScOutlineArray;
41
class SvXMLExportPropertyMapper;
41
class SvXMLExportPropertyMapper;
Lines 82-88 Link Here
82
	UniReference < SvXMLExportPropertyMapper >	xRowStylesExportPropertySetMapper;
82
	UniReference < SvXMLExportPropertyMapper >	xRowStylesExportPropertySetMapper;
83
	UniReference < SvXMLExportPropertyMapper >	xTableStylesExportPropertySetMapper;
83
	UniReference < SvXMLExportPropertyMapper >	xTableStylesExportPropertySetMapper;
84
	XMLNumberFormatAttributesExportHelper* pNumberFormatAttributesExportHelper;
84
	XMLNumberFormatAttributesExportHelper* pNumberFormatAttributesExportHelper;
85
    typedef ::std::hash_map<sal_Int32, sal_Int32>  NumberFormatIndexMap;
85
    typedef ::boost::unordered_map<sal_Int32, sal_Int32>  NumberFormatIndexMap;
86
    NumberFormatIndexMap                aNumFmtIndexMap;
86
    NumberFormatIndexMap                aNumFmtIndexMap;
87
	ScMySharedData*						pSharedData;
87
	ScMySharedData*						pSharedData;
88
	ScColumnStyles*					pColumnStyles;
88
	ScColumnStyles*					pColumnStyles;
(-)sc/source/filter/xml/xmlimprt.hxx (-2 / +2 lines)
Lines 48-54 Link Here
48
#include <com/sun/star/sheet/XSheetCellRangeContainer.hpp>
48
#include <com/sun/star/sheet/XSheetCellRangeContainer.hpp>
49
49
50
#include <vector>
50
#include <vector>
51
#include <hash_map>
51
#include <boost/unordered_map.hpp>
52
52
53
class ScRangeList;
53
class ScRangeList;
54
class ScMyStyleNumberFormats;
54
class ScMyStyleNumberFormats;
Lines 658-664 Link Here
658
658
659
class ScXMLImport: public SvXMLImport
659
class ScXMLImport: public SvXMLImport
660
{
660
{
661
	typedef ::std::hash_map< ::rtl::OUString, sal_Int16, ::rtl::OUStringHash >	CellTypeMap;
661
	typedef ::boost::unordered_map< ::rtl::OUString, sal_Int16, ::rtl::OUStringHash >	CellTypeMap;
662
	CellTypeMap				aCellTypeMap;
662
	CellTypeMap				aCellTypeMap;
663
663
664
	ScDocument*				pDoc;
664
	ScDocument*				pDoc;
(-)sc/source/filter/inc/namebuff.hxx (-2 / +2 lines)
Lines 31-37 Link Here
31
#include "xiroot.hxx"
31
#include "xiroot.hxx"
32
32
33
#include "rangenam.hxx"
33
#include "rangenam.hxx"
34
#include <hash_map>
34
#include <boost/unordered_map.hpp>
35
#include <list>
35
#include <list>
36
36
37
class ScDocument;
37
class ScDocument;
Lines 171-177 Link Here
171
	{
171
	{
172
		size_t operator() (const ScAddress &addr) const;
172
		size_t operator() (const ScAddress &addr) const;
173
	};
173
	};
174
    typedef std::hash_map <ScAddress, sal_uInt16, ScAddressHashFunc> ShrfmlaHash;
174
    typedef boost::unordered_map <ScAddress, sal_uInt16, ScAddressHashFunc> ShrfmlaHash;
175
	typedef	std::list <ScRange>									 ShrfmlaList;
175
	typedef	std::list <ScRange>									 ShrfmlaList;
176
176
177
	ShrfmlaHash	 index_hash;
177
	ShrfmlaHash	 index_hash;
(-)sc/source/core/inc/bcaslot.hxx (-3 / +3 lines)
Lines 25-31 Link Here
25
#define SC_BCASLOT_HXX
25
#define SC_BCASLOT_HXX
26
26
27
#include <set>
27
#include <set>
28
#include <hash_set>
28
#include <boost/unordered_set.hpp>
29
#include <functional>
29
#include <functional>
30
#include <svl/broadcast.hxx>
30
#include <svl/broadcast.hxx>
31
#include <svl/svarray.hxx>
31
#include <svl/svarray.hxx>
Lines 92-98 Link Here
92
    }
92
    }
93
};
93
};
94
94
95
typedef ::std::hash_set< ScBroadcastArea*, ScBroadcastAreaHash, ScBroadcastAreaEqual > ScBroadcastAreas;
95
typedef ::boost::unordered_set< ScBroadcastArea*, ScBroadcastAreaHash, ScBroadcastAreaEqual > ScBroadcastAreas;
96
96
97
//=============================================================================
97
//=============================================================================
98
98
Lines 112-118 Link Here
112
    }
112
    }
113
};
113
};
114
114
115
typedef ::std::hash_set< const ScBroadcastArea*, ScBroadcastAreaBulkHash,
115
typedef ::boost::unordered_set< const ScBroadcastArea*, ScBroadcastAreaBulkHash,
116
        ScBroadcastAreaBulkEqual > ScBroadcastAreasBulk;
116
        ScBroadcastAreaBulkEqual > ScBroadcastAreasBulk;
117
117
118
//=============================================================================
118
//=============================================================================
(-)sc/source/core/inc/cellkeytranslator.hxx (-2 / +2 lines)
Lines 27-33 Link Here
27
#include "global.hxx"
27
#include "global.hxx"
28
#include "formula/opcode.hxx"
28
#include "formula/opcode.hxx"
29
#include "unotools/transliterationwrapper.hxx"
29
#include "unotools/transliterationwrapper.hxx"
30
#include <hash_map>
30
#include <boost/unordered_map.hpp>
31
#include <list>
31
#include <list>
32
#include <memory>
32
#include <memory>
33
33
Lines 44-50 Link Here
44
    ScCellKeyword(const sal_Char* pName, OpCode eOpCode, const ::com::sun::star::lang::Locale& rLocale);
44
    ScCellKeyword(const sal_Char* pName, OpCode eOpCode, const ::com::sun::star::lang::Locale& rLocale);
45
};
45
};
46
46
47
typedef ::std::hash_map< String, ::std::list<ScCellKeyword>, ScStringHashCode, ::std::equal_to<String> > ScCellKeywordHashMap;
47
typedef ::boost::unordered_map< String, ::std::list<ScCellKeyword>, ScStringHashCode, ::std::equal_to<String> > ScCellKeywordHashMap;
48
48
49
/** Translate cell function keywords.
49
/** Translate cell function keywords.
50
    
50
    
(-)sc/source/core/data/dpsdbtab.cxx (-2 / +2 lines)
Lines 57-64 Link Here
57
using namespace com::sun::star;
57
using namespace com::sun::star;
58
58
59
using ::std::vector;
59
using ::std::vector;
60
using ::std::hash_map;
60
using ::boost::unordered_map;
61
using ::std::hash_set;
61
using ::boost::unordered_set;
62
using ::com::sun::star::uno::Sequence;
62
using ::com::sun::star::uno::Sequence;
63
using ::com::sun::star::uno::Reference;
63
using ::com::sun::star::uno::Reference;
64
using ::com::sun::star::uno::Any;
64
using ::com::sun::star::uno::Any;
(-)sc/source/core/data/dpsave.cxx (-2 / +2 lines)
Lines 65-78 Link Here
65
using namespace com::sun::star::sheet;
65
using namespace com::sun::star::sheet;
66
// End Comments
66
// End Comments
67
67
68
#include <hash_map>
68
#include <boost/unordered_map.hpp>
69
69
70
using namespace com::sun::star;
70
using namespace com::sun::star;
71
using ::com::sun::star::uno::Reference;
71
using ::com::sun::star::uno::Reference;
72
using ::com::sun::star::uno::Any;
72
using ::com::sun::star::uno::Any;
73
using ::rtl::OUString;
73
using ::rtl::OUString;
74
using ::rtl::OUStringHash;
74
using ::rtl::OUStringHash;
75
using ::std::hash_map;
75
using ::boost::unordered_map;
76
using ::std::auto_ptr;
76
using ::std::auto_ptr;
77
77
78
// -----------------------------------------------------------------------
78
// -----------------------------------------------------------------------
(-)sc/source/core/data/dpcachetable.cxx (-2 / +2 lines)
Lines 49-56 Link Here
49
using ::rtl::OUString;
49
using ::rtl::OUString;
50
using ::std::vector;
50
using ::std::vector;
51
using ::std::pair;
51
using ::std::pair;
52
using ::std::hash_map;
52
using ::boost::unordered_map;
53
using ::std::hash_set;
53
using ::boost::unordered_set;
54
using ::std::auto_ptr;
54
using ::std::auto_ptr;
55
using ::com::sun::star::i18n::LocaleDataItem;
55
using ::com::sun::star::i18n::LocaleDataItem;
56
using ::com::sun::star::uno::Exception;
56
using ::com::sun::star::uno::Exception;
(-)sc/source/core/data/dptabsrc.cxx (-4 / +4 lines)
Lines 32-39 Link Here
32
#include <algorithm>
32
#include <algorithm>
33
#include <vector>
33
#include <vector>
34
#include <set>
34
#include <set>
35
#include <hash_map>
35
#include <boost/unordered_map.hpp>
36
#include <hash_set>
36
#include <boost/unordered_set.hpp>
37
37
38
#include <tools/debug.hxx>
38
#include <tools/debug.hxx>
39
#include <rtl/math.hxx>
39
#include <rtl/math.hxx>
Lines 72-79 Link Here
72
using namespace com::sun::star;
72
using namespace com::sun::star;
73
using ::std::vector;
73
using ::std::vector;
74
using ::std::set;
74
using ::std::set;
75
using ::std::hash_map;
75
using ::boost::unordered_map;
76
using ::std::hash_set;
76
using ::boost::unordered_set;
77
using ::com::sun::star::uno::Reference;
77
using ::com::sun::star::uno::Reference;
78
using ::com::sun::star::uno::Sequence;
78
using ::com::sun::star::uno::Sequence;
79
using ::com::sun::star::uno::Any;
79
using ::com::sun::star::uno::Any;
(-)sc/source/core/data/dpgroup.cxx (-4 / +4 lines)
Lines 49-56 Link Here
49
#include <com/sun/star/sheet/DataPilotFieldFilter.hpp>
49
#include <com/sun/star/sheet/DataPilotFieldFilter.hpp>
50
50
51
#include <vector>
51
#include <vector>
52
#include <hash_set>
52
#include <boost/unordered_set.hpp>
53
#include <hash_map>
53
#include <boost/unordered_map.hpp>
54
54
55
using namespace ::com::sun::star;
55
using namespace ::com::sun::star;
56
using ::com::sun::star::uno::Any;
56
using ::com::sun::star::uno::Any;
Lines 62-69 Link Here
62
using ::rtl::OUStringHash;
62
using ::rtl::OUStringHash;
63
63
64
using ::std::vector;
64
using ::std::vector;
65
using ::std::hash_set;
65
using ::boost::unordered_set;
66
using ::std::hash_map;
66
using ::boost::unordered_map;
67
using ::boost::shared_ptr;
67
using ::boost::shared_ptr;
68
68
69
#define D_TIMEFACTOR              86400.0
69
#define D_TIMEFACTOR              86400.0
(-)sc/source/core/data/dptabres.cxx (-2 / +2 lines)
Lines 44-50 Link Here
44
#include <math.h>
44
#include <math.h>
45
#include <float.h>			//! Test !!!
45
#include <float.h>			//! Test !!!
46
#include <algorithm>
46
#include <algorithm>
47
#include <hash_map>
47
#include <boost/unordered_map.hpp>
48
48
49
#include <com/sun/star/sheet/DataResultFlags.hpp>
49
#include <com/sun/star/sheet/DataResultFlags.hpp>
50
#include <com/sun/star/sheet/MemberResultFlags.hpp>
50
#include <com/sun/star/sheet/MemberResultFlags.hpp>
Lines 58-64 Link Here
58
using namespace com::sun::star;
58
using namespace com::sun::star;
59
using ::std::vector;
59
using ::std::vector;
60
using ::std::pair;
60
using ::std::pair;
61
using ::std::hash_map;
61
using ::boost::unordered_map;
62
using ::com::sun::star::uno::Sequence;
62
using ::com::sun::star::uno::Sequence;
63
using ::rtl::OUString;
63
using ::rtl::OUString;
64
64
(-)sc/source/core/data/dpshttab.cxx (-2 / +2 lines)
Lines 52-59 Link Here
52
using ::com::sun::star::uno::Any;
52
using ::com::sun::star::uno::Any;
53
using ::com::sun::star::uno::Sequence;
53
using ::com::sun::star::uno::Sequence;
54
using ::std::vector;
54
using ::std::vector;
55
using ::std::hash_map;
55
using ::boost::unordered_map;
56
using ::std::hash_set;
56
using ::boost::unordered_set;
57
57
58
// -----------------------------------------------------------------------
58
// -----------------------------------------------------------------------
59
59
(-)sc/source/core/tool/cellkeytranslator.cxx (-1 / +1 lines)
Lines 35-41 Link Here
35
using ::com::sun::star::lang::Locale;
35
using ::com::sun::star::lang::Locale;
36
using ::com::sun::star::uno::Sequence;
36
using ::com::sun::star::uno::Sequence;
37
using ::std::list;
37
using ::std::list;
38
using ::std::hash_map;
38
using ::boost::unordered_map;
39
using ::rtl::OUString;
39
using ::rtl::OUString;
40
40
41
using namespace ::com::sun::star;
41
using namespace ::com::sun::star;
(-)sc/source/core/tool/chartlis.cxx (-1 / +1 lines)
Lines 36-42 Link Here
36
using namespace com::sun::star;
36
using namespace com::sun::star;
37
using ::std::vector;
37
using ::std::vector;
38
using ::std::list;
38
using ::std::list;
39
using ::std::hash_set;
39
using ::boost::unordered_set;
40
using ::std::auto_ptr;
40
using ::std::auto_ptr;
41
using ::std::unary_function;
41
using ::std::unary_function;
42
using ::std::for_each;
42
using ::std::for_each;
(-)sc/source/core/tool/formulaparserpool.cxx (-1 / +1 lines)
Lines 57-63 Link Here
57
                            const OUString& rNamespace );
57
                            const OUString& rNamespace );
58
58
59
private:
59
private:
60
    typedef ::std::hash_map< OUString, Reference< XSingleComponentFactory >, OUStringHash > FactoryMap;
60
    typedef ::boost::unordered_map< OUString, Reference< XSingleComponentFactory >, OUStringHash > FactoryMap;
61
61
62
    Reference< XComponentContext > mxContext;   /// Global component context.
62
    Reference< XComponentContext > mxContext;   /// Global component context.
63
    FactoryMap          maFactories;            /// All parser factories, mapped by formula namespace.
63
    FactoryMap          maFactories;            /// All parser factories, mapped by formula namespace.
(-)sc/source/ui/unoobj/cellsuno.cxx (-2 / +2 lines)
Lines 9650-9656 Link Here
9650
};
9650
};
9651
9651
9652
// Hash map to find a range by its start row
9652
// Hash map to find a range by its start row
9653
typedef ::std::hash_map< SCROW, ScRange > ScRowRangeHashMap;
9653
typedef ::boost::unordered_map< SCROW, ScRange > ScRowRangeHashMap;
9654
9654
9655
typedef ::std::vector<ScRange> ScRangeVector;
9655
typedef ::std::vector<ScRange> ScRangeVector;
9656
9656
Lines 9769-9775 Link Here
9769
    return *aReturnRanges;
9769
    return *aReturnRanges;
9770
}
9770
}
9771
9771
9772
typedef ::std::hash_map< const ScPatternAttr*, ScUniqueFormatsEntry, ScPatternHashCode > ScUniqueFormatsHashMap;
9772
typedef ::boost::unordered_map< const ScPatternAttr*, ScUniqueFormatsEntry, ScPatternHashCode > ScUniqueFormatsHashMap;
9773
9773
9774
// function object to sort the range lists by start of first range
9774
// function object to sort the range lists by start of first range
9775
struct ScUniqueFormatsOrder
9775
struct ScUniqueFormatsOrder
(-)sc/source/ui/unoobj/chart2uno.cxx (-1 / +1 lines)
Lines 76-82 Link Here
76
using ::std::list;
76
using ::std::list;
77
using ::std::distance;
77
using ::std::distance;
78
using ::std::unary_function;
78
using ::std::unary_function;
79
using ::std::hash_set;
79
using ::boost::unordered_set;
80
using ::boost::shared_ptr;
80
using ::boost::shared_ptr;
81
81
82
namespace
82
namespace
(-)sc/source/ui/view/gridwin2.cxx (-2 / +2 lines)
Lines 57-69 Link Here
57
#include "scabstdlg.hxx" //CHINA001
57
#include "scabstdlg.hxx" //CHINA001
58
58
59
#include <vector>
59
#include <vector>
60
#include <hash_map>
60
#include <boost/unordered_map.hpp>
61
61
62
using namespace com::sun::star;
62
using namespace com::sun::star;
63
using ::com::sun::star::sheet::DataPilotFieldOrientation;
63
using ::com::sun::star::sheet::DataPilotFieldOrientation;
64
using ::std::vector;
64
using ::std::vector;
65
using ::std::auto_ptr;
65
using ::std::auto_ptr;
66
using ::std::hash_map;
66
using ::boost::unordered_map;
67
using ::rtl::OUString;
67
using ::rtl::OUString;
68
using ::rtl::OUStringHash;
68
using ::rtl::OUStringHash;
69
69
(-)sc/source/ui/view/dbfunc3.cxx (-5 / +5 lines)
Lines 74-81 Link Here
74
#include "cell.hxx"
74
#include "cell.hxx"
75
#include "userlist.hxx"
75
#include "userlist.hxx"
76
76
77
#include <hash_set>
77
#include <boost/unordered_set.hpp>
78
#include <hash_map>
78
#include <boost/unordered_map.hpp>
79
#include <memory>
79
#include <memory>
80
#include <list>
80
#include <list>
81
#include <vector>
81
#include <vector>
Lines 94-101 Link Here
94
using ::std::auto_ptr;
94
using ::std::auto_ptr;
95
using ::std::list;
95
using ::std::list;
96
using ::std::vector;
96
using ::std::vector;
97
using ::std::hash_map;
97
using ::boost::unordered_map;
98
using ::std::hash_set;
98
using ::boost::unordered_set;
99
99
100
// STATIC DATA -----------------------------------------------------------
100
// STATIC DATA -----------------------------------------------------------
101
101
Lines 1913-1919 Link Here
1913
        bool bValid = ( aDestData.Dimension >= 0 );        // dropping onto a field
1913
        bool bValid = ( aDestData.Dimension >= 0 );        // dropping onto a field
1914
1914
1915
        // look through the source range
1915
        // look through the source range
1916
        std::hash_set< rtl::OUString, rtl::OUStringHash, std::equal_to<rtl::OUString> > aMembersSet;   // for lookup
1916
        boost::unordered_set< rtl::OUString, rtl::OUStringHash, std::equal_to<rtl::OUString> > aMembersSet;   // for lookup
1917
        std::vector< rtl::OUString > aMembersVector;  // members in original order, for inserting
1917
        std::vector< rtl::OUString > aMembersVector;  // members in original order, for inserting
1918
        aMembersVector.reserve( std::max( static_cast<SCSIZE>( rSource.aEnd.Col() - rSource.aStart.Col() + 1 ),
1918
        aMembersVector.reserve( std::max( static_cast<SCSIZE>( rSource.aEnd.Col() - rSource.aStart.Col() + 1 ),
1919
                                          static_cast<SCSIZE>( rSource.aEnd.Row() - rSource.aStart.Row() + 1 ) ) );
1919
                                          static_cast<SCSIZE>( rSource.aEnd.Row() - rSource.aStart.Row() + 1 ) ) );
(-)sc/source/ui/cctrl/dpcontrol.cxx (-1 / +1 lines)
Lines 52-58 Link Here
52
using ::rtl::OUString;
52
using ::rtl::OUString;
53
using ::rtl::OUStringHash;
53
using ::rtl::OUStringHash;
54
using ::std::vector;
54
using ::std::vector;
55
using ::std::hash_map;
55
using ::boost::unordered_map;
56
using ::std::auto_ptr;
56
using ::std::auto_ptr;
57
57
58
ScDPFieldButton::ScDPFieldButton(OutputDevice* pOutDev, const StyleSettings* pStyle, const Fraction* pZoomX, const Fraction* pZoomY, ScDocument* pDoc) :
58
ScDPFieldButton::ScDPFieldButton(OutputDevice* pOutDev, const StyleSettings* pStyle, const Fraction* pZoomX, const Fraction* pZoomY, ScDocument* pDoc) :
(-)sc/source/ui/vba/vbacharts.hxx (-1 / +1 lines)
Lines 26-32 Link Here
26
#include <com/sun/star/sheet/XSpreadsheetDocument.hpp>
26
#include <com/sun/star/sheet/XSpreadsheetDocument.hpp>
27
#include <vbahelper/vbacollectionimpl.hxx>
27
#include <vbahelper/vbacollectionimpl.hxx>
28
#include "excelvbahelper.hxx"
28
#include "excelvbahelper.hxx"
29
#include <hash_map>
29
#include <boost/unordered_map.hpp>
30
30
31
typedef CollTestImplHelper< ov::excel::XCharts > Charts_BASE;
31
typedef CollTestImplHelper< ov::excel::XCharts > Charts_BASE;
32
32
(-)sc/source/ui/vba/vbawindow.cxx (-2 / +2 lines)
Lines 42-48 Link Here
42
#include <tabvwsh.hxx>
42
#include <tabvwsh.hxx>
43
#include <docuno.hxx>
43
#include <docuno.hxx>
44
#include <sc.hrc>
44
#include <sc.hrc>
45
#include <hash_map>
45
#include <boost/unordered_map.hpp>
46
#include <sfx2/viewfrm.hxx>
46
#include <sfx2/viewfrm.hxx>
47
#include <vcl/wrkwin.hxx>
47
#include <vcl/wrkwin.hxx>
48
#include "unonames.hxx"
48
#include "unonames.hxx"
Lines 51-57 Link Here
51
using namespace ::ooo::vba;
51
using namespace ::ooo::vba;
52
using namespace ::ooo::vba::excel::XlWindowState;
52
using namespace ::ooo::vba::excel::XlWindowState;
53
53
54
typedef  std::hash_map< rtl::OUString,
54
typedef  boost::unordered_map< rtl::OUString,
55
SCTAB, ::rtl::OUStringHash,
55
SCTAB, ::rtl::OUStringHash,
56
::std::equal_to< ::rtl::OUString > > NameIndexHash;
56
::std::equal_to< ::rtl::OUString > > NameIndexHash;
57
57
(-)sc/source/ui/vba/vbawindows.cxx (-2 / +2 lines)
Lines 22-28 Link Here
22
22
23
#include "vbawindows.hxx"
23
#include "vbawindows.hxx"
24
24
25
#include <hash_map>
25
#include <boost/unordered_map.hpp>
26
26
27
#include <com/sun/star/sheet/XSpreadsheetDocument.hpp>
27
#include <com/sun/star/sheet/XSpreadsheetDocument.hpp>
28
#include <com/sun/star/frame/XDesktop.hpp>
28
#include <com/sun/star/frame/XDesktop.hpp>
Lines 36-42 Link Here
36
using namespace ::com::sun::star;
36
using namespace ::com::sun::star;
37
using namespace ::ooo::vba;
37
using namespace ::ooo::vba;
38
38
39
typedef  std::hash_map< rtl::OUString,
39
typedef  boost::unordered_map< rtl::OUString,
40
sal_Int32, ::rtl::OUStringHash,
40
sal_Int32, ::rtl::OUStringHash,
41
::std::equal_to< ::rtl::OUString > > NameIndexHash;
41
::std::equal_to< ::rtl::OUString > > NameIndexHash;
42
42
(-)sc/source/ui/vba/vbaworkbooks.cxx (-1 / +1 lines)
Lines 57-63 Link Here
57
#include "vbaworkbooks.hxx"
57
#include "vbaworkbooks.hxx"
58
#include <vbahelper/vbahelper.hxx>
58
#include <vbahelper/vbahelper.hxx>
59
59
60
#include <hash_map>
60
#include <boost/unordered_map.hpp>
61
#include <vector>
61
#include <vector>
62
#include <osl/file.hxx>
62
#include <osl/file.hxx>
63
using namespace ::ooo::vba;
63
using namespace ::ooo::vba;
(-)sc/source/ui/vba/vbachartobjects.hxx (-2 / +2 lines)
Lines 31-41 Link Here
31
#include <com/sun/star/container/XEnumerationAccess.hpp>
31
#include <com/sun/star/container/XEnumerationAccess.hpp>
32
#include <vbahelper/vbacollectionimpl.hxx>
32
#include <vbahelper/vbacollectionimpl.hxx>
33
#include "excelvbahelper.hxx"
33
#include "excelvbahelper.hxx"
34
#include <hash_map>
34
#include <boost/unordered_map.hpp>
35
35
36
typedef CollTestImplHelper< ov::excel::XChartObjects > ChartObjects_BASE;
36
typedef CollTestImplHelper< ov::excel::XChartObjects > ChartObjects_BASE;
37
/* #TODO see if this hash table is 'really' necessary
37
/* #TODO see if this hash table is 'really' necessary
38
typedef ::std::hash_map< ::rtl::OUString, 
38
typedef ::boost::unordered_map< ::rtl::OUString, 
39
css::uno::Reference< ov::excel::XChartObject >,
39
css::uno::Reference< ov::excel::XChartObject >,
40
    ::rtl::OUStringHash,
40
    ::rtl::OUStringHash,
41
    ::std::equal_to< ::rtl::OUString > > aHashTable;
41
    ::std::equal_to< ::rtl::OUString > > aHashTable;
(-)sc/source/ui/inc/dpcontrol.hxx (-2 / +2 lines)
Lines 35-41 Link Here
35
35
36
#include <boost/shared_ptr.hpp>
36
#include <boost/shared_ptr.hpp>
37
#include <memory>
37
#include <memory>
38
#include <hash_map>
38
#include <boost/unordered_map.hpp>
39
39
40
namespace com { namespace sun { namespace star {
40
namespace com { namespace sun { namespace star {
41
41
Lines 277-283 Link Here
277
277
278
    const Size& getWindowSize() const;
278
    const Size& getWindowSize() const;
279
279
280
    void getResult(::std::hash_map< ::rtl::OUString, bool, ::rtl::OUStringHash>& rResult);
280
    void getResult(::boost::unordered_map< ::rtl::OUString, bool, ::rtl::OUStringHash>& rResult);
281
    void close(bool bOK);
281
    void close(bool bOK);
282
282
283
    /** 
283
    /** 
(-)sc/source/ui/inc/docsh.hxx (-2 / +2 lines)
Lines 37-43 Link Here
37
#include "shellids.hxx"
37
#include "shellids.hxx"
38
#include "refreshtimer.hxx"
38
#include "refreshtimer.hxx"
39
39
40
#include <hash_map>
40
#include <boost/unordered_map.hpp>
41
41
42
class ScEditEngineDefaulter;
42
class ScEditEngineDefaulter;
43
class FontList;
43
class FontList;
Lines 67-73 Link Here
67
namespace sfx2 { class FileDialogHelper; }
67
namespace sfx2 { class FileDialogHelper; }
68
struct DocShell_Impl;
68
struct DocShell_Impl;
69
69
70
typedef ::std::hash_map< sal_uLong, sal_uLong > ScChangeActionMergeMap;
70
typedef ::boost::unordered_map< sal_uLong, sal_uLong > ScChangeActionMergeMap;
71
71
72
//==================================================================
72
//==================================================================
73
73
(-)sc/source/ui/inc/crnrdlg.hxx (-2 / +2 lines)
Lines 29-35 Link Here
29
#include <vcl/fixed.hxx>
29
#include <vcl/fixed.hxx>
30
#include <vcl/lstbox.hxx>
30
#include <vcl/lstbox.hxx>
31
31
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
33
34
class ScViewData;
34
class ScViewData;
35
class ScDocument;
35
class ScDocument;
Lines 74-80 Link Here
74
	ScRangePairListRef	xColNameRanges;
74
	ScRangePairListRef	xColNameRanges;
75
	ScRangePairListRef	xRowNameRanges;
75
	ScRangePairListRef	xRowNameRanges;
76
76
77
    typedef ::std::hash_map< String, ScRange, ScStringHashCode, ::std::equal_to<String> > NameRangeMap;
77
    typedef ::boost::unordered_map< String, ScRange, ScStringHashCode, ::std::equal_to<String> > NameRangeMap;
78
    NameRangeMap    aRangeMap;
78
    NameRangeMap    aRangeMap;
79
	ScViewData*		pViewData;
79
	ScViewData*		pViewData;
80
	ScDocument*		pDoc;
80
	ScDocument*		pDoc;
(-)sc/source/ui/inc/pvfundlg.hxx (-2 / +2 lines)
Lines 38-44 Link Here
38
#include <sfx2/itemconnect.hxx>
38
#include <sfx2/itemconnect.hxx>
39
#include "pivot.hxx"
39
#include "pivot.hxx"
40
40
41
#include <hash_map>
41
#include <boost/unordered_map.hpp>
42
42
43
// ============================================================================
43
// ============================================================================
44
44
Lines 219-225 Link Here
219
    CancelButton        maBtnCancel;
219
    CancelButton        maBtnCancel;
220
    HelpButton          maBtnHelp;
220
    HelpButton          maBtnHelp;
221
221
222
    typedef ::std::hash_map<String, long, ScStringHashCode> DimNameIndexMap;
222
    typedef ::boost::unordered_map<String, long, ScStringHashCode> DimNameIndexMap;
223
    DimNameIndexMap     maNameIndexMap;
223
    DimNameIndexMap     maNameIndexMap;
224
    ScDPObject&         mrDPObj;
224
    ScDPObject&         mrDPObj;
225
};
225
};
(-)sc/inc/sheetdata.hxx (-2 / +2 lines)
Lines 27-33 Link Here
27
#include <xmloff/maptype.hxx>
27
#include <xmloff/maptype.hxx>
28
#include <editeng/editdata.hxx>
28
#include <editeng/editdata.hxx>
29
#include <vector>
29
#include <vector>
30
#include <hash_set>
30
#include <boost/unordered_set.hpp>
31
31
32
#include "address.hxx"
32
#include "address.hxx"
33
33
Lines 109-115 Link Here
109
109
110
class ScSheetSaveData
110
class ScSheetSaveData
111
{
111
{
112
    std::hash_set<rtl::OUString, rtl::OUStringHash>  maInitialPrefixes;
112
    boost::unordered_set<rtl::OUString, rtl::OUStringHash>  maInitialPrefixes;
113
    std::vector<ScLoadedNamespaceEntry>              maLoadedNamespaces;
113
    std::vector<ScLoadedNamespaceEntry>              maLoadedNamespaces;
114
114
115
    std::vector<ScCellStyleEntry> maCellStyles;
115
    std::vector<ScCellStyleEntry> maCellStyles;
(-)sc/inc/chart2uno.hxx (-3 / +3 lines)
Lines 54-60 Link Here
54
#include <rtl/ustring.hxx>
54
#include <rtl/ustring.hxx>
55
#include <svl/itemprop.hxx>
55
#include <svl/itemprop.hxx>
56
56
57
#include <hash_set>
57
#include <boost/unordered_set.hpp>
58
#include <list>
58
#include <list>
59
#include <vector>
59
#include <vector>
60
#include <memory>
60
#include <memory>
Lines 391-404 Link Here
391
        virtual void notify(sal_uInt16 nFileId, ScExternalRefManager::LinkUpdateType eType);
391
        virtual void notify(sal_uInt16 nFileId, ScExternalRefManager::LinkUpdateType eType);
392
        void addFileId(sal_uInt16 nFileId);
392
        void addFileId(sal_uInt16 nFileId);
393
        void removeFileId(sal_uInt16 nFileId);
393
        void removeFileId(sal_uInt16 nFileId);
394
        const ::std::hash_set<sal_uInt16>& getAllFileIds();
394
        const ::boost::unordered_set<sal_uInt16>& getAllFileIds();
395
395
396
    private:
396
    private:
397
        ExternalRefListener();
397
        ExternalRefListener();
398
        ExternalRefListener(const ExternalRefListener& r);
398
        ExternalRefListener(const ExternalRefListener& r);
399
399
400
        ScChart2DataSequence&       mrParent;
400
        ScChart2DataSequence&       mrParent;
401
        ::std::hash_set<sal_uInt16> maFileIds;
401
        ::boost::unordered_set<sal_uInt16> maFileIds;
402
        ScDocument*                 mpDoc;
402
        ScDocument*                 mpDoc;
403
    };
403
    };
404
404
(-)sc/inc/dpshttab.hxx (-2 / +2 lines)
Lines 92-100 Link Here
92
    virtual bool                    IsRepeatIfEmpty();
92
    virtual bool                    IsRepeatIfEmpty();
93
93
94
    virtual void                    CreateCacheTable();
94
    virtual void                    CreateCacheTable();
95
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::std::hash_set<sal_Int32>& rCatDims);
95
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::boost::unordered_set<sal_Int32>& rCatDims);
96
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
96
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
97
                                                     const ::std::hash_set<sal_Int32>& rCatDims,
97
                                                     const ::boost::unordered_set<sal_Int32>& rCatDims,
98
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData);
98
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData);
99
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow);
99
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow);
100
    virtual const ScDPCacheTable&   GetCacheTable() const;
100
    virtual const ScDPCacheTable&   GetCacheTable() const;
(-)sc/inc/formulaparserpool.hxx (-2 / +2 lines)
Lines 24-30 Link Here
24
#ifndef SC_FORMULAPARSERPOOL_HXX
24
#ifndef SC_FORMULAPARSERPOOL_HXX
25
#define SC_FORMULAPARSERPOOL_HXX
25
#define SC_FORMULAPARSERPOOL_HXX
26
26
27
#include <hash_map>
27
#include <boost/unordered_map.hpp>
28
#include <com/sun/star/sheet/XFormulaParser.hpp>
28
#include <com/sun/star/sheet/XFormulaParser.hpp>
29
29
30
class ScDocument;
30
class ScDocument;
Lines 47-53 Link Here
47
                        getFormulaParser( const ::rtl::OUString& rNamespace );
47
                        getFormulaParser( const ::rtl::OUString& rNamespace );
48
48
49
private:
49
private:
50
    typedef ::std::hash_map<
50
    typedef ::boost::unordered_map<
51
        ::rtl::OUString,
51
        ::rtl::OUString,
52
        ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XFormulaParser >,
52
        ::com::sun::star::uno::Reference< ::com::sun::star::sheet::XFormulaParser >,
53
        ::rtl::OUStringHash,
53
        ::rtl::OUStringHash,
(-)sc/inc/dpsdbtab.hxx (-2 / +2 lines)
Lines 79-87 Link Here
79
	virtual void					SetEmptyFlags( sal_Bool bIgnoreEmptyRows, sal_Bool bRepeatIfEmpty );
79
	virtual void					SetEmptyFlags( sal_Bool bIgnoreEmptyRows, sal_Bool bRepeatIfEmpty );
80
80
81
    virtual void                    CreateCacheTable();
81
    virtual void                    CreateCacheTable();
82
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::std::hash_set<sal_Int32>& rDataDims);
82
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::boost::unordered_set<sal_Int32>& rDataDims);
83
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
83
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
84
                                                     const ::std::hash_set<sal_Int32>& rCatDims,
84
                                                     const ::boost::unordered_set<sal_Int32>& rCatDims,
85
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData);
85
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData);
86
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow);
86
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow);
87
    virtual const ScDPCacheTable&   GetCacheTable() const;
87
    virtual const ScDPCacheTable&   GetCacheTable() const;
(-)sc/inc/dpsave.hxx (-3 / +3 lines)
Lines 29-35 Link Here
29
#include <com/sun/star/sheet/XDimensionsSupplier.hpp>
29
#include <com/sun/star/sheet/XDimensionsSupplier.hpp>
30
#include <com/sun/star/sheet/DataPilotFieldOrientation.hpp>
30
#include <com/sun/star/sheet/DataPilotFieldOrientation.hpp>
31
#include "scdllapi.h"
31
#include "scdllapi.h"
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
#include <list>
33
#include <list>
34
#include <memory>
34
#include <memory>
35
35
Lines 110-116 Link Here
110
    ::com::sun::star::sheet::DataPilotFieldLayoutInfo* pLayoutInfo;         // (level)
110
    ::com::sun::star::sheet::DataPilotFieldLayoutInfo* pLayoutInfo;         // (level)
111
111
112
public:
112
public:
113
    typedef	std::hash_map <String, ScDPSaveMember*, rtl::OUStringHash> MemberHash;
113
    typedef	boost::unordered_map <String, ScDPSaveMember*, rtl::OUStringHash> MemberHash;
114
    typedef	std::list <ScDPSaveMember*>                                MemberList;
114
    typedef	std::list <ScDPSaveMember*>                                MemberList;
115
private:
115
private:
116
    MemberHash maMemberHash;
116
    MemberHash maMemberHash;
Lines 180-186 Link Here
180
									com::sun::star::sheet::XDimensionsSupplier>& xSource ,
180
									com::sun::star::sheet::XDimensionsSupplier>& xSource ,
181
									const	std::list<String> & deletedDims);
181
									const	std::list<String> & deletedDims);
182
182
183
    void                    UpdateMemberVisibility(const ::std::hash_map< ::rtl::OUString, bool, ::rtl::OUStringHash>& rData);
183
    void                    UpdateMemberVisibility(const ::boost::unordered_map< ::rtl::OUString, bool, ::rtl::OUStringHash>& rData);
184
184
185
    bool                    HasInvisibleMember() const;
185
    bool                    HasInvisibleMember() const;
186
};
186
};
(-)sc/inc/addincol.hxx (-2 / +2 lines)
Lines 42-48 Link Here
42
#include "scmatrix.hxx"
42
#include "scmatrix.hxx"
43
#endif
43
#endif
44
44
45
#include <hash_map>
45
#include <boost/unordered_map.hpp>
46
46
47
47
48
class String;
48
class String;
Lines 52-58 Link Here
52
class ScFuncDesc;
52
class ScFuncDesc;
53
53
54
54
55
typedef ::std::hash_map< String, const ScUnoAddInFuncData*, ScStringHashCode, ::std::equal_to< String > > ScAddInHashMap;
55
typedef ::boost::unordered_map< String, const ScUnoAddInFuncData*, ScStringHashCode, ::std::equal_to< String > > ScAddInHashMap;
56
56
57
57
58
enum ScAddInArgumentType
58
enum ScAddInArgumentType
(-)sc/inc/dptabsrc.hxx (-3 / +3 lines)
Lines 25-31 Link Here
25
#define SC_DPTABSRC_HXX
25
#define SC_DPTABSRC_HXX
26
26
27
#include <vector>
27
#include <vector>
28
#include <hash_map>
28
#include <boost/unordered_map.hpp>
29
// Wang Xu Ming -- 2009-8-17
29
// Wang Xu Ming -- 2009-8-17
30
// DataPilot Migration - Cache&&Performance
30
// DataPilot Migration - Cache&&Performance
31
#include <list>
31
#include <list>
Lines 152-158 Link Here
152
     * Compile a list of dimension indices that are either, column, row or 
152
     * Compile a list of dimension indices that are either, column, row or 
153
     * page dimensions (i.e. all but data dimensions). 
153
     * page dimensions (i.e. all but data dimensions). 
154
     */
154
     */
155
    void                    GetCategoryDimensionIndices(::std::hash_set<sal_Int32>& rCatDims);
155
    void                    GetCategoryDimensionIndices(::boost::unordered_set<sal_Int32>& rCatDims);
156
156
157
    /** 
157
    /** 
158
     * Set visibilities of individual rows in the cache table based on the 
158
     * Set visibilities of individual rows in the cache table based on the 
Lines 703-709 Link Here
703
};
703
};
704
704
705
// hash map from name to index in the member array, for fast name access
705
// hash map from name to index in the member array, for fast name access
706
typedef ::std::hash_map< ::rtl::OUString, sal_Int32, ::rtl::OUStringHash > ScDPMembersHashMap;
706
typedef ::boost::unordered_map< ::rtl::OUString, sal_Int32, ::rtl::OUStringHash > ScDPMembersHashMap;
707
707
708
class ScDPMembers : public cppu::WeakImplHelper2<
708
class ScDPMembers : public cppu::WeakImplHelper2<
709
							com::sun::star::container::XNameAccess,
709
							com::sun::star::container::XNameAccess,
(-)sc/inc/dpgroup.hxx (-4 / +4 lines)
Lines 25-31 Link Here
25
#define SC_DPGROUP_HXX
25
#define SC_DPGROUP_HXX
26
26
27
#include <vector>
27
#include <vector>
28
#include <hash_set>
28
#include <boost/unordered_set.hpp>
29
#include <boost/shared_ptr.hpp>
29
#include <boost/shared_ptr.hpp>
30
30
31
#include "dptabdat.hxx"
31
#include "dptabdat.hxx"
Lines 189-195 Link Here
189
189
190
class ScDPGroupTableData : public ScDPTableData
190
class ScDPGroupTableData : public ScDPTableData
191
{
191
{
192
    typedef ::std::hash_set< ::rtl::OUString, ::rtl::OUStringHash, ::std::equal_to< ::rtl::OUString > > StringHashSet;
192
    typedef ::boost::unordered_set< ::rtl::OUString, ::rtl::OUStringHash, ::std::equal_to< ::rtl::OUString > > StringHashSet;
193
193
194
    ::boost::shared_ptr<ScDPTableData> pSourceData;
194
    ::boost::shared_ptr<ScDPTableData> pSourceData;
195
    long                    nSourceCount;
195
    long                    nSourceCount;
Lines 240-248 Link Here
240
    virtual bool                    IsRepeatIfEmpty();
240
    virtual bool                    IsRepeatIfEmpty();
241
241
242
    virtual void                    CreateCacheTable();
242
    virtual void                    CreateCacheTable();
243
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::std::hash_set<sal_Int32>& rDataDims);
243
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::boost::unordered_set<sal_Int32>& rDataDims);
244
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
244
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
245
                                                     const ::std::hash_set<sal_Int32>& rCatDims,
245
                                                     const ::boost::unordered_set<sal_Int32>& rCatDims,
246
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData);
246
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData);
247
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow);
247
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow);
248
    virtual const ScDPCacheTable&   GetCacheTable() const;
248
    virtual const ScDPCacheTable&   GetCacheTable() const;
(-)sc/inc/lookupcache.hxx (-3 / +3 lines)
Lines 30-36 Link Here
30
#include <svl/listener.hxx>
30
#include <svl/listener.hxx>
31
#include <tools/string.hxx>
31
#include <tools/string.hxx>
32
32
33
#include <hash_map>
33
#include <boost/unordered_map.hpp>
34
34
35
class ScDocument;
35
class ScDocument;
36
36
Lines 236-242 Link Here
236
        }
236
        }
237
    };
237
    };
238
238
239
    typedef ::std::hash_map< QueryKey, QueryCriteriaAndResult, QueryKey::Hash, ::std::equal_to< QueryKey > > QueryMap;
239
    typedef ::boost::unordered_map< QueryKey, QueryCriteriaAndResult, QueryKey::Hash, ::std::equal_to< QueryKey > > QueryMap;
240
    QueryMap        maQueryMap;
240
    QueryMap        maQueryMap;
241
    ScRange         maRange;
241
    ScRange         maRange;
242
    ScDocument *    mpDoc;
242
    ScDocument *    mpDoc;
Lines 248-253 Link Here
248
};
248
};
249
249
250
250
251
typedef ::std::hash_map< ScRange, ScLookupCache*, ScLookupCache::Hash, ::std::equal_to< ScRange > > ScLookupCacheMap;
251
typedef ::boost::unordered_map< ScRange, ScLookupCache*, ScLookupCache::Hash, ::std::equal_to< ScRange > > ScLookupCacheMap;
252
252
253
#endif
253
#endif
(-)sc/inc/compiler.hxx (-1 / +1 lines)
Lines 48-54 Link Here
48
#endif
48
#endif
49
49
50
#ifndef INCLUDED_HASH_MAP
50
#ifndef INCLUDED_HASH_MAP
51
#include <hash_map>
51
#include <boost/unordered_map.hpp>
52
#define INCLUDED_HASH_MAP
52
#define INCLUDED_HASH_MAP
53
#endif
53
#endif
54
54
(-)sc/inc/dpglobal.hxx (-1 / +1 lines)
Lines 172-178 Link Here
172
		size_t operator() (const ScDPItemData &rData) const { return rData.Hash(); }
172
		size_t operator() (const ScDPItemData &rData) const { return rData.Hash(); }
173
	};
173
	};
174
174
175
	typedef ::std::hash_multimap< ScDPItemData, sal_Int32, DataHashFunc > DataHash;
175
	typedef ::boost::hash_multimap< ScDPItemData, sal_Int32, DataHashFunc > DataHash;
176
176
177
	::std::vector< ScDPItemData > maItems;
177
	::std::vector< ScDPItemData > maItems;
178
	DataHash  maItemIds;
178
	DataHash  maItemIds;
(-)sc/inc/chartlis.hxx (-3 / +3 lines)
Lines 35-41 Link Here
35
#include <memory>
35
#include <memory>
36
#include <vector>
36
#include <vector>
37
#include <list>
37
#include <list>
38
#include <hash_set>
38
#include <boost/unordered_set.hpp>
39
39
40
class ScDocument;
40
class ScDocument;
41
class ScChartUnoData;
41
class ScChartUnoData;
Lines 53-66 Link Here
53
        virtual void notify(sal_uInt16 nFileId, ScExternalRefManager::LinkUpdateType eType);
53
        virtual void notify(sal_uInt16 nFileId, ScExternalRefManager::LinkUpdateType eType);
54
        void addFileId(sal_uInt16 nFileId);
54
        void addFileId(sal_uInt16 nFileId);
55
        void removeFileId(sal_uInt16 nFileId);
55
        void removeFileId(sal_uInt16 nFileId);
56
        ::std::hash_set<sal_uInt16>& getAllFileIds();
56
        ::boost::unordered_set<sal_uInt16>& getAllFileIds();
57
57
58
    private:
58
    private:
59
        ExternalRefListener();
59
        ExternalRefListener();
60
        ExternalRefListener(const ExternalRefListener& r);
60
        ExternalRefListener(const ExternalRefListener& r);
61
61
62
        ScChartListener& mrParent;
62
        ScChartListener& mrParent;
63
        ::std::hash_set<sal_uInt16> maFileIds;
63
        ::boost::unordered_set<sal_uInt16> maFileIds;
64
        ScDocument*                 mpDoc;
64
        ScDocument*                 mpDoc;
65
    };
65
    };
66
66
(-)sc/inc/dpcachetable.hxx (-5 / +5 lines)
Lines 30-37 Link Here
30
#include "collect.hxx"
30
#include "collect.hxx"
31
31
32
#include <vector>
32
#include <vector>
33
#include <hash_map>
33
#include <boost/unordered_map.hpp>
34
#include <hash_set>
34
#include <boost/unordered_set.hpp>
35
#include <boost/shared_ptr.hpp>
35
#include <boost/shared_ptr.hpp>
36
#include <com/sun/star/uno/Reference.hxx>
36
#include <com/sun/star/uno/Reference.hxx>
37
37
Lines 178-184 Link Here
178
178
179
    /** Set filter on/off flag to each row to control visibility.  The caller
179
    /** Set filter on/off flag to each row to control visibility.  The caller
180
        must ensure that the table is filled before calling this function. */
180
        must ensure that the table is filled before calling this function. */
181
    void filterByPageDimension(const ::std::vector<Criterion>& rCriteria, const ::std::hash_set<sal_Int32>& rRepeatIfEmptyDims);
181
    void filterByPageDimension(const ::std::vector<Criterion>& rCriteria, const ::boost::unordered_set<sal_Int32>& rRepeatIfEmptyDims);
182
182
183
    /** Get the cell instance at specified location within the data grid. Note
183
    /** Get the cell instance at specified location within the data grid. Note
184
        that the data grid doesn't include the header row.  Don't delete the
184
        that the data grid doesn't include the header row.  Don't delete the
Lines 205-211 Link Here
205
        a drill-down data table. */
205
        a drill-down data table. */
206
    void filterTable(const ::std::vector<Criterion>& rCriteria,
206
    void filterTable(const ::std::vector<Criterion>& rCriteria,
207
                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rTabData,
207
                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rTabData,
208
                     const ::std::hash_set<sal_Int32>& rRepeatIfEmptyDims);
208
                     const ::boost::unordered_set<sal_Int32>& rRepeatIfEmptyDims);
209
209
210
    void clear();
210
    void clear();
211
    void swap(ScDPCacheTable& rOther);
211
    void swap(ScDPCacheTable& rOther);
Lines 221-227 Link Here
221
     * @param nRow index of row to be tested.
221
     * @param nRow index of row to be tested.
222
     * @param rCriteria a list of criteria
222
     * @param rCriteria a list of criteria
223
     */
223
     */
224
    bool isRowQualified(sal_Int32 nRow, const ::std::vector<Criterion>& rCriteria, const ::std::hash_set<sal_Int32>& rRepeatIfEmptyDims) const;
224
    bool isRowQualified(sal_Int32 nRow, const ::std::vector<Criterion>& rCriteria, const ::boost::unordered_set<sal_Int32>& rRepeatIfEmptyDims) const;
225
    void getValueData(ScDocument* pDoc, const ScAddress& rPos, ScDPCacheCell& rCell);
225
    void getValueData(ScDocument* pDoc, const ScAddress& rPos, ScDPCacheCell& rCell);
226
   // Wang Xu Ming -- 2009-8-17
226
   // Wang Xu Ming -- 2009-8-17
227
    // DataPilot Migration - Cache&&Performance
227
    // DataPilot Migration - Cache&&Performance
(-)sc/inc/externalrefmgr.hxx (-15 / +15 lines)
Lines 34-41 Link Here
34
#include "scmatrix.hxx"
34
#include "scmatrix.hxx"
35
#include "rangelst.hxx"
35
#include "rangelst.hxx"
36
36
37
#include <hash_map>
37
#include <boost/unordered_map.hpp>
38
#include <hash_set>
38
#include <boost/unordered_set.hpp>
39
#include <boost/shared_ptr.hpp>
39
#include <boost/shared_ptr.hpp>
40
#include <vector>
40
#include <vector>
41
#include <list>
41
#include <list>
Lines 116-123 Link Here
116
        TokenRef    mxToken;
116
        TokenRef    mxToken;
117
        sal_uInt32  mnFmtIndex;
117
        sal_uInt32  mnFmtIndex;
118
    };
118
    };
119
    typedef ::std::hash_map<SCCOL, Cell>            RowDataType;
119
    typedef ::boost::unordered_map<SCCOL, Cell>            RowDataType;
120
    typedef ::std::hash_map<SCROW, RowDataType>     RowsDataType;
120
    typedef ::boost::unordered_map<SCROW, RowDataType>     RowsDataType;
121
121
122
public:
122
public:
123
    // SUNWS needs a forward declared friend, otherwise types and members
123
    // SUNWS needs a forward declared friend, otherwise types and members
Lines 202-208 Link Here
202
    };
202
    };
203
203
204
    typedef ::boost::shared_ptr<Table>      TableTypeRef;
204
    typedef ::boost::shared_ptr<Table>      TableTypeRef;
205
    typedef ::std::hash_map<String, size_t, ScStringHashCode>   TableNameIndexMap;
205
    typedef ::boost::unordered_map<String, size_t, ScStringHashCode>   TableNameIndexMap;
206
206
207
    ScExternalRefCache();
207
    ScExternalRefCache();
208
    ~ScExternalRefCache();
208
    ~ScExternalRefCache();
Lines 316-324 Link Here
316
        }
316
        }
317
    };
317
    };
318
318
319
    typedef ::std::hash_map<String, TokenArrayRef, ScStringHashCode>    RangeNameMap;
319
    typedef ::boost::unordered_map<String, TokenArrayRef, ScStringHashCode>    RangeNameMap;
320
    typedef ::std::hash_map<ScRange, TokenArrayRef, RangeHash>          RangeArrayMap;
320
    typedef ::boost::unordered_map<ScRange, TokenArrayRef, RangeHash>          RangeArrayMap;
321
    typedef ::std::hash_map<String, String, ScStringHashCode>           NamePairMap;
321
    typedef ::boost::unordered_map<String, String, ScStringHashCode>           NamePairMap;
322
322
323
    // SUNWS needs a forward declared friend, otherwise types and members
323
    // SUNWS needs a forward declared friend, otherwise types and members
324
    // of the outer class are not accessible.
324
    // of the outer class are not accessible.
Lines 345-351 Link Here
345
345
346
        DocItem() : mbInitFromSource(false) {}
346
        DocItem() : mbInitFromSource(false) {}
347
    };
347
    };
348
    typedef ::std::hash_map<sal_uInt16, DocItem>  DocDataType;
348
    typedef ::boost::unordered_map<sal_uInt16, DocItem>  DocDataType;
349
    DocItem* getDocItem(sal_uInt16 nFileId) const;
349
    DocItem* getDocItem(sal_uInt16 nFileId) const;
350
350
351
private:
351
private:
Lines 359-365 Link Here
359
public:
359
public:
360
360
361
    typedef ::std::set<ScFormulaCell*>                      RefCellSet;
361
    typedef ::std::set<ScFormulaCell*>                      RefCellSet;
362
    typedef ::std::hash_map<sal_uInt16, RefCellSet>         RefCellMap;
362
    typedef ::boost::unordered_map<sal_uInt16, RefCellSet>         RefCellMap;
363
363
364
    enum LinkUpdateType { LINK_MODIFIED, LINK_BROKEN };
364
    enum LinkUpdateType { LINK_MODIFIED, LINK_BROKEN };
365
365
Lines 407-420 Link Here
407
        Time                maLastAccess;
407
        Time                maLastAccess;
408
    };
408
    };
409
409
410
    typedef ::std::hash_map<sal_uInt16, SrcShell>           DocShellMap;
410
    typedef ::boost::unordered_map<sal_uInt16, SrcShell>           DocShellMap;
411
    typedef ::std::hash_map<sal_uInt16, bool>               LinkedDocMap;
411
    typedef ::boost::unordered_map<sal_uInt16, bool>               LinkedDocMap;
412
412
413
    typedef ::std::hash_map<sal_uInt16, SvNumberFormatterMergeMap> NumFmtMap;
413
    typedef ::boost::unordered_map<sal_uInt16, SvNumberFormatterMergeMap> NumFmtMap;
414
414
415
415
416
    typedef ::std::hash_set<LinkListener*, LinkListener::Hash>  LinkListeners;
416
    typedef ::boost::unordered_set<LinkListener*, LinkListener::Hash>  LinkListeners;
417
    typedef ::std::hash_map<sal_uInt16, LinkListeners>          LinkListenerMap;
417
    typedef ::boost::unordered_map<sal_uInt16, LinkListeners>          LinkListenerMap;
418
418
419
public:
419
public:
420
    /** Source document meta-data container. */
420
    /** Source document meta-data container. */
(-)sc/inc/global.hxx (-1 / +1 lines)
Lines 31-37 Link Here
31
#include <com/sun/star/uno/Reference.hxx>
31
#include <com/sun/star/uno/Reference.hxx>
32
#include "scdllapi.h"
32
#include "scdllapi.h"
33
33
34
#include <hash_map>
34
#include <boost/unordered_map.hpp>
35
35
36
class ImageList;
36
class ImageList;
37
class Bitmap;
37
class Bitmap;
(-)sc/inc/dptabdat.hxx (-4 / +4 lines)
Lines 35-42 Link Here
35
35
36
#include <vector>
36
#include <vector>
37
#include <set>
37
#include <set>
38
#include <hash_map>
38
#include <boost/unordered_map.hpp>
39
#include <hash_set>
39
#include <boost/unordered_set.hpp>
40
40
41
namespace com { namespace sun { namespace star { namespace sheet {
41
namespace com { namespace sun { namespace star { namespace sheet {
42
    struct DataPilotFieldFilter;
42
    struct DataPilotFieldFilter;
Lines 153-161 Link Here
153
    virtual bool                    IsRepeatIfEmpty();
153
    virtual bool                    IsRepeatIfEmpty();
154
154
155
    virtual void                    CreateCacheTable() = 0;
155
    virtual void                    CreateCacheTable() = 0;
156
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::std::hash_set<sal_Int32>& rDataDims) = 0;
156
    virtual void                    FilterCacheTable(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria, const ::boost::unordered_set<sal_Int32>& rDataDims) = 0;
157
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
157
    virtual void                    GetDrillDownData(const ::std::vector<ScDPCacheTable::Criterion>& rCriteria,
158
                                                     const ::std::hash_set<sal_Int32>& rCatDims,
158
                                                     const ::boost::unordered_set<sal_Int32>& rCatDims,
159
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData) = 0;
159
                                                     ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Sequence< ::com::sun::star::uno::Any > >& rData) = 0;
160
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow) = 0;
160
    virtual void                    CalcResults(CalcInfo& rInfo, bool bAutoShow) = 0;
161
    virtual const ScDPCacheTable&   GetCacheTable() const = 0;
161
    virtual const ScDPCacheTable&   GetCacheTable() const = 0;
(-)sc/inc/linkuno.hxx (-1 / +1 lines)
Lines 48-54 Link Here
48
48
49
#include "externalrefmgr.hxx"
49
#include "externalrefmgr.hxx"
50
50
51
#include <hash_map>
51
#include <boost/unordered_map.hpp>
52
#include <vector>
52
#include <vector>
53
53
54
class ScAreaLink;
54
class ScAreaLink;
(-)sc/inc/autonamecache.hxx (-2 / +2 lines)
Lines 25-36 Link Here
25
#define SC_AUTONAMECACHE_HXX
25
#define SC_AUTONAMECACHE_HXX
26
26
27
#include <vector>
27
#include <vector>
28
#include <hash_map>
28
#include <boost/unordered_map.hpp>
29
#include "address.hxx"
29
#include "address.hxx"
30
#include "global.hxx"
30
#include "global.hxx"
31
31
32
typedef ::std::vector< ScAddress > ScAutoNameAddresses;
32
typedef ::std::vector< ScAddress > ScAutoNameAddresses;
33
typedef ::std::hash_map< String, ScAutoNameAddresses, ScStringHashCode, ::std::equal_to< String > > ScAutoNameHashMap;
33
typedef ::boost::unordered_map< String, ScAutoNameAddresses, ScStringHashCode, ::std::equal_to< String > > ScAutoNameHashMap;
34
34
35
//
35
//
36
//  Cache for faster lookup of automatic names during CompileXML
36
//  Cache for faster lookup of automatic names during CompileXML
(-)sc/inc/dptabres.hxx (-5 / +5 lines)
Lines 31-38 Link Here
31
#include <com/sun/star/uno/Sequence.hxx>
31
#include <com/sun/star/uno/Sequence.hxx>
32
#include "global.hxx"		// enum ScSubTotalFunc
32
#include "global.hxx"		// enum ScSubTotalFunc
33
#include "dpcachetable.hxx"
33
#include "dpcachetable.hxx"
34
#include <hash_map>
34
#include <boost/unordered_map.hpp>
35
#include <hash_set>
35
#include <boost/unordered_set.hpp>
36
#include <vector>
36
#include <vector>
37
#include <memory>
37
#include <memory>
38
38
Lines 254-260 Link Here
254
};
254
};
255
255
256
typedef std::vector <ScDPParentDimData *>                 DimMemberArray;
256
typedef std::vector <ScDPParentDimData *>                 DimMemberArray;
257
typedef std::hash_map < SCROW, ScDPParentDimData *, MemberHashIndexFunc>  DimMemberHash;
257
typedef boost::unordered_map < SCROW, ScDPParentDimData *, MemberHashIndexFunc>  DimMemberHash;
258
258
259
class ResultMembers
259
class ResultMembers
260
{
260
{
Lines 723-730 Link Here
723
    {
723
    {
724
        size_t operator()(const ScDPItemData& r) const;
724
        size_t operator()(const ScDPItemData& r) const;
725
    };
725
    };
726
    typedef ::std::hash_set<ScDPItemData, MemberHash> VisibleMemberType;
726
    typedef ::boost::unordered_set<ScDPItemData, MemberHash> VisibleMemberType;
727
    typedef ::std::hash_map<String, VisibleMemberType, ScStringHashCode> DimMemberType;
727
    typedef ::boost::unordered_map<String, VisibleMemberType, ScStringHashCode> DimMemberType;
728
    DimMemberType maDimensions;
728
    DimMemberType maDimensions;
729
729
730
    ScDPSource* mpSource;
730
    ScDPSource* mpSource;
(-)formula/inc/formula/FormulaCompiler.hxx (-3 / +3 lines)
Lines 30-36 Link Here
30
#include <rtl/ustrbuf.hxx>
30
#include <rtl/ustrbuf.hxx>
31
31
32
#include <boost/shared_ptr.hpp>
32
#include <boost/shared_ptr.hpp>
33
#include <hash_map>
33
#include <boost/unordered_map.hpp>
34
34
35
#include <com/sun/star/uno/Sequence.hxx>
35
#include <com/sun/star/uno/Sequence.hxx>
36
36
Lines 72-79 Link Here
72
    }
72
    }
73
};
73
};
74
74
75
typedef ::std::hash_map< String, OpCode, StringHashCode, ::std::equal_to< String > > OpCodeHashMap;
75
typedef ::boost::unordered_map< String, OpCode, StringHashCode, ::std::equal_to< String > > OpCodeHashMap;
76
typedef ::std::hash_map< String, String, StringHashCode, ::std::equal_to< String > > ExternalHashMap;
76
typedef ::boost::unordered_map< String, String, StringHashCode, ::std::equal_to< String > > ExternalHashMap;
77
77
78
class FORMULA_DLLPUBLIC FormulaCompiler
78
class FORMULA_DLLPUBLIC FormulaCompiler
79
{
79
{
(-)desktop/source/deployment/registry/executable/dp_executable.cxx (-1 / +1 lines)
Lines 80-86 Link Here
80
    };
80
    };
81
    friend class ExecutablePackageImpl;
81
    friend class ExecutablePackageImpl;
82
    
82
    
83
    typedef ::std::hash_map< OUString, Reference<XInterface>,
83
    typedef ::boost::unordered_map< OUString, Reference<XInterface>,
84
                             ::rtl::OUStringHash > t_string2object;
84
                             ::rtl::OUStringHash > t_string2object;
85
   
85
   
86
    // PackageRegistryBackend
86
    // PackageRegistryBackend
(-)desktop/source/deployment/registry/dp_registry.cxx (-5 / +5 lines)
Lines 45-53 Link Here
45
#include "com/sun/star/util/XUpdatable.hpp"
45
#include "com/sun/star/util/XUpdatable.hpp"
46
#include "com/sun/star/container/XContentEnumerationAccess.hpp"
46
#include "com/sun/star/container/XContentEnumerationAccess.hpp"
47
#include "com/sun/star/deployment/PackageRegistryBackend.hpp"
47
#include "com/sun/star/deployment/PackageRegistryBackend.hpp"
48
#include <hash_map>
48
#include <boost/unordered_map.hpp>
49
#include <set>
49
#include <set>
50
#include <hash_set>
50
#include <boost/unordered_set.hpp>
51
#include <memory>
51
#include <memory>
52
52
53
using namespace ::dp_misc;
53
using namespace ::dp_misc;
Lines 86-95 Link Here
86
            return str1.equalsIgnoreAsciiCase( str2 );
86
            return str1.equalsIgnoreAsciiCase( str2 );
87
        }
87
        }
88
    };
88
    };
89
    typedef ::std::hash_map<
89
    typedef ::boost::unordered_map<
90
        OUString, Reference<deployment::XPackageRegistry>,
90
        OUString, Reference<deployment::XPackageRegistry>,
91
        ci_string_hash, ci_string_equals > t_string2registry;
91
        ci_string_hash, ci_string_equals > t_string2registry;
92
    typedef ::std::hash_map<
92
    typedef ::boost::unordered_map<
93
        OUString, OUString,
93
        OUString, OUString,
94
        ci_string_hash, ci_string_equals > t_string2string;
94
        ci_string_hash, ci_string_equals > t_string2string;
95
    typedef ::std::set<
95
    typedef ::std::set<
Lines 203-209 Link Here
203
    Reference<deployment::XPackageRegistry> const & xBackend )
203
    Reference<deployment::XPackageRegistry> const & xBackend )
204
{
204
{
205
    m_allBackends.insert( xBackend );
205
    m_allBackends.insert( xBackend );
206
    typedef ::std::hash_set<OUString, ::rtl::OUStringHash> t_stringset;
206
    typedef ::boost::unordered_set<OUString, ::rtl::OUStringHash> t_stringset;
207
    t_stringset ambiguousFilters;
207
    t_stringset ambiguousFilters;
208
    
208
    
209
    const Sequence< Reference<deployment::XPackageTypeInfo> > packageTypes(
209
    const Sequence< Reference<deployment::XPackageTypeInfo> > packageTypes(
(-)desktop/source/deployment/registry/component/dp_component.cxx (-2 / +2 lines)
Lines 50-56 Link Here
50
#include "com/sun/star/ucb/NameClash.hpp"
50
#include "com/sun/star/ucb/NameClash.hpp"
51
#include "com/sun/star/util/XMacroExpander.hpp"
51
#include "com/sun/star/util/XMacroExpander.hpp"
52
#include <list>
52
#include <list>
53
#include <hash_map>
53
#include <boost/unordered_map.hpp>
54
#include <vector>
54
#include <vector>
55
#include <memory>
55
#include <memory>
56
#include <algorithm>
56
#include <algorithm>
Lines 236-242 Link Here
236
    bool m_unorc_modified;
236
    bool m_unorc_modified;
237
    bool bSwitchedRdbFiles;
237
    bool bSwitchedRdbFiles;
238
    
238
    
239
    typedef ::std::hash_map< OUString, Reference<XInterface>,
239
    typedef ::boost::unordered_map< OUString, Reference<XInterface>,
240
                             ::rtl::OUStringHash > t_string2object;
240
                             ::rtl::OUStringHash > t_string2object;
241
    t_string2object m_backendObjects;
241
    t_string2object m_backendObjects;
242
    
242
    
(-)desktop/source/deployment/manager/dp_extensionmanager.cxx (-1 / +1 lines)
Lines 60-66 Link Here
60
#include "boost/bind.hpp"
60
#include "boost/bind.hpp"
61
61
62
#include <list>
62
#include <list>
63
#include <hash_map>
63
#include <boost/unordered_map.hpp>
64
#include <algorithm>
64
#include <algorithm>
65
65
66
namespace deploy = com::sun::star::deployment;
66
namespace deploy = com::sun::star::deployment;
(-)desktop/source/deployment/manager/dp_extensionmanager.hxx (-1 / +1 lines)
Lines 42-48 Link Here
42
42
43
namespace dp_manager {
43
namespace dp_manager {
44
44
45
typedef ::std::hash_map<
45
typedef ::boost::unordered_map<
46
    ::rtl::OUString,
46
    ::rtl::OUString,
47
    ::std::vector<css::uno::Reference<css::deployment::XPackage> >,
47
    ::std::vector<css::uno::Reference<css::deployment::XPackage> >,
48
    ::rtl::OUStringHash > id2extensions;
48
    ::rtl::OUStringHash > id2extensions;
(-)desktop/source/deployment/manager/dp_managerfac.cxx (-1 / +1 lines)
Lines 52-58 Link Here
52
    Reference<deployment::XPackageManager> m_xBundledMgr;
52
    Reference<deployment::XPackageManager> m_xBundledMgr;
53
    Reference<deployment::XPackageManager> m_xTmpMgr;
53
    Reference<deployment::XPackageManager> m_xTmpMgr;
54
    Reference<deployment::XPackageManager> m_xBakMgr;
54
    Reference<deployment::XPackageManager> m_xBakMgr;
55
    typedef ::std::hash_map<
55
    typedef ::boost::unordered_map<
56
        OUString, WeakReference<deployment::XPackageManager>,
56
        OUString, WeakReference<deployment::XPackageManager>,
57
        ::rtl::OUStringHash > t_string2weakref;
57
        ::rtl::OUStringHash > t_string2weakref;
58
    t_string2weakref m_managers;
58
    t_string2weakref m_managers;
(-)desktop/source/deployment/manager/dp_activepackages.cxx (-1 / +1 lines)
Lines 36-42 Link Here
36
#include "rtl/uri.h"
36
#include "rtl/uri.h"
37
#include "rtl/uri.hxx"
37
#include "rtl/uri.hxx"
38
#include "rtl/ustring.hxx"
38
#include "rtl/ustring.hxx"
39
#include <hash_map>
39
#include <boost/unordered_map.hpp>
40
40
41
#include "dp_identifier.hxx"
41
#include "dp_identifier.hxx"
42
#include "dp_persmap.h"
42
#include "dp_persmap.h"
(-)desktop/source/app/app.cxx (-2 / +2 lines)
Lines 161-167 Link Here
161
#include "com/sun/star/deployment/XExtensionManager.hpp"
161
#include "com/sun/star/deployment/XExtensionManager.hpp"
162
#include "com/sun/star/task/XInteractionApprove.hpp"
162
#include "com/sun/star/task/XInteractionApprove.hpp"
163
#include "cppuhelper/compbase3.hxx"
163
#include "cppuhelper/compbase3.hxx"
164
#include <hash_set>
164
#include <boost/unordered_set.hpp>
165
165
166
#if defined MACOSX
166
#if defined MACOSX
167
#include <errno.h>
167
#include <errno.h>
Lines 897-903 Link Here
897
	::css::uno::Reference< ::css::task::XAbortChannel> xAbortChannel;
897
	::css::uno::Reference< ::css::task::XAbortChannel> xAbortChannel;
898
898
899
	// get the list of deployed extensions
899
	// get the list of deployed extensions
900
	typedef std::hash_set< rtl::OUString, ::rtl::OUStringHash> StringSet;
900
	typedef boost::unordered_set< rtl::OUString, ::rtl::OUStringHash> StringSet;
901
	StringSet aExtNameSet;
901
	StringSet aExtNameSet;
902
	css::uno::Sequence< css::uno::Sequence<css::uno::Reference<css::deployment::XPackage> > > xListOfLists = xEM->getAllExtensions( xAbortChannel, xCmdEnv);
902
	css::uno::Sequence< css::uno::Sequence<css::uno::Reference<css::deployment::XPackage> > > xListOfLists = xEM->getAllExtensions( xAbortChannel, xCmdEnv);
903
	const sal_Int32 nLen1 = xListOfLists.getLength();
903
	const sal_Int32 nLen1 = xListOfLists.getLength();
(-)desktop/source/app/dispatchwatcher.hxx (-2 / +2 lines)
Lines 29-35 Link Here
29
#include <com/sun/star/frame/XDispatchResultListener.hpp>
29
#include <com/sun/star/frame/XDispatchResultListener.hpp>
30
30
31
#include "officeipcthread.hxx"
31
#include "officeipcthread.hxx"
32
#include <hash_map>
32
#include <boost/unordered_map.hpp>
33
#include <vector>
33
#include <vector>
34
34
35
namespace desktop
35
namespace desktop
Lines 51-57 Link Here
51
	}
51
	}
52
};
52
};
53
53
54
class DispatchWatcherHashMap : public ::std::hash_map< ::rtl::OUString, sal_Int32, OUStringHashCode, ::std::equal_to< ::rtl::OUString >	>
54
class DispatchWatcherHashMap : public ::boost::unordered_map< ::rtl::OUString, sal_Int32, OUStringHashCode, ::std::equal_to< ::rtl::OUString >	>
55
{
55
{
56
	public:
56
	public:
57
		inline void free()
57
		inline void free()
(-)desktop/source/migration/migration_impl.hxx (-2 / +2 lines)
Lines 26-32 Link Here
26
#include <vector>
26
#include <vector>
27
#include <algorithm>
27
#include <algorithm>
28
#include <memory>
28
#include <memory>
29
#include <hash_map>
29
#include <boost/unordered_map.hpp>
30
30
31
#include "migration.hxx"
31
#include "migration.hxx"
32
32
Lines 133-139 Link Here
133
	::rtl::OUString GetPrevSibling() const { return m_sPrevSibling; }
133
	::rtl::OUString GetPrevSibling() const { return m_sPrevSibling; }
134
};
134
};
135
135
136
typedef ::std::hash_map< ::rtl::OUString, 
136
typedef ::boost::unordered_map< ::rtl::OUString, 
137
						 ::std::vector< MigrationItem >, 
137
						 ::std::vector< MigrationItem >, 
138
						 ::rtl::OUStringHash, 
138
						 ::rtl::OUStringHash, 
139
						 ::std::equal_to< ::rtl::OUString > > MigrationHashMap;
139
						 ::std::equal_to< ::rtl::OUString > > MigrationHashMap;
(-)desktop/win32/source/setup/setup_help.hxx (-1 / +1 lines)
Lines 40-43 Link Here
40
40
41
//--------------------------------------------------------------------------
41
//--------------------------------------------------------------------------
42
42
43
#endif
43
#endif
(-)cppuhelper/source/component_context.cxx (-3 / +3 lines)
Lines 33-39 Link Here
33
#endif
33
#endif
34
34
35
#include <vector>
35
#include <vector>
36
#include <hash_map>
36
#include <boost/unordered_map.hpp>
37
#ifdef CONTEXT_DIAG
37
#ifdef CONTEXT_DIAG
38
#include <map>
38
#include <map>
39
#endif
39
#endif
Lines 59-65 Link Here
59
#include <com/sun/star/beans/XPropertySet.hpp>
59
#include <com/sun/star/beans/XPropertySet.hpp>
60
#include "com/sun/star/uno/RuntimeException.hpp"
60
#include "com/sun/star/uno/RuntimeException.hpp"
61
61
62
#include <hash_map>
62
#include <boost/unordered_map.hpp>
63
#include <memory>
63
#include <memory>
64
64
65
#define SMGR_SINGLETON "/singletons/com.sun.star.lang.theServiceManager"
65
#define SMGR_SINGLETON "/singletons/com.sun.star.lang.theServiceManager"
Lines 358-364 Link Here
358
            , lateInit( lateInit_ )
358
            , lateInit( lateInit_ )
359
            {}
359
            {}
360
    };
360
    };
361
    typedef ::std::hash_map< OUString, ContextEntry * , OUStringHash > t_map;
361
    typedef ::boost::unordered_map< OUString, ContextEntry * , OUStringHash > t_map;
362
    t_map m_map;
362
    t_map m_map;
363
363
364
    Reference< lang::XMultiComponentFactory > m_xSMgr;
364
    Reference< lang::XMultiComponentFactory > m_xSMgr;
(-)cppuhelper/source/interfacecontainer.cxx (-1 / +1 lines)
Lines 31-37 Link Here
31
#include <osl/diagnose.h>
31
#include <osl/diagnose.h>
32
#include <osl/mutex.hxx>
32
#include <osl/mutex.hxx>
33
33
34
#include <hash_map>
34
#include <boost/unordered_map.hpp>
35
35
36
#include <com/sun/star/lang/XEventListener.hpp>
36
#include <com/sun/star/lang/XEventListener.hpp>
37
37

Return to issue 121585