private function getStepsSortedDescByPriority()
    {
        $steps = $this->steps;
        // Use illogically large and small priorities
        $steps[-255][] = new Step\ArrayCheckStep;
        foreach ($this->writers as $writer) {
            $steps[-256][] = new Step\WriterStep($writer);
        }

        krsort($steps);

        $sortedStep = [];
        /** @var Step[] $stepsAtSamePriority */
        foreach ($steps as $stepsAtSamePriority) {
            foreach ($stepsAtSamePriority as $step) {
                $sortedStep[] = $step;
            }
        }

        return array_reverse($sortedStep);
    }
private function getStepsSortedDescByPriority()
    {
        $steps = $this->steps;
        // Use illogically large and small priorities
        $steps[-255][] = new Step\ArrayCheckStep;
        foreach ($this->writers as $writer) {
            $steps[-256][] = new Step\WriterStep($writer);
        }

        krsort($steps);

        $sortedStep = [];
        /** @var Step[] $stepsAtSamePriority */
        foreach ($steps as $stepsAtSamePriority) {
            foreach ($stepsAtSamePriority as $step) {
                $sortedStep[] = $step;
            }
        }

        return array_reverse($sortedStep);
    }
private function getStepsSortedDescByPriority ( ) { $ steps = $ this -> steps ; // Use illogically large and small priorities $ steps [ - 255 ] [ ] = new Step \ ArrayCheckStep ; foreach ( $ this -> writers as $ writer ) { $ steps [ - 256 ] [ ] = new Step \ WriterStep ( $ writer ) ; } krsort ( $ steps ) ; $ sortedStep = [ ] ; /** @var Step[] $stepsAtSamePriority */ foreach ( $ steps as $ stepsAtSamePriority ) { foreach ( $ stepsAtSamePriority as $ step ) { $ sortedStep [ ] = $ step ; } } return array_reverse ( $ sortedStep ) ; }
Sorts the internal list of steps and writers by priority in reverse order.

@return Step[]
Sorts the internal list of steps and writers by priority in reverse order .