2 * Copyright (c) 2015 Cisco Systems, Inc. and others. All rights reserved.
4 * This program and the accompanying materials are made available under the
5 * terms of the Eclipse Public License v1.0 which accompanies this distribution,
6 * and is available at http://www.eclipse.org/legal/epl-v10.html
8 package org.opendaylight.yangtools.yang.parser.rfc7950.stmt;
10 import static java.util.Objects.requireNonNull;
12 import com.google.common.collect.ImmutableMap;
13 import com.google.common.collect.ImmutableSet;
14 import java.util.HashSet;
15 import java.util.LinkedHashMap;
16 import java.util.LinkedHashSet;
18 import java.util.Optional;
20 import org.opendaylight.yangtools.yang.common.QName;
21 import org.opendaylight.yangtools.yang.model.api.DataNodeContainer;
22 import org.opendaylight.yangtools.yang.model.api.DataSchemaNode;
23 import org.opendaylight.yangtools.yang.model.api.GroupingDefinition;
24 import org.opendaylight.yangtools.yang.model.api.TypeDefinition;
25 import org.opendaylight.yangtools.yang.model.api.UsesNode;
26 import org.opendaylight.yangtools.yang.model.api.meta.DeclaredStatement;
27 import org.opendaylight.yangtools.yang.model.api.meta.EffectiveStatement;
28 import org.opendaylight.yangtools.yang.model.api.stmt.TypedefEffectiveStatement;
29 import org.opendaylight.yangtools.yang.parser.spi.meta.StmtContext;
31 public abstract class AbstractEffectiveDocumentedDataNodeContainer<A, D extends DeclaredStatement<A>>
32 extends AbstractSchemaEffectiveDocumentedNode<A, D> implements DataNodeContainer {
34 private final ImmutableMap<QName, DataSchemaNode> childNodes;
35 private final ImmutableSet<GroupingDefinition> groupings;
36 private final ImmutableSet<UsesNode> uses;
37 private final ImmutableSet<TypeDefinition<?>> typeDefinitions;
38 private final ImmutableSet<DataSchemaNode> publicChildNodes;
40 protected AbstractEffectiveDocumentedDataNodeContainer(final StmtContext<A, D, ?> ctx) {
43 Map<QName, DataSchemaNode> mutableChildNodes = new LinkedHashMap<>();
44 Set<GroupingDefinition> mutableGroupings = new HashSet<>();
45 Set<UsesNode> mutableUses = new HashSet<>();
46 Set<TypeDefinition<?>> mutableTypeDefinitions = new LinkedHashSet<>();
47 Set<DataSchemaNode> mutablePublicChildNodes = new LinkedHashSet<>();
49 for (EffectiveStatement<?, ?> stmt : effectiveSubstatements()) {
50 if (stmt instanceof DataSchemaNode) {
51 final DataSchemaNode dataSchemaNode = (DataSchemaNode) stmt;
52 if (mutableChildNodes.containsKey(dataSchemaNode.getQName())) {
53 throw EffectiveStmtUtils.createNameCollisionSourceException(ctx, stmt);
56 mutableChildNodes.put(dataSchemaNode.getQName(), dataSchemaNode);
57 mutablePublicChildNodes.add(dataSchemaNode);
59 if (stmt instanceof UsesNode) {
60 UsesNode usesNode = (UsesNode) stmt;
61 if (!mutableUses.contains(usesNode)) {
62 mutableUses.add(usesNode);
64 throw EffectiveStmtUtils.createNameCollisionSourceException(ctx, stmt);
67 if (stmt instanceof TypedefEffectiveStatement) {
68 TypedefEffectiveStatement typeDef = (TypedefEffectiveStatement) stmt;
69 TypeDefinition<?> type = typeDef.getTypeDefinition();
70 if (!mutableTypeDefinitions.contains(type)) {
71 mutableTypeDefinitions.add(type);
73 throw EffectiveStmtUtils.createNameCollisionSourceException(ctx, stmt);
76 if (stmt instanceof GroupingDefinition) {
77 GroupingDefinition grp = (GroupingDefinition) stmt;
78 if (!mutableGroupings.contains(grp)) {
79 mutableGroupings.add(grp);
81 throw EffectiveStmtUtils.createNameCollisionSourceException(ctx, stmt);
86 this.childNodes = ImmutableMap.copyOf(mutableChildNodes);
87 this.groupings = ImmutableSet.copyOf(mutableGroupings);
88 this.publicChildNodes = ImmutableSet.copyOf(mutablePublicChildNodes);
89 this.typeDefinitions = ImmutableSet.copyOf(mutableTypeDefinitions);
90 this.uses = ImmutableSet.copyOf(mutableUses);
94 public final Set<TypeDefinition<?>> getTypeDefinitions() {
95 return typeDefinitions;
99 public final Set<DataSchemaNode> getChildNodes() {
100 return publicChildNodes;
104 public final Set<GroupingDefinition> getGroupings() {
109 public final Optional<DataSchemaNode> findDataChildByName(final QName name) {
110 // Child nodes are keyed by their container name, so we can do a direct lookup
111 return Optional.ofNullable(childNodes.get(requireNonNull(name)));
115 public Set<UsesNode> getUses() {