Merge pull request #37 from wayfair-contribs/fix_native_function_invocation

Automated native_function_invocation fixes

Author: clue

src/Bipartit.php

@@ -60,7 +60,7 @@ public function getColors()
                 // breadth search all vertices in same component
                 do {
                     // next vertex in color
-                    $vertex = array_shift($queue);
+                    $vertex = \array_shift($queue);
                     $color = $colors[$vertex->getId()];
                     $nextColor = 1-$color;
 

src/ConnectedComponents.php

@@ -78,7 +78,7 @@ public function isSingle()
         }
         $alg = $this->createSearch($vertex);
 
-        return (count($this->graph->getVertices()) === count($alg->getVertices()));
+        return (\count($this->graph->getVertices()) === \count($alg->getVertices()));
     }
 
     /**

src/Degree.php

@@ -164,7 +164,7 @@ public function isVertexSink(Vertex $vertex)
      */
     public function getDegreeVertex(Vertex $vertex)
     {
-        return count($vertex->getEdges());
+        return \count($vertex->getEdges());
     }
 
     /**

src/Groups.php

@@ -16,7 +16,7 @@ class Groups extends BaseGraph
      */
     public function getNumberOfGroups()
     {
-        return count($this->getGroups());
+        return \count($this->getGroups());
     }
 
     /**
@@ -63,7 +63,7 @@ public function getGroups()
             $groups[$vertex->getGroup()] = true;
         }
 
-        return array_keys($groups);
+        return \array_keys($groups);
     }
 
     /**

src/MaximumMatching/Base.php

@@ -18,7 +18,7 @@ abstract class Base extends BaseGraph
      */
     public function getNumberOfMatches()
     {
-        return count($this->getEdges());
+        return \count($this->getEdges());
     }
 
     /**

src/MinimumSpanningTree/Kruskal.php

@@ -103,7 +103,7 @@ public function getEdges()
                 $worseColor  = $bColor;
 
                 // more vertices with color a => paint all in b in a's color
-                if (count($colorVertices[$bColor]) > count($colorVertices[$aColor])) {
+                if (\count($colorVertices[$bColor]) > \count($colorVertices[$aColor])) {
                     $betterColor = $bColor;
                     $worseColor = $aColor;
                 }
@@ -125,7 +125,7 @@ public function getEdges()
 
         // definition of spanning tree: number of edges = number of vertices - 1
         // above algorithm does not check isolated edges or may otherwise return multiple connected components => force check
-        if (count($returnEdges) !== (count($this->graph->getVertices()) - 1)) {
+        if (\count($returnEdges) !== (\count($this->graph->getVertices()) - 1)) {
             throw new UnexpectedValueException('Graph is not connected');
         }
 

src/MinimumSpanningTree/Prim.php

@@ -35,7 +35,7 @@ public function getEdges()
         $returnEdges = array();
 
         // iterate n-1 times (per definition, resulting MST MUST have n-1 edges)
-        for ($i = 0, $n = count($this->startVertex->getGraph()->getVertices()) - 1; $i < $n; ++$i) {
+        for ($i = 0, $n = \count($this->startVertex->getGraph()->getVertices()) - 1; $i < $n; ++$i) {
             $markInserted[$vertexCurrent->getId()] = true;
 
             // get unvisited vertex of the edge and add edges from new vertex

src/Parallel.php

@@ -68,7 +68,7 @@ public function getEdgesParallelEdge(Edge $edge)
             $edges = $ends->getVertexFirst()->getEdges()->getEdgesIntersection($ends->getVertexLast()->getEdges())->getVector();
         }
 
-        $pos = array_search($edge, $edges, true);
+        $pos = \array_search($edge, $edges, true);
 
         if ($pos === false) {
             // @codeCoverageIgnoreStart
@@ -79,6 +79,6 @@ public function getEdgesParallelEdge(Edge $edge)
         // exclude current edge from parallel edges
         unset($edges[$pos]);
 
-        return new Edges(array_values($edges));
+        return new Edges(\array_values($edges));
     }
 }

src/Property/GraphProperty.php

@@ -46,6 +46,6 @@ public function isNull()
      */
     public function isTrivial()
     {
-        return ($this->graph->getEdges()->isEmpty() && count($this->graph->getVertices()) === 1);
+        return ($this->graph->getEdges()->isEmpty() && \count($this->graph->getVertices()) === 1);
     }
 }

src/Property/WalkProperty.php

@@ -162,7 +162,7 @@ public function hasCycle()
      */
     public function isLoop()
     {
-        return (count($this->walk->getEdges()) === 1 && $this->isCycle());
+        return (\count($this->walk->getEdges()) === 1 && $this->isCycle());
     }
 
     /**
@@ -214,11 +214,11 @@ public function hasLoop()
     public function isDigon()
     {
         // exactly 2 edges
-        return (count($this->walk->getEdges()) === 2 &&
+        return (\count($this->walk->getEdges()) === 2 &&
                 // no duplicate edges
                 !$this->hasArrayDuplicates($this->walk->getEdges()->getVector()) &&
                 // exactly two distinct vertices
-                count($this->walk->getVertices()->getVerticesDistinct()) === 2 &&
+                \count($this->walk->getVertices()->getVerticesDistinct()) === 2 &&
                 // this is actually a cycle
                 $this->isCycle());
     }
@@ -238,9 +238,9 @@ public function isDigon()
     public function isTriangle()
     {
         // exactly 3 (implicitly distinct) edges
-        return (count($this->walk->getEdges()) === 3 &&
+        return (\count($this->walk->getEdges()) === 3 &&
                 // exactly three distinct vertices
-                count($this->walk->getVertices()->getVerticesDistinct()) === 3 &&
+                \count($this->walk->getVertices()->getVerticesDistinct()) === 3 &&
                 // this is actually a cycle
                 $this->isCycle());
     }
@@ -347,7 +347,7 @@ private function hasArrayDuplicates($array)
         $compare = array();
         foreach ($array as $element) {
             // duplicate element found
-            if (in_array($element, $compare, true)) {
+            if (\in_array($element, $compare, true)) {
                 return true;
             } else {
                 // add element to temporary array to check for duplicates
@@ -368,7 +368,7 @@ private function hasArrayDuplicates($array)
     private function isArrayContentsEqual($a, $b)
     {
         foreach ($b as $one) {
-            $pos = array_search($one, $a, true);
+            $pos = \array_search($one, $a, true);
             if ($pos === false) {
                 return false;
             } else {