/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package lab9zad2;

import java.util.*;







class Numerek implements Comparable<Numerek>{
    Numerek(int i,int j)
    {
        this.i=i;
        this.j=j;
    }
    int i;
    int j;


    @Override
    public int compareTo(Numerek o) {
        if (this.i>o.i)
           return 1;
        else if(this.i==o.i)
            return 0;
        else
            return -1;
    }
    @Override
    public int hashCode(){
       return this.i;
    }

    @Override
    public boolean equals(Object obj) {
        if (obj == null) {
            return false;
        }
        if (getClass() != obj.getClass()) {
            return false;
        }
        final Numerek other = (Numerek) obj;
        if (this.i != other.i) {
            return false;
        }
        return true;
    }


}


public class Lab9zad2 {


    public static void main(String[] args) {
        // TODO code application logic here
        ArrayList<Integer> arr=  new ArrayList<>();
        arr.add(5);
        arr.add(3);
        System.out.println(arr.size());

        Iterator<Integer> iter=arr.iterator();
        while(iter.hasNext())
        {
            System.out.println(iter.next());
        }

        LinkedList<Integer> lin= new LinkedList<>();
        lin.add(1);
        lin.add(12);
        lin.add(5);
        System.out.println(lin.size());

        Iterator<Integer> iter2=lin.iterator();
        while(iter2.hasNext())
        {
            System.out.println(iter2.next());
        }

        Set<Integer> has= new HashSet<>();
        has.add(6);
        has.add(6);
        has.add(3);
        System.out.println(has.size());

        Iterator<Integer> iter3=has.iterator();
        while(iter3.hasNext())
        {
            System.out.println(iter3.next());
        }

        Set<Integer> tre= new TreeSet<>();
        tre.add(7);
        tre.add(6);
        tre.add(3);
        System.out.println(tre.size());

        Iterator<Integer> iter4=tre.iterator();
        while(iter4.hasNext())
        {
            System.out.println(iter4.next());
        }

        Map<Integer,Integer> hasm= new HashMap<>();
        hasm.put(1,1);
        hasm.put(2,1);
        hasm.put(3,1);
        hasm.put(4,2);
        System.out.println(hasm.size());

        Map<Integer,Integer> trem= new TreeMap<>();
        trem.put(1,1);
        trem.put(2,2);
        trem.put(3,1);
        trem.put(4,2);
        System.out.println(hasm.size());


        Set<Numerek> hasNumerek= new HashSet<>();
        hasNumerek.add(new Numerek(1,2));
        hasNumerek.add(new Numerek(2,3));
        hasNumerek.add(new Numerek(4,2));
        System.out.println(hasNumerek.size());

        Set<Numerek> treNumerek= new TreeSet<>();
        treNumerek.add(new Numerek(2,3));
        treNumerek.add(new Numerek(7,8));
        treNumerek.add(new Numerek(2,9));
        System.out.println(tre.size());

        Map<Integer,Numerek> hasmNumerek= new HashMap<>();
        hasmNumerek.put(1,new Numerek(2,7));
        hasmNumerek.put(2,new Numerek(1,3));
        System.out.println(hasmNumerek.size());

        Map<Integer,Numerek> tremNumerek= new HashMap<>();
        tremNumerek.put(1,new Numerek(3,7));
        tremNumerek.put(2,new Numerek(1,8));
        System.out.println(hasmNumerek.size());

    }
}
///by shf zubrówka ( ARtur pic pic pic trzepac