![\"01-prj\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/01-prj1.png\")
<\/a><\/li>\n<\/a><\/li>\n<\/a><\/li>\n<\/a><\/li>\n<\/a><\/li>\n#include <gtest\/gtest.h>\r\n#include <stdio.h>\r\n#include <memory.h>\r\n\r\ntemplate <class _Element> class Queue\r\n{\r\nprivate:\r\n\u00a0\u00a0\u00a0 _Element *m_pData = nullptr;\r\n\u00a0\u00a0\u00a0 int m_ReadOffset = 0, m_WriteOffset = 0, m_Allocated = 0;\r\n\u00a0\u00a0 \u00a0\r\npublic:\r\n\u00a0\u00a0\u00a0 Queue(int reservedCount = 4)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (reservedCount)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Allocated = reservedCount;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_pData = (_Element *)malloc(reservedCount * sizeof(_Element));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 ~Queue()\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (m_pData)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 free(m_pData);\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 int GetCount()\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return m_WriteOffset - m_ReadOffset;\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 void Enqueue(const _Element *pElement)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (GetCount() >= m_Allocated)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Allocated *= 2;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_pData = (_Element *)realloc(m_pData, m_Allocated * sizeof(_Element));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (m_ReadOffset)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int base = m_ReadOffset;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 memmove(m_pData, m_pData + base, (m_Allocated - base) * sizeof(_Element));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_ReadOffset -= base;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_WriteOffset -= base;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_pData[m_WriteOffset++] = *pElement;\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 bool Dequeue(_Element *pElement)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (m_ReadOffset >= m_WriteOffset)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return false;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 *pElement = m_pData[m_ReadOffset++];\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 return true;\r\n\u00a0\u00a0\u00a0 }\r\n};<\/pre>\nThen add a basic test that will enqueue 3 elements and then dequeue them:<\/p>\n
TEST(QueueTests, BasicTest)\r\n{\r\n\u00a0\u00a0\u00a0 Queue<int> queue;\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < 3; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 queue.Enqueue(&i);\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < 3; i++)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int tmp;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_TRUE(queue.Dequeue(&tmp));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_EQ(i, tmp);\r\n\u00a0\u00a0\u00a0 }\r\n}<\/pre>\n![\"06-basic\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/06-basic.png\")
<\/a><\/li>\n- Now you can use the Test Explorer window to run the test and verify that it succeeds:
![\"t1\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/t1.png\")
<\/a><\/li>\n- The fact that the test succeeded means that the scenarios covered by the test work as expected, however it doesn’t indicate how much of the programs’ code was actually tested. Code coverage reports fill this gap by providing detailed statistics on functions, blocks and lines executed during the test run. Open VisualGDB Project Properties, go to the Code Coverage page and enable the “Build code coverage reports” checkbox. VisualGDB will suggest automatically enabling code coverage instrumentation:
![\"07-coverage\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/07-coverage.png\")
<\/a><\/li>\n- Instrumenting your program for code coverage will add significant run-time overhead, making your program slower than the non-instrumented version. You can then temporarily disable it via Visual Studio Project Properties -> Instrumentation -> Generate Code Coverage Reports (the option in VisualGDB Project Properties will stop VisualGDB from downloading and parsing the report files, but won’t disable the instrumentation):
![\"08-cover\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/08-cover.png\")
<\/a>As the instrumentation settings are stored separately for each configuration, you can create a separate configuration via VisualGDB Project Properties and use it solely for checking code coverage so that your regular test performance won’t be affected.<\/li>\n- It is also recommended to disable code coverage instrumentation for the files from the test framework itself. This will slightly improve the performance and remove unnecessary information from the coverage reports. You can do this by selecting those files in Solution Explorer, opening Visual Studio Properties and disabling report generation under Configuration Properties -> C\/C++ -> Instrumentation:
![\"09-nocover\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/09-nocover.png\")
<\/a>Note that the settings under the C\/C++->Instrumentation<\/strong> only affect the compiler (but not the linker). If you are editing global project settings manually, use the Configuration Properties->Instrumentation<\/strong> page instead:![\"10-run\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/10-run.png\")
<\/a><\/li>\n- Run the test again. When it is completed, open the coverage report viewer via Test->VisualGDB Code Coverage Reports:
![\"11-showcover\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/11-showcover.png\")
<\/a><\/li>\n- VisualGDB will display the list of functions along with their invocation count and coverage statistics. It will also highlight the covered lines directly in the source code:
![\"12-report\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/12-report.png\")
<\/a><\/li>\n- Click on the “lines” column to sort the functions by the fraction of covered lines, then enter “file:tests.cpp” in the “filter” field to limit the displayed functions to your main source file:
![\"13-sort\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/13-sort.png\")
<\/a>You can hover the mouse over the ‘filter’ field to view help on supported filter expressions.<\/li>\n- The report will show that the Queue<int>::Enqueue()<\/strong> method has only 45% line. Double-click on it to navigate to its definition in the code:
![\"14-missing\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/14-missing.png\")
<\/a>The coverage report quickly shows that the following branches are not covered:\n\n- The branch checking whether the queue is empty before dequeuing<\/li>\n
- The branch checking whether enough memory is allocated before enqueuing more elements<\/li>\n
- The branch moving the enqueued elements to the beginning of the buffer before adding more (the current implementation is not optimal, but clearly demonstrates 2 different conditions)<\/li>\n<\/ul>\n<\/li>\n
- The easiest branch to cover is the empty queue check. Adjust the test method as follows, build the project and re-run the test:\n
TEST(QueueTests, BasicTest)\r\n{\r\n\u00a0\u00a0\u00a0 Queue<int> queue;\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < 3; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 queue.Enqueue(&i);\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < 4; i++)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int tmp;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 bool done = queue.Dequeue(&tmp);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (i == 3)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_FALSE(done);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 else\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_TRUE(done);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_EQ(i, tmp);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 }\r\n}<\/pre>\n![\"15-empty\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/15-empty.png\")
<\/a><\/li>\n- Covering both reallocation and moving requires interleaving enqueuing and dequeuing operations and increasing the batch sizes. To do this, replace the test code with the following:\n
void EnqueueConsecutive(Queue<int> &queue, int first, int count)\r\n{\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < count; i++)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int tmp = i + first;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 queue.Enqueue(&tmp);\r\n\u00a0\u00a0\u00a0 }\r\n}\r\n\r\nvoid DequeueConsecutive(Queue<int> &queue, int first, int count)\r\n{\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < count; i++)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 int tmp;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_TRUE(queue.Dequeue(&tmp));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 ASSERT_EQ(i + first, tmp);\r\n\u00a0\u00a0\u00a0 }\r\n}\r\n\r\nvoid CheckEndOfQueue(Queue<int> &queue)\r\n{\r\n\u00a0\u00a0\u00a0 int tmp;\r\n\u00a0\u00a0\u00a0 ASSERT_FALSE(queue.Dequeue(&tmp));\r\n}\r\n\r\nTEST(QueueTests, BasicTest)\r\n{\r\n\u00a0\u00a0\u00a0 Queue<int> queue;\r\n\u00a0\u00a0\u00a0 EnqueueConsecutive(queue, 0, 3);\r\n\u00a0\u00a0\u00a0 DequeueConsecutive(queue, 0, 3);\r\n\u00a0\u00a0\u00a0 CheckEndOfQueue(queue);\r\n}<\/pre>\nThen build and run the tests to ensure that all the code is now covered:![\"16-covered\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/16-covered.png\")
<\/a>Note that the test coverage reports always show the coverage for the tests scheduled during a test run. I.e. if you only run 1 test out of 2, the functions checked by the second tests will be shown as not covered.<\/li>\n- Now we will show how VisualGDB manages the coverage reports internally. Open the project folder in Windows Explorer and go to the CoverageReports subdirectory:
![\"17-reports\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/17-reports.png\")
<\/a>Each .scovreport<\/strong> file corresponds to one coverage report from one test run.<\/li>\n- You can delete the old report files either manually, or in the Coverage Report viewer. VisualGDB will also automatically remove the old report files when their amount exceeds the limit specified via global settings:
![\"cleanup\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/cleanup1.png\")
<\/a><\/li>\n- If the coverage reports appear inconsistent, open VisualGDB settings (from Tools->Options) and enable the “Keep raw coverage reports” setting:
![\"19-raw\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/19-raw.png\")
<\/a><\/li>\n- VisualGDB will then keep the original gcov report files downloaded for each session:
![\"20-rawfiles\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/20-rawfiles.png\")
<\/a><\/li>\n- You can check the consistency of the reports by looking at the job.txt<\/strong> and the .gcov<\/strong> files referenced from it:
![\"21-txtfiles\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/21-txtfiles.png\")
<\/a>The job.txt file contains lines starting with “>” that specify the base source directories followed by paths of .gcov files listing line and function coverage (VisualGDB automatically runs the gcov<\/a> tool to generate .gcov files from .gcda and .gcno files). If the .gcov files appear inconsistent, check that you are using a recent version of the compiler.<\/li>\n- Finally we will show how to use the code coverage to quickly spot inconsistencies in the program behavior. We will add a very basic smart pointer class and try to use it with our custom queue:\n
class SmartPointer\r\n{\r\nprivate:\r\n\u00a0\u00a0\u00a0 char *m_Pointer;\r\n\u00a0\u00a0 \u00a0\r\npublic:\r\n\u00a0\u00a0\u00a0 SmartPointer()\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Pointer = nullptr;\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 SmartPointer(const SmartPointer &right)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (right.m_Pointer)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Pointer = strdup(right.m_Pointer);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 else\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Pointer = nullptr;\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 void operator=(const SmartPointer &right)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (m_Pointer)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 free(m_Pointer);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (right.m_Pointer)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Pointer = strdup(right.m_Pointer);\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 else\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Pointer = nullptr;\r\n\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0 \u00a0\r\n\u00a0\u00a0\u00a0 ~SmartPointer()\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (m_Pointer)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 free(m_Pointer);\r\n\u00a0\u00a0\u00a0 }\r\n};\r\n\r\nTEST(QueueTests, SmartPointerTest)\r\n{\r\n\u00a0\u00a0\u00a0 Queue<SmartPointer> queue;\r\n\u00a0\u00a0\u00a0 SmartPointer sp;\r\n\u00a0\u00a0\u00a0 for (int i = 0; i < 10; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 queue.Enqueue(&sp);\r\n}<\/pre>\nIf you run the test now, VisualGDB will trigger an “invalid memory access” error in the assignment operator:![\"22-crash\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/22-crash.png\")
<\/a><\/li>\n- Try commenting it out and run the test again. Note how the code coverage shows 10 invocations of the operator=()<\/strong>, but only one invocation of the constructor:
![\"23-cov\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/23-cov.png\")
<\/a><\/li>\n- As a result, operator=()<\/strong> is trying to free a pointer that was never initialized and contains garbage. You can address this by modifying the Queue() constructor to call the placement new each time it allocated an object, acting similarly to the new[] operator:\n
\u00a0\u00a0\u00a0 Queue(int reservedCount = 4)\r\n\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (reservedCount)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Allocated = reservedCount;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_pData = (_Element *)malloc(reservedCount * sizeof(_Element));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = 0; i < reservedCount; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 new(&m_pData[i]) _Element();\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }\r\n\u00a0\u00a0\u00a0 }<\/pre>\nThe reallocation logic should also contain a call to placement new for each allocated object:<\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 if (GetCount() >= m_Allocated)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 {\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_Allocated *= 2;\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 m_pData = (_Element *)realloc(m_pData, m_Allocated * sizeof(_Element));\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 for (int i = m_Allocated \/ 2; i < m_Allocated; i++)\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 new(&m_pData[i]) _Element();\r\n\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 }<\/pre>\n<\/li>\n- Build and run the project now to see that the tests pass. Note that now the Enqueue() method declaration corresponds to 2 physical methods: Queue<int>::Enqueue()<\/strong> and Queue<SmartPointer>::Enqueue()<\/strong>. VisualGDB can distinguish between them and will show you the detailed statistics once you click on the “2\/2 variants covered” link above the method declaration:
![\"24-popup\"](\"https:\/\/visualgdb.com\/w\/wp-content\/uploads\/2017\/11\/24-popup.png\")
<\/a><\/li>\n<\/ol>\n