/**

  * Free Telco Dictionary

  * Copyright © 2013 František Kučera (frantovo.cz)

  *

  * 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 3 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, see <http://www.gnu.org/licenses/>.

  */

 package cz.frantovo.telco.dictionary;

 import java.io.DataOutputStream;

 import java.io.IOException;

 import java.nio.charset.StandardCharsets;

 import java.util.Objects;

 /**

  * Represents one item in StarDict index file (.idx)

  * which links the term and its position and length in data file (.dict)

  * 

  * @author Ing. František Kučera (frantovo.cz)

  */

 public class IndexEntry implements Comparable<IndexEntry> {

 	private String name;

 	private long offset;

 	private long length;

 	private long ordinal;

 	public IndexEntry(String name, long offset, long length) {

 		this.name = name;

 		this.offset = offset;

 		this.length = length;

 	}

 	public void serialize(DataOutputStream indexOutputStream) throws IOException {

 		indexOutputStream.write(name.getBytes(StandardCharsets.UTF_8));

 		indexOutputStream.write(0);

 		indexOutputStream.writeInt((int) offset); // unsigned int 32

 		indexOutputStream.writeInt((int) length); // unsigned int 32

 	}

 	public void setOrdinal(long ordinal) {

 		this.ordinal = ordinal;

 	}

 	public long getOrdinal() {

 		return ordinal;

 	}

 	@Override

 	public int compareTo(IndexEntry o) {

 		int nameDiff = name.compareTo(o.name);

 		if (nameDiff == 0) {

 			int offsetDiff = ((Long) offset).compareTo(o.offset);

 			if (offsetDiff == 0) {

 				return ((Long) length).compareTo(o.length);

 			} else {

 				return offsetDiff;

 			}

 		} else {

 			return nameDiff;

 		}

 	}

 	@Override

 	public boolean equals(Object o) {

 		return o instanceof IndexEntry && compareTo((IndexEntry) o) == 0;

 	}

 	@Override

 	public int hashCode() {

 		int hash = 5;

 		hash = 53 * hash + Objects.hashCode(this.name);

 		hash = 53 * hash + (int) (this.offset ^ (this.offset >>> 32));

 		hash = 53 * hash + (int) (this.length ^ (this.length >>> 32));

 		return hash;

 	}

 }