codatid.java

jxme的一些相关程序,主要是手机上程序开发以及手机和计算机通信的一些程序资料,程序编译需要Ant支持

/************************************************************************
 *
 * $Id: CodatID.java,v 1.2 2002/03/04 21:42:58 echtcherbina Exp $
 *
 * Copyright (c) 2001 Sun Microsystems, Inc.  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
 *       Sun Microsystems, Inc. for Project JXTA."
 *    Alternately, this acknowledgment may appear in the software itself,
 *    if and wherever such third-party acknowledgments normally appear.
 *
 * 4. The names "Sun", "Sun Microsystems, Inc.", "JXTA" and "Project JXTA"
 *    must not be used to endorse or promote products derived from this
 *    software without prior written permission. For written
 *    permission, please contact Project JXTA at http://www.jxta.org.
 *
 * 5. Products derived from this software may not be called "JXTA",
 *    nor may "JXTA" appear in their name, without prior written
 *    permission of Sun.
 *
 * 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 SUN MICROSYSTEMS 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 Project JXTA.  For more
 * information on Project JXTA, please see
 * <http://www.jxta.org/>.
 *
 * This license is based on the BSD license adopted by the Apache Foundation.
 *********************************************************************************/

package net.jxta.impl.id.UUID;

import java.io.InputStream;
import java.net.URL;
import java.security.MessageDigest;

import java.io.IOException;
import java.security.DigestException;
import java.security.ProviderException;
import java.security.NoSuchAlgorithmException;

import net.jxta.document.Document;

/**
 *
 * This class represents a CodatID. Codats are JXTA objects that can hold
 * both data or code.
 *
 * <p>Codats are containers objects that are used to hold any kinds of
 * objects or data. A codat can represent a file, a class file, the saved
 * state of an application, a loadable C library. Codats are handled
 * transparently by the JXTA platform, and are used as placeholders for
 * any type of data. Codats hold Document that represent the data that
 * they hold.</p>
 *
 * <p>A CodatID is formed by the conjuction of a PeerGroup unique ID and
 * the Codat Document hash value.The Id is the unique Id for this Codat
 * within the JXTA world. Some codats may not hold a document. In that case
 * a codatId is constructed without the document hash value.
 *
 * @see     net.jxta.codat.Codat
 * @see     net.jxta.codat.CodatID
 * @see     net.jxta.document.Document
 * @see     net.jxta.document.StructuredDocument
 *
 * @version $Revision: 1.2 $
 * @since JXTA 1.0 
 **/
public final class CodatID extends net.jxta.codat.CodatID {
    /*
     *  ALL PUBLIC METHODS USE INHERITED JAVADOC
     */
    
    /**
     * size of a SHA1 hash. I would use MessageDigest.getDigestLength, but
     * possible exceptions make it difficult to do.
     */
    final static int hashSize = 20;
    
    final static int groupIdOffset = 0;
    final static int idOffset = CodatID.groupIdOffset + IDFormat.uuidSize;
    final static int codatHashOffset = CodatID.idOffset + IDFormat.uuidSize;
    final static int padOffset = CodatID.codatHashOffset + CodatID.hashSize;
    final static int padSize = IDFormat.flagsOffset - CodatID.padOffset;
    
    /**
     *  The id data
     **/
    protected IDBytes id;
    
    /**
     * Internal constructor
     *
     * @since JXTA 1.0
     *
     **/
    private CodatID() {
        super();
        id = new IDBytes();
        id.bytes[IDFormat.flagsOffset + IDFormat.flagsIdTypeOffset] = IDFormat.flagCodatID;
    };
    
    /**
     * Constructor. Intializes contents from provided ID.
     *
     * @since       JXTA  1.0
     *
     * @param id    the ID data
     **/
    CodatID( IDBytes id ) {
        super();
        this.id = id;
    };
    
    public CodatID(PeerGroupID groupID) {
        this( );
        
        UUID    groupUUID = new UUID(
        groupID.id.bytesIntoLong( PeerGroupID.groupIdOffset ),
        groupID.id.bytesIntoLong( PeerGroupID.groupIdOffset + 8 ) );
        UUID    idUUID = UUIDFactory.newUUID();
        
        id.longIntoBytes( CodatID.groupIdOffset,
        groupUUID.getMostSignificantBits() );
        id.longIntoBytes( CodatID.groupIdOffset + 8,
        groupUUID.getLeastSignificantBits() );
        
        id.longIntoBytes( CodatID.idOffset,
        idUUID.getMostSignificantBits() );
        id.longIntoBytes( CodatID.idOffset + 8,
        idUUID.getLeastSignificantBits() );
    };
    
    public CodatID( PeerGroupID groupID, InputStream in ) throws IOException {
        this( groupID );
        
        MessageDigest dig = null;
        try {
            dig = MessageDigest.getInstance( "SHA" );
        } catch( NoSuchAlgorithmException caught ) {
            dig = null;
        }
        if (dig == null) {
            throw (new ProviderException("SHA1 digest algorithm found"));
        }
        
        dig.reset();
        
        do {
            int nextByte = in.read();
            if( nextByte == -1 )
                break;
            
            dig.update( (byte) nextByte);
        }
        while( true );
        
        in.close();
        
        try {
            byte [] result = dig.digest( );
            for( int eachByte = 0; eachByte < CodatID.hashSize; eachByte++ )
                id.bytes[eachByte + CodatID.codatHashOffset] = result[eachByte];
        }
        catch( Exception e ) {
      /* we convert this to an IO Exception to keep the number of
       * down.
       */
            throw new IOException( "Digest algorithm could not complete" );
        }
    };
    
    public Object clone() {
        return this; // ID instances are immutable so we can return ourself
    }
    
    public boolean equals( Object target ) {
        if (this == target) {
            return true;
        }
        
        // FIXME 20011220 [e-mail] very many places try to compare
        // strings against ids. For now we allow this to work.
        if (target instanceof String )
            return target.equals( this.toString() );
        
        if (target instanceof CodatID )
            return id.equals( ((CodatID)target).id );
        else
            return false;
    };
    
    public int hashCode() {
        return id.hashCode();
    };
    
    public String getIDFormat() {
        return IDFormat.INSTANTIATOR.getSupportedIDFormat();
    }
    
    public Object getUniqueValue() {
        return getIDFormat() + "-" + (String) id.getUniqueValue();
    }
    
    public URL getURL( ) {
        return IDFormat.getURL( (String) getUniqueValue() );
    }
    
    public net.jxta.id.ID getPeerGroupID() {
        UUID groupUUID = new UUID(
        id.bytesIntoLong( CodatID.groupIdOffset ),
        id.bytesIntoLong( CodatID.groupIdOffset + 8 ) );
        
        PeerGroupID groupID = new PeerGroupID( groupUUID );
        
        // convert to the generic world PGID as necessary
        return IDFormat.translateToWellKnown( groupID );
    };
    
   public boolean isStatic() {
        for( int eachHashByte = CodatID.codatHashOffset;
        eachHashByte < (CodatID.padOffset); eachHashByte++ )
            if( 0 != id.bytes[eachHashByte] )
                return true;
        
        return false;
    };
}