@@ -21,7 +21,7 @@ discard block |
||
21 | 21 | } |
22 | 22 | |
23 | 23 | // sort versions (jASC) |
24 | - usort($this->versions, function (Version $v1, Version $v2) { |
|
24 | + usort($this->versions, function(Version $v1, Version $v2) { |
|
25 | 25 | $v1 = (string) $v1->getFull(); |
26 | 26 | $v2 = (string) $v2->getFull(); |
27 | 27 | |
@@ -48,7 +48,7 @@ discard block |
||
48 | 48 | */ |
49 | 49 | public function merge(OrderedList $range, $checkAliases = false) |
50 | 50 | { |
51 | - $filtered = $range->filter(function (Version $version) use ($checkAliases) { |
|
51 | + $filtered = $range->filter(function(Version $version) use ($checkAliases) { |
|
52 | 52 | return !$this->contains($version, $checkAliases); |
53 | 53 | }); |
54 | 54 | |
@@ -64,7 +64,7 @@ discard block |
||
64 | 64 | public function contains(Version $version, $checkAliases = false) |
65 | 65 | { |
66 | 66 | if ($checkAliases) { |
67 | - return in_array($version->getFull(), $this->map(function (Version $version) { |
|
67 | + return in_array($version->getFull(), $this->map(function(Version $version) { |
|
68 | 68 | return $version->getFull(); |
69 | 69 | })); |
70 | 70 | } |
@@ -107,7 +107,7 @@ discard block |
||
107 | 107 | public function isEqualTo(OrderedList $range, $checkAliases = false) |
108 | 108 | { |
109 | 109 | if ($checkAliases) { |
110 | - $getFull = function (Version $version) { |
|
110 | + $getFull = function(Version $version) { |
|
111 | 111 | return $version->getFull(); |
112 | 112 | }; |
113 | 113 |
@@ -19,7 +19,7 @@ discard block |
||
19 | 19 | public function __construct(AdjacencyList $adj) |
20 | 20 | { |
21 | 21 | foreach ($adj as $vertex => $list) { |
22 | - $list = array_map(function (Version $version) use ($vertex) { |
|
22 | + $list = array_map(function(Version $version) use ($vertex) { |
|
23 | 23 | return [(string) $version => (new Version($vertex))->isChildOf($version) ? 0 : 1]; |
24 | 24 | }, iterator_to_array($list)); |
25 | 25 | |
@@ -144,7 +144,7 @@ discard block |
||
144 | 144 | $aliases = $aliases->merge($from->getAliases()); |
145 | 145 | } |
146 | 146 | |
147 | - return $aliases->filter(function (Version $version) { |
|
147 | + return $aliases->filter(function(Version $version) { |
|
148 | 148 | return isset($this->graph[(string) $version]); |
149 | 149 | }); |
150 | 150 | } |
@@ -156,7 +156,7 @@ discard block |
||
156 | 156 | */ |
157 | 157 | private function getDestinationVertexes(Version $to) |
158 | 158 | { |
159 | - return $to->getAliases()->filter(function (Version $version) { |
|
159 | + return $to->getAliases()->filter(function(Version $version) { |
|
160 | 160 | return isset($this->graph[(string) $version]); |
161 | 161 | }); |
162 | 162 | } |
@@ -75,8 +75,8 @@ discard block |
||
75 | 75 | /** |
76 | 76 | * Dijkstra "the shortest path" algorithm |
77 | 77 | * |
78 | - * @param $source |
|
79 | - * @param $target |
|
78 | + * @param string $source |
|
79 | + * @param string $target |
|
80 | 80 | * |
81 | 81 | * @return array |
82 | 82 | */ |
@@ -146,7 +146,7 @@ discard block |
||
146 | 146 | /** |
147 | 147 | * @param Version $from |
148 | 148 | * |
149 | - * @return OrderedList |
|
149 | + * @return \Sugarcrm\UpgradeSpec\Version\OrderedList |
|
150 | 150 | */ |
151 | 151 | private function getOriginVertexes(Version $from) |
152 | 152 | { |
@@ -164,7 +164,7 @@ discard block |
||
164 | 164 | /** |
165 | 165 | * @param Version $to |
166 | 166 | * |
167 | - * @return OrderedList |
|
167 | + * @return \Sugarcrm\UpgradeSpec\Version\OrderedList |
|
168 | 168 | */ |
169 | 169 | private function getDestinationVertexes(Version $to) |
170 | 170 | { |