1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
*/
#pragma once
#include <unordered_map>
#include <com/sun/star/uno/Sequence.h>
#include <com/sun/star/beans/PropertyValue.hpp>
#include <vector>
#include <comphelper/sequenceashashmap.hxx>
namespace filter::config {
/** @short represent an item of a FilterCache
instance.
@descr This class is not threadsafe tp perform
operations, which use many instances of
this class! Synchronizations must be done outside.
*/
class CacheItem : public ::comphelper::SequenceAsHashMap
{
public:
/** @short creates an empty item.
*/
CacheItem();
/** @short update only properties, which are given by the
specified rItem.
@descr Update means: - add new properties
- change existing values
@param rUpdateItem
another cache item, which contains some special
properties, which should by used for updating
this one.
*/
void update(const CacheItem& rUpdateItem);
/** @short check, if the given properties exist
at this item.
@descr All properties are compared in its minimum.
E.g: string lists => only the requested items
are checked. Additional existing items are ignored.
@param lProps
contains all properties, which must exist at this item.
@return sal_True if all given properties exists
at this item; sal_False otherwise.
*/
bool haveProps(const CacheItem& lProps) const;
/** @short check, if the given properties don't exist
at this item.
@descr All properties are compared in its minimum.
E.g: string lists => only the requested items
are checked. Additional existing items are ignored.
@param lProps
contains all properties, which should not exist at this item.
@return sal_False if at least on property exists at this item(!);
sal_True otherwise.
*/
bool dontHaveProps(const CacheItem& lProps) const;
/** @short because we know two UIName properties
(a list with all locales and the value
for the current locale only), we must be sure
that the correspond together.
@param sActLocale
must specify the current office locale.
It's needed to address the UIName property inside
the list of possible ones.
*/
void validateUINames(const OUString& sActLocale);
/** @short convert this structure to a seq< PropertyValue >
and ignore all empty properties!
@descr Normally the converter routines of the base class
SequenceAsHashMap do this job already.
But it doesn't provide a "pack" mechanism to
ignore properties with empty (means "void") values.
@return css::uno::Sequence< css::beans::PropertyValue >
as a list of all properties of this cacheitem,
where empty properties was removed.
*/
css::uno::Sequence< css::beans::PropertyValue > getAsPackedPropertyValueList();
};
/** @short represent an item list of a FilterCache
instance.
*/
typedef std::unordered_map< OUString,
CacheItem > CacheItemList;
/** @short supports registration of multiple key to
another string information.
@descr E.g. a list of internal type names can be registered
to an extension. Organization as an hash makes it
faster than searching inside vectors.
On the other side e.g. URLPattern can't be really addressed
by a hash value ... because the use wildcards. But
there we need key-value pairs too, which can't be provided
by a pure vector!
*/
typedef std::unordered_map< OUString,
std::vector<OUString> > CacheItemRegistration;
/** @short is used to collect all matching types of a URL
during type detection.
@descr Every type in this list is combined with an information,
which property matched to the given URL. The user of this
structure can decide then, if a deep detection should be
suppressed e.g. if a URLPattern was used.
*/
struct FlatDetectionInfo
{
// the internal type name
OUString sType;
// this type was found by a matching the URL extension
bool bMatchByExtension;
// this type was found by a matching URL Pattern
bool bMatchByPattern;
// the user selected this type implicit by selecting a corresponding office module
bool bPreselectedByDocumentService;
FlatDetectionInfo();
};
typedef ::std::vector< FlatDetectionInfo > FlatDetection;
} // namespace filter::config
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
