<?php

namespace Combodo\iTop\Setup\ModuleDependency;

require_once(__DIR__.'/module.class.inc.php');

use MissingDependencyException;

/**
 * Class that sorts module dependencies
 */
class ModuleDependencySort
{
	private static ModuleDependencySort $oInstance;

	protected function __construct()
	{
	}

	final public static function GetInstance(): ModuleDependencySort
	{
		if (!isset(self::$oInstance)) {
			self::$oInstance = new ModuleDependencySort();
		}

		return self::$oInstance;
	}

	final public static function SetInstance(?ModuleDependencySort $oInstance): void
	{
		self::$oInstance = $oInstance;
	}

	/**
	 * Sort a list of modules, based on their (inter) dependencies
	 *
	 * @param array $aModules The list of modules to process: 'id' => $aModuleInfo
	 * @param bool $bAbortOnMissingDependency ...
	 *
	 * @return array
	 * @throws \MissingDependencyException
	 */
	public function GetModulesOrderedForInstallation($aModules, $bAbortOnMissingDependency = false)
	{
		// Filter modules to compute
		$aUnresolvedDependencyModules = [];
		$aAllModuleNames = [];
		foreach ($aModules as $sModuleId => $aModule) {
			$oModule = new Module($sModuleId);
			$sModuleName = $oModule->GetModuleName();
			$oModule->SetDependencies($aModule['dependencies']);
			$aUnresolvedDependencyModules[$sModuleId] = $oModule;
			$aAllModuleNames[$sModuleName] = true;
		}

		// Make sure order is deterministic (alphabtical order)
		ksort($aUnresolvedDependencyModules);

		//Attempt to resolve module dependencies
		$aOrderedModules = [];
		$aResolvedModuleVersions = [];
		$iPreviousUnresolvedCount = -1;
		//loop until no dependency is resolved
		while ($iPreviousUnresolvedCount !== count($aUnresolvedDependencyModules)) {
			$iPreviousUnresolvedCount = count($aUnresolvedDependencyModules);
			if ($iPreviousUnresolvedCount === 0) {
				break;
			}

			foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
				/** @var Module $oModule */
				$oModule->UpdateModuleResolutionState($aResolvedModuleVersions, $aAllModuleNames);
				if ($oModule->IsResolved()) {
					$aOrderedModules[] = $sModuleId;
					$aResolvedModuleVersions[$oModule->GetModuleName()] = $oModule->GetVersion();
					unset($aUnresolvedDependencyModules[$sModuleId]);
				}
			}
		}

