From 75007da068aac10fed90fc5234ab2d50deed3e61 Mon Sep 17 00:00:00 2001
From: Fritz Elfert <felfert@to.com>
Date: Thu, 1 Mar 2001 00:22:23 +0000
Subject: Modified icons. Started NLS support. Added kpsion KDE2 application.
 Unified file-headers.

---
 lib/Enum.cc | 94 ++++++++++++++++++++++++++++++++++++-------------------------
 1 file changed, 56 insertions(+), 38 deletions(-)

(limited to 'lib/Enum.cc')

diff --git a/lib/Enum.cc b/lib/Enum.cc
index 8abce8b..74fc2e3 100644
--- a/lib/Enum.cc
+++ b/lib/Enum.cc
@@ -1,57 +1,75 @@
-/*--*-c++-*-------------------------------------------------------------
- *  $Id$
- *---------------------------------------------------------------------*/
-
+/*-*-c++-*-
+ * $Id$
+ *
+ * This file is part of plptools.
+ *
+ *  Copyright (C) 2000 Henner Zeller <hzeller@to.com>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program 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 General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+ *
+ */
 #include "Enum.h"
 
 void EnumBase::i2sMapper::add(long i, const char* s) {
-	stringMap.insert(pair<long, const char* const>(i, s));
+    stringMap.insert(pair<long, const char* const>(i, s));
 }
 
 string EnumBase::i2sMapper::lookup (long i) const {
-	i2s_map_t::const_iterator searchPtr = stringMap.find(i);
+    i2s_map_t::const_iterator searchPtr = stringMap.find(i);
 
-	if (searchPtr == stringMap.end())
-		return "[OUT-OF-RANGE]";
-	/*
-	 * now combine the probably the multiple strings belonging to this
-	 * integer
-	 */
-	string result;
-	for (i = stringMap.count(i); i > 0 ; --i, ++searchPtr) {
-		// this should be the case:
-		assert(searchPtr != stringMap.end());
-		if (result.length() != 0) 
-			result += string(",");
-		result += string(searchPtr->second);
-	}
-	return result;
+    if (searchPtr == stringMap.end())
+	return "[OUT-OF-RANGE]";
+    /*
+    * now combine the probably the multiple strings belonging to this
+    * integer
+    */
+    string result;
+    for (i = stringMap.count(i); i > 0 ; --i, ++searchPtr) {
+	// this should be the case:
+	assert(searchPtr != stringMap.end());
+	if (result.length() != 0)
+	    result += string(",");
+	result += string(searchPtr->second);
+    }
+    return result;
 }
 
 
 long EnumBase::i2sMapper::lookup (const char *s) const {
-	/*
-	 * lookup a specific string.
-	 * Since speed does not matter, we just do an exhaustive
-	 * search.
-	 * Otherwise we would have to maintain another map
-	 * mapping strings to ints .. but its not worth the memory
-	 */
-	i2s_map_t::const_iterator run = stringMap.begin();
-	while (run != stringMap.end() && strcmp(s, run->second)) {
-		++run;
-	}
-	if (run == stringMap.end())
-		return  -1;    // FIXME .. maybe throw an exception ?
-	return run->first;
+    /*
+    * lookup a specific string.
+    * Since speed does not matter, we just do an exhaustive
+    * search.
+    * Otherwise we would have to maintain another map
+    * mapping strings to ints .. but its not worth the memory
+    */
+    i2s_map_t::const_iterator run = stringMap.begin();
+    while (run != stringMap.end() && strcmp(s, run->second)) {
+	++run;
+    }
+    if (run == stringMap.end())
+	return  -1;    // FIXME .. maybe throw an exception ?
+    return run->first;
 }
 
 bool EnumBase::i2sMapper::inRange (long i) const {
-	return (stringMap.find(i) != stringMap.end());
+    return (stringMap.find(i) != stringMap.end());
 }
 
-/* 
+/*
  * Local variables:
- * c-basic-offset: 8
+ * c-basic-offset: 4
  * End:
  */
-- 
cgit v1.2.3