// ByteArray.java
// (C) 2007 by Michael Peter Christen; mc@yacy.net, Frankfurt a. M., Germany
// first published 30.03.2007 on http://yacy.net
//
// $LastChangedDate: 2006-04-02 22:40:07 +0200 (So, 02 Apr 2006) $
// $LastChangedRevision: 1986 $
// $LastChangedBy: orbiter $
//
// LICENSE
// 
// 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

package de.anomic.kelondro.util;

import java.util.HashMap;

import de.anomic.kelondro.order.ByteOrder;

/**
 * this class is a experimental replacement of byte[].
 * It can be used if a byte[] shall be stored within a HashMap or HashSet
 * which is faster than TreeMap but is generally not possible because storing
 * a byte[] in a Hashtable does not work because the hash computation does not
 * work for byte[]. This class extends byte[] with a cached hashing function,
 * so it can be used in hashtables.
 */

public class ByteArray {
    
    private byte[] buffer;
    private int hash;

    
    public ByteArray(final byte[] bb) {
        this.buffer = bb;
        this.hash = 0;
    }

    public int length() {
        return buffer.length;
    }
    
    public byte[] asBytes() {
        return this.buffer;
    }
    
    public byte readByte(final int pos) {
        return buffer[pos];
    }
    
    public static boolean equals(final byte[] buffer, final byte[] pattern) {
        // compares two byte arrays: true, if pattern appears completely at offset position
        if (buffer == null && pattern == null) return true;
        if (buffer == null || pattern == null) return false;
        if (buffer.length < pattern.length) return false;
        for (int i = 0; i < pattern.length; i++) if (buffer[i] != pattern[i]) return false;
        return true;
    }
    
    public int compareTo(final ByteArray b, final ByteOrder order) {
        return order.compare(this.buffer, 0, this.buffer.length, b.buffer, 0, b.buffer.length);
    }
    
    public int compareTo(final int aoffset, final int alength, final ByteArray b, final int boffset, final int blength, final ByteOrder order) {
        return order.compare(this.buffer, aoffset, alength, b.buffer, boffset, blength);
    }
    
    public int hashCode() {
        if (this.hash != 0) return this.hash;
        int l = this.buffer.length;
        int h = 0;
        while (--l >= 0) h = 31*h + buffer[l];
        
        this.hash = h;
        return h;
    }

    public boolean equals(Object other) {
        ByteArray b = (ByteArray) other;
        if (buffer == null && b == null) return true;
        if (buffer == null || b == null) return false;
        if (this.buffer.length != b.buffer.length) return false;
        int l = this.buffer.length;
        while (--l >= 0) if (this.buffer[l] != b.buffer[l]) return false;
        return true;
    }

    public static void main(String[] args) {
        ByteArray a0 = new ByteArray("abc".getBytes());
        ByteArray a1 = new ByteArray("abc".getBytes());
        ByteArray b  = new ByteArray("bbb".getBytes());
        System.out.println("a0 " + ((a0.equals(a1)) ? "=" : "!=") + " a1");
        System.out.println("a0 " + ((a0.equals(b)) ? "=" : "!=") + " b");
        HashMap<ByteArray, Integer> map = new HashMap<ByteArray, Integer>();
        map.put(a0, 1);
        //map.put(a1, 1);
        map.put(b, 2);
        System.out.println("map.size() = " + map.size());
        System.out.println("hashCode(a0) = " + a0.hashCode());
        System.out.println("hashCode(a1) = " + a1.hashCode());
        System.out.println("hashCode(b) = " + b.hashCode());
        System.out.println("a0 " + ((map.containsKey(a0)) ? "in" : "not in") + " map");
        System.out.println("a1 " + ((map.containsKey(a1)) ? "in" : "not in") + " map");
        System.out.println("b " + ((map.containsKey(b)) ? "in" : "not in") + " map");
    }
}