-
-
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.
[GH-1204] Add full support for foreign key constraints in SQLite Plat…
…form and Schema.
- Loading branch information
Showing
13 changed files
with
425 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
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,164 @@ | ||
<?php | ||
|
||
namespace Doctrine\DBAL\Internal; | ||
|
||
use function array_reverse; | ||
|
||
/** | ||
* CommitOrderCalculator 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). | ||
*/ | ||
class CommitOrderCalculator | ||
{ | ||
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,CommitOrderNode> | ||
*/ | ||
private $nodeList = []; | ||
|
||
/** | ||
* Volatile variable holding calculated nodes during sorting process. | ||
* | ||
* @var array<CommitOrderNode> | ||
*/ | ||
private $sortedNodeList = []; | ||
|
||
/** | ||
* Checks for node (vertex) existence in graph. | ||
* | ||
* @param string $hash | ||
* | ||
* @return bool | ||
*/ | ||
public function hasNode($hash) | ||
{ | ||
return isset($this->nodeList[$hash]); | ||
} | ||
|
||
/** | ||
* Adds a new node (vertex) to the graph, assigning its hash and value. | ||
* | ||
* @param string $hash | ||
* @param object $node | ||
* | ||
* @return void | ||
*/ | ||
public function addNode($hash, $node) | ||
{ | ||
$vertex = new CommitOrderNode(); | ||
|
||
$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. | ||
* | ||
* @param string $fromHash | ||
* @param string $toHash | ||
* @param int $weight | ||
* | ||
* @return void | ||
*/ | ||
public function addDependency($fromHash, $toHash, $weight) | ||
{ | ||
$vertex = $this->nodeList[$fromHash]; | ||
$edge = new CommitOrderEdge(); | ||
|
||
$edge->from = $fromHash; | ||
$edge->to = $toHash; | ||
$edge->weight = $weight; | ||
|
||
$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() | ||
{ | ||
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(CommitOrderNode $vertex) | ||
{ | ||
$vertex->state = self::IN_PROGRESS; | ||
|
||
foreach ($vertex->dependencyList as $edge) { | ||
$adjacentVertex = $this->nodeList[$edge->to]; | ||
|
||
switch ($adjacentVertex->state) { | ||
case self::VISITED: | ||
// Do nothing, since node was already visited | ||
break; | ||
|
||
case self::IN_PROGRESS: | ||
if (isset($adjacentVertex->dependencyList[$vertex->hash]) && | ||
$adjacentVertex->dependencyList[$vertex->hash]->weight < $edge->weight) { | ||
// If we have some non-visited dependencies in the in-progress dependency, we | ||
// need to visit them before adding the node. | ||
foreach ($adjacentVertex->dependencyList as $adjacentEdge) { | ||
$adjacentEdgeVertex = $this->nodeList[$adjacentEdge->to]; | ||
|
||
if ($adjacentEdgeVertex->state !== self::NOT_VISITED) { | ||
continue; | ||
} | ||
|
||
$this->visit($adjacentEdgeVertex); | ||
} | ||
|
||
$adjacentVertex->state = self::VISITED; | ||
|
||
$this->sortedNodeList[] = $adjacentVertex->value; | ||
} | ||
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,15 @@ | ||
<?php | ||
|
||
namespace Doctrine\DBAL\Internal; | ||
|
||
class CommitOrderEdge | ||
{ | ||
/** @var string */ | ||
public $from; | ||
|
||
/** @var string */ | ||
public $to; | ||
|
||
/** @var int */ | ||
public $weight; | ||
} |
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 CommitOrderNode | ||
{ | ||
/** @var string */ | ||
public $hash; | ||
|
||
/** @var int */ | ||
public $state; | ||
|
||
/** @var object */ | ||
public $value; | ||
|
||
/** @var CommitOrderEdge[] */ | ||
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
Oops, something went wrong.