blob: 68ae2e5c9d23cc9d0242706ee4cc6216b3173bbd [file] [log] [blame]
/*
* Copyright 2005-2006 Sun Microsystems, Inc. All Rights Reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Sun designates this
* particular file as subject to the "Classpath" exception as provided
* by Sun in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
* CA 95054 USA or visit www.sun.com if you need additional information or
* have any questions.
*/
package com.sun.tools.internal.xjc.reader.dtd;
import java.util.LinkedHashSet;
import java.util.Set;
/**
* @author Kohsuke Kawaguchi
*/
final class Block {
final boolean isOptional;
final boolean isRepeated;
/**
* {@link Element}s that belong to this block.
* <p>
* We want to preserve the order they are added, but we don't want
* dupliates.
*/
final Set<Element> elements = new LinkedHashSet<Element>();
Block(boolean optional, boolean repeated) {
isOptional = optional;
isRepeated = repeated;
}
}