| /************************************************************** |
| * |
| * 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 |
| * |
| * Unless required by applicable law or agreed to in writing, |
| * software distributed under the License is distributed on an |
| * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| * KIND, either express or implied. See the License for the |
| * specific language governing permissions and limitations |
| * under the 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: */ |
