      //
      // A bitvector indexed by offset in the read indicating whether this seed is used.
      // This is here to avoid doing a memory allocation in the aligner.
-@@ -257,6 +260,7 @@ private:
+@@ -257,6 +260,8 @@ private:
      unsigned lvScoresAfterBestFound;
      double probabilityOfAllCandidates;
      double probabilityOfBestCandidate;
++	_int64 minHashTableHits[NUM_DIRECTIONS];
 +    double probabilityOfSecondBestCandidate;
      int firstPassSeedsNotSkipped[NUM_DIRECTIONS];
      _int64 smallestSkippedSeed[NUM_DIRECTIONS];

+			  double _probabilityOfSecondBestCandidate,
+			  unsigned _popularSeedsSkipped,
+			  unsigned _popularSeedsSkippedPair,
+			  _int64 _countOfHashTableLookups,
+			  float _hitsPerLookup,
+			  float _hitsPerLookupPair)
+	{

 struct SingleAlignmentResult {
 	AlignmentResult status;
 
@@ -54,6 +116,7 @@ struct SingleAlignmentResult {
     int             score;		// score of each end if matched
 
     int             mapq;		// mapping quality, encoded like a Phred score (but as an integer, not ASCII Phred + 33).
