34         std::cout << "(attr) type=";  in visit()
35         attr.printMask(std::cout);  in visit()
40                 std::cout << "\n        "  in visit()
48         std::cout << "(style)";  in visit()
50             std::cout << " parent=";  in visit()
52                 std::cout << style.parent.name << " ";  in visit()
56                 std::cout << style.parent.id;  in visit()
61             std::cout << "\n        ";  in visit()
63                 std::cout << entry.key.name.package << ":" << entry.key.name.entry;  in visit()
67                 std::cout << "(" << entry.key.id << ")";  in visit()
70             std::cout << "=" << *entry.value;  in visit()
75         array.print(std::cout);  in visit()
79         plural.print(std::cout);  in visit()
83         styleable.print(std::cout);  in visit()
87         item.print(std::cout);  in visitItem()
91 void Debug::printTable(const std::shared_ptr<ResourceTable>& table) {  in printTable()
92     std::cout << "Package name=" << table->getPackage();  in printTable()
94         std::cout << " id=" << std::hex << table->getPackageId() << std::dec;  in printTable()
96     std::cout << std::endl;  in printTable()
99         std::cout << "  type " << type->type;  in printTable()
101             std::cout << " id=" << std::hex << type->typeId << std::dec;  in printTable()
103         std::cout << " entryCount=" << type->entries.size() << std::endl;  in printTable()
105         std::vector<const ResourceEntry*> sortedEntries;  in printTable()
107             auto iter = std::lower_bound(sortedEntries.begin(), sortedEntries.end(), entry.get(),  in printTable()
117             std::cout << "    spec resource " << id << " " << name;  in printTable()
119                 std::cout << " PUBLIC";  in printTable()
121             std::cout << std::endl;  in printTable()
125                 std::cout << "      (" << value.config << ") ";  in printTable()
127                 std::cout << std::endl;  in printTable()
133 static size_t getNodeIndex(const std::vector<ResourceName>& names, const ResourceName& name) {  in getNodeIndex()
134     auto iter = std::lower_bound(names.begin(), names.end(), name);  in getNodeIndex()
136     return std::distance(names.begin(), iter);  in getNodeIndex()
139 void Debug::printStyleGraph(const std::shared_ptr<ResourceTable>& table,  in printStyleGraph()
141     std::map<ResourceName, std::set<ResourceName>> graph;  in printStyleGraph()
143     std::queue<ResourceName> stylesToVisit;  in printStyleGraph()
147         std::set<ResourceName>& parents = graph[styleName];  in printStyleGraph()
155         std::tie(type, entry) = table->findResource(styleName);  in printStyleGraph()
168     std::vector<ResourceName> names;  in printStyleGraph()
173     std::cout << "digraph styles {\n";  in printStyleGraph()
175         std::cout << "  node_" << getNodeIndex(names, name)  in printStyleGraph()
184             std::cout << "  node_" << styleNodeIndex << " -> "  in printStyleGraph()
189     std::cout << "}" << std::endl;  in printStyleGraph()