/**
    * This file Copyright (c) 2011-2019 Magnolia International
    * Ltd.  (http://www.magnolia-cms.com). All rights reserved.
    *
    *
    * This file is dual-licensed under both the Magnolia
    * Network Agreement and the GNU General Public License.
    * You may elect to use one or the other of these licenses.
    *
   * This file is distributed in the hope that it will be
   * useful, but AS-IS and WITHOUT ANY WARRANTY; without even the
   * implied warranty of MERCHANTABILITY or FITNESS FOR A
   * PARTICULAR PURPOSE, TITLE, or NONINFRINGEMENT.
   * Redistribution, except as permitted by whichever of the GPL
   * or MNA you select, is prohibited.
   *
   * 1. For the GPL license (GPL), you can redistribute and/or
   * modify this file under the terms of the GNU General
   * Public License, Version 3, as published by the Free Software
   * Foundation.  You should have received a copy of the GNU
   * General Public License, Version 3 along with this program;
   * if not, write to the Free Software Foundation, Inc., 51
   * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
   *
   * 2. For the Magnolia Network Agreement (MNA), this file
   * and the accompanying materials are made available under the
   * terms of the MNA which accompanies this distribution, and
   * is available at http://www.magnolia-cms.com/mna.html
   *
   * Any modifications to this file must keep this entire header
   * intact.
   *
   */
  package info.magnolia.ui.vaadin.gwt.client.editor.model;
  
  import info.magnolia.ui.vaadin.gwt.client.editor.dom.MgnlArea;
  import info.magnolia.ui.vaadin.gwt.client.editor.dom.MgnlElement;
  import info.magnolia.ui.vaadin.gwt.client.editor.dom.MgnlPage;
  import info.magnolia.ui.vaadin.gwt.client.shared.AbstractElement;
  
  import java.util.HashMap;
  import java.util.LinkedList;
  import java.util.List;
  import java.util.Map;
  
  import com.google.gwt.dom.client.Element;
  import com.google.gwt.dom.client.Node;
  
  
  /**
   * Singleton keeping the model.
   */
  public class ModelImpl implements Model {
  
      public MgnlPage rootPage;
      public List<MgnlArea> rootAreas = new LinkedList<>();
      private Map<MgnlElement, List<Element>> elements = new HashMap<>();
      private Map<Element, MgnlElement> mgnlElements = new HashMap<>();
      private boolean moving = false;
  
      @Override
      public void addElement(MgnlElement mgnlElement, Element element) {
  
          if (mgnlElement == null || element == null) {
              return;
          }
          mgnlElements.put(element, mgnlElement);
  
          if (elements.get(mgnlElement) != null) {
              elements.get(mgnlElement).add(element);
          } else {
              List<Element> elList = new LinkedList<Element>();
              elList.add(element);
              elements.put(mgnlElement, elList);
          }
      }
  
      @Override
      public void addElements(MgnlElement mgnlElement, Element element) {
  
          if (mgnlElement == null || element == null) {
              return;
          }
          addElement(mgnlElement, element);
  
          for (int i = 0; i < element.getChildCount(); i++) {
              Node childNode = element.getChild(i);
              if (childNode.getNodeType() == Node.ELEMENT_NODE) {
                  Element child = childNode.cast();
                  addElements(mgnlElement, child);
              }
          }
      }
  
      @Override
      public MgnlElement getMgnlElement(Element element) {
          return mgnlElements.get(element);
  
      }
 
     @Override
     public MgnlElement getMgnlElement(AbstractElement element) {
         if (element == null) {
             return null;
         }
 
         for (final MgnlElement mgnlElement : mgnlElements.values()) {
             if (element.equals(mgnlElement.getTypedElement())) {
                 return mgnlElement;
             }
         }
 
         return null;
     }
 
     @Override
     public MgnlPage getRootPage() {
         return rootPage;
     }
 
     @Override
     public void setRootPage(MgnlPage rootPage) {
         this.rootPage = rootPage;
     }
 
     @Override
     public void addRootArea(MgnlArea area) {
         this.rootAreas.add(area);
     }
 
     @Override
     public List<MgnlArea> getRootAreas() {
         return rootAreas;
     }
     @Override
     public void removeMgnlElement(MgnlElement mgnlElement) {
 
         // remove all occurrences of the element
         if (mgnlElements.containsValue(mgnlElement)) {
             while (mgnlElements.values().remove(mgnlElement)) {
                 ;
             }
         }
         elements.remove(mgnlElement);
 
 
         // if the element is a root node, add all children to root list
         if (rootAreas.contains(mgnlElement)) {
             rootAreas.remove(mgnlElement);
             for (MgnlArea childNode : mgnlElement.getAreas()) {
                 rootAreas.add(childNode);
             }
         }
     }
 
     /**
      * Reset the tree, e.g. when browsing inside the page editor.
      */
     @Override
     public void reset() {
         this.rootAreas.forEach(MgnlArea::removeBars);
         this.elements = new HashMap<>();
         this.mgnlElements = new HashMap<>();
         this.rootPage = null;
         this.rootAreas = new LinkedList<>();
         this.moving = false;
     }
 
     @Override
     public boolean isMoving() {
         return moving;
     }
 
     @Override
     public void setMoving(boolean moving) {
         this.moving = moving;
     }
 }