Here you can find the source of memcmp(byte[] a, int a_offset, byte[] b, int b_offset, int length)
bytes
to another.
Parameter | Description |
---|---|
a | the first array |
a_offset | the start offset in <code>a</code> |
b | the second array |
b_offset | the start offset in <code>b</code> |
length | the number of <code>byte</code>s to compare. |
public static boolean memcmp(byte[] a, int a_offset, byte[] b, int b_offset, int length)
//package com.java2s; /* gvSIG. Sistema de Informaci?n Geogr?fica de la Generalitat Valenciana * * Copyright (C) 2004 IVER T.I. and Generalitat Valenciana. * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License * as published by the Free Software Foundation; either version 2 * of the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, write to the Free Software * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307,USA. * * For more information, contact://w ww . j a v a 2s. co m * * Generalitat Valenciana * Conselleria d'Infraestructures i Transport * Av. Blasco Ib??ez, 50 * 46010 VALENCIA * SPAIN * * +34 963862235 * gvsig@gva.es * www.gvsig.gva.es * * or * * IVER T.I. S.A * Salamanca 50 * 46005 Valencia * Spain * * +34 963163400 * dac@iver.es */ public class Main { /** * Compare the contents of one array of <code>bytes</code> to another. * * @param a the first array * @param a_offset the start offset in <code>a</code> * @param b the second array * @param b_offset the start offset in <code>b</code> * @param length the number of <code>byte</code>s to compare. * * @return DOCUMENT ME! */ public static boolean memcmp(byte[] a, int a_offset, byte[] b, int b_offset, int length) { if ((a == null) && (b == null)) { return true; } if ((a == null) || (b == null)) { return false; } for (int i = 0; i < length; ++i, ++a_offset, ++b_offset) if (a[a_offset] != b[b_offset]) { return false; } return true; } }