+/* This file is part of EdiTeX, an editor of mathematical
+ * expressions based on TeX syntax.
+ *
+ * Copyright (C) 2002-2003 Luca Padovani <lpadovan@cs.unibo.it>,
+ * 2003 Paolo Marinelli <pmarinel@cs.unibo.it>.
+ *
+ * This library is free software; you can redistribute it and/or
+ * modify it under the terms of the GNU Lesser General Public
+ * License as published by the Free Software Foundation; either
+ * version 2.1 of the License, or (at your option) any later version.
+ *
+ * This library 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
+ * Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public
+ * License along with this library; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ *
+ * For more information, please visit the project's home page
+ * http://helm.cs.unibo.it/editex/
+ * or send an email to <lpadovan@cs.unibo.it>
+ */
#include <sstream>
+#include <cassert>
#include "dom.hh"
+#include "config.dirs"
#include "TDictionary.hh"
#include "TTokenizer.hh"
#include "CLoggerConsole.hh"
else return uri;
}
+std::string
+TDictionary::getDefaultDictionaryPath()
+{
+ return PKGDATADIR"/dictionary-tex.xml";
+}
+
void
TDictionary::load(const std::string& uri)
{
if (p != entries.end()) return (*p).second;
else
{
- cerr << "ERROR: unknown entry `" << name << "'" << endl;
+ logger.warning("unknown entry `" + name + "'");
return undefinedEntry;
}
}
+std::string
+TDictionary::complete(const std::string prefix, std::list<std::string>& complete_list) const
+{
+ bool no_match = true;
+ std::string new_prefix = "";
+ for (Dictionary::const_iterator i = entries.begin(); i != entries.end(); i++)
+ {
+ if ((*i).first.find(prefix) == 0)
+ {
+ complete_list.push_front((*i).first);
+ if (no_match)
+ {
+ // it's the first match
+ no_match = false;
+ new_prefix = (*i).first;
+ }
+ else
+ {
+ // in this case, new_prefix has been set yet.
+ std::string s1 = (*i).first.substr(prefix.length()); // s1 is the high part of the matching string
+ std::string s2 = new_prefix.substr(prefix.length()); // s2 is the high part of new_prefix
+#if 0
+ long j = 0; // it's the number of common characters
+ while (s1[j] == s2[j]) j++;
+#endif
+ std::string::const_iterator i1 = s1.begin();
+ std::string::const_iterator i2 = s2.begin();
+ while (i1 != s1.end() && i2 != s2.end() && *i1 == *i2) i1++, i2++;
+ new_prefix = prefix + s1.substr(0, i1 - s1.begin());
+ //new_prefix = (j) ? prefix + s1.substr(0, i1 - s1.begin()) : prefix;
+ }
+ }
+ }
+
+ return new_prefix;
+}
+
bool
TDictionary::Entry::paramDelimited(unsigned i) const
{