import java.util.concurrent.*;
import easyIO.*;
// enklest mulig modell-kode for parallellitet,
// se Model2.java for tidtaking mm
class Tider2016 {
	Out ut;
	int n;

	void println(String s){
		System.out.println(s);
		ut.outln(s);
	}

     //  felles data og metoder A
      public static void main(String [] args) {
		  if ( args.length != 2)	{
		  			System.out.println("use: >java Tider2016  <n> <fil>");
	      } else {
            Tider2016 p = new Tider2016();
            p.utfoer(args);
		}
      }

      int neste(int i){
		  return i+1;
	  }

      void utfoer (String [] args) {
		  n = Integer.parseInt(args[0]);
		  ut = new Out(args[1],true);  // Open with append
          int k=0;
		  long t;
		  double d;
		  String s;
		  int [] ia;
		  Thread t1;

		  class C { int i;C(int i){ this.i =i;} int les () { return i+10;} } // end C
          class D { int i;D(int i){ this.i =i;} int les () { return i+11;} } // end D


		  //Metodekall
		  s ="Metodekall";
		  t = System.nanoTime();
		  k=neste(k);
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			  k+=neste(k);
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");


		  s ="Array new len =100";
		  t = System.nanoTime();
		  ia = new int[100];
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
		     ia = new int[100];
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");



		  s ="new Thread() start & join ";
		  t = System.nanoTime();
		   (t1 = new Thread(new Arbeider(3))).start();
		  try{t1.join();}catch (Exception e){}
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			  (t1 = new Thread(new Arbeider(3))).start();
			  try{t1.join();}catch (Exception e){}
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");
          System.gc();

		  s ="new Class C+ metodekall ";
		  t = System.nanoTime();
		  k= new C(k).les();
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			    k= new C(k).les();
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");

		  s ="new Class D+ metodekall ";
		  t = System.nanoTime();
		  k= new D(k).les();
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
				k= new D(k).les();
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");

		  s ="Array write";
		  t = System.nanoTime();
			ia[k%55] =669;
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
			  ia[i%100] =i;
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");



		  //Array les
		  s ="Array les ";
		  t = System.nanoTime();
		  k = ia[55];
		  d = (double) ((System.nanoTime() -t)/1000.0);
		  println(s+Format.align(d,10,4)+"us. forste gang");
		   t = System.nanoTime();
		  for (int i = 0; i<n; i++) {
				k = ia[i%55];
		  }
		  d = (double) ((System.nanoTime() -t)/(n*1000.0));
		  println(s+Format.align(d,10,4)+"us.snitt " + n+" ganger");




        ut.close();



      }

       class Arbeider implements Runnable {
	       int ind;
	       // lokale data og metoder B til hver traad
	              Arbeider (int in) {ind = in;}
	               public void run( ) {
	                   ind++;
	               } // end run
      } // end indre klasse Arbeider


} // end class Tider2015