Method candidates

libyul/optimiser/StackCompressor.cpp:64–76

@returns a map from function name to rematerialisation costs to a vector of variables to rematerialise and variables that occur in their expression. While the map is sorted by cost, the contained vectors are sorted by the order of occurrence.

	/// and variables that occur in their expression.
	/// While the map is sorted by cost, the contained vectors are sorted by the order of occurrence.
	std::map<YulName, std::map<size_t, std::vector<YulName>>> candidates()
	{
		std::map<YulName, std::map<size_t, std::vector<YulName>>> cand;
		for (auto const& [functionName, candidate]: m_candidates)
		{
			if (size_t const* cost = util::valueOrNullptr(m_expressionCodeCost, candidate))
			{
				size_t numRef = m_numReferences[candidate];
				cand[functionName][*cost * numRef].emplace_back(candidate);
			}
		}
		return cand;
	}

	using DataFlowAnalyzer::operator();
	void operator()(FunctionDefinition& _function) override