diff options
Diffstat (limited to 'sw/source/filter/ww8/hash_wrap.hxx')
-rw-r--r-- | sw/source/filter/ww8/hash_wrap.hxx | 124 |
1 files changed, 124 insertions, 0 deletions
diff --git a/sw/source/filter/ww8/hash_wrap.hxx b/sw/source/filter/ww8/hash_wrap.hxx new file mode 100644 index 000000000000..179ae8f6105b --- /dev/null +++ b/sw/source/filter/ww8/hash_wrap.hxx @@ -0,0 +1,124 @@ +/************************************************************************* + * + * 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. + * + ************************************************************************/ + +/* -*- Mode: C; tab-width: 4; indent-tabs-mode: nil -*- */ + +//this is a shameless rip from sortedarray.hxx but changed to hash_set + +#ifndef WW_HASH_WRAP_HXX +#define WW_HASH_WRAP_HXX + +#include <hash_set> +#include <tools/debug.hxx> +#include <errhdl.hxx> // ASSERT() + +//simple wrapper around hash_set to behave like sorted array +namespace ww +{ + /** simple template that manages a hash + + + @author + <a href="mailto:mikeleib@openoffice.org">Michael Leibowitz</a> + */ + template<class C, class HashFcn = std::hash<C> > class WrappedHash + { + private: + std::hash_set<C, HashFcn> mHashSet; + + //No copying + WrappedHash(const WrappedHash&); + WrappedHash& operator=(const WrappedHash&); + public: + //Find an entry, return its address if found and 0 if not + const C* search(C aSrch) const + { + typename std::hash_set<C, HashFcn>::const_iterator it; + it= mHashSet.find(aSrch); + if (it != mHashSet.end()) + return &(*it); + else + return 0; + } + + WrappedHash(const C *pWwSprmTab, const size_t nNoElems) + { + ASSERT(nNoElems && pWwSprmTab, "WW8: empty Array: Don't do that"); + const C *pIter = pWwSprmTab; + const C *pEnd = pWwSprmTab + nNoElems; + while (pIter < pEnd) + { + mHashSet.insert(*pIter); + pIter++; + } +#if OSL_DEBUG_LEVEL > 1 + bool bBroken=false; + rtl::OUString sError; + pIter = pWwSprmTab; + const C *pBeforeEnd = pWwSprmTab + nNoElems - 1; + while (pIter < pBeforeEnd) + { + if (*pIter == *(pIter+1)) + { + if (!bBroken) + { + sError = rtl::OUString::createFromAscii( + "WW8: Duplicate in list, almost certainly don't " + "want that!\n" + "(You will not see this message again unless you " + "restart)\n" + "Extra entries are...\n"); + bBroken=true; + } + + size_t nSize = sizeof(C); + const sal_uInt8 *pHack = + reinterpret_cast<const sal_uInt8 *>(&(*pIter)); + for (size_t i=0; i < nSize; ++i) + { + sError += rtl::OUString::valueOf( + static_cast<sal_Int32>(pHack[i]), 16); + sError += rtl::OUString::valueOf(sal_Unicode(' ')); + } + sError += rtl::OUString::valueOf(sal_Unicode('\n')); + while (*pIter == *(pIter+1) && pIter < pBeforeEnd) + ++pIter; + } + else + ++pIter; + } + if (bBroken) + { + DBG_ERROR(rtl::OUStringToOString(sError, RTL_TEXTENCODING_ASCII_US)); + } +#endif + } + }; +} +#endif + +/* vi:set tabstop=4 shiftwidth=4 expandtab: */ |