1 /* ==================================================================== 2 * The Apache Software License, Version 1.1 3 * 4 * Copyright (c) 2000 The Apache Software Foundation. All rights 5 * reserved. 6 * 7 * Redistribution and use in source and binary forms, with or without 8 * modification, are permitted provided that the following conditions 9 * are met: 10 * 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 14 * 2. Redistributions in binary form must reproduce the above copyright 15 * notice, this list of conditions and the following disclaimer in 16 * the documentation and/or other materials provided with the 17 * distribution. 18 * 19 * 3. The end-user documentation included with the redistribution, 20 * if any, must include the following acknowledgment: 21 * "This product includes software developed by the 22 * Apache Software Foundation (http://www.apache.org/)." 23 * Alternately, this acknowledgment may appear in the software itself, 24 * if and wherever such third-party acknowledgments normally appear. 25 * 26 * 4. The names "Apache" and "Apache Software Foundation" must 27 * not be used to endorse or promote products derived from this 28 * software without prior written permission. For written 29 * permission, please contact apache@apache.org. 30 * 31 * 5. Products derived from this software may not be called "Apache", 32 * nor may "Apache" appear in their name, without prior written 33 * permission of the Apache Software Foundation. 34 * 35 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED 36 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 37 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 38 * DISCLAIMED. IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR 39 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 40 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 41 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF 42 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 43 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 44 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT 45 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 46 * SUCH DAMAGE. 47 * ==================================================================== 48 * 49 * This software consists of voluntary contributions made by many 50 * individuals on behalf of the Apache Software Foundation. For more 51 * information on the Apache Software Foundation, please see 52 * <http://www.apache.org/>. 53 * 54 * Portions of this software are based upon public domain software 55 * originally written at the National Center for Supercomputing Applications, 56 * University of Illinois, Urbana-Champaign. 57 */ 58 59 package org.apache.poi.hpsf.littleendian; 60 61 import java.io.*; 62 63 /** 64 * <p>Represents a class ID (16 bytes). Unlike other little-endian 65 * type the {@link ClassID} is not just 16 bytes stored in the wrong 66 * order. Instead, it is a double word (4 bytes) followed by two words 67 * (2 bytes each) followed by 8 bytes.</p> 68 * 69 * @see LittleEndian 70 * 71 * @author Rainer Klute (klute@rainer-klute.de) 72 * @version $Id: ClassID.java,v 1.1 2002/02/14 04:00:59 mjohnson Exp $ 73 * @since 2002-02-09 74 */ 75 public class ClassID extends LittleEndian 76 { 77 78 /** 79 * <p>Creates a {@link ClassID} and reads its value from a byte 80 * array.</p> 81 * 82 * @param src The byte array to read from. 83 * 84 * @param offset The offset of the first byte to read. 85 */ 86 public ClassID(final byte[] src, final int offset) 87 { 88 super(src, offset); 89 } 90 91 92 93 public final static int LENGTH = 16; 94 95 public int length() 96 { 97 return LENGTH; 98 } 99 100 101 102 public byte[] read(byte[] src, int offset) 103 { 104 LittleEndian[] b = new LittleEndian[11]; 105 b[0] = new DWord(src, offset); 106 b[1] = new Word(src, offset += DWord.LENGTH); 107 b[2] = new Word(src, offset += Word.LENGTH); 108 b[3] = new Byte(src, offset += Word.LENGTH); 109 b[4] = new Byte(src, offset += Byte.LENGTH); 110 b[5] = new Byte(src, offset += Byte.LENGTH); 111 b[6] = new Byte(src, offset += Byte.LENGTH); 112 b[7] = new Byte(src, offset += Byte.LENGTH); 113 b[8] = new Byte(src, offset += Byte.LENGTH); 114 b[9] = new Byte(src, offset += Byte.LENGTH); 115 b[10] = new Byte(src, offset += Byte.LENGTH); 116 int capacity = 0; 117 for (int i = 0; i < b.length; i++) 118 capacity += b[i].getBytes().length; 119 bytes = new byte[capacity]; 120 int pos = 0; 121 for (int i = 0; i < b.length; i++) 122 { 123 byte[] s = b[i].getBytes(); 124 for (int j = 0; j < s.length; j++) 125 bytes[pos++] = s[j]; 126 } 127 return bytes; 128 } 129 130 } 131