<?php

/*
 * This file is part of the Access to Memory (AtoM) software.
 *
 * Access to Memory (AtoM) is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Access to Memory (AtoM) is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with Access to Memory (AtoM).  If not, see <http://www.gnu.org/licenses/>.
 */

class TermTreeViewComponent extends sfComponent
{
    public function execute($request)
    {
        $this->resource = $request->getAttribute('sf_route')->resource;

        // Number of siblings that we are showing above and below the current node
        $numberOfPreviousOrNextSiblings = 4;
        $this->getChildrensAndShowActive = true;

        if ($this->resource instanceof QubitTaxonomy) {
            $criteria = new Criteria();
            $criteria->add(QubitTerm::TAXONOMY_ID, $this->resource->id);
            $criteria->add(QubitTerm::PARENT_ID, QubitTerm::ROOT_ID);
            $criteria->addAscendingOrderByColumn('name');
            $criteria = QubitCultureFallback::addFallbackCriteria($criteria, 'QubitTerm');

            // Get first top level term if we are in a taxonomy page
            $this->resource = QubitTerm::getOne($criteria);

            // Get more siblings and no childrens
            $numberOfPreviousOrNextSiblings = 11;
            $this->getChildrensAndShowActive = false;
        }

        if (isset($this->resource)) {
            $this->ancestors = $this->resource->getAncestors()->orderBy('lft');

            $this->browser = isset($this->browser) && true === $this->browser;

            $this->hasPrevSiblings = false;
            $this->hasNextSiblings = false;

            // Child descriptions
            if ($this->getChildrensAndShowActive && $this->resource->hasChildren()) {
                list($this->children, $this->hasNextSiblings) = $this->resource->getTreeViewChildren(['numberOfPreviousOrNextSiblings' => $numberOfPreviousOrNextSiblings]);
            }
            // Show siblings if there's no children
            else {
                // Previous siblings
                // Get an extra sibling just to know if the + button is necessary
                $this->prevSiblings = $this->resource->getTreeViewSiblings(['limit' => $numberOfPreviousOrNextSiblings + 1, 'position' => 'previous']);
                $this->hasPrevSiblings = count($this->prevSiblings) > $numberOfPreviousOrNextSiblings;
                if ($this->hasPrevSiblings) {
                    array_pop($this->prevSiblings);
                }

                // Reverse array
                $this->prevSiblings = array_reverse($this->prevSiblings);

                // Next siblings, same logic than above with the + button
                $this->nextSiblings = $this->resource->getTreeViewSiblings(['limit' => $numberOfPreviousOrNextSiblings + 1, 'position' => 'next']);
                $this->hasNextSiblings = count($this->nextSiblings) > $numberOfPreviousOrNextSiblings;
                if ($this->hasNextSiblings) {
                    array_pop($this->nextSiblings);
                }
            }
        }
    }
}
