View Javadoc
1   /**
2    * This file Copyright (c) 2011-2018 Magnolia International
3    * Ltd.  (http://www.magnolia-cms.com). All rights reserved.
4    *
5    *
6    * This file is dual-licensed under both the Magnolia
7    * Network Agreement and the GNU General Public License.
8    * You may elect to use one or the other of these licenses.
9    *
10   * This file is distributed in the hope that it will be
11   * useful, but AS-IS and WITHOUT ANY WARRANTY; without even the
12   * implied warranty of MERCHANTABILITY or FITNESS FOR A
13   * PARTICULAR PURPOSE, TITLE, or NONINFRINGEMENT.
14   * Redistribution, except as permitted by whichever of the GPL
15   * or MNA you select, is prohibited.
16   *
17   * 1. For the GPL license (GPL), you can redistribute and/or
18   * modify this file under the terms of the GNU General
19   * Public License, Version 3, as published by the Free Software
20   * Foundation.  You should have received a copy of the GNU
21   * General Public License, Version 3 along with this program;
22   * if not, write to the Free Software Foundation, Inc., 51
23   * Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
24   *
25   * 2. For the Magnolia Network Agreement (MNA), this file
26   * and the accompanying materials are made available under the
27   * terms of the MNA which accompanies this distribution, and
28   * is available at http://www.magnolia-cms.com/mna.html
29   *
30   * Any modifications to this file must keep this entire header
31   * intact.
32   *
33   */
34  package info.magnolia.module.delta;
35  
36  import info.magnolia.cms.filters.FilterManager;
37  import info.magnolia.jcr.util.NodeUtil;
38  import info.magnolia.module.InstallContext;
39  
40  import java.util.ArrayList;
41  import java.util.Arrays;
42  import java.util.Collection;
43  import java.util.HashSet;
44  import java.util.List;
45  import java.util.Set;
46  
47  import javax.jcr.Node;
48  import javax.jcr.NodeIterator;
49  import javax.jcr.RepositoryException;
50  
51  /**
52   * Orders a filter <strong>before</strong> a given set of other filters. The filter is placed directly before the first
53   * of the other filters. The other filters can be required or optional, if a required filter isn't present this task
54   * will do nothing and report a warning. If all other filters are optional and none are present this task does nothing.
55   * Does not take nested filter into account.
56   *
57   * @see FilterOrderingTask
58   */
59  public class OrderFilterBeforeTask extends AbstractRepositoryTask {
60  
61      private final String filterToBeOrderedName;
62      private final List<String> requiredFilters;
63      private final List<String> optionalFilters;
64  
65      public OrderFilterBeforeTask(String filterName, String[] filtersAfter) {
66          this(filterName, filtersAfter, new String[]{});
67      }
68  
69      public OrderFilterBeforeTask(String filterName, String[] filtersAfter, String[] optionalFiltersAfter) {
70          this(filterName, "Orders the " + filterName + " filter in the filter chain.", filtersAfter, optionalFiltersAfter);
71      }
72  
73      public OrderFilterBeforeTask(String filterName, String description, String[] requiredFiltersAfter) {
74          this(filterName, description, requiredFiltersAfter, new String[]{});
75      }
76  
77      public OrderFilterBeforeTask(String filterName, String description, String[] requiredFiltersAfter, String[] optionalFiltersAfter) {
78          super("Setup " + filterName + " filter", description);
79          this.filterToBeOrderedName = filterName;
80          this.requiredFilters = new ArrayList<String>(Arrays.asList(requiredFiltersAfter));
81          this.optionalFilters = new ArrayList<String>(Arrays.asList(optionalFiltersAfter));
82      }
83  
84      @Override
85      protected void doExecute(InstallContext ctx) throws RepositoryException, TaskExecutionException {
86          final Node filtersParent = ctx.getConfigJCRSession().getNode(FilterManager.SERVER_FILTERS);
87  
88          if (!filtersParent.hasNode(filterToBeOrderedName)) {
89              throw new TaskExecutionException("Filter with name " + filterToBeOrderedName + " can't be found.");
90          }
91  
92          if (!requiredFilters.isEmpty() && !hasNodes(filtersParent, requiredFilters)) {
93              ctx.warn("Could not sort filter " + filterToBeOrderedName + ". It should be positioned before " + requiredFilters);
94              return;
95          }
96  
97          Set<String> combinedFilterNames = new HashSet<String>();
98          combinedFilterNames.addAll(requiredFilters);
99          combinedFilterNames.addAll(optionalFilters);
100 
101         orderBeforeSiblings(filtersParent.getNode(filterToBeOrderedName), combinedFilterNames);
102     }
103 
104     private void orderBeforeSiblings(Node node, Set<String> siblingNames) throws RepositoryException {
105         Node firstMatch = getFirstChild(node.getParent(), siblingNames);
106         if (firstMatch != null) {
107             NodeUtil.orderBefore(node, firstMatch.getName());
108         }
109     }
110 
111     private Node getFirstChild(Node parentNode, Collection<String> childNames) throws RepositoryException {
112         NodeIterator nodes = parentNode.getNodes();
113         while (nodes.hasNext()) {
114             Node child = nodes.nextNode();
115             if (childNames.contains(child.getName())) {
116                 return child;
117             }
118         }
119         return null;
120     }
121 
122     private boolean hasNodes(Node node, Collection<String> childNames) throws RepositoryException {
123         for (String childName : childNames) {
124             if (!node.hasNode(childName)) {
125                 return false;
126             }
127         }
128         return true;
129     }
130 }