| 268 | } |
| 269 | |
| 270 | static bool isPrefix(const PathInData::Parts & prefix, const PathInData::Parts & parts) |
| 271 | { |
| 272 | if (prefix.size() > parts.size()) |
| 273 | return false; |
| 274 | |
| 275 | for (size_t i = 0; i < prefix.size(); ++i) |
| 276 | if (prefix[i].key != parts[i].key) |
| 277 | return false; |
| 278 | return true; |
| 279 | } |
| 280 | |
| 281 | /// Returns true if there exists a prefix with matched names, |
| 282 | /// but not matched structure (is Nested, number of dimensions). |
no test coverage detected