2 * CDE - Common Desktop Environment
4 * Copyright (c) 1993-2012, The Open Group. All rights reserved.
6 * These libraries and programs are free software; you can
7 * redistribute them and/or modify them under the terms of the GNU
8 * Lesser General Public License as published by the Free Software
9 * Foundation; either version 2 of the License, or (at your option)
12 * These libraries and programs are distributed in the hope that
13 * they will be useful, but WITHOUT ANY WARRANTY; without even the
14 * implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
15 * PURPOSE. See the GNU Lesser General Public License for more
18 * You should have received a copy of the GNU Lesser General Public
19 * License along with these libraries and programs; if not, write
20 * to the Free Software Foundation, Inc., 51 Franklin Street, Fifth
21 * Floor, Boston, MA 02110-1301 USA
23 /* $XConsortium: RangeMap.h /main/1 1996/07/29 17:02:22 cde-hp $ */
24 // Copyright (c) 1994 James Clark
25 // See the file COPYING for copying permission.
27 #ifndef RangeMap_INCLUDED
28 #define RangeMap_INCLUDED 1
37 namespace SP_NAMESPACE {
40 template<class From, class To>
41 struct RangeMapRange {
49 template<class From, class To> class RangeMapIter;
51 template<class From, class To>
55 Boolean map(From, To &, From &alsoMax) const;
56 // Return 0 for no matches, 1 for 1, 2 for more than 1.
57 unsigned inverseMap(To, From &, ISet<WideChar> &, WideChar &count) const;
58 void addRange(From, From, To);
60 Vector<RangeMapRange<From,To> > ranges_;
61 friend class RangeMapIter<From,To>;
64 template<class From, class To>
67 RangeMapIter(const RangeMap<From,To> &map);
68 Boolean next(From &fromMin, From &fromMax, To &toMin) {
72 fromMin = ptr_->fromMin;
73 fromMax = ptr_->fromMax;
82 const RangeMapRange<From,To> *ptr_;
83 // Vector<RangeMapRange<From,To> >::const_iterator ptr_;
90 #endif /* not RangeMap_INCLUDED */
92 #ifdef SP_DEFINE_TEMPLATES