@@ -41,11 +41,11 @@ discard block |
||
| 41 | 41 | public function addDependency($name, $order = 0, $dependencies = []) |
| 42 | 42 | { |
| 43 | 43 | //Check if dependency is already declared. |
| 44 | - if(isset($this->dependenciesInfos[$name])) { |
|
| 44 | + if (isset($this->dependenciesInfos[$name])) { |
|
| 45 | 45 | throw new Exception('Dependency '.$name.' already declared.'); |
| 46 | 46 | } |
| 47 | 47 | |
| 48 | - if(!is_array($dependencies)) { |
|
| 48 | + if (!is_array($dependencies)) { |
|
| 49 | 49 | throw new Exception('Dependencies must be passed in a array.'); |
| 50 | 50 | } |
| 51 | 51 | |
@@ -56,14 +56,14 @@ discard block |
||
| 56 | 56 | $this->dependenciesInfos[$name] = $dependencyInfos; |
| 57 | 57 | |
| 58 | 58 | //Create the key for list of depends if she doesn't exist |
| 59 | - if(!isset($this->listDepends[$name])) { |
|
| 59 | + if (!isset($this->listDepends[$name])) { |
|
| 60 | 60 | $this->listDepends[$name] = []; |
| 61 | 61 | } |
| 62 | 62 | |
| 63 | 63 | //Generate the list of depends |
| 64 | - if($dependencies !== []) { |
|
| 65 | - foreach($dependencies as $dependencyName) { |
|
| 66 | - if(!isset($this->listDepends[$dependencyName])) { |
|
| 64 | + if ($dependencies !== []) { |
|
| 65 | + foreach ($dependencies as $dependencyName) { |
|
| 66 | + if (!isset($this->listDepends[$dependencyName])) { |
|
| 67 | 67 | $this->listDepends[$dependencyName] = []; |
| 68 | 68 | } |
| 69 | 69 | |
@@ -83,11 +83,11 @@ discard block |
||
| 83 | 83 | { |
| 84 | 84 | //Read all depencies declared and positioned each dependency on |
| 85 | 85 | //the tree with they order value |
| 86 | - foreach($this->dependenciesInfos as $name => $dependency) { |
|
| 86 | + foreach ($this->dependenciesInfos as $name => $dependency) { |
|
| 87 | 87 | $order = $dependency->order; |
| 88 | 88 | |
| 89 | 89 | //If the line for this order not exist |
| 90 | - if(!isset($this->tree[$order])) { |
|
| 90 | + if (!isset($this->tree[$order])) { |
|
| 91 | 91 | $this->tree[$order] = []; |
| 92 | 92 | } |
| 93 | 93 | |
@@ -98,8 +98,8 @@ discard block |
||
| 98 | 98 | |
| 99 | 99 | //Read the tree and check depends of each package. |
| 100 | 100 | //Move some package in the tree if need for depends. |
| 101 | - foreach($this->tree as $dependencies) { |
|
| 102 | - foreach($dependencies as $dependencyName) { |
|
| 101 | + foreach ($this->tree as $dependencies) { |
|
| 102 | + foreach ($dependencies as $dependencyName) { |
|
| 103 | 103 | $this->checkDepend($dependencyName); |
| 104 | 104 | } |
| 105 | 105 | } |
@@ -125,17 +125,17 @@ discard block |
||
| 125 | 125 | $order = $dependencyInfos->order; |
| 126 | 126 | |
| 127 | 127 | //No depends :) |
| 128 | - if($listDepends === []) { |
|
| 128 | + if ($listDepends === []) { |
|
| 129 | 129 | return; |
| 130 | 130 | } |
| 131 | 131 | |
| 132 | 132 | //Read all depends and check if they correctly spoted. |
| 133 | 133 | //If not, call the method to move the depend read. |
| 134 | - foreach($listDepends as $dependencyName) { |
|
| 134 | + foreach ($listDepends as $dependencyName) { |
|
| 135 | 135 | $dependencyPos = $this->dependenciesPositions[$dependencyName]; |
| 136 | 136 | $dependencyOrder = $dependencyPos[0]; |
| 137 | 137 | |
| 138 | - if($dependencyOrder < $order) { |
|
| 138 | + if ($dependencyOrder < $order) { |
|
| 139 | 139 | $this->moveDepend($dependencyName, $order); |
| 140 | 140 | } |
| 141 | 141 | } |
@@ -156,7 +156,7 @@ discard block |
||
| 156 | 156 | $oldOrder = $dependencyInfos->order; |
| 157 | 157 | |
| 158 | 158 | //If the new position not already exist in the tree |
| 159 | - if(!isset($this->tree[$newOrder])) { |
|
| 159 | + if (!isset($this->tree[$newOrder])) { |
|
| 160 | 160 | $this->tree[$newOrder] = []; |
| 161 | 161 | } |
| 162 | 162 | |
@@ -186,10 +186,10 @@ discard block |
||
| 186 | 186 | $this->tree = [[]]; //generate a empty tree |
| 187 | 187 | |
| 188 | 188 | //Read all depends of each dependencies |
| 189 | - foreach($this->listDepends as $dependencyName => $depends) { |
|
| 189 | + foreach ($this->listDepends as $dependencyName => $depends) { |
|
| 190 | 190 | |
| 191 | 191 | //If the package have depends, we continue |
| 192 | - if($depends !== []) { |
|
| 192 | + if ($depends !== []) { |
|
| 193 | 193 | continue; |
| 194 | 194 | } |
| 195 | 195 | |
@@ -206,12 +206,12 @@ discard block |
||
| 206 | 206 | $this->tree = array_reverse($this->tree); |
| 207 | 207 | |
| 208 | 208 | //Read the tree for update the order of each dependency |
| 209 | - foreach($this->tree as $order => $dependencies) { |
|
| 210 | - foreach($dependencies as $dependencyName) { |
|
| 209 | + foreach ($this->tree as $order => $dependencies) { |
|
| 210 | + foreach ($dependencies as $dependencyName) { |
|
| 211 | 211 | $dependencyInfos = &$this->dependenciesInfos[$dependencyName]; |
| 212 | 212 | |
| 213 | 213 | //If the order has not be already updated |
| 214 | - if($dependencyInfos->order > -1) { |
|
| 214 | + if ($dependencyInfos->order > -1) { |
|
| 215 | 215 | continue; |
| 216 | 216 | } |
| 217 | 217 | |
@@ -235,16 +235,16 @@ discard block |
||
| 235 | 235 | protected function generateOrderForADependency($dependencyName, $currentOrder) |
| 236 | 236 | { |
| 237 | 237 | $depends = $this->dependenciesInfos[$dependencyName]->dependencies; |
| 238 | - if($depends === []) { |
|
| 238 | + if ($depends === []) { |
|
| 239 | 239 | return; |
| 240 | 240 | } |
| 241 | 241 | |
| 242 | - $order = $currentOrder+1; |
|
| 243 | - if(!isset($this->tree[$order])) { |
|
| 242 | + $order = $currentOrder + 1; |
|
| 243 | + if (!isset($this->tree[$order])) { |
|
| 244 | 244 | $this->tree[$order] = []; |
| 245 | 245 | } |
| 246 | 246 | |
| 247 | - foreach($depends as $dependName) { |
|
| 247 | + foreach ($depends as $dependName) { |
|
| 248 | 248 | $this->tree[$order][$dependName] = $dependName; |
| 249 | 249 | |
| 250 | 250 | $this->generateOrderForADependency( |
@@ -25,11 +25,11 @@ discard block |
||
| 25 | 25 | public function addDependency($name, $order = 0, $dependencies = []) |
| 26 | 26 | { |
| 27 | 27 | //Check if dependency is already declared. |
| 28 | - if(isset($this->dependencies[$name])) { |
|
| 28 | + if (isset($this->dependencies[$name])) { |
|
| 29 | 29 | throw new Exception('Dependency '.$name.' already declared.'); |
| 30 | 30 | } |
| 31 | 31 | |
| 32 | - if(!is_array($dependencies)) { |
|
| 32 | + if (!is_array($dependencies)) { |
|
| 33 | 33 | throw new Exception('Dependencies must be passed in a array.'); |
| 34 | 34 | } |
| 35 | 35 | |
@@ -65,7 +65,7 @@ discard block |
||
| 65 | 65 | $tree = new Tree; |
| 66 | 66 | |
| 67 | 67 | //add all dependency to the Tree |
| 68 | - foreach($this->dependencies as $dependencyName => $dependencyInfos) { |
|
| 68 | + foreach ($this->dependencies as $dependencyName => $dependencyInfos) { |
|
| 69 | 69 | $tree->addDependency( |
| 70 | 70 | $dependencyName, |
| 71 | 71 | $dependencyInfos->order, |
@@ -88,10 +88,10 @@ discard block |
||
| 88 | 88 | //Read the orderTree and generate a tree |
| 89 | 89 | //for each line of the first tree |
| 90 | 90 | |
| 91 | - foreach($orderTree as $order => $dependencies) { |
|
| 91 | + foreach ($orderTree as $order => $dependencies) { |
|
| 92 | 92 | $tree = new Tree; |
| 93 | 93 | |
| 94 | - foreach($dependencies as $dependencyName) { |
|
| 94 | + foreach ($dependencies as $dependencyName) { |
|
| 95 | 95 | $dependencyInfos = $this->dependencies[$dependencyName]; |
| 96 | 96 | |
| 97 | 97 | $tree->addDependency( |