1 /************************************************************************* 2 * 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * Copyright 2000, 2010 Oracle and/or its affiliates. 6 * 7 * OpenOffice.org - a multi-platform office productivity suite 8 * 9 * This file is part of OpenOffice.org. 10 * 11 * OpenOffice.org is free software: you can redistribute it and/or modify 12 * it under the terms of the GNU Lesser General Public License version 3 13 * only, as published by the Free Software Foundation. 14 * 15 * OpenOffice.org is distributed in the hope that it will be useful, 16 * but WITHOUT ANY WARRANTY; without even the implied warranty of 17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 18 * GNU Lesser General Public License version 3 for more details 19 * (a copy is included in the LICENSE file that accompanied this code). 20 * 21 * You should have received a copy of the GNU Lesser General Public License 22 * version 3 along with OpenOffice.org. If not, see 23 * <http://www.openoffice.org/license.html> 24 * for a copy of the LGPLv3 License. 25 * 26 ************************************************************************/ 27 28 #ifndef ARY_CROSS_REFS_HXX 29 #define ARY_CROSS_REFS_HXX 30 31 32 33 // USED SERVICES 34 // BASE CLASSES 35 // COMPONENTS 36 // PARAMETERS 37 #include "sorted_idset.hxx" 38 39 40 template <class VALUE_LIST, class TYPES> 41 class CrossReferences 42 { 43 public: 44 typedef TYPES::element_type element; 45 46 /// Checks for double occurences 47 void Add( 48 VALUE_LIST::index_type 49 i_nPosition 50 const element & i_rElem ); 51 void Get_List( 52 Dyn_StdConstIterator<element> & 53 o_rResult ) const; 54 private: 55 SortedIdSet<TYPES> aData[VALUE_LIST::max]; 56 }; 57 58 59 60 namespace ary 61 { 62 63 template <class TYPES> 64 class SortedIdSet 65 { 66 public: 67 typedef typename TYPES::element_type element; 68 typedef typename TYPES::sort_type sorter; 69 typedef typename TYPES::find_type finder; 70 71 SortedIdSet( 72 const finder & i_rFinder ) 73 : aSorter(i_rFinder), 74 aData(aSorter) {} 75 ~SortedIdSet() {} 76 77 void Get_Begin( 78 Dyn_StdConstIterator<element> & 79 o_rResult ) 80 { o_rResult = new SCI_Set<FINDER>(aData); } 81 void Add( 82 const element & i_rElement ) 83 { aData.insert(i_rElement); } 84 85 private: 86 typedef std::set<element, sorter> Set; 87 88 // DATA 89 sorter aSorter; 90 Set aData; 91 }; 92 93 94 } // namespace ary 95 96 97 98 #endif 99 100