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 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*************************************************************************
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* Copyright 2000, 2010 Oracle and/or its affiliates.
*
* OpenOffice.org - a multi-platform office productivity suite
*
* This file is part of OpenOffice.org.
*
* OpenOffice.org is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License version 3
* only, as published by the Free Software Foundation.
*
* OpenOffice.org is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Lesser General Public License version 3 for more details
* (a copy is included in the LICENSE file that accompanied this code).
*
* You should have received a copy of the GNU Lesser General Public License
* version 3 along with OpenOffice.org. If not, see
* <http://www.openoffice.org/license.html>
* for a copy of the LGPLv3 License.
*
************************************************************************/
#include "property_description.hxx"
#include "forms/form_handler_factory.hxx"
#include "strings.hxx"
#include "xmloff/xmltoken.hxx"
#include "xmloff/xmlnmspe.hxx"
#include <tools/diagnose_ex.h>
#include <tools/debug.hxx>
#include <boost/unordered_map.hpp>
//......................................................................................................................
namespace xmloff { namespace metadata
{
//......................................................................................................................
using namespace ::xmloff::token;
#define FORM_SINGLE_PROPERTY( id, att ) \
PropertyDescription( PROPERTY_##id, XML_NAMESPACE_FORM, att, &FormHandlerFactory::getFormPropertyHandler, PID_##id, NO_GROUP )
//==================================================================================================================
//= property meta data
//==================================================================================================================
//------------------------------------------------------------------------------------------------------------------
namespace
{
const PropertyDescription* lcl_getPropertyMetaData()
{
static const PropertyDescription s_propertyMetaData[] =
{
FORM_SINGLE_PROPERTY( DATE_MIN, XML_MIN_VALUE ),
FORM_SINGLE_PROPERTY( DATE_MAX, XML_MAX_VALUE ),
FORM_SINGLE_PROPERTY( DEFAULT_DATE, XML_VALUE ),
FORM_SINGLE_PROPERTY( DATE, XML_CURRENT_VALUE ),
FORM_SINGLE_PROPERTY( TIME_MIN, XML_MIN_VALUE ),
FORM_SINGLE_PROPERTY( TIME_MAX, XML_MAX_VALUE ),
FORM_SINGLE_PROPERTY( DEFAULT_TIME, XML_VALUE ),
FORM_SINGLE_PROPERTY( TIME, XML_CURRENT_VALUE ),
PropertyDescription()
};
return s_propertyMetaData;
}
}
//------------------------------------------------------------------------------------------------------------------
namespace
{
// TODO: instead of having all of the below static, it should be some per-instance data. This way, the
// approach used here would scale much better.
// That is, if you have multiple "meta data instances", which manage a small, but closed set of properties,
// then looking looking through those multiple instances would probably be faster than searching within
// one big instance, since in this case, every instance can quickly decide whether it is responsible
// for some attribute or property, and otherwise delegate to the next instance.
//..............................................................................................................
typedef ::boost::unordered_map< ::rtl::OUString, const PropertyDescription*, ::rtl::OUStringHash > DescriptionsByName;
//..............................................................................................................
const DescriptionsByName& lcl_getPropertyDescriptions()
{
DBG_TESTSOLARMUTEX();
static DescriptionsByName s_propertyDescriptionsByName;
if ( s_propertyDescriptionsByName.empty() )
{
const PropertyDescription* desc = lcl_getPropertyMetaData();
while ( desc->propertyName.getLength() != 0 )
{
s_propertyDescriptionsByName[ desc->propertyName ] = desc;
++desc;
}
}
return s_propertyDescriptionsByName;
}
//..............................................................................................................
typedef ::std::map< PropertyGroup, PropertyDescriptionList > IndexedPropertyGroups;
//..............................................................................................................
const IndexedPropertyGroups& lcl_getIndexedPropertyGroups()
{
DBG_TESTSOLARMUTEX();
static IndexedPropertyGroups s_indexedPropertyGroups;
if ( s_indexedPropertyGroups.empty() )
{
const PropertyDescription* desc = lcl_getPropertyMetaData();
while ( desc->propertyName.getLength() != 0 )
{
if ( desc->propertyGroup != NO_GROUP )
s_indexedPropertyGroups[ desc->propertyGroup ].push_back( desc );
++desc;
}
}
return s_indexedPropertyGroups;
}
//..............................................................................................................
typedef ::boost::unordered_map< ::rtl::OUString, XMLTokenEnum, ::rtl::OUStringHash > ReverseTokenLookup;
//..............................................................................................................
const ReverseTokenLookup& getReverseTokenLookup()
{
DBG_TESTSOLARMUTEX();
static ReverseTokenLookup s_reverseTokenLookup;
if ( s_reverseTokenLookup.empty() )
{
const PropertyDescription* desc = lcl_getPropertyMetaData();
while ( desc->propertyName.getLength() != 0 )
{
s_reverseTokenLookup[ token::GetXMLToken( desc->attribute.attributeToken ) ] = desc->attribute.attributeToken;
++desc;
}
}
return s_reverseTokenLookup;
}
//..............................................................................................................
struct AttributeHash : public ::std::unary_function< AttributeDescription, size_t >
{
size_t operator()( const AttributeDescription& i_attribute ) const
{
return size_t( i_attribute.attributeToken * 100 ) + size_t( i_attribute.namespacePrefix );
}
};
//..............................................................................................................
typedef ::boost::unordered_multimap< AttributeDescription, PropertyGroup, AttributeHash > AttributeGroups;
//..............................................................................................................
const AttributeGroups& lcl_getAttributeGroups()
{
DBG_TESTSOLARMUTEX();
static AttributeGroups s_attributeGroups;
if ( s_attributeGroups.empty() )
{
const PropertyDescription* desc = lcl_getPropertyMetaData();
while ( desc->propertyName.getLength() != 0 )
{
if ( desc->propertyGroup != NO_GROUP )
s_attributeGroups.insert( AttributeGroups::value_type( desc->attribute, desc->propertyGroup ) );
++desc;
}
}
return s_attributeGroups;
}
//..............................................................................................................
typedef ::boost::unordered_map< AttributeDescription, PropertyGroups, AttributeHash > AttributesWithoutGroup;
//..............................................................................................................
const AttributesWithoutGroup& lcl_getAttributesWithoutGroups()
{
DBG_TESTSOLARMUTEX();
static AttributesWithoutGroup s_attributesWithoutGroup;
if ( s_attributesWithoutGroup.empty() )
{
const PropertyDescription* desc = lcl_getPropertyMetaData();
while ( desc->propertyName.getLength() != 0 )
{
if ( desc->propertyGroup == NO_GROUP )
{
PropertyDescriptionList singleElementList;
singleElementList.push_back( desc );
s_attributesWithoutGroup[ desc->attribute ].push_back( singleElementList );
}
++desc;
}
}
return s_attributesWithoutGroup;
}
}
//------------------------------------------------------------------------------------------------------------------
const PropertyDescription* getPropertyDescription( const ::rtl::OUString& i_propertyName )
{
const DescriptionsByName& rAllDescriptions( lcl_getPropertyDescriptions() );
DescriptionsByName::const_iterator pos = rAllDescriptions.find( i_propertyName );
if ( pos != rAllDescriptions.end() )
return pos->second;
return NULL;
}
//------------------------------------------------------------------------------------------------------------------
void getPropertyGroup( const PropertyGroup i_propertyGroup, PropertyDescriptionList& o_propertyDescriptions )
{
OSL_ENSURE( i_propertyGroup != NO_GROUP, "xmloff::metadata::getPropertyGroup: illegal group!" );
const IndexedPropertyGroups& rPropertyGroups( lcl_getIndexedPropertyGroups() );
const IndexedPropertyGroups::const_iterator pos = rPropertyGroups.find( i_propertyGroup );
if ( pos != rPropertyGroups.end() )
o_propertyDescriptions = pos->second;
}
//------------------------------------------------------------------------------------------------------------------
void getPropertyGroupList( const AttributeDescription& i_attribute, PropertyGroups& o_propertyGroups )
{
const AttributeGroups& rAttributeGroups = lcl_getAttributeGroups();
::std::pair< AttributeGroups::const_iterator, AttributeGroups::const_iterator >
range = rAttributeGroups.equal_range( i_attribute );
if ( range.first == range.second )
{
// the attribute is not used for any non-trivial group, which means it is mapped directly to
// a single property
const AttributesWithoutGroup& attributesWithoutGroups( lcl_getAttributesWithoutGroups() );
const AttributesWithoutGroup::const_iterator pos = attributesWithoutGroups.find( i_attribute );
if ( pos != attributesWithoutGroups.end() )
o_propertyGroups = pos->second;
}
else
{
const IndexedPropertyGroups& rPropertyGroups = lcl_getIndexedPropertyGroups();
for ( AttributeGroups::const_iterator group = range.first; group != range.second; ++group )
{
const PropertyGroup propGroup = group->second;
const IndexedPropertyGroups::const_iterator groupPos = rPropertyGroups.find( propGroup );
ENSURE_OR_CONTINUE( groupPos != rPropertyGroups.end(), "getPropertyGroupList: inconsistency!" );
o_propertyGroups.push_back( groupPos->second );
}
}
}
//------------------------------------------------------------------------------------------------------------------
AttributeDescription getAttributeDescription( const sal_uInt16 i_namespacePrefix, const ::rtl::OUString& i_attributeName )
{
AttributeDescription attribute;
const ReverseTokenLookup& rTokenLookup( getReverseTokenLookup() );
const ReverseTokenLookup::const_iterator pos = rTokenLookup.find( i_attributeName );
if ( pos != rTokenLookup.end() )
{
attribute.namespacePrefix = i_namespacePrefix;
attribute.attributeToken = pos->second;
}
return attribute;
}
//......................................................................................................................
} } // namespace xmloff::metadata
//......................................................................................................................
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|