Function destroy

Source/Common/Singleton.cpp:63–123

	}

	void destroy(String itemName = Slice::Empty) {
		std::unordered_set<std::string> entries;
		if (itemName.empty()) {
			for (const auto& life : lives) {
				entries.insert(life.first);
			}
			for (const auto& itemRef : itemRefs) {
				entries.insert(itemRef.first);
			}
			for (auto& ref : refs) {
				ref.visited = false;
				auto entry = entries.find(ref.target);
				if (entry != entries.end()) {
					entries.erase(entry);
				}
			}
		} else {
			for (auto& ref : refs) {
				ref.visited = false;
			}
			entries.insert(itemName.toString());
		}
		for (const auto& entry : entries) {
			std::vector<std::string> items;
			std::queue<std::string> refList;
			refList.push(entry);
			while (!refList.empty()) {
				std::string name = refList.front();
				refList.pop();
				items.push_back(name);
				auto it = itemRefs.find(name);
				if (it != itemRefs.end()) {
					for (Reference* ref : *it->second) {
						if (!ref->visited) {
							ref->visited = true;
							refList.push(ref->target);
						}
					}
				}
			}
#if DORA_DEBUG
			std::unordered_set<std::string> names;
			std::vector<std::string> nameList;
			for (auto it = items.rbegin(); it != items.rend(); ++it) {
				if (names.find(*it) == names.end() && lives.find(*it) != lives.end()) {
					names.insert(*it);
					nameList.push_back(*it);
				}
			}
			if (!nameList.empty()) {
				LogInfo(fmt::format("destroy: {}.", std::accumulate(nameList.begin() + 1, nameList.end(), nameList.front(), [](const std::string& a, const std::string& b) {
					return a + ", " + b;
				})));
			}
#endif // DORA_DEBUG
			for (auto it = items.rbegin(); it != items.rend(); ++it) {
				lives.erase(*it);
				itemRefs.erase(*it);