Changeset 8242 for trunk/mgpp/text/UCArray.cpp

Timestamp:

2004-10-08T13:03:36+13:00 (20 years ago)

Author:

kjdon

Message:

added in Partial matching for query terms. Cna type comp* as a query, and it will find all words that begin with comp. This search can be case sensitive or insensitive. Changes made to invf.h/cpp, UCArray.h/cpp, Terms.cpp, GSDLQueryLex.h/cpp, GSDLQueryParser.cpp

File:

• trunk/mgpp/text/UCArray.cpp (modified) (1 diff)

trunk/mgpp/text/UCArray.cpp

@@ -244 +244 @@
 }
 
+// does the first string start with the second?
+bool StartsWith (const UCArray &a1, const UCArray &a2) {
+  unsigned int l1 = a1.size();
+  unsigned int l2 = a2.size();
+  if (l2 > l1) {
+    // if the prefix is longer than the string, it can't start with it
+    return false; 
+  }
+  unsigned int l =l2;
+  UCArray::const_iterator a1Here = a1.begin();
+  UCArray::const_iterator a2Here = a2.begin();
+  
+  while (l--) {
+    if ((*a1Here != *a2Here))
+      return false;
+    ++a1Here;
+    ++a2Here;
+  }
+  return true; // we have successfully matched the whole way
+    
+}
+
+// does the first string start with the second, ignoring case?
+bool StartsWithCasefold(const UCArray &a1, const UCArray &a2) {
+  unsigned int l1 = a1.size();
+  unsigned int l2 = a2.size();
+  if (l2 > l1) {
+    // if the prefix is longer than the string, it can't start with it
+    return false; 
+  }
+  unsigned int l =l2;
+  UCArray::const_iterator a1Here = a1.begin();
+  UCArray::const_iterator a2Here = a2.begin();
+  
+  while (l--) {
+    if (casecharmap[*a1Here] != casecharmap[*a2Here]) 
+      return false;
+    ++a1Here;
+    ++a2Here;
+  }
+  return true; // we have successfully matched the whole way
+    
+}
+
+
 unsigned long PrefixLen (const UCArray &a1, const UCArray &a2) {
   unsigned long l = (a1.size() < a2.size()) ? a1.size() : a2.size();