X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2FDEVEL%2Fmathml_editor%2Fsrc%2FTDictionary.cc;h=25f6c9674cc353c5359eea52e67eaa44493ea8da;hb=4167cea65ca58897d1a3dbb81ff95de5074700cc;hp=3cf2334876ded1f66367a302c558675c6c017f51;hpb=387aeebf96181c051b7f527a0901b173cfcdf194;p=helm.git

diff --git a/helm/DEVEL/mathml_editor/src/TDictionary.cc b/helm/DEVEL/mathml_editor/src/TDictionary.cc
index 3cf233487..25f6c9674 100644
--- a/helm/DEVEL/mathml_editor/src/TDictionary.cc
+++ b/helm/DEVEL/mathml_editor/src/TDictionary.cc
@@ -1,26 +1,80 @@
+/* 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"
 
 static TDictionary::Entry undefinedEntry;
 
+static std::string
+getURIBase(const std::string& uri)
+{
+  std::string::size_type slash = uri.rfind('/');
+  if (slash != std::string::npos) return uri.substr(0, slash + 1);
+  else return "";
+}
+
+static std::string
+getURIName(const std::string& uri)
+{
+  std::string::size_type slash = uri.rfind('/');
+  if (slash != std::string::npos) return uri.substr(slash + 1, uri.size());
+  else return uri;
+}
+
+std::string
+TDictionary::getDefaultDictionaryPath()
+{
+  return PKGDATADIR"/dictionary-tex.xml";
+}
+
 void
 TDictionary::load(const std::string& uri)
 {
-  logger.debug("Dictionary: loading `" + uri + "'");
+  load(getURIName(uri), getURIBase(uri));
+}
+
+void
+TDictionary::load(const std::string& name, const std::string& base)
+{
+  logger.debug("Dictionary: loading `" + base + name + "'");
 
   DOM::DOMImplementation di;
-  DOM::Document doc = di.createDocumentFromURI(uri.c_str());
+  DOM::Document doc = di.createDocumentFromURI((base + name).c_str());
   assert(doc);
-  load(doc);
+  load(doc, base);
 }
 
 void
-TDictionary::load(const DOM::Document& doc)
+TDictionary::load(const DOM::Document& doc, const std::string& base)
 {
   assert(doc);
 
@@ -36,8 +90,14 @@ TDictionary::load(const DOM::Document& doc)
 	DOM::Element el = p;
 	assert(el);
 	if (el.hasAttribute("href"))
-	  // WARNING: this may result into an infinite loop!
-	  load(std::string(el.getAttribute("href")));
+	  {
+	    // WARNING: this may result into an infinite loop!
+	    std::string href = el.getAttribute("href");
+	    std::string newBase = getURIBase(href);
+	    std::string newName = getURIName(href);
+	    if (newBase != "") load(newName, newBase);
+	    else load(newName, base);
+	  }
 	else
 	  logger.warning("Dictionary: include statement with no href attribute (ignored)");
       }
@@ -174,11 +234,48 @@ TDictionary::find(const std::string& name) const
   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
 {