X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=src%2Fchset.C;h=e97330e2ff656542af8955fa7b42a7e54dca04d1;hb=33243f70037b067f90d1574b74b34f90a2ef2aa1;hp=a2a716191581d08b0d7ac35a9507985e274690be;hpb=6396f9a204bfa7a154729dfaa17dc7abc619f7d0;p=lyx.git

diff --git a/src/chset.C b/src/chset.C
index a2a7161915..e97330e2ff 100644
--- a/src/chset.C
+++ b/src/chset.C
@@ -1,32 +1,51 @@
+/**
+ * \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/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::atoi;
+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();
-	
-	if (fname.empty() || fname == "ascii") 
-		return true;	// ascii 7-bit
-	
+
+	// ascii 7-bit
+	if (fname.empty() || fname == "ascii")
+		return true;
+
 	// open definition file
 	lyxerr[Debug::KBMAP]
 		<< "Reading character set file " << fname << ".cdef" << endl;
@@ -37,23 +56,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]+\"([^ ]+)\".*");
-	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);
+	// without the use of a keyword table.
+	regex reg("^([12][0-9][0-9])[ \t]+\"([^ ]+)\".*");
+	while (getline(ifs, line)) {
+		smatch sub;
+		if (regex_match(line, sub, reg)) {
+			int const n = atoi(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;
 		}
 	}
@@ -64,7 +81,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);
@@ -74,7 +91,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);
 }