X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2Fchset.C;h=6a5631566d1d5843526d9895da4bbdc86b871118;hb=65ca7003ba47b7348610393a9a0d2d309b4e9702;hp=c912b31149438eab3169440a994c5f9a9af46f54;hpb=1120aa806c16aac6942760f244a1dbbe30c744be;p=lyx.git

diff --git a/src/chset.C b/src/chset.C
index c912b31149..6a5631566d 100644
--- a/src/chset.C
+++ b/src/chset.C
@@ -1,33 +1,50 @@
+/**
+ * \file chset.C
+ * This file is part of LyX, the document processor.
+ * Licence details can be found in the file COPYING.
+ *
+ * \author Lars Gullik Bjønnes
+ * \author Jean-Marc Lasgouttes
+ *
+ * Full author contact details are available in file CREDITS.
+ */
+
 #include <config.h>
 
-#ifdef __GNUG__
-#pragma implementation
-#endif
+#include "chset.h"
 
-#include <fstream>
+#include "debug.h"
 
-#include "chset.h"
+#include "support/convert.h"
 #include "support/filetools.h"
-#include "support/LRegex.h"
-#include "support/LSubstring.h"
-#include "support/lyxlib.h"
-#include "debug.h"
 
-using std::ifstream;
+#include <boost/regex.hpp>
+
+#include <fstream>
+
+using lyx::support::LibFileSearch;
+
+using boost::regex;
+using boost::smatch;
+
+using std::endl;
 using std::getline;
-using std::pair;
 using std::make_pair;
-using std::endl;
+
+using std::ifstream;
+using std::pair;
+using std::string;
+
 
 bool CharacterSet::loadFile(string const & fname)
 {
 	map_.clear();
 	name_.erase();
- 
+
 	// ascii 7-bit
 	if (fname.empty() || fname == "ascii")
 		return true;
-	
+
 	// open definition file
 	lyxerr[Debug::KBMAP]
 		<< "Reading character set file " << fname << ".cdef" << endl;
@@ -38,23 +55,21 @@ bool CharacterSet::loadFile(string const & fname)
 		return true;		// no definition, use 7-bit ascii
 	}
 	name_ = fname;
-	
+
 	string line;
 	// Ok, I'll be the first to admit that this is probably not
 	// the fastest way to parse the cdef files, but I though it
 	// was a bit neat. Anyway it is wrong to use the lyxlex parse
-	// without the use of a keyword table.     
-	LRegex reg("^([12][0-9][0-9])[ \t]+\"([^ ]+)\".*");
+	// without the use of a keyword table.
+	regex reg("^([12][0-9][0-9])[ \t]+\"([^ ]+)\".*");
 	while (getline(ifs, line)) {
-		if (reg.exact_match(line)) {
-			LRegex::SubMatches const & sub = reg.exec(line);
-			int const n = lyx::atoi(line.substr(sub[1].first,
-						  sub[1].second));
-			string const str = LSubstring(line, sub[2].first,
-						      sub[2].second);
+		smatch sub;
+		if (regex_match(line, sub, reg)) {
+			int const n = convert<int>(sub.str(1));
+			string const str = sub.str(2);
 			if (lyxerr.debugging(Debug::KBMAP))
 				lyxerr << "Chardef: " << n
-				       << " to [" << str << "]" << endl;
+				       << " to [" << str << ']' << endl;
 			map_[str] = n;
 		}
 	}
@@ -65,7 +80,7 @@ bool CharacterSet::loadFile(string const & fname)
 
 pair<bool, int> const CharacterSet::encodeString(string const & str) const
 {
-	lyxerr[Debug::KBMAP] << "Checking if we know [" << str << "]" << endl;
+	lyxerr[Debug::KBMAP] << "Checking if we know [" << str << ']' << endl;
 	bool ret = false;
 	int val = 0;
 	Cdef::const_iterator cit = map_.find(str);
@@ -75,7 +90,7 @@ pair<bool, int> const CharacterSet::encodeString(string const & str) const
 	}
 	lyxerr[Debug::KBMAP] << "   "
 			     << (ret ? "yes we" : "no we don't")
-			     <<  " know [" << str << "]" << endl;
+			     <<  " know [" << str << ']' << endl;
 	return make_pair(ret, val);
 }