merge stemExpand into termExpand. return term frequencies from there and display in spellW

src/utils/smallut.cpp

@@ -1,5 +1,5 @@
 #ifndef lint
-static char rcsid[] = "@(#$Id: smallut.cpp,v 1.24 2006-12-18 12:06:11 dockes Exp $ (C) 2004 J.F.Dockes";
+static char rcsid[] = "@(#$Id: smallut.cpp,v 1.25 2006-12-19 12:11:21 dockes Exp $ (C) 2004 J.F.Dockes";
 #endif
 /*
  *   This program is free software; you can redistribute it and/or modify
@@ -38,16 +38,6 @@ using namespace std;
 
 #define MIN(A,B) ((A)<(B)?(A):(B))
 
-string stringlistdisp(const list<string>& sl)
-{
-    string s;
-    for (list<string>::const_iterator it = sl.begin(); it!= sl.end(); it++)
-	s += "[" + *it + "] ";
-    if (!s.empty())
-	s.erase(s.length()-1);
-    return s;
-}
-
 int stringicmp(const string & s1, const string& s2) 
 {
     string::const_iterator it1 = s1.begin();

src/utils/smallut.h

@@ -16,7 +16,7 @@
  */
 #ifndef _SMALLUT_H_INCLUDED_
 #define _SMALLUT_H_INCLUDED_
-/* @(#$Id: smallut.h,v 1.24 2006-12-18 12:06:11 dockes Exp $  (C) 2004 J.F.Dockes */
+/* @(#$Id: smallut.h,v 1.25 2006-12-19 12:11:21 dockes Exp $  (C) 2004 J.F.Dockes */
 #include <string>
 #include <list>
 #include <map>
@@ -38,8 +38,6 @@ extern int stringisuffcmp(const string& s1, const string& s2);
 // Compare charset names, removing the more common spelling variations
 extern bool samecharset(const string &cs1, const string &cs2);
 
-extern string stringlistdisp(const list<string>& strs);
-
 /**
  * Parse input string into list of strings. 
  *