org.jvnet.fastinfoset.Vocabulary Maven / Gradle / Ivy
/*
* Fast Infoset ver. 0.1 software ("Software")
*
* Copyright, 2004-2005 Sun Microsystems, Inc. All Rights Reserved.
*
* Software is licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License. You may
* obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
* WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
* License for the specific language governing permissions and limitations.
*
* Sun supports and benefits from the global community of open source
* developers, and thanks the community for its important contributions and
* open standards-based technology, which Sun has adopted into many of its
* products.
*
* Please note that portions of Software may be provided with notices and
* open source licenses from such communities and third parties that govern the
* use of those portions, and any licenses granted hereunder do not alter any
* rights and obligations you may have under such open source licenses,
* however, the disclaimer of warranty and limitation of liability provisions
* in this License will apply to all Software in this distribution.
*
* You acknowledge that the Software is not designed, licensed or intended
* for use in the design, construction, operation or maintenance of any nuclear
* facility.
*
* Apache License
* Version 2.0, January 2004
* http://www.apache.org/licenses/
*
*/
package org.jvnet.fastinfoset;
import java.util.LinkedHashSet;
import java.util.Set;
import javax.xml.namespace.QName;
/**
* A canonical representation of a vocabulary.
*
* Each vocabulary table is represented as a Set. A vocabulary table entry is
* represented as an item in the Set.
*
* 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).
*
* 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();
}