/*
 * This file is part of the Illarion project.
 *
 * Copyright © 2015 - Illarion e.V.
 *
 * Illarion is free software: you can redistribute it and/or modify
 * it under the terms of the GNU Affero General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 *
 * Illarion 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.
 */
package illarion.easynpc.data;

import illarion.common.types.ItemId;
import illarion.common.util.TableLoader;

import javax.annotation.Nonnull;
import javax.annotation.Nullable;
import java.util.ArrayList;
import java.util.Arrays;

/**
 * This class loads and stores all items defined in the client database along
 * with all the values required for the script parser to work properly.
 *
 * @author Martin Karing <nitram@illarion.org>
 */
public final class Items implements Comparable<Items> {
    /**
     * The table index of the item id in the definition table.
     */
    private static final int TB_ID = 0;

    /**
     * The list of items that were load.
     */
    @Nonnull
    private static final int[] itemsList;

    static {
        ArrayList<Integer> itemList = new ArrayList<>();

        new TableLoader("Items", (line, loader) -> {
            int itemId1 = loader.getInt(TB_ID);
            itemList.add(itemId1);
            return true;
        });

        itemsList = new int[itemList.size()];
        for (int i = 0; i < itemList.size(); i++) {
            itemsList[i] = itemList.get(i);
        }
        Arrays.sort(itemsList);
    }

    /**
     * The ID of the item.
     */
    private final int itemId;

    /**
     * Protected constructor to store the item ID.
     *
     * @param id the ID of the item
     */
    private Items(int id) {
        itemId = id;
    }

    /**
     * Get the values stored in this list. This creates a new list filled with
     * the references to the item object. The internal list remains untouched.
     *
     * @return the array of references to the item objects
     */
    @Nonnull
    public static Items[] values() {
        Items[] retList = new Items[itemsList.length];
        for (int i = 0; i < itemsList.length; i++) {
            retList[i] = new Items(itemsList[i]);
        }
        return retList;
    }

    @Nullable
    public static Items valueOf(int id) {
        if (contains(id)) {
            return new Items(id);
        }
        return null;
    }

    @Nullable
    public static Items valueOf(@Nullable ItemId id) {
        if (ItemId.isValidItem(id)) {
            assert id != null;
            return valueOf(id.getValue());
        }
        return null;
    }

    /**
     * Check if a ID is part oft this list.
     *
     * @param id the ID of the item to look for
     * @return {@code true} in case the item is found in the list of valid items
     */
    private static boolean contains(int id) {
        return Arrays.binarySearch(itemsList, id) >= 0;
    }

    /**
     * Get the ID of the item.
     *
     * @return the ID of the item.
     */
    public int getItemId() {
        return itemId;
    }

    @Override
    public int compareTo(@Nonnull Items o) {
        return Integer.compare(itemId, o.itemId);
    }

    @Override
    public boolean equals(@Nullable Object obj) {
        if (super.equals(obj)) {
            return true;
        }
        if (obj instanceof Items) {
            Items objItems = (Items) obj;
            return objItems.itemId == itemId;
        }
        return false;
    }

    @Override
    public int hashCode() {
        return itemId;
    }
}