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 * Portions of this software are based upon public domain software 59 * originally written at the National Center for Supercomputing Applications, 60 * University of Illinois, Urbana-Champaign. 61 */ 62 63 package org.apache.poi.hpsf.littleendian; 64 65 /** 66 * <p>Represents an unsigned double word (4 bytes).</p> 67 * 68 * @author Rainer Klute (klute@rainer-klute.de) 69 * @version $Id: DWord.java,v 1.3 2002/05/03 07:29:09 klute Exp $ 70 * @since 2002-02-09 71 */ 72 public class DWord extends LittleEndian 73 { 74 75 /** 76 * <p>Creates a {@link DWord} and reads its value from a byte 77 * array.</p> 78 * 79 * @param src The byte array to read from. 80 * 81 * @param offset The offset of the first byte to read. 82 */ 83 public DWord(final byte[] src, final int offset) 84 { 85 super(src, offset); 86 } 87 88 89 90 public final static int LENGTH = 4; 91 92 public int length() 93 { 94 return LENGTH; 95 } 96 97 98 99 /** 100 * <p>Returns the integral value of this {@link DWord}.</p> 101 * 102 * <p><strong>FIXME:</strong> Introduce a superclass for the 103 * numeric types and make this a method of the superclass!</p> 104 */ 105 public int intValue() 106 { 107 int value = 0; 108 final int length = length(); 109 for (int i = 0; i < length; i++) 110 { 111 final int b = 0xFF & bytes[i]; 112 value = value << 8 | b; 113 } 114 return value; 115 } 116 117 } 118