com.badlogic.gdx.ai.pfa.DefaultGraphPath.java Source code

Java tutorial

Introduction

Here is the source code for com.badlogic.gdx.ai.pfa.DefaultGraphPath.java

Source

/*******************************************************************************
 * Copyright 2014 See AUTHORS file.
 * <p>
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * <p>
 * http://www.apache.org/licenses/LICENSE-2.0
 * <p>
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 ******************************************************************************/

package com.badlogic.gdx.ai.pfa;

import com.badlogic.gdx.utils.Array;

import java.util.Iterator;

/** Default implementation of a {@link GraphPath} that uses an internal {@link Array} to store nodes or connections.
 *
 * @param <N> Type of node
 *
 * @author davebaol */
public class DefaultGraphPath<N> implements GraphPath<N> {
    public final Array<N> nodes;

    /** Creates a {@code DefaultGraphPath} with no nodes. */
    public DefaultGraphPath() {
        this(new Array<N>());
    }

    /** Creates a {@code DefaultGraphPath} with the given capacity and no nodes. */
    public DefaultGraphPath(int capacity) {
        this(new Array<N>(capacity));
    }

    /** Creates a {@code DefaultGraphPath} with the given nodes. */
    public DefaultGraphPath(Array<N> nodes) {
        this.nodes = nodes;
    }

    @Override
    public void clear() {
        nodes.clear();
    }

    @Override
    public int getCount() {
        return nodes.size;
    }

    @Override
    public void add(N node) {
        nodes.add(node);
    }

    @Override
    public N get(int index) {
        return nodes.get(index);
    }

    @Override
    public void reverse() {
        nodes.reverse();
    }

    @Override
    public Iterator<N> iterator() {
        return nodes.iterator();
    }
}