Java tutorial
//package com.java2s; /* ***** BEGIN LICENSE BLOCK ***** * Version: MPL 1.1/GPL 2.0/LGPL 2.1 * * The contents of this file are subject to the Mozilla Public License Version * 1.1 (the "License"); you may not use this file except in compliance with * the License. You may obtain a copy of the License at * http://www.mozilla.org/MPL/ * * Software distributed under the License is distributed on an "AS IS" basis, * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License * for the specific language governing rights and limitations under the * License. * * The Original Code is part of dcm4che, an implementation of DICOM(TM) in * Java(TM), hosted at http://sourceforge.net/projects/dcm4che. * * The Initial Developer of the Original Code is * Gunter Zeilinger, Huetteldorferstr. 24/10, 1150 Vienna/Austria/Europe. * Portions created by the Initial Developer are Copyright (C) 2002-2005 * the Initial Developer. All Rights Reserved. * * Contributor(s): * Gunter Zeilinger <gunterze@gmail.com> * * Alternatively, the contents of this file may be used under the terms of * either the GNU General Public License Version 2 or later (the "GPL"), or * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"), * in which case the provisions of the GPL or the LGPL are applicable instead * of those above. If you wish to allow use of your version of this file only * under the terms of either the GPL or the LGPL, and not to allow others to * use your version of this file under the terms of the MPL, indicate your * decision by deleting the provisions above and replace them with the notice * and other provisions required by the GPL or the LGPL. If you do not delete * the provisions above, a recipient may use your version of this file under * the terms of any one of the MPL, the GPL or the LGPL. * * ***** END LICENSE BLOCK ***** */ public class Main { public static void toggleIntEndian(byte[] b) { if (b != null) toggleIntEndian(b, 0, b.length); } public static void toggleIntEndian(byte[] b, int off, int len) { if (b == null || len == 0) return; int end = off + len; if (off < 0 || len < 0 || end > b.length) throw new IndexOutOfBoundsException("b.length = " + b.length + ", off = " + off + ", len = " + len); if ((len & 3) != 0) throw new IllegalArgumentException("len = " + len); byte tmp; for (int i = off; i < end; i++, i++, i++, i++) { tmp = b[i]; b[i] = b[i + 3]; b[i + 3] = tmp; tmp = b[i + 1]; b[i + 1] = b[i + 2]; b[i + 2] = tmp; } } }