1 files changed, 0 insertions, 54 deletions
diff --git a/tools/mail-scan.c b/tools/mail-scan.c
index 058caed..3100ab6 100644
--- a/tools/mail-scan.c
+++ b/tools/mail-scan.c
@@ -61,49 +61,6 @@ const int sa_good(0);
 const int sa_spam(1);
 const int sa_usage(64);
 
-/////////////////////////////////////////////////////////
-// Case insensitive comparison of strings
-
-class lessthan_foldcase{
-public:
-  bool operator() (const std::string& a, const std::string& b) const {
-    size_t a_len = a.length();
-    size_t b_len = b.length();
-
-    size_t lim = a_len < b_len ? a_len : b_len;
-
-    for (size_t i=0; i<lim; ++i)
-    {
-            char cha = toupper(a[i]);
-            char chb = toupper(b[i]);
-
-            if (cha < chb) return true;
-            if (cha > chb) return false;
-    }
-    // here if one is an extension of the other
-    if ( a_len < b_len ) return true;
-    return false;
-  }
-};
-
-
-// Returns negative if a is less than b in alphabetical order
-// returns 0 if they are the same, or positive if a is greater.
-// Like perl cmp operator, but ignores case.
-int cmp_casefold(const std::string& a, const std::string& b) {
-  string::const_iterator aa, bb;
-  aa = a.begin();
-  bb = b.begin();
-  while (aa != a.end() && bb != b.end()){
-    char ca = tolower(*aa++);
-    char cb = tolower(*bb++);
-    if (ca != cb) return ca < cb ? -2 : 2;
-  }
-  if (aa != a.end()) return 1;          // a is longer
-  if (bb != b.end()) return -1;         // b is longer
-  return 0;
-}
-
 void exeunt(const int sts){
   if (sts == sa_good) exit(sts);
 
@@ -158,17 +115,6 @@ public:
   }
 };
 
-string noCR(const string bar){
-  string foo(bar);
-  int len = foo.length();
-  if (len){
-    if (foo[len-1] == '\r') {
-      foo.erase(len-1);
-    }
-  }
-  return foo;
-}
-
 ////////////////////////////////////////////////////////////
 int main(int _argc, const char** _argv){
 ////  pid_t pid = getpid();