Fix mass search&replace error in comments (as int32_t as --> as long as)

HttpServer.cpp

@@ -1492,7 +1492,7 @@ static void getMsgPieceWrapper(int fd, void *state) {
 			log(LOG_LOGIC,"http: getMsgPiece returned -1.");
 			return;
 		}
-		// keep reading more from file and sending it as int32_t as file didn't
+		// keep reading more from file and sending it as long as file didn't
 		// block
 	}
 }
@@ -1519,7 +1519,7 @@ static void getSSLMsgPieceWrapper(int fd, void *state) {
 		// . g_errno may be set in which case TcpServer::writeSocketWrapper()
 		//   will destroy s and call s's callback, cleanUp()
 		g_loop.callCallbacks_ass ( false /*for reading?*/, sd );
-		// keep reading more from file and sending it as int32_t as file didn't
+		// keep reading more from file and sending it as long as file didn't
 		// block
 	}
 }

Msg40.cpp

@@ -203,7 +203,7 @@ bool Msg40::getResults ( SearchInput *si      ,
 	// . this allows Msg3a to allow higher scoring docids in tier #1 to
 	//   outrank lower-scoring docids in tier #0, even if such docids have
 	//   all the query terms explicitly. and we can guarantee consistency
-	//   as int32_t as we only allow for this outranking within the first
+	//   as long as we only allow for this outranking within the first
 	//   MIN_DOCS_TO_GET docids.
 	if ( get < MIN_DOCS_TO_GET ) get = MIN_DOCS_TO_GET;
 	// this is how many docids to get total, assuming that some will be

RdbMap.cpp

@@ -926,7 +926,7 @@ int64_t RdbMap::getAbsoluteOffset(int32_t page) const {
 int64_t RdbMap::getNextAbsoluteOffset(int32_t page) const {
 	// advance to next page
 	page++;
-	// inc page as int32_t as we need to
+	// inc page as long as we need to
 	while ( page < m_numPages && getOffset(page) == -1 ) page++;
 	// . if we hit eof then return m_offset
 	// . otherwise, we hit another key

Sections.cpp

@@ -1879,7 +1879,7 @@ bool Sections::addSentenceSections ( ) {
 				// ry/buffalo-ny-usa/places-to-go/tourist-stops
 				// like <a><b>...</div> with no ending </a> or
 				// </b> tags then we have to get the parent
-				// of the parent as int32_t as its m_b is the
+				// of the parent as long as its m_b is the
 				// same and check that before advancing addb
 				// otherwise we can miss the parent section
 				// that we want! (this is because the kid

Spider.cpp

@@ -3578,7 +3578,7 @@ checkNextRule:
 			if ( plen == 0 ) 
 				continue;
 			int32_t m = 1;
-			// check to see if we matched if url was int32_t enough
+			// check to see if we matched if url was long enough
 			if ( urlLen >= plen )
 				m = strncmp(pstart,url,plen);
 			if ( ( m == 0 && val == 0 ) ||
@@ -3620,7 +3620,7 @@ checkNextRule:
 			// . url has to be at least as big
 			// . match our tail
 			int32_t m = 1;
-			// check to see if we matched if url was int32_t enough
+			// check to see if we matched if url was long enough
 			if ( urlLen >= plen )
 				m = strncmp(pstart,url+urlLen-plen,plen);
 			if ( ( m == 0 && val == 0 ) ||

SpiderColl.cpp

@@ -1017,7 +1017,7 @@ bool SpiderColl::addSpiderRequest ( SpiderRequest *sreq , int64_t nowGlobalMS )
 	// once in waiting tree, we will scan waiting tree and then lookup
 	// each firstIp in waiting tree in spiderdb to get the best
 	// SpiderRequest for that firstIp, then we can add it to doledb
-	// as int32_t as it can be spidered now
+	// as long as it can be spidered now
 	//bool status = addToWaitingTree ( spiderTimeMS,sreq->m_firstIp,true);
 	bool added = addToWaitingTree ( 0 , sreq->m_firstIp , true );
 

Summary.cpp

@@ -669,7 +669,7 @@ int64_t Summary::getBestWindow ( Matches *matches, int32_t mm, int32_t *lasta,
 	bool goodStart = false;
 	int32_t wordCount = 0;
 
-	// . decrease "a" as int32_t as we stay within maxNumCharsPerLine
+	// . decrease "a" as long as we stay within maxNumCharsPerLine
 	// . avoid duplicating windows by using "lasta", the last "a" of the
 	//   previous call to getBestWindow(). This can happen if our last
 	//   central query term was close to this one.
@@ -808,7 +808,7 @@ int64_t Summary::getBestWindow ( Matches *matches, int32_t mm, int32_t *lasta,
 
 	// . the match at the center of the window is match #"mm", so that
 	//   matches->m_matches[mm] is the Match class
-	// . set "mi" to it and back up "mi" as int32_t as >= a
+	// . set "mi" to it and back up "mi" as long as >= a
 	for ( mi = mm ; mi > 0 && matches->getMatch(mi-1).m_wordNum >=a ; mi-- )
 		;
 

XmlDoc.cpp

@@ -21270,7 +21270,7 @@ char *XmlDoc::getFragVec ( ) {
 		if ( j == k ) { g_process.shutdownAbort(true); }
 		// skip to next in chain to check later
 		if ( ++n >= nb ) n = 0;
-		// keep advancing k and j as int32_t as the words match
+		// keep advancing k and j as long as the words match
 	matchLoop:
 		// get next wid for k and j
 		while ( k < nw && ! wids[k] ) k++;

XmlNode.cpp

@@ -264,7 +264,7 @@ int32_t XmlNode::set( char *node, bool pureXml ) {
 		m_hash       = 0;
 		int32_t i = 0;
 
-		// inc i as int32_t as it's NOT the beginning of a tag
+		// inc i as long as it's NOT the beginning of a tag
 		while ( node[i] && ( node[i] != '<' || !isTagStart( node + i ) ) ) {
 			++i;
 		}