containsKey
- * method.
- */
- public boolean contains(Object value) {
-
- if (value == null) throw new NullPointerException();
-
- int i;
- HashtableEntry e;
- HashtableEntry tab[] = table;
-
- for (i = tab.length ; i-- > 0 ;) {
- for (e = tab[i] ; e != null ; e = e.next) {
- if (e.value.equals(value)) {
- return true;
- }
- }
- }
- return false;
- }
-
- /**
- * Tests if the specified object is a key in this hashtable.
- */
- public boolean containsKey(Object key) {
- HashtableEntry e;
- HashtableEntry tab[] = table;
- int hash = key.hashCode();
- int index = (hash & 0x7FFFFFFF) % tab.length;
-
- for (e = tab[index] ; e != null ; e = e.next)
- if ((e.hash == hash) && e.key.equals(key))
- return true;
-
- return false;
- }
-
- /**
- * Returns the value to which the specified key is mapped in this hashtable.
- */
- public Object get(Object key) {
- HashtableEntry e;
- HashtableEntry tab[] = table;
- int hash = key.hashCode();
- int index = (hash & 0x7FFFFFFF) % tab.length;
-
- for (e = tab[index] ; e != null ; e = e.next)
- if ((e.hash == hash) && e.key.equals(key))
- return e.value;
-
- return null;
- }
-
- /**
- * Rehashes the contents of the hashtable into a hashtable with a
- * larger capacity. This method is called automatically when the
- * number of keys in the hashtable exceeds this hashtable's capacity
- * and load factor.
- */
- protected void rehash() {
- HashtableEntry e, old;
- int i, index;
- int oldCapacity = table.length;
- HashtableEntry oldTable[] = table;
-
- int newCapacity = oldCapacity * 2 + 1;
- HashtableEntry newTable[] = new HashtableEntry[newCapacity];
-
- threshold = (int)(newCapacity * loadFactor);
- table = newTable;
-
- for (i = oldCapacity ; i-- > 0 ;) {
- for (old = oldTable[i] ; old != null ; ) {
- e = old;
- old = old.next;
- index = (e.hash & 0x7FFFFFFF) % newCapacity;
- e.next = newTable[index];
- newTable[index] = e;
- }
- }
- }
-
- /**
- * Maps the specified key to the specified
- * value in this hashtable. Neither the key nor the
- * value can be null.
- *
- * The value can be retrieved by calling the get method
- * with a key that is equal to the original key.
- */
- public Object put(Object key, Object value) {
- // Make sure the value is not null
- if (value == null) throw new NullPointerException();
-
- // Makes sure the key is not already in the hashtable.
- HashtableEntry e;
- HashtableEntry tab[] = table;
- int hash = key.hashCode();
- int index = (hash & 0x7FFFFFFF) % tab.length;
-
- for (e = tab[index] ; e != null ; e = e.next) {
- if ((e.hash == hash) && e.key.equals(key)) {
- Object old = e.value;
- e.value = value;
- return old;
- }
- }
-
- // Rehash the table if the threshold is exceeded
- if (count >= threshold) {
- rehash();
- return put(key, value);
- }
-
- // Creates the new entry.
- e = new HashtableEntry();
- e.hash = hash;
- e.key = key;
- e.value = value;
- e.next = tab[index];
- tab[index] = e;
- count++;
- return null;
- }
-
- /**
- * Removes the key (and its corresponding value) from this
- * hashtable. This method does nothing if the key is not in the hashtable.
- */
- public Object remove(Object key) {
- HashtableEntry e, prev;
- HashtableEntry tab[] = table;
- int hash = key.hashCode();
- int index = (hash & 0x7FFFFFFF) % tab.length;
- for (e = tab[index], prev = null ; e != null ; prev = e, e = e.next) {
- if ((e.hash == hash) && e.key.equals(key)) {
- if (prev != null)
- prev.next = e.next;
- else
- tab[index] = e.next;
- count--;
- return e.value;
- }
- }
- return null;
- }
-
- /**
- * Clears this hashtable so that it contains no keys.
- */
- public void clear() {
- HashtableEntry tab[] = table;
- for (int index = tab.length; --index >= 0; )
- tab[index] = null;
- count = 0;
- }
-
- /**
- * Returns a rather long string representation of this hashtable.
- * Handy for debugging - leave it here!!!
- */
- public String toString() {
- int i;
- int max = size() - 1;
- StringBuffer buf = new StringBuffer();
- Enumeration k = keys();
- Enumeration e = elements();
- buf.append("{");
-
- for (i = 0; i <= max; i++) {
- String s1 = k.nextElement().toString();
- String s2 = e.nextElement().toString();
- buf.append(s1).append('=').append(s2);
- if (i < max) buf.append(", ");
- }
- buf.append("}");
- return buf.toString();
- }
-
- /**
- * A hashtable enumerator class. This class should remain opaque
- * to the client. It will use the Enumeration interface.
- */
- class HashtableEnumerator implements Enumeration {
- boolean keys;
- int index;
- HashtableEntry table[];
- HashtableEntry entry;
-
- HashtableEnumerator(HashtableEntry table[], boolean keys) {
- this.table = table;
- this.keys = keys;
- this.index = table.length;
- }
-
- public boolean hasMoreElements() {
- if (entry != null) {
- return true;
- }
- while (index-- > 0) {
- if ((entry = table[index]) != null) {
- return true;
- }
- }
- return false;
- }
-
- public Object nextElement() {
- if (entry == null) {
- while ((index-- > 0) && ((entry = table[index]) == null));
- }
- if (entry != null) {
- HashtableEntry e = entry;
- entry = e.next;
- return keys ? e.key : e.value;
- }
- return null;
- }
- }
-
-}
diff -r 35dc0af3c933 -r 7fb0bb6f3bd0 src/com/sun/org/apache/xerces/internal/util/PrimeNumberSequenceGenerator.java
--- /dev/null Thu Jan 01 00:00:00 1970 +0000
+++ b/src/com/sun/org/apache/xerces/internal/util/PrimeNumberSequenceGenerator.java Tue Apr 28 16:07:40 2015 +0300
@@ -0,0 +1,45 @@
+/*
+ * Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
+ */
+/*
+ * Licensed to the Apache Software Foundation (ASF) under one or more
+ * contributor license agreements. See the NOTICE file distributed with
+ * this work for additional information regarding copyright ownership.
+ * The ASF licenses this file to You 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 under the License.
+ */
+package com.sun.org.apache.xerces.internal.util;
+
+import java.util.Random;
+
+ /**
+ * Fills an array with a random sequence of prime numbers.
+ */
+final class PrimeNumberSequenceGenerator {
+
+ private static final int [] PRIMES = {
+ 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59,
+ 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137,
+ 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227,
+ 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313,
+ 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419,
+ 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509,
+ 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617,
+ 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727};
+
+ static void generateSequence(int[] arrayToFill) {
+ Random r = new Random();
+ for (int i = 0; i < arrayToFill.length; i++) {
+ arrayToFill[i] = PRIMES[r.nextInt(PRIMES.length)];
+ }
+ }
+}
diff -r 35dc0af3c933 -r 7fb0bb6f3bd0 src/com/sun/org/apache/xerces/internal/util/TypeInfoImpl.java
--- a/src/com/sun/org/apache/xerces/internal/util/TypeInfoImpl.java Tue Apr 28 15:04:23 2015 +0300
+++ /dev/null Thu Jan 01 00:00:00 1970 +0000
@@ -1,134 +0,0 @@
-/*
- * reserved comment block
- * DO NOT REMOVE OR ALTER!
- */
-/*
- * The Apache Software License, Version 1.1
- *
- *
- * Copyright (c) 2000-2002 The Apache Software Foundation. All rights
- * reserved.
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- *
- * 1. Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- *
- * 2. Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in
- * the documentation and/or other materials provided with the
- * distribution.
- *
- * 3. The end-user documentation included with the redistribution,
- * if any, must include the following acknowledgment:
- * "This product includes software developed by the
- * Apache Software Foundation (http://www.apache.org/)."
- * Alternately, this acknowledgment may appear in the software itself,
- * if and wherever such third-party acknowledgments normally appear.
- *
- * 4. The names "Xerces" and "Apache Software Foundation" must
- * not be used to endorse or promote products derived from this
- * software without prior written permission. For written
- * permission, please contact apache@apache.org.
- *
- * 5. Products derived from this software may not be called "Apache",
- * nor may "Apache" appear in their name, without prior written
- * permission of the Apache Software Foundation.
- *
- * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
- * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
- * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
- * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
- * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
- * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
- * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
- * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
- * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
- * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
- * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
- * SUCH DAMAGE.
- * ====================================================================
- *
- * This software consists of voluntary contributions made by many
- * individuals on behalf of the Apache Software Foundation and was
- * originally based on software copyright (c) 1999, International
- * Business Machines, Inc., http://www.apache.org. For more
- * information on the Apache Software Foundation, please see
- *
- * This class is immutable. - * - * @author - * Kohsuke Kawaguchi (kohsuke.kawaguchi@sun.com) - */ -public class TypeInfoImpl implements TypeInfo { - - private final String typeNamespace; - private final String typeName; - private final static String dtdNamespaceURI = "http://www.w3.org/TR/REC-xml"; - public TypeInfoImpl(){ - typeNamespace = null; - typeName = null; - } - public TypeInfoImpl(String typeNamespace, String typeName) { - this.typeNamespace = typeNamespace; - this.typeName = typeName; - } - - public TypeInfoImpl(XSTypeDefinition t) { - this( t.getNamespace(), t.getName() ); - } - - public String getTypeName() { - return typeName; - } - - public String getTypeNamespace() { - return typeNamespace; - } - - /** - * Always returns false. - */ - public boolean isDerivedFrom(String typeNamespaceArg, String typeNameArg, int derivationMethod) { - return false; - } - - /** - * Map from DTD type name ({@link String}) to {@link TypeInfo}. - */ - private static final Hashtable dtdCache = new Hashtable(); - - /** - * Obtains a {@link TypeInfo} object from the DTD type name. - *
- * Since DTD has a very limited type names, we can actually
- * cache the {@link TypeInfo} objects.
- */
- public static TypeInfo getDTDTypeInfo( String name ) {
- TypeInfo t = (TypeInfo)dtdCache.get(name);
- if(t==null) throw new IllegalArgumentException("Unknown DTD datatype "+name);
- return t;
- }
-
- static {
- String[] typeNames = new String[]{
- "CDATA", "ID", "IDREF", "IDREFS", "NMTOKEN", "NMTOKENS",
- "ENTITY", "ENTITIES", "NOTATION"};
- for( int i=0; i
ISSUE: For testing purposes, I've extended NamespaceSupport even - * though I'm completely reasserting all behaviors and fields. - * Wasteful.... But SAX did not put an interface under that object and - * we seem to have written that SAX class into our APIs... and I don't - * want to argue with it right now.
- * - * @see org.xml.sax.helpers.NamespaceSupport - * */ -public class NamespaceSupport2 - extends org.xml.sax.helpers.NamespaceSupport -{ - //////////////////////////////////////////////////////////////////// - // Internal state. - //////////////////////////////////////////////////////////////////// - - private Context2 currentContext; // Current point on the double-linked stack - - - //////////////////////////////////////////////////////////////////// - // Constants. - //////////////////////////////////////////////////////////////////// - - - /** - * The XML Namespace as a constant. - * - *This is the Namespace URI that is automatically mapped - * to the "xml" prefix.
- */ - public final static String XMLNS = - "http://www.w3.org/XML/1998/namespace"; - - - //////////////////////////////////////////////////////////////////// - // Constructor. - //////////////////////////////////////////////////////////////////// - - - /** - * Create a new Namespace support object. - */ - public NamespaceSupport2 () - { - reset(); - } - - - //////////////////////////////////////////////////////////////////// - // Context management. - //////////////////////////////////////////////////////////////////// - - - /** - * Reset this Namespace support object for reuse. - * - *It is necessary to invoke this method before reusing the - * Namespace support object for a new session.
- */ - public void reset () - { - // Discarding the whole stack doesn't save us a lot versus - // creating a new NamespaceSupport. Do we care, or should we - // change this to just reset the root context? - currentContext = new Context2(null); - currentContext.declarePrefix("xml", XMLNS); - } - - - /** - * Start a new Namespace context. - * - *Normally, you should push a new context at the beginning - * of each XML element: the new context will automatically inherit - * the declarations of its parent context, but it will also keep - * track of which declarations were made within this context.
- * - *The Namespace support object always starts with a base context - * already in force: in this context, only the "xml" prefix is - * declared.
- * - * @see #popContext - */ - public void pushContext () - { - // JJK: Context has a parent pointer. - // That means we don't need a stack to pop. - // We may want to retain for reuse, but that can be done via - // a child pointer. - - Context2 parentContext=currentContext; - currentContext = parentContext.getChild(); - if (currentContext == null){ - currentContext = new Context2(parentContext); - } - else{ - // JJK: This will wipe out any leftover data - // if we're reusing a previously allocated Context. - currentContext.setParent(parentContext); - } - } - - - /** - * Revert to the previous Namespace context. - * - *Normally, you should pop the context at the end of each - * XML element. After popping the context, all Namespace prefix - * mappings that were previously in force are restored.
- * - *You must not attempt to declare additional Namespace - * prefixes after popping a context, unless you push another - * context first.
- * - * @see #pushContext - */ - public void popContext () - { - Context2 parentContext=currentContext.getParent(); - if(parentContext==null) - throw new EmptyStackException(); - else - currentContext = parentContext; - } - - - - //////////////////////////////////////////////////////////////////// - // Operations within a context. - //////////////////////////////////////////////////////////////////// - - - /** - * Declare a Namespace prefix. - * - *This method declares a prefix in the current Namespace - * context; the prefix will remain in force until this context - * is popped, unless it is shadowed in a descendant context.
- * - *To declare a default Namespace, use the empty string. The - * prefix must not be "xml" or "xmlns".
- * - *Note that you must not declare a prefix after - * you've pushed and popped another Namespace.
- * - *Note that there is an asymmetry in this library: while {@link - * #getPrefix getPrefix} will not return the default "" prefix, - * even if you have declared one; to check for a default prefix, - * you have to look it up explicitly using {@link #getURI getURI}. - * This asymmetry exists to make it easier to look up prefixes - * for attribute names, where the default prefix is not allowed.
- * - * @param prefix The prefix to declare, or null for the empty - * string. - * @param uri The Namespace URI to associate with the prefix. - * @return true if the prefix was legal, false otherwise - * @see #processName - * @see #getURI - * @see #getPrefix - */ - public boolean declarePrefix (String prefix, String uri) - { - if (prefix.equals("xml") || prefix.equals("xmlns")) { - return false; - } else { - currentContext.declarePrefix(prefix, uri); - return true; - } - } - - - /** - * Process a raw XML 1.0 name. - * - *This method processes a raw XML 1.0 name in the current - * context by removing the prefix and looking it up among the - * prefixes currently declared. The return value will be the - * array supplied by the caller, filled in as follows:
- * - *All of the strings in the array will be internalized. If - * the raw name has a prefix that has not been declared, then - * the return value will be null.
- * - *Note that attribute names are processed differently than - * element names: an unprefixed element name will received the - * default Namespace (if any), while an unprefixed element name - * will not.
- * - * @param qName The raw XML 1.0 name to be processed. - * @param parts A string array supplied by the caller, capable of - * holding at least three members. - * @param isAttribute A flag indicating whether this is an - * attribute name (true) or an element name (false). - * @return The supplied array holding three internalized strings - * representing the Namespace URI (or empty string), the - * local name, and the raw XML 1.0 name; or null if there - * is an undeclared prefix. - * @see #declarePrefix - * @see java.lang.String#intern */ - public String [] processName (String qName, String[] parts, - boolean isAttribute) - { - String[] name=currentContext.processName(qName, isAttribute); - if(name==null) - return null; - - // JJK: This recopying is required because processName may return - // a cached result. I Don't Like It. ***** - System.arraycopy(name,0,parts,0,3); - return parts; - } - - - /** - * Look up a prefix and get the currently-mapped Namespace URI. - * - *This method looks up the prefix in the current context. - * Use the empty string ("") for the default Namespace.
- * - * @param prefix The prefix to look up. - * @return The associated Namespace URI, or null if the prefix - * is undeclared in this context. - * @see #getPrefix - * @see #getPrefixes - */ - public String getURI (String prefix) - { - return currentContext.getURI(prefix); - } - - - /** - * Return an enumeration of all prefixes currently declared. - * - *Note: if there is a default prefix, it will not be - * returned in this enumeration; check for the default prefix - * using the {@link #getURI getURI} with an argument of "".
- * - * @return An enumeration of all prefixes declared in the - * current context except for the empty (default) - * prefix. - * @see #getDeclaredPrefixes - * @see #getURI - */ - public Enumeration getPrefixes () - { - return currentContext.getPrefixes(); - } - - - /** - * Return one of the prefixes mapped to a Namespace URI. - * - *If more than one prefix is currently mapped to the same - * URI, this method will make an arbitrary selection; if you - * want all of the prefixes, use the {@link #getPrefixes} - * method instead.
- * - *Note: this will never return the empty - * (default) prefix; to check for a default prefix, use the {@link - * #getURI getURI} method with an argument of "".
- * - * @param uri The Namespace URI. - * @return One of the prefixes currently mapped to the URI supplied, - * or null if none is mapped or if the URI is assigned to - * the default Namespace. - * @see #getPrefixes(java.lang.String) - * @see #getURI */ - public String getPrefix (String uri) - { - return currentContext.getPrefix(uri); - } - - - /** - * Return an enumeration of all prefixes currently declared for a URI. - * - *This method returns prefixes mapped to a specific Namespace - * URI. The xml: prefix will be included. If you want only one - * prefix that's mapped to the Namespace URI, and you don't care - * which one you get, use the {@link #getPrefix getPrefix} - * method instead.
- * - *Note: the empty (default) prefix is - * never included in this enumeration; to check for the - * presence of a default Namespace, use the {@link #getURI getURI} - * method with an argument of "".
- * - * @param uri The Namespace URI. - * @return An enumeration of all prefixes declared in the - * current context. - * @see #getPrefix - * @see #getDeclaredPrefixes - * @see #getURI */ - public Enumeration getPrefixes (String uri) - { - // JJK: The old code involved creating a vector, filling it - // with all the matching prefixes, and then getting its - // elements enumerator. Wastes storage, wastes cycles if we - // don't actually need them all. Better to either implement - // a specific enumerator for these prefixes... or a filter - // around the all-prefixes enumerator, which comes out to - // roughly the same thing. - // - // **** Currently a filter. That may not be most efficient - // when I'm done restructuring storage! - return new PrefixForUriEnumerator(this,uri,getPrefixes()); - } - - - /** - * Return an enumeration of all prefixes declared in this context. - * - *The empty (default) prefix will be included in this - * enumeration; note that this behaviour differs from that of - * {@link #getPrefix} and {@link #getPrefixes}.
- * - * @return An enumeration of all prefixes declared in this - * context. - * @see #getPrefixes - * @see #getURI - */ - public Enumeration getDeclaredPrefixes () - { - return currentContext.getDeclaredPrefixes(); - } - - - -} - -//////////////////////////////////////////////////////////////////// -// Local classes. -// These were _internal_ classes... but in fact they don't have to be, -// and may be more efficient if they aren't. -//////////////////////////////////////////////////////////////////// - -/** - * Implementation of Enumeration filter, wrapped - * aroung the get-all-prefixes version of the operation. This is NOT - * necessarily the most efficient approach; finding the URI and then asking - * what prefixes apply to it might make much more sense. - */ -class PrefixForUriEnumerator implements Enumeration -{ - private Enumeration allPrefixes; - private String uri; - private String lookahead=null; - private NamespaceSupport2 nsup; - - // Kluge: Since one can't do a constructor on an - // anonymous class (as far as I know)... - PrefixForUriEnumerator(NamespaceSupport2 nsup,String uri, Enumeration allPrefixes) - { - this.nsup=nsup; - this.uri=uri; - this.allPrefixes=allPrefixes; - } - - public boolean hasMoreElements() - { - if(lookahead!=null) - return true; - - while(allPrefixes.hasMoreElements()) - { - String prefix=(String)allPrefixes.nextElement(); - if(uri.equals(nsup.getURI(prefix))) - { - lookahead=prefix; - return true; - } - } - return false; - } - - public Object nextElement() - { - if(hasMoreElements()) - { - String tmp=lookahead; - lookahead=null; - return tmp; - } - else - throw new java.util.NoSuchElementException(); - } -} - -/** - * Internal class for a single Namespace context. - * - *This module caches and reuses Namespace contexts, so the number allocated - * will be equal to the element depth of the document, not to the total - * number of elements (i.e. 5-10 rather than tens of thousands).
- */ -final class Context2 { - - //////////////////////////////////////////////////////////////// - // Manefest Constants - //////////////////////////////////////////////////////////////// - - /** - * An empty enumeration. - */ - private final static Enumeration EMPTY_ENUMERATION = - new Vector().elements(); - - //////////////////////////////////////////////////////////////// - // Protected state. - //////////////////////////////////////////////////////////////// - - Hashtable prefixTable; - Hashtable uriTable; - Hashtable elementNameTable; - Hashtable attributeNameTable; - String defaultNS = null; - - //////////////////////////////////////////////////////////////// - // Internal state. - //////////////////////////////////////////////////////////////// - - private Vector declarations = null; - private boolean tablesDirty = false; - private Context2 parent = null; - private Context2 child = null; - - /** - * Create a new Namespace context. - */ - Context2 (Context2 parent) - { - if(parent==null) - { - prefixTable = new Hashtable(); - uriTable = new Hashtable(); - elementNameTable=null; - attributeNameTable=null; - } - else - setParent(parent); - } - - - /** - * @returns The child Namespace context object, or null if this - * is the last currently on the chain. - */ - Context2 getChild() - { - return child; - } - - /** - * @returns The parent Namespace context object, or null if this - * is the root. - */ - Context2 getParent() - { - return parent; - } - - /** - * (Re)set the parent of this Namespace context. - * This is separate from the c'tor because it's re-applied - * when a Context2 is reused by push-after-pop. - * - * @param parent The parent Namespace context object. - */ - void setParent (Context2 parent) - { - this.parent = parent; - parent.child = this; // JJK: Doubly-linked - declarations = null; - prefixTable = parent.prefixTable; - uriTable = parent.uriTable; - elementNameTable = parent.elementNameTable; - attributeNameTable = parent.attributeNameTable; - defaultNS = parent.defaultNS; - tablesDirty = false; - } - - - /** - * Declare a Namespace prefix for this context. - * - * @param prefix The prefix to declare. - * @param uri The associated Namespace URI. - * @see org.xml.sax.helpers.NamespaceSupport2#declarePrefix - */ - void declarePrefix (String prefix, String uri) - { - // Lazy processing... - if (!tablesDirty) { - copyTables(); - } - if (declarations == null) { - declarations = new Vector(); - } - - prefix = prefix.intern(); - uri = uri.intern(); - if ("".equals(prefix)) { - if ("".equals(uri)) { - defaultNS = null; - } else { - defaultNS = uri; - } - } else { - prefixTable.put(prefix, uri); - uriTable.put(uri, prefix); // may wipe out another prefix - } - declarations.addElement(prefix); - } - - - /** - * Process a raw XML 1.0 name in this context. - * - * @param qName The raw XML 1.0 name. - * @param isAttribute true if this is an attribute name. - * @return An array of three strings containing the - * URI part (or empty string), the local part, - * and the raw name, all internalized, or null - * if there is an undeclared prefix. - * @see org.xml.sax.helpers.NamespaceSupport2#processName - */ - String [] processName (String qName, boolean isAttribute) - { - String name[]; - Hashtable table; - - // Select the appropriate table. - if (isAttribute) { - if(elementNameTable==null) - elementNameTable=new Hashtable(); - table = elementNameTable; - } else { - if(attributeNameTable==null) - attributeNameTable=new Hashtable(); - table = attributeNameTable; - } - - // Start by looking in the cache, and - // return immediately if the name - // is already known in this content - name = (String[])table.get(qName); - if (name != null) { - return name; - } - - // We haven't seen this name in this - // context before. - name = new String[3]; - int index = qName.indexOf(':'); - - - // No prefix. - if (index == -1) { - if (isAttribute || defaultNS == null) { - name[0] = ""; - } else { - name[0] = defaultNS; - } - name[1] = qName.intern(); - name[2] = name[1]; - } - - // Prefix - else { - String prefix = qName.substring(0, index); - String local = qName.substring(index+1); - String uri; - if ("".equals(prefix)) { - uri = defaultNS; - } else { - uri = (String)prefixTable.get(prefix); - } - if (uri == null) { - return null; - } - name[0] = uri; - name[1] = local.intern(); - name[2] = qName.intern(); - } - - // Save in the cache for future use. - table.put(name[2], name); - tablesDirty = true; - return name; - } - - - /** - * Look up the URI associated with a prefix in this context. - * - * @param prefix The prefix to look up. - * @return The associated Namespace URI, or null if none is - * declared. - * @see org.xml.sax.helpers.NamespaceSupport2#getURI - */ - String getURI (String prefix) - { - if ("".equals(prefix)) { - return defaultNS; - } else if (prefixTable == null) { - return null; - } else { - return (String)prefixTable.get(prefix); - } - } - - - /** - * Look up one of the prefixes associated with a URI in this context. - * - *Since many prefixes may be mapped to the same URI, - * the return value may be unreliable.
- * - * @param uri The URI to look up. - * @return The associated prefix, or null if none is declared. - * @see org.xml.sax.helpers.NamespaceSupport2#getPrefix - */ - String getPrefix (String uri) - { - if (uriTable == null) { - return null; - } else { - return (String)uriTable.get(uri); - } - } - - - /** - * Return an enumeration of prefixes declared in this context. - * - * @return An enumeration of prefixes (possibly empty). - * @see org.xml.sax.helpers.NamespaceSupport2#getDeclaredPrefixes - */ - Enumeration getDeclaredPrefixes () - { - if (declarations == null) { - return EMPTY_ENUMERATION; - } else { - return declarations.elements(); - } - } - - - /** - * Return an enumeration of all prefixes currently in force. - * - *The default prefix, if in force, is not - * returned, and will have to be checked for separately.
- * - * @return An enumeration of prefixes (never empty). - * @see org.xml.sax.helpers.NamespaceSupport2#getPrefixes - */ - Enumeration getPrefixes () - { - if (prefixTable == null) { - return EMPTY_ENUMERATION; - } else { - return prefixTable.keys(); - } - } - - //////////////////////////////////////////////////////////////// - // Internal methods. - //////////////////////////////////////////////////////////////// - - /** - * Copy on write for the internal tables in this context. - * - *This class is optimized for the normal case where most - * elements do not contain Namespace declarations. In that case, - * the Context2 will share data structures with its parent. - * New tables are obtained only when new declarations are issued, - * so they can be popped off the stack.
- * - *JJK: **** Alternative: each Context2 might declare - * _only_ its local bindings, and delegate upward if not found.
- */ - private void copyTables () - { - // Start by copying our parent's bindings - prefixTable = (Hashtable)prefixTable.clone(); - uriTable = (Hashtable)uriTable.clone(); - - // Replace the caches with empty ones, rather than - // trying to determine which bindings should be flushed. - // As far as I can tell, these caches are never actually - // used in Xalan... More efficient to remove the whole - // cache system? **** - if(elementNameTable!=null) - elementNameTable=new Hashtable(); - if(attributeNameTable!=null) - attributeNameTable=new Hashtable(); - tablesDirty = true; - } - -} - - -// end of NamespaceSupport2.java