All Downloads are FREE. Search and download functionalities are using the official Maven repository.
  • Log In
  • Register

    • eu.interedition.collatex.suffixtree.Sequence Maven / Gradle / Ivy

    package eu.interedition.collatex.suffixtree;

import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;


/**
 * Represents a sequence of items. This plays the part of the string in a non
 * generic suffix tree implementation. This object automatically appends a
 * terminating item to the end of the instance which is included in all
 * operations.
 *
 * @author Max Garfinkel
 */
public class Sequence> implements Iterable {

    private List masterSequence = new ArrayList();

    Sequence() {
    }

    /**
     * Initialize the sequence.
     *
     * @param sequence
     */
    Sequence(S sequence) {
        for (Object item : sequence)
            masterSequence.add(item);
        SequenceTerminal sequenceTerminal = new SequenceTerminal(sequence);
        masterSequence.add(sequenceTerminal);
    }

    /**
     * Retrieve the item at the position specified by index.
     *
     * @param index
     * @return
     */
    Object getItem(int index) {
        return masterSequence.get(index);
    }

    /**
     * Adds a Sequence to the suffix tree.
     *
     * @param sequence
     */
    void add(S sequence) {
        for (I item : sequence) {
            masterSequence.add(item);
        }
        SequenceTerminal terminal = new SequenceTerminal(sequence);
        masterSequence.add(terminal);
    }

    /**
     * Retrieves an iterator for the sequence.
     */
    public Iterator iterator() {
        return new Iterator() {

            int currentPosition = 0;

            public boolean hasNext() {
                return masterSequence.size() > currentPosition;
            }

            public Object next() {
                if (currentPosition <= masterSequence.size())
                    return masterSequence.get(currentPosition++);
                else {
                    return null;
                }
            }

            public void remove() {
                throw new UnsupportedOperationException(
                    "Remove is not supported.");

            }

        };
    }

    int getLength() {
        return masterSequence.size();
    }

    public String toString() {
        StringBuilder sb = new StringBuilder("Sequence = [");
        for (Object i : masterSequence) {
            sb.append(i).append(", ");
        }
        sb.append("]");
        return sb.toString();
    }

}
    
    
    
    

    




    
    
    © 2015 - 2025 Weber Informatics LLC | Privacy Policy