Use PHP 5.3 array syntax.

Author: mpartel

library/Xi/Algorithm/TopologicalSort.php

@@ -28,15 +28,15 @@ public static function apply(array $edges)
         // If we meet a node marked 2 then it's already on the list and we return.
         $unmarkedNodes = array_fill_keys($allNodes, null);
         $marks = array_fill_keys($allNodes, 0);
-        $result = [];
+        $result = array();
 
         $visit = function ($node) use ($edges, &$visit, &$marks, &$unmarkedNodes, &$result) {
             $mark = $marks[$node];
             if ($mark === 0) {
                 $marks[$node] = 1;
                 unset($unmarkedNodes[$node]);
 
-                foreach ((isset($edges[$node]) ? $edges[$node] : []) as $next) {
+                foreach ((isset($edges[$node]) ? $edges[$node] : array()) as $next) {
                     $visit($next);
                 }
 
@@ -60,7 +60,7 @@ public static function apply(array $edges)
 
     private static function allNodes(array $deps)
     {
-        $allNodes = [];
+        $allNodes = array();
         foreach ($deps as $node => $others) {
             if (!is_array($others)) {
                 throw new \InvalidArgumentException('Dependencies should be given as arrays, not single elements.');

tests/Xi/Tests/Algorithm/TopologicalSortTest.php

@@ -8,15 +8,15 @@ class TopologicalSortTest extends \PHPUnit_Framework_TestCase
      */
     public function simpleCase()
     {
-        $edges = [
-            'B' => ['C', 'D'],
-            'A' => ['B'],
-            'C' => ['D'],
-        ];
+        $edges = array(
+            'B' => array('C', 'D'),
+            'A' => array('B'),
+            'C' => array('D'),
+        );
 
         for ($i = 0; $i < 100; ++$i) {
             $edges = self::shuffleGraphSpec($edges);
-            $this->assertEquals(['D', 'C', 'B', 'A'], TopologicalSort::apply($edges));
+            $this->assertEquals(array('D', 'C', 'B', 'A'), TopologicalSort::apply($edges));
         }
     }
 
@@ -35,22 +35,22 @@ public function test(array $edges)
 
     public function provider()
     {
-        return [
-            [[
-                'B' => ['C', 'D'],
-                'A' => ['B'],
-                'C' => ['D'],
-            ]],
+        return array(
+            array(array(
+                'B' => array('C', 'D'),
+                'A' => array('B'),
+                'C' => array('D'),
+            )),
 
             // Wikipedia's example
-            [[
-                7 => [11, 8],
-                5 => [11],
-                3 => [8, 10],
-                11 => [2, 9, 10],
-                8 => [9]
-            ]]
-        ];
+            array(array(
+                7 => array(11, 8),
+                5 => array(11),
+                3 => array(8, 10),
+                11 => array(2, 9, 10),
+                8 => array(9)
+            ))
+        );
     }
 
     /**
@@ -59,12 +59,12 @@ public function provider()
      */
     public function throwsOnCycle()
     {
-        $edges = [
-            'B' => ['C', 'D'],
-            'A' => ['B'],
-            'C' => ['D'],
-            'D' => ['A']
-        ];
+        $edges = array(
+            'B' => array('C', 'D'),
+            'A' => array('B'),
+            'C' => array('D'),
+            'D' => array('A')
+        );
 
         TopologicalSort::apply($edges);
     }
@@ -73,7 +73,7 @@ private function shuffleGraphSpec(array $array)
     {
         $keys = array_keys($array);
         shuffle($keys);
-        $result = [];
+        $result = array();
         foreach ($keys as $key) {
             $result[$key] = $array[$key];
             shuffle($result[$key]);