2 * Copyright (c) 2013 Cisco Systems, Inc. and others. All rights reserved.
\r
4 * This program and the accompanying materials are made available under the
\r
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
\r
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
\r
8 package org.opendaylight.yangtools.yang.data.impl;
\r
10 import java.util.ArrayList;
\r
11 import java.util.Collection;
\r
12 import java.util.Collections;
\r
13 import java.util.HashMap;
\r
14 import java.util.List;
\r
15 import java.util.Map;
\r
16 import java.util.Set;
\r
18 import org.opendaylight.yangtools.yang.common.QName;
\r
19 import org.opendaylight.yangtools.yang.data.api.CompositeNode;
\r
20 import org.opendaylight.yangtools.yang.data.api.ModifyAction;
\r
21 import org.opendaylight.yangtools.yang.data.api.MutableCompositeNode;
\r
22 import org.opendaylight.yangtools.yang.data.api.Node;
\r
23 import org.opendaylight.yangtools.yang.data.api.SimpleNode;
\r
26 * @author michal.rehak
\r
29 public class MutableCompositeNodeTOImpl extends AbstractNodeTO<List<Node<?>>> implements MutableCompositeNode {
\r
31 private Map<QName, List<Node<?>>> nodeMap = new HashMap<>();
\r
32 private CompositeNode original;
\r
34 public MutableCompositeNodeTOImpl(QName qname, CompositeNode parent, List<Node<?>> value, ModifyAction modifyAction) {
\r
35 super(qname, parent, value, modifyAction);
\r
40 * update nodeMap - it should be invoked after children was changed
\r
43 public void init() {
\r
44 if (!getChildren().isEmpty()) {
\r
45 nodeMap = NodeUtils.buildNodeMap(getChildren());
\r
50 public List<Node<?>> getChildren() {
\r
51 return getValue() == null ? new ArrayList<Node<?>>() : getValue();
\r
55 public List<Node<?>> setValue(List<Node<?>> value) {
\r
56 List<Node<?>> oldVal = super.setValue(value);
\r
62 public void setModifyAction(ModifyAction action) {
\r
63 super.setModificationAction(action);
\r
66 protected Map<QName, List<Node<?>>> getNodeMap() {
\r
71 public MutableCompositeNode asMutable() {
\r
76 public CompositeNode getOriginal() {
\r
82 * the original to set
\r
84 public void setOriginal(CompositeNode original) {
\r
85 this.original = original;
\r
89 public SimpleNode<?> getFirstSimpleByName(QName leafQName) {
\r
90 List<SimpleNode<?>> list = getSimpleNodesByName(leafQName);
\r
91 if (list.isEmpty()) {
\r
98 public List<CompositeNode> getCompositesByName(QName children) {
\r
99 List<Node<?>> toFilter = getNodeMap().get(children);
\r
100 if (toFilter == null) {
\r
101 return Collections.emptyList();
\r
103 List<CompositeNode> list = new ArrayList<CompositeNode>();
\r
104 for (Node<?> node : toFilter) {
\r
105 if (node instanceof CompositeNode) {
\r
106 list.add((CompositeNode) node);
\r
113 public List<SimpleNode<?>> getSimpleNodesByName(QName children) {
\r
114 List<Node<?>> toFilter = getNodeMap().get(children);
\r
115 if (toFilter == null) {
\r
116 return Collections.emptyList();
\r
118 List<SimpleNode<?>> list = new ArrayList<SimpleNode<?>>();
\r
120 for (Node<?> node : toFilter) {
\r
121 if (node instanceof SimpleNode<?>) {
\r
122 list.add((SimpleNode<?>) node);
\r
129 public CompositeNode getFirstCompositeByName(QName container) {
\r
130 List<CompositeNode> list = getCompositesByName(container);
\r
131 if (list.isEmpty()) {
\r
134 return list.get(0);
\r
139 * @return TODO:: do we need this method?
\r
141 public SimpleNode<?> getFirstLeafByName(QName leaf) {
\r
142 List<SimpleNode<?>> list = getSimpleNodesByName(leaf);
\r
143 if (list.isEmpty()) {
\r
146 return list.get(0);
\r
150 public List<CompositeNode> getCompositesByName(String children) {
\r
151 return getCompositesByName(new QName(getNodeType(), children));
\r
155 public List<SimpleNode<?>> getSimpleNodesByName(String children) {
\r
156 return getSimpleNodesByName(new QName(getNodeType(), children));
\r
160 public String toString() {
\r
161 return super.toString() + ", children.size = " + (getChildren() != null ? getChildren().size() : "n/a");
\r
165 public void clear() {
\r
170 public boolean containsKey(Object key) {
\r
171 return nodeMap.containsKey(key);
\r
175 public boolean containsValue(Object value) {
\r
176 return nodeMap.containsValue(value);
\r
180 public Set<java.util.Map.Entry<QName, List<Node<?>>>> entrySet() {
\r
181 return nodeMap.entrySet();
\r
185 public boolean equals(Object obj) {
\r
186 return super.equals(obj);
\r
190 public int size() {
\r
191 return nodeMap.size();
\r
195 public boolean isEmpty() {
\r
196 return nodeMap.isEmpty();
\r
200 public List<Node<?>> get(Object key) {
\r
201 return nodeMap.get(key);
\r
205 public List<Node<?>> put(QName key, List<Node<?>> value) {
\r
206 return nodeMap.put(key, value);
\r
210 public List<Node<?>> remove(Object key) {
\r
211 return nodeMap.remove(key);
\r
215 public void putAll(Map<? extends QName, ? extends List<Node<?>>> m) {
\r
220 public Set<QName> keySet() {
\r
221 return nodeMap.keySet();
\r
225 public Collection<List<Node<?>>> values() {
\r
226 return nodeMap.values();
\r