X-Git-Url: http://matita.cs.unibo.it/gitweb/?a=blobdiff_plain;f=helm%2FDEVEL%2Fmathml_editor%2Fsrc%2FTDictionary.hh;h=8807f83772e0e2076a86079b9d1ca12875ea25bc;hb=10372ee288ae67dcab8b1b04f7c52c65009fd6e9;hp=358481ee06728a86b541d9978de261d75cb7ff77;hpb=617c3cf27758b63f35ab21a5d5e67be5aa9f065f;p=helm.git

diff --git a/helm/DEVEL/mathml_editor/src/TDictionary.hh b/helm/DEVEL/mathml_editor/src/TDictionary.hh
index 358481ee0..8807f8377 100644
--- a/helm/DEVEL/mathml_editor/src/TDictionary.hh
+++ b/helm/DEVEL/mathml_editor/src/TDictionary.hh
@@ -1,3 +1,27 @@
+/* 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>
+ */
 
 #ifndef __TDictionary_hh__
 #define __TDictionary_hh__
@@ -7,6 +31,7 @@
 #include <string>
 #include <vector>
 #include <hash_map>
+#include <list>
 
 #include "dom.hh"
 #include "TToken.hh"
@@ -59,10 +84,13 @@ public:
     unsigned table : 1;
   };
 
+  static std::string getDefaultDictionaryPath(void);
+
   void load(const std::string&);
   void load(const std::string&, const std::string&);
   void load(const DOM::Document&, const std::string& = "");
   const Entry& find(const std::string&) const;
+  std::string complete(const std::string, std::list<std::string>&) const;
 
 private:
   struct StringHash : public std::unary_function< std::string, size_t >