1/* 2 * Copyright (c) 2004, 2012, Oracle and/or its affiliates. All rights reserved. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 4 * 5 * This code is free software; you can redistribute it and/or modify it 6 * under the terms of the GNU General Public License version 2 only, as 7 * published by the Free Software Foundation. Oracle designates this 8 * particular file as subject to the "Classpath" exception as provided 9 * by Oracle in the LICENSE file that accompanied this code. 10 * 11 * This code is distributed in the hope that it will be useful, but WITHOUT 12 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or 13 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License 14 * version 2 for more details (a copy is included in the LICENSE file that 15 * accompanied this code). 16 * 17 * You should have received a copy of the GNU General Public License version 18 * 2 along with this work; if not, write to the Free Software Foundation, 19 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. 20 * 21 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA 22 * or visit www.oracle.com if you need additional information or have any 23 * questions. 24 * 25 * THIS FILE WAS MODIFIED BY SUN MICROSYSTEMS, INC. 26 */ 27 28package com.sun.xml.internal.org.jvnet.fastinfoset; 29 30import java.util.LinkedHashSet; 31import java.util.Set; 32 33/** 34 * A canonical representation of a vocabulary. 35 * <p> 36 * Each vocabulary table is represented as a Set. A vocabulary table entry is 37 * represented as an item in the Set. 38 * <p> 39 * The 1st item contained in a Set is assigned the smallest index value, 40 * n say (where n >= 0). The 2nd item is assigned an index value of n + 1. The kth 41 * item is assigned an index value of n + (k - 1). 42 * <p> 43 * A Fast Infoset parser/serializer implementation will tranform the canonical 44 * representation of a Vocabulary instance into a more optimal form suitable 45 * for the efficient usage according to the API implemented by the parsers and 46 * serialziers. 47 */ 48public class Vocabulary { 49 /** 50 * The restricted alphabet table, containing String objects. 51 */ 52 public final Set restrictedAlphabets = new LinkedHashSet(); 53 54 /** 55 * The encoding algorithm table, containing String objects. 56 */ 57 public final Set encodingAlgorithms = new LinkedHashSet(); 58 59 /** 60 * The prefix table, containing String objects. 61 */ 62 public final Set prefixes = new LinkedHashSet(); 63 64 /** 65 * The namespace name table, containing String objects. 66 */ 67 public final Set namespaceNames = new LinkedHashSet(); 68 69 /** 70 * The local name table, containing String objects. 71 */ 72 public final Set localNames = new LinkedHashSet(); 73 74 /** 75 * The "other NCName" table, containing String objects. 76 */ 77 public final Set otherNCNames = new LinkedHashSet(); 78 79 /** 80 * The "other URI" table, containing String objects. 81 */ 82 public final Set otherURIs = new LinkedHashSet(); 83 84 /** 85 * The "attribute value" table, containing String objects. 86 */ 87 public final Set attributeValues = new LinkedHashSet(); 88 89 /** 90 * The "other string" table, containing String objects. 91 */ 92 public final Set otherStrings = new LinkedHashSet(); 93 94 /** 95 * The "character content chunk" table, containing String objects. 96 */ 97 public final Set characterContentChunks = new LinkedHashSet(); 98 99 /** 100 * The element table, containing QName objects. 101 */ 102 public final Set elements = new LinkedHashSet(); 103 104 /** 105 * The attribute table, containing QName objects. 106 */ 107 public final Set attributes = new LinkedHashSet(); 108} 109