AutojoinList.java

Go to the documentation of this file.

/*
 * Gridarta MMORPG map editor for Crossfire, Daimonin and similar games.
 * Copyright (C) 2000-2015 The Gridarta Developers.
 *
 * 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.,
 * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
 */

package net.sf.gridarta.model.autojoin;

import java.io.Serializable;
import java.util.ArrayList;
import java.util.Collections;
import java.util.IdentityHashMap;
import java.util.List;
import java.util.Map;
import net.sf.gridarta.model.archetype.Archetype;
import net.sf.gridarta.model.gameobject.GameObject;
import net.sf.gridarta.model.maparchobject.MapArchObject;
import org.apache.log4j.Category;
import org.apache.log4j.Logger;
import org.jetbrains.annotations.NotNull;

public class AutojoinList<G extends GameObject<G, A, R>, A extends MapArchObject<A>, R extends Archetype<G, A, R>> implements Serializable {

    private static final long serialVersionUID = 1L;

    @NotNull
    private static final Category LOG = Logger.getLogger(AutojoinList.class);

    public static final int SIZE = 16;

    // bitmask constants for {@link #archetypes} index

    public static final int NORTH = 1;

    public static final int EAST = 2;

    public static final int SOUTH = 4;

    public static final int WEST = 8;

    @NotNull
    private final List<List<R>> archetypes;

    public AutojoinList(@NotNull final Iterable<List<R>> archetypes) throws IllegalAutojoinListException {
        final ArrayList<List<R>> newArchetypes = new ArrayList<>();

        for (final List<R> archetypeList : archetypes) {
            newArchetypes.add(validate(archetypeList));
        }

        if (newArchetypes.size() > SIZE) {
            throw new IllegalAutojoinListException("autojoin list with more than " + SIZE + " valid entries");
        } else if (newArchetypes.size() < SIZE) {
            throw new IllegalAutojoinListException("autojoin list with less than " + SIZE + " valid entries");
        }

        newArchetypes.trimToSize();
        this.archetypes = newArchetypes;
    }

    @NotNull
    private static <R extends Archetype<?, ?, R>> List<R> validate(@NotNull final Iterable<R> archetypeList) throws IllegalAutojoinListException {
        final ArrayList<R> result = new ArrayList<>();
        final Map<R, R> tmp = new IdentityHashMap<>();
        for (final R archetype : archetypeList) {
            if (archetype == null) {
                throw new IllegalArgumentException();
            }

            if (tmp.put(archetype, archetype) != null) {
                throw new IllegalAutojoinListException("autojoin list contains duplicate archetype '" + archetype.getArchetypeName() + "'");
            }

            result.add(archetype);
        }
        if (result.isEmpty()) {
            throw new IllegalAutojoinListException("autojoin list is empty");
        }
        result.trimToSize();
        return result;
    }

    public int getIndex(@NotNull final R archetype) {
        for (int i = 0; i < SIZE; i++) {
            if (archetypes.get(i).contains(archetype)) {
                return i;
            }
        }

        LOG.warn("Error in AutojoinList.get_index: index not found");
        return 0;
    }

    public boolean isMainIndex(@NotNull final R archetype) {
        for (int i = 0; i < SIZE; i++) {
            if (archetypes.get(i).get(0) == archetype) {
                return true;
            }
        }

        return false;
    }

    public int getAlternativeIndex(@NotNull final R archetype) {
        for (int i = 0; i < SIZE; i++) {
            final List<R> tmp = archetypes.get(i);
            if (tmp.get(0) != archetype && tmp.contains(archetype)) {
                return i;
            }
        }

        return -1;
    }

    @NotNull
    public R getArchetype(final int index) {
        return archetypes.get(index).get(0);
    }

    @NotNull
    public Iterable<R> getArchetypes(final int index) {
        return Collections.unmodifiableCollection(archetypes.get(index));
    }

}