13   path PP;  in BM_PathConstructString()  local
15     PP /= Part;  in BM_PathConstructString()
16   benchmark::DoNotOptimize(PP.native().data());  in BM_PathConstructString()
18     const path P(PP.native());  in BM_PathConstructString()
31   path PP;  in BM_PathConstructCStr()  local
33     PP /= Part;  in BM_PathConstructCStr()
34   benchmark::DoNotOptimize(PP.native().data());  in BM_PathConstructCStr()
36     const path P(PP.native().c_str());  in BM_PathConstructCStr()
49   path PP;  in BM_PathConstructIter()  local
51     PP /= Part;  in BM_PathConstructIter()
52   auto Start = Iter(PP.native().begin());  in BM_PathConstructIter()
53   auto End = Iter(PP.native().end());  in BM_PathConstructIter()
54   benchmark::DoNotOptimize(PP.native().data());  in BM_PathConstructIter()
81   path PP;  in BM_PathIterateMultipleTimes()  local
83     PP /= Part;  in BM_PathIterateMultipleTimes()
84   benchmark::DoNotOptimize(PP.native().data());  in BM_PathIterateMultipleTimes()
86     for (auto const& E : PP) {  in BM_PathIterateMultipleTimes()
101   path PP;  in BM_PathIterateOnce()  local
103     PP /= Part;  in BM_PathIterateOnce()
104   benchmark::DoNotOptimize(PP.native().data());  in BM_PathIterateOnce()
106     const path P = PP.native();  in BM_PathIterateOnce()
121   path PP;  in BM_PathIterateOnceBackwards()  local
123     PP /= Part;  in BM_PathIterateOnceBackwards()
124   benchmark::DoNotOptimize(PP.native().data());  in BM_PathIterateOnceBackwards()
126     const path P = PP.native();  in BM_PathIterateOnceBackwards()