-
-
Notifications
You must be signed in to change notification settings - Fork 1.3k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Browse files
Browse the repository at this point in the history
…ySupport [GH-1204] Add full support for foreign key constraints for SQLite
- Loading branch information
Showing
14 changed files
with
354 additions
and
25 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
131 changes: 131 additions & 0 deletions
131
lib/Doctrine/DBAL/Internal/DependencyOrderCalculator.php
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,131 @@ | ||
<?php | ||
|
||
namespace Doctrine\DBAL\Internal; | ||
|
||
use function array_reverse; | ||
|
||
/** | ||
* DependencyOrderCalculator implements topological sorting, which is an ordering | ||
* algorithm for directed graphs (DG) and/or directed acyclic graphs (DAG) by | ||
* using a depth-first searching (DFS) to traverse the graph built in memory. | ||
* This algorithm have a linear running time based on nodes (V) and dependency | ||
* between the nodes (E), resulting in a computational complexity of O(V + E). | ||
*/ | ||
final class DependencyOrderCalculator | ||
{ | ||
public const NOT_VISITED = 0; | ||
public const IN_PROGRESS = 1; | ||
public const VISITED = 2; | ||
|
||
/** | ||
* Matrix of nodes (aka. vertex). | ||
* Keys are provided hashes and values are the node definition objects. | ||
* | ||
* @var array<string,DependencyOrderNode> | ||
*/ | ||
private $nodeList = []; | ||
|
||
/** | ||
* Volatile variable holding calculated nodes during sorting process. | ||
* | ||
* @var array<object> | ||
*/ | ||
private $sortedNodeList = []; | ||
|
||
/** | ||
* Checks for node (vertex) existence in graph. | ||
*/ | ||
public function hasNode(string $hash) : bool | ||
{ | ||
return isset($this->nodeList[$hash]); | ||
} | ||
|
||
/** | ||
* Adds a new node (vertex) to the graph, assigning its hash and value. | ||
* | ||
* @param object $node | ||
*/ | ||
public function addNode(string $hash, $node) : void | ||
{ | ||
$vertex = new DependencyOrderNode(); | ||
|
||
$vertex->hash = $hash; | ||
$vertex->state = self::NOT_VISITED; | ||
$vertex->value = $node; | ||
|
||
$this->nodeList[$hash] = $vertex; | ||
} | ||
|
||
/** | ||
* Adds a new dependency (edge) to the graph using their hashes. | ||
*/ | ||
public function addDependency(string $fromHash, string $toHash) : void | ||
{ | ||
$vertex = $this->nodeList[$fromHash]; | ||
$edge = new DependencyOrderEdge(); | ||
|
||
$edge->from = $fromHash; | ||
$edge->to = $toHash; | ||
|
||
$vertex->dependencyList[$toHash] = $edge; | ||
} | ||
|
||
/** | ||
* Return a valid order list of all current nodes. | ||
* The desired topological sorting is the reverse post order of these searches. | ||
* | ||
* {@internal Highly performance-sensitive method.} | ||
* | ||
* @return array<object> | ||
*/ | ||
public function sort() : array | ||
{ | ||
foreach ($this->nodeList as $vertex) { | ||
if ($vertex->state !== self::NOT_VISITED) { | ||
continue; | ||
} | ||
|
||
$this->visit($vertex); | ||
} | ||
|
||
$sortedList = $this->sortedNodeList; | ||
|
||
$this->nodeList = []; | ||
$this->sortedNodeList = []; | ||
|
||
return array_reverse($sortedList); | ||
} | ||
|
||
/** | ||
* Visit a given node definition for reordering. | ||
* | ||
* {@internal Highly performance-sensitive method.} | ||
*/ | ||
private function visit(DependencyOrderNode $vertex) : void | ||
{ | ||
$vertex->state = self::IN_PROGRESS; | ||
|
||
foreach ($vertex->dependencyList as $edge) { | ||
$adjacentVertex = $this->nodeList[$edge->to]; | ||
|
||
switch ($adjacentVertex->state) { | ||
case self::VISITED: | ||
case self::IN_PROGRESS: | ||
// Do nothing, since node was already visited or is | ||
// currently visited | ||
break; | ||
|
||
case self::NOT_VISITED: | ||
$this->visit($adjacentVertex); | ||
} | ||
} | ||
|
||
if ($vertex->state === self::VISITED) { | ||
return; | ||
} | ||
|
||
$vertex->state = self::VISITED; | ||
|
||
$this->sortedNodeList[] = $vertex->value; | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
<?php | ||
|
||
namespace Doctrine\DBAL\Internal; | ||
|
||
class DependencyOrderEdge | ||
{ | ||
/** @var string */ | ||
public $from; | ||
|
||
/** @var string */ | ||
public $to; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,18 @@ | ||
<?php | ||
|
||
namespace Doctrine\DBAL\Internal; | ||
|
||
class DependencyOrderNode | ||
{ | ||
/** @var string */ | ||
public $hash; | ||
|
||
/** @var int */ | ||
public $state; | ||
|
||
/** @var object */ | ||
public $value; | ||
|
||
/** @var DependencyOrderEdge[] */ | ||
public $dependencyList = []; | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Oops, something went wrong.