Java Array Intersect byteIntersection(byte[] a, byte[] b)

Description

byte Intersection

License

Open Source License

Declaration

public static byte[] byteIntersection(byte[] a, byte[] b) 

Method Source Code

//package com.java2s;
/*******************************************************************************
 * This file is part of the GeOxygene project source files.
 * //w  w  w.ja  v  a2 s . c o m
 * GeOxygene aims at providing an open framework which implements OGC/ISO specifications for
 * the development and deployment of geographic (GIS) applications. It is a open source
 * contribution of the COGIT laboratory at the Institut G?ographique National (the French
 * National Mapping Agency).
 * 
 * See: http://oxygene-project.sourceforge.net
 * 
 * Copyright (C) 2005 Institut G?ographique National
 * 
 * This library is free software; you can redistribute it and/or modify it under the terms
 * of the GNU Lesser General Public License as published by the Free Software Foundation;
 * either version 2.1 of the License, or any later version.
 * 
 * This library 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 Lesser General Public License for more details.
 * 
 * You should have received a copy of the GNU Lesser General Public License along with
 * this library (see file LICENSE if present); if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
 *******************************************************************************/

import java.util.Arrays;

public class Main {
    public static byte[] byteIntersection(byte[] a, byte[] b) {
        int max = Math.max(a.length, b.length);
        byte[] newarray = new byte[max];
        Arrays.fill(newarray, (byte) 0);
        for (int i = 0; i < max; i++) {
            byte aval = 0;
            byte bval = 0;
            if (i >= a.length) {
                aval = 0;
            } else {
                aval = a[i];
            }
            if (i >= b.length) {
                bval = 0;
            } else {
                bval = b[i];
            }
            newarray[i] = (byte) (aval * bval);
        }
        return newarray;
    }
}

Related

1. arrayInterp(double[] inputArray, double index)
2. arraysIntersect(Object[] array1, Object[] array2)
3. getArrayIntersection(int a[], int b[])
4. getNonIntersection(int[] interval, int[] intervalToRemove)
5. hasIntersection(String a1[], String a2[], int mode)
6. intersect(boolean[] mask, int[] examples, boolean[] intersection)