View Javadoc
1   /**
2    * This file Copyright (c) 2012-2015 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.jcr.node2bean.impl;
35  
36  import info.magnolia.jcr.node2bean.TransformationState;
37  import info.magnolia.jcr.node2bean.TypeDescriptor;
38  
39  import javax.inject.Singleton;
40  import javax.jcr.Node;
41  
42  import org.apache.commons.collections4.ArrayStack;
43  
44  /**
45   * Transformation state implementation. Contains stacks of info for the types, beans and the content.
46   */
47  @Singleton
48  public class TransformationStateImpl implements TransformationState {
49  
50      protected ArrayStack typeStack = new ArrayStack();
51  
52      protected ArrayStack beanStack = new ArrayStack();
53  
54      protected ArrayStack nodeStack = new ArrayStack();
55  
56      @Override
57      public Object getCurrentBean() {
58          return beanStack.peek();
59      }
60  
61      @Override
62      public void setCurrentBean(Object bean) {
63          beanStack.set(beanStack.size() - 1, bean);
64      }
65  
66      @Override
67      public TypeDescriptor getCurrentType() {
68          return (TypeDescriptor) typeStack.peek();
69      }
70  
71      @Override
72      public Node getCurrentNode() {
73          return (Node) nodeStack.peek();
74      }
75  
76      @Override
77      public Object peekBean(int pos) {
78          return beanStack.peek(pos);
79      }
80  
81      @Override
82      public TypeDescriptor peekType(int pos) {
83          return (TypeDescriptor) typeStack.peek(pos);
84      }
85  
86      @Override
87      public Node peekNode(int pos) {
88          return (Node) nodeStack.peek(pos);
89      }
90  
91      @Override
92      public void popBean() {
93          beanStack.pop();
94      }
95  
96      @Override
97      public void popType() {
98          typeStack.pop();
99      }
100 
101     @Override
102     public void popNode() {
103         nodeStack.pop();
104     }
105 
106     @Override
107     public void pushBean(Object bean) {
108         beanStack.push(bean);
109     }
110 
111     @Override
112     public void pushType(TypeDescriptor type) {
113         typeStack.push(type);
114     }
115 
116     @Override
117     public void pushNode(Node node) {
118         nodeStack.push(node);
119     }
120 
121     @Override
122     public int getLevel() {
123         return Math.max(Math.max(typeStack.size(), beanStack.size()), nodeStack.size());
124     }
125 }