Lines Matching defs:subtree

342     const dbus::utility::MapperGetSubTreeResponse& subtree)
354 object : subtree)
1379 const dbus::utility::MapperGetSubTreeResponse& subtree)
1388 if (subtree.empty())
1401 subtree, path, service))
1410 if (subtree[0].first.empty() || subtree[0].second.size() != 1)
1417 path = subtree[0].first;
1418 service = subtree[0].second.begin()->first;
1477 const dbus::utility::MapperGetSubTreeResponse& subtree)
1485 if (subtree.empty())
1498 subtree, path, serv))
1509 if (subtree[0].first.empty() || subtree[0].second.size() != 1)
1516 path = subtree[0].first;
1517 serv = subtree[0].second.begin()->first;
1779 const dbus::utility::MapperGetSubTreeResponse& subtree) {
1786 if (subtree.empty())
1794 if (subtree.size() > 1)
1800 if (subtree[0].first.empty() || subtree[0].second.size() != 1)
1807 const std::string& path = subtree[0].first;
1808 const std::string& service = subtree[0].second.begin()->first;
2173 const dbus::utility::MapperGetSubTreeResponse& subtree) {
2182 if (subtree.empty())
2188 if (subtree.size() > 1)
2194 subtree.size());
2198 if ((subtree[0].first.empty()) || (subtree[0].second.size() != 1))
2204 const std::string& path = subtree[0].first;
2205 const std::string& service = subtree[0].second.begin()->first;
2303 const dbus::utility::MapperGetSubTreeResponse& subtree) {
2312 if (subtree.empty())
2319 if (subtree.size() > 1)
2325 subtree.size());
2329 if ((subtree[0].first.empty()) || (subtree[0].second.size() != 1))
2335 const std::string& path = subtree[0].first;
2336 const std::string& service = subtree[0].second.begin()->first;
2608 const dbus::utility::MapperGetSubTreeResponse& subtree) {
2617 if (subtree.empty())
2624 if (subtree.size() > 1)
2630 subtree.size());
2634 if ((subtree[0].first.empty()) || (subtree[0].second.size() != 1))
2640 const std::string& path = subtree[0].first;
2641 const std::string& service = subtree[0].second.begin()->first;
2708 const dbus::utility::MapperGetSubTreeResponse& subtree) {
2717 if (subtree.empty())
2724 if (subtree.size() > 1)
2730 subtree.size());
2734 if ((subtree[0].first.empty()) || (subtree[0].second.size() != 1))
2740 const std::string& path = subtree[0].first;
2741 const std::string& service = subtree[0].second.begin()->first;