/*
 * The Apache Software License, Version 1.1
 *
 *
 * Copyright (c) 2001-2003 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 "Axis" 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.  For more
 * information on the Apache Software Foundation, please see
 * <http://www.apache.org/>.
 */
package org.jboss.axis.types;

import org.jboss.axis.utils.Messages;

/**
 * Custom class for supporting primitive XSD data type Token.
 * token represents tokenized strings.
 * The base type of token is normalizedString.
 *
 * @author Chris Haddad <chaddad@cobia.net>
 * @see <a href="http://www.w3.org/TR/xmlschema-2/#token">XML Schema 3.3.2</a>
 */
public class Token extends NormalizedString
{

   public Token()
   {
      super();
   }

   /**
    * ctor for Token
    *
    * @throws IllegalArgumentException will be thrown if validation fails
    */
   public Token(String stValue) throws IllegalArgumentException
   {
      try
      {
         setValue(stValue);
      }
      catch (IllegalArgumentException e)
      {
         // recast normalizedString exception as token exception
         throw new IllegalArgumentException(Messages.getMessage("badToken00") + "data=[" +
                 stValue + "]");
      }
   }

   /**
    * validate the value against the xsd definition
    * <p/>
    * The value space of token is the set of strings that do not
    * contain the line feed (#xA) nor tab (#x9) characters, that
    * have no leading or trailing spaces (#x20) and that have no
    * internal sequences of two or more spaces. The lexical space
    * of token is the set of strings that do not contain the line
    * feed (#xA) nor tab (#x9) characters, that have no leading or
    * trailing spaces (#x20) and that have no internal sequences of two
    * or more spaces.
    */
   public boolean isValid(String stValue)
   {
      int scan;
      // check to see if we have a string to review
      if ((stValue == null) || (stValue.length() == 0))
         return true;

      // no leading space
      if (stValue.charAt(0) == 0x20)
         return false;

      // no trail space
      if (stValue.charAt(stValue.length() - 1) == 0x20)
         return false;

      for (scan = 0; scan < stValue.length(); scan++)
      {
         char cDigit = stValue.charAt(scan);
         switch (cDigit)
         {
            case 0x09:
            case 0x0A:
               return false;
            case 0x20:
               // no doublspace
               if (scan + 1 < stValue.length())
                  if (stValue.charAt(scan + 1) == 0x20)
                  {
                     return false;
                  }
            default:
               break;
         }
      }
      return true;
   }
}
