/**
 * Kevin Liu
 * 112830164
 * kevin.liu.2@stonybrook.edu
 * Assignment #4
 * CSE 214
 * R03 | Jenny Xu
 */
package com.company;

import java.util.ArrayList;
import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;

public class Phrase {
    private Queue queue;

    public void enqueue(Bigram b)
    {
        this.queue.add(b);
    }


    public Bigram dequeue()
    {
       return (Bigram)queue.poll();
    }

    public Bigram peak()
    {
        return peak();
    }

    public int size()
    {
        return queue.size();
    }

    public boolean isEmpty()
    {
        if(queue.peek() != null)
            return true;
        else
            return false;
    }

    public static Phrase buildPhraseFromString(String s)
    {
        s = s.replaceAll("\\s+","");
        ArrayList<Character> sArray = new ArrayList<>();
        for(int i = 0; i < s.length(); i++)
        {
            sArray.add(s.charAt(i));
        }
        Phrase phrase = new Phrase();
        Queue<Bigram> queue = new LinkedList<>();
        int i = 0;
        while(i + 2 <= sArray.size())
        {
            Bigram b = new Bigram(sArray.get(i),sArray.get(i+1));
            if(sArray.get(i) == sArray.get(i+1))
            {
                sArray.add(i+1,'X');
                b = new Bigram(sArray.get(i),sArray.get(i+1));
                System.out.println(sArray.toString());

            }
            i = i + 2;
            queue.add(b);
        }
        for(int t = 0; t<queue.size(); t++)
        {
            phrase.enqueue(queue.poll());
        }
        if(i != sArray.size())
        {
            System.out.println();
        }
            /*
        String str = s.substring(0,2);
        Bigram bigram = new Bigram(str.charAt(0),str.charAt(1));
        phrase.enqueue(bigram);
        System.out.println(queue.toString());
        System.out.println(phrase.toString() + "HI");

             */
        /*
        for(int i = 0; (i + 2) < s.length(); i++)
        {
            String str = s.substring(i,i+2);
            Bigram bigram = new Bigram(str.charAt(i),str.charAt(i+1));
            phrase.enqueue(bigram);
        }

         */
        return phrase;
    }
    /*

    public Phrase encrypt(KeyTable key)
    {

    }

    public Phrase decrypt(KeyTable)
    {

    }


     */

}