return m_nTotalItems;
}
-/**\r
-* @brief Return item taking most time among current items.\r
-*/\r
-const DIFFITEM *CompareStats::GetCurDiffItem()\r
-{\r
- int nHitCountMax = 0;\r
- const DIFFITEM *cdi = m_rgThreadState.front().m_pDiffItem;\r
- std::vector<ThreadState>::iterator it = m_rgThreadState.begin();\r
- while (it != m_rgThreadState.end())\r
- {\r
- const DIFFITEM *di = it->m_pDiffItem;\r
- if (di != NULL && (di->diffcode.diffcode & DIFFCODE::COMPAREFLAGS) == DIFFCODE::NOCMP)\r
- {\r
- int nHitCount = it->m_nHitCount++;\r
- if (nHitCountMax < nHitCount)\r
- {\r
- nHitCountMax = nHitCount;\r
- cdi = di;\r
- }\r
- }\r
- ++it;\r
- }\r
- return cdi;\r
-}\r
+/**
+* @brief Return item taking most time among current items.
+*/
+const DIFFITEM *CompareStats::GetCurDiffItem()
+{
+ int nHitCountMax = 0;
+ const DIFFITEM *cdi = m_rgThreadState.front().m_pDiffItem;
+ std::vector<ThreadState>::iterator it = m_rgThreadState.begin();
+ while (it != m_rgThreadState.end())
+ {
+ const DIFFITEM *di = it->m_pDiffItem;
+ if (di != NULL && (di->diffcode.diffcode & DIFFCODE::COMPAREFLAGS) == DIFFCODE::NOCMP)
+ {
+ int nHitCount = it->m_nHitCount++;
+ if (nHitCountMax < nHitCount)
+ {
+ nHitCountMax = nHitCount;
+ cdi = di;
+ }
+ }
+ ++it;
+ }
+ return cdi;
+}
/**
* @brief Reset comparestats.