Class Edge

lib/base/dependencygraph.hpp:37–86

	 * It allows to traverse the graph in both directions, i.e. from parent to child and vice versa.
	 */
	struct Edge
	{
		ConfigObject* parent; // The parent object of the child one.
		ConfigObject* child; // The dependent object of the parent.
		// Counter for the number of parent <-> child edges to allow duplicates.
		int count;

		Edge(ConfigObject* parent, ConfigObject* child, int count = 1): parent(parent), child(child), count(count)
		{
		}

		struct Hash
		{
			/**
			 * Generates a unique hash of the given Edge object.
			 *
			 * Note, the hash value is generated only by combining the hash values of the parent and child pointers.
			 *
			 * @param edge The Edge object to be hashed.
			 *
			 * @return size_t The resulting hash value of the given object.
			 */
			size_t operator()(const Edge& edge) const
			{
				size_t seed = 0;
				boost::hash_combine(seed, edge.parent);
				boost::hash_combine(seed, edge.child);

				return seed;
			}
		};

		struct Equal
		{
			/**
			 * Compares whether the two Edge objects contain the same parent and child pointers.
			 *
			 * Note, the member property count is not taken into account for equality checks.
			 *
			 * @param a The first Edge object to compare.
			 * @param b The second Edge object to compare.
			 *
			 * @return bool Returns true if the two objects are equal, false otherwise.
			 */
			bool operator()(const Edge& a, const Edge& b) const
			{
				return a.parent == b.parent && a.child == b.child;
			}
		};
	};

	using DependencyMap = boost::multi_index_container<
		Edge, // The value type we want to sore in the container.