fixed typos

src/rcldb/rclabsfromtext.cpp

@@ -135,7 +135,7 @@ public:
     virtual bool takeword(const std::string& term, int pos, int bts, int bte) {
         LOGDEB1("takeword: [" << term << "] bytepos: "<<bts<<":"<<bte<<endl);
         // Limit time taken with monster documents. The resulting
-        // abstract will be incorrect or inexistant, but this is
+        // abstract will be incorrect or inexistent, but this is
         // better than taking forever (the default cutoff value comes
         // from the snippetMaxPosWalk configuration parameter, and is
         // 10E6)

src/rcldb/rclabstract.cpp

@@ -131,7 +131,7 @@ void Query::Native::setDbWideQTermsFreqs()
 // retrieving the Within Document Frequencies and multiplying by
 // overal term frequency, then using log-based thresholds.
 // 2012: it's not too clear to me why exactly we do the log thresholds thing.
-//  Preferring terms wich are rare either or both in the db and the document 
+//  Preferring terms which are rare either or both in the db and the document 
 //  seems reasonable though
 // To avoid setting a high quality for a low frequency expansion of a
 // common stem, which seems wrong, we group the terms by
@@ -395,7 +395,7 @@ void Query::Native::abstractPopulateQTerm(
 // the neighboring positions marked, populate the neighbours: for each
 // term in the document, walk its position list and populate slots
 // around the query terms. We arbitrarily truncate the list to avoid
-// taking forever. If we do cutoff, the abstract may be inconsistant
+// taking forever. If we do cutoff, the abstract may be inconsistent
 // (missing words, potentially altering meaning), which is bad.
 void Query::Native::abstractPopulateContextTerms(
     Xapian::Database& xrdb,
@@ -524,7 +524,7 @@ int Query::Native::abstractFromIndex(
     // populating the adjacent slots.
     unsigned int maxpos = 0;
 
-    // Total number of occurences for all terms. We stop when we have too much
+    // Total number of occurrences for all terms. We stop when we have too much
     unsigned int totaloccs = 0;
 
     // First pass to populate the sparse document: we walk the term
@@ -585,7 +585,7 @@ int Query::Native::abstractFromIndex(
     LOGABS("makeAbstract:" << chron.millis() <<
            "mS:chosen number of positions " << totaloccs << "\n");
 
-    // This can happen if there are term occurences in the keywords
+    // This can happen if there are term occurrences in the keywords
     // etc. but not elsewhere ?
     if (totaloccs == 0) {
         LOGDEB("makeAbstract: no occurrences\n");
@@ -615,7 +615,7 @@ int Query::Native::abstractFromIndex(
 // query terms.  This can either uses the index position lists, or the
 // stored document text, with very different implementations.
 //
-// DatabaseModified and other general exceptions are catched and
+// DatabaseModified and other general exceptions are caught and
 // possibly retried by our caller.
 //
 // @param[out] vabs the abstract is returned as a vector of snippets.

src/rcldb/rcldb.h

@@ -596,7 +596,7 @@ private:
 
     bool getDoc(const std::string& udi, int idxi, Doc& doc);
 
-    /* Copyconst and assignement private and forbidden */
+    /* Copyconst and assignment private and forbidden */
     Db(const Db &) {}
     Db& operator=(const Db &) {return *this;};
 };

src/rcldb/rcldb_p.h

@@ -37,7 +37,7 @@ class Query;
 
 #ifdef IDX_THREADS
 // Task for the index update thread. This can be 
-//  - add/update for a new / update documment
+//  - add/update for a new / update document
 //  - delete for a deleted document
 //  - purgeOrphans when a multidoc file is updated during a partial pass (no 
 //    general purge). We want to remove subDocs that possibly don't

src/rcldb/searchdata.h

@@ -62,7 +62,7 @@ class SearchDataClauseDist;
 
     The content of each clause when added may not be fully parsed yet
     (may come directly from a gui field). It will be parsed and may be
-    translated to several queries in the Xapian sense, for exemple
+    translated to several queries in the Xapian sense, for example
     several terms and phrases as would result from 
     ["this is a phrase"  term1 term2] . 
 

src/rcldb/termproc.h

@@ -142,7 +142,7 @@ public:
             // It may happen in some weird cases that the output from
             // unac is empty (if the word actually consisted entirely
             // of diacritics ...)  The consequence is that a phrase
-            // search won't work without addional slack.
+            // search won't work without additional slack.
             return true;
         }