package practicaIntegradora;

import java.util.*;
import java.util.concurrent.LinkedBlockingDeque;

public class ColaDuplicada {
    public static void main(String[] args) {
        System.out.println("Initializing queue...");
        Deque<Integer> queue = new LinkedBlockingDeque<>();
        System.out.println("queue initialized. elems: " + queue);

        System.out.println("");
        System.out.println("Queuing 10 numbers...");
        for(int i = 1; i <=10; i++) {
            System.out.println("Queuing " + i);
            queue.addLast(i);
            System.out.println("Queue: " + queue);
        }

        System.out.println("");
        System.out.println("Adding elements from first queue into a duplicate queue, and duplicating their value");
        Deque<Integer> duplicatedQueue = new ArrayDeque<>();
        while(!queue.isEmpty()) {
            Integer element = queue.removeFirst();
            System.out.println("Adding element with a duplicated value: " + element);
            duplicatedQueue.addLast(element*2);
            System.out.println("First queue after removal: " + queue );
            System.out.println("Duplicate queue after adding element: " + duplicatedQueue );
        }

        System.out.println("");
        System.out.println("Extracting elements from duplicated queue until we find an odd number");
        while(!duplicatedQueue.isEmpty()) {
            Integer element = duplicatedQueue.peekFirst();
            if(element % 2 == 0) {
                duplicatedQueue.remove();
            }
            System.out.println("Duplicate queue after removing element until finding an odd one: " + duplicatedQueue );

        }

    }

}