0N/A/*
2362N/A * Copyright (c) 2004, 2011, Oracle and/or its affiliates. All rights reserved.
0N/A * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
0N/A *
0N/A * This code is free software; you can redistribute it and/or modify it
0N/A * under the terms of the GNU General Public License version 2 only, as
2362N/A * published by the Free Software Foundation. Oracle designates this
0N/A * particular file as subject to the "Classpath" exception as provided
2362N/A * by Oracle in the LICENSE file that accompanied this code.
0N/A *
0N/A * This code is distributed in the hope that it will be useful, but WITHOUT
0N/A * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
0N/A * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
0N/A * version 2 for more details (a copy is included in the LICENSE file that
0N/A * accompanied this code).
0N/A *
0N/A * You should have received a copy of the GNU General Public License version
0N/A * 2 along with this work; if not, write to the Free Software Foundation,
0N/A * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
0N/A *
2362N/A * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
2362N/A * or visit www.oracle.com if you need additional information or have any
2362N/A * questions.
0N/A *
0N/A * THIS FILE WAS MODIFIED BY SUN MICROSYSTEMS, INC.
0N/A */
0N/A
0N/Apackage com.sun.xml.internal.org.jvnet.fastinfoset;
0N/A
0N/Aimport java.util.LinkedHashSet;
0N/Aimport java.util.Set;
0N/A
0N/A/**
0N/A * A canonical representation of a vocabulary.
0N/A * <p>
0N/A * Each vocabulary table is represented as a Set. A vocabulary table entry is
0N/A * represented as an item in the Set.
0N/A * <p>
0N/A * The 1st item contained in a Set is assigned the smallest index value,
* n say (where n >= 0). The 2nd item is assigned an index value of n + 1. The kth
* item is assigned an index value of n + (k - 1).
* <p>
* A Fast Infoset parser/serializer implementation will tranform the canonical
* representation of a Vocabulary instance into a more optimal form suitable
* for the efficient usage according to the API implemented by the parsers and
* serialziers.
*/
public class Vocabulary {
/**
* The restricted alphabet table, containing String objects.
*/
public final Set restrictedAlphabets = new LinkedHashSet();
/**
* The encoding algorithm table, containing String objects.
*/
public final Set encodingAlgorithms = new LinkedHashSet();
/**
* The prefix table, containing String objects.
*/
public final Set prefixes = new LinkedHashSet();
/**
* The namespace name table, containing String objects.
*/
public final Set namespaceNames = new LinkedHashSet();
/**
* The local name table, containing String objects.
*/
public final Set localNames = new LinkedHashSet();
/**
* The "other NCName" table, containing String objects.
*/
public final Set otherNCNames = new LinkedHashSet();
/**
* The "other URI" table, containing String objects.
*/
public final Set otherURIs = new LinkedHashSet();
/**
* The "attribute value" table, containing String objects.
*/
public final Set attributeValues = new LinkedHashSet();
/**
* The "other string" table, containing String objects.
*/
public final Set otherStrings = new LinkedHashSet();
/**
* The "character content chunk" table, containing String objects.
*/
public final Set characterContentChunks = new LinkedHashSet();
/**
* The element table, containing QName objects.
*/
public final Set elements = new LinkedHashSet();
/**
* The attribute table, containing QName objects.
*/
public final Set attributes = new LinkedHashSet();
}