/*
* reserved comment block
* DO NOT REMOVE OR ALTER!
*/
/*
* Copyright 1999-2004 The Apache Software Foundation.
*
* 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
*
*
* 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.
*/
/*
* $Id: StringToStringTable.java,v 1.2.4.1 2005/09/15 08:15:56 suresh_emailid Exp $
*/
/**
* A very simple lookup table that stores a list of strings, the even
* number strings being keys, and the odd number strings being values.
* @xsl.usage internal
*/
public class StringToStringTable
{
/** Size of blocks to allocate */
private int m_blocksize;
/** Array of strings this contains */
/** Number of strings this contains */
/** Size of this table */
private int m_mapSize;
/**
* Default constructor. Note that the default
* block size is very small, for small lists.
*/
public StringToStringTable()
{
m_blocksize = 16;
}
/**
* Construct a StringToStringTable, using the given block size.
*
* @param blocksize Size of blocks to allocate
*/
{
}
/**
* Get the length of the list.
*
* @return Number of strings in the list
*/
public final int getLength()
{
return m_firstFree;
}
/**
* Append a string onto the vector.
* The strings go to the even locations in the array
* and the values in the odd.
*
* @param key String to add to the list
* @param value Value of the string
*/
{
{
m_mapSize += m_blocksize;
}
m_firstFree++;
m_firstFree++;
}
/**
* Tell if the table contains the given string.
*
* @param key String to look up
*
* @return return the value of the string or null if not found.
*/
{
{
return m_map[i + 1];
}
return null;
}
/**
* Remove the given string and its value from this table.
*
* @param key String to remove from the table
*/
{
{
{
if ((i + 2) < m_firstFree)
m_firstFree -= 2;
break;
}
}
}
/**
* Tell if the table contains the given string. Ignore case
*
* @param key String to look up
*
* @return The value of the string or null if not found
*/
{
return null;
{
return m_map[i + 1];
}
return null;
}
/**
* Tell if the table contains the given string in the value.
*
* @param val Value of the string to look up
*
* @return the string associated with the given value or null if not found
*/
{
{
return m_map[i - 1];
}
return null;
}
/**
* Get the nth element.
*
* @param i index of the string to look up.
*
* @return The string at the given index.
*/
{
return m_map[i];
}
/**
* Tell if the table contains the given string.
*
* @param key String to look up
*
* @return True if the given string is in this table
*/
{
{
return true;
}
return false;
}
/**
* Tell if the table contains the given string.
*
* @param val value to look up
*
* @return True if the given value is in the table.
*/
{
{
return true;
}
return false;
}
}