		// Report unresolved dependencies
		if ($bAbortOnMissingDependency && count($aUnresolvedDependencyModules) > 0) {
			$this->SortModulesByCountOfDepencenciesDescending($aUnresolvedDependencyModules);

			$aUnresolvedModulesInfo = [];
			$aModuleDeps = [];
			foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
				$aModule = $aModules[$sModuleId];
				$aDepsWithIcons = $oModule->GetDependencyResolutionFeedback();

				$aModuleDeps[] = "{$aModule['label']} (id: $sModuleId) depends on: ".implode(' + ', $aDepsWithIcons);
				$aUnresolvedModulesInfo[$sModuleId] = ['module' => $aModule, 'dependencies' => $aDepsWithIcons];
			}
			$sMessage = "The following modules have unmet dependencies:\n".implode(",\n", $aModuleDeps);
			$oException = new MissingDependencyException($sMessage);
			$oException->aModulesInfo = $aUnresolvedModulesInfo;
			throw $oException;
		}

		// Return the ordered list, so that the dependencies are met...
		$aResult = [];
		foreach ($aOrderedModules as $sId) {
			$aResult[$sId] = $aModules[$sId];
		}

		return $aResult;
	}

	/**
	 * This method is key as it sorts modules by their dependencies (topological sort).
	 * Modules with less dependencies are first.
	 * When module A depends from module B with same amount of dependencies, moduleB is first.
	 * This order can deal with
	 *      - cyclic dependencies
	 *      - further versions of same module (name)
	 *
	 * @param array $aUnresolvedDependencyModules : dict of Module objects by moduleId key
	 *
	 * @return void
	 */
	protected function SortModulesByCountOfDepencenciesDescending(array &$aUnresolvedDependencyModules): void
	{
		$aCountDepsByModuleId = [];
		$aDependsOnModuleName = [];

		foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
			/** @var Module $oModule */
			$aDependsOnModuleName[$oModule->GetModuleName()] = [];
		}

		foreach ($aUnresolvedDependencyModules as $sModuleId => $oModule) {
			$iInDegreeCounter = 0;
			/** @var Module $oModule */
			$aUnresolvedDependencyModuleNames = $oModule->GetUnresolvedDependencyModuleNames();
			foreach ($aUnresolvedDependencyModuleNames as $sModuleName) {
				if (array_key_exists($sModuleName, $aDependsOnModuleName)) {
					$aDependsOnModuleName[$sModuleName][] = $sModuleId;
					$iInDegreeCounter++;
				}
			}
			//include all modules
			$iInDegreeCounterIncludingOutsideModules = count($oModule->GetUnresolvedDependencyModuleNames());
			$aCountDepsByModuleId[$sModuleId] = new ModuleCountDepency($sModuleId, $iInDegreeCounter, $iInDegreeCounterIncludingOutsideModules);
		}

		$aRes = [];
		while (count($aUnresolvedDependencyModules) > 0) {
			asort($aCountDepsByModuleId);

			uasort($aCountDepsByModuleId, function (ModuleCountDepency $oModuleCountDepency1, ModuleCountDepency $oModuleCountDepency2) {
				$res = $oModuleCountDepency1->iInDegreeCounter - $oModuleCountDepency2->iInDegreeCounter;
				if ($res != 0) {
					return $res;
				}

				$res = $oModuleCountDepency1->iInDegreeCounterIncludingOutsideModules - $oModuleCountDepency2->iInDegreeCounterIncludingOutsideModules;
				if ($res != 0) {
					return $res;
				}

				//alphabetical order at least
				return strcmp($oModuleCountDepency1->sModuleId, $oModuleCountDepency2->sModuleId);
			});

			$bOneLoopAtLeast = false;
			foreach ($aCountDepsByModuleId as $sModuleId => $oModuleCountDepency) {
				/** @var ModuleCountDepency $oModuleCountDepency */
				$oModule = $aUnresolvedDependencyModules[$sModuleId];

				if ($bOneLoopAtLeast && ($oModuleCountDepency->iInDegreeCounter > 0)) {
					break;
				}

				unset($aUnresolvedDependencyModules[$sModuleId]);
				unset($aCountDepsByModuleId[$sModuleId]);

				$aRes[$sModuleId] = $oModule;

				//when 2 versions of the same module (name) below array has been removed already
				if (array_key_exists($oModule->GetModuleName(), $aDependsOnModuleName)) {
					foreach ($aDependsOnModuleName[$oModule->GetModuleName()] as $sModuleId2) {
						if (!array_key_exists($sModuleId2, $aCountDepsByModuleId)) {
							continue;
						}
						/** @var ModuleCountDepency $oModuleCountDepency2 */
						$oModuleCountDepency2 = $aCountDepsByModuleId[$sModuleId2];
						$iInDegreeCounter = $oModuleCountDepency2->iInDegreeCounter - 1;
						$aCountDepsByModuleId[$sModuleId2] = new ModuleCountDepency($sModuleId2, $iInDegreeCounter, $oModuleCountDepency2->iInDegreeCounterIncludingOutsideModules);
					}

					unset($aDependsOnModuleName[$oModule->GetModuleName()]);
				}

				$bOneLoopAtLeast = true;
			}
		}

		$aUnresolvedDependencyModules = $aRes;
	}
}

class ModuleCountDepency
{
	public string $sModuleId;
	public int $iInDegreeCounter;
	public int $iInDegreeCounterIncludingOutsideModules;

	public function __construct(string $sModuleId, int $iInDegreeCounter, int $iInDegreeCounterIncludingOutsideModules)
	{
		$this->iInDegreeCounter = $iInDegreeCounter;
		$this->iInDegreeCounterIncludingOutsideModules = $iInDegreeCounterIncludingOutsideModules;
		$this->sModuleId = $sModuleId;
	}

}