Script Programming(스크립트 프로그래밍)

package concurrent;

import static fj.Bottom.error;
import fj.Effect;
import fj.F;
import fj.P;
import fj.P2;
import fj.Unit;
import fj.data.List;
import fj.control.parallel.Actor;
import fj.control.parallel.Promise;
import fj.control.parallel.Strategy;
import static fj.data.List.range;
import static fj.function.Integers.add;
import static fj.control.parallel.Promise.join;
import static fj.control.parallel.Promise.promise;
import static fj.control.parallel.Actor.actor;

import java.text.MessageFormat;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

/**
 * Parallel Fibonacci numbers.
 * Based on a Haskell example by Don Stewart.
 * Author: Runar
 */
public class Fibs
  {private static final int CUTOFF = 35;

   public static void main(final String[] args)
     {if (args.length < 1)
         throw error("This program takes an argument: number_of_threads");

      final int threads = Integer.parseInt(args[0]);
      final ExecutorService pool = Executors.newFixedThreadPool(threads);
      final Strategy<Unit> su = Strategy.executorStrategy(pool);
      final Strategy<Promise<Integer>> spi = Strategy.executorStrategy(pool);

      // This actor performs output and detects the termination condition.
      final Actor<List<Integer>> out = actor(su, new Effect<List<Integer>>()
        {public void e(final List<Integer> fs)
          {for (final P2<Integer, Integer> p : fs.zipIndex())
               {System.out.println(MessageFormat.format("n={0} => {1}", p._2(), p._1()));}
           pool.shutdown();}});

      // A parallel recursive Fibonacci function
      final F<Integer, Promise<Integer>> fib = new F<Integer, Promise<Integer>>()
        {public Promise<Integer> f(final Integer n)
          {return n < CUTOFF ? promise(su, P.p(seqFib(n))) : f(n - 1).bind(f(n - 2), add);}};

      System.out.println("Calculating Fibonacci sequence in parallel...");
      join(su, spi.parMap(fib, range(0, 46)).map(Promise.<Integer>sequence(su))).to(out);}

  // The sequential version of the recursive Fibonacci function
  public static int seqFib(final int n)
    {return n < 2 ? n : seqFib(n - 1) + seqFib(n - 2);}}

/*
  Execution Examples (with Java 1.6.0_12):

      Prompt> java DivideEachApp 1234567812343
      1234567812343 = 1 * 1234567812343
      1234567812343 is a prime
      Elapsed time: 0.25 sec

      Prompt> java DivideEachApp 9999994200000841
      9999994200000841 = 99999971 * 99999971
      9999994200000841 is a not prime
      Elapsed time: 21.047 sec

      Prompt> java DivideEachApp 18446744073709551617
      18446744073709551617 = 274177 * 67280421310721
      18446744073709551617 is a not prime
      Elapsed time: 0.078 sec

      Prompt> java DivideEachApp 10023859281455311421
      10023859281455311421 = 1308520867 * 7660450463
      10023859281455311421 is a not prime
      Elapsed time: 304.906 sec
*/

import java.math.*;
import java.util.*;

public class DivideEachApp {
    public static void main(String[] args) {
        final BigInteger ONE = new BigInteger("1");
        final BigInteger TWO = new BigInteger("2");
        BigInteger n, k, d, z;
        n = new BigInteger("10006099720301");
        if (args.length > 0) {
            n = new BigInteger(args[0]);
        }

        z = n.divide(TWO);    // z = n / 2
        if (n.equals(z.multiply(TWO))) {
            System.out.println(n + "n = 2 * " + z);
        }

        double time1 = new GregorianCalendar().getTime().getTime();

        d = new BigInteger("1");
        k = new BigInteger("3");
        while (k.multiply(k).compareTo(n) <= 0) {
            z = n.divide(k);    // z = n / k
            if ( n.equals(k.multiply(z)) ) {
                d = k;
                break;
            }
            k = k.add(TWO);
        }

        double time2 = new GregorianCalendar().getTime().getTime();

        System.out.println(n + " = " + d + " * " + n.divide(d));
        if (d.equals(ONE))
            System.out.println(n + " is a prime");
        else
            System.out.println(n + " is a not prime");

        System.out.println("Elapsed time: " + (time2 - time1)/1000.0 + " sec");
    }
}

/*
  Execution Examples (with java 1.6.0_12):

      Prompt> java PollardRhoApp 1234567812343
      Try first the Pollard rho algorithm with c = 2
      d = 1234567812343, count = 466951
      Try second the Pollard rho algorithm with c = 3
      d = 1, count = 1111112
      Try third the Pollard rho algorithm with c = 1
      d = 1234567812343, count = 799441
      1234567812343 = 1234567812343 * 1
      Elapsed time: 17.735 sec

      Prompt> java PollardRhoApp 9999994200000841
      Try first the Pollard rho algorithm with c = 2
      d = 99999971, count = 3593
      9999994200000841 = 99999971 * 99999971
      Elapsed time: 0.062 sec

      Prompt> java PollardRhoApp 18446744073709551617
      Try first the Pollard rho algorithm with c = 2
      d = 274177, count = 1028
      18446744073709551617 = 274177 * 67280421310721
      Elapsed time: 0.032 sec

      Prompt> java PollardRhoApp 10023859281455311421
      Try first the Pollard rho algorithm with c = 2
      d = 1308520867, count = 20350
      10023859281455311421 = 1308520867 * 7660450463
      Elapsed time: 0.297 sec
*/

import java.math.*;
import java.util.*;

public class PollardRhoApp {
    public static BigInteger f(BigInteger x, BigInteger c, BigInteger n) {
        return x.multiply(x).add(c).mod(n);    // (x*x + c) % n
    }

    public static BigInteger g(BigInteger x, BigInteger c, BigInteger n) {
        return f(f(x, c, n), c, n);
    }

    public static BigInteger gcd(BigInteger x, BigInteger y) {
        BigInteger a, b, t;
        a = x.abs();
        b = y.abs();
        if (b.equals(BigInteger.ZERO)) {
            return a;
        }
        while (!b.equals(BigInteger.ZERO)) {
            t = a.mod(b);
            a = b;
            b = t;
        }
        return a;
    }

    public static BigInteger pollardRho(BigInteger n) {
        BigInteger c, x, y, d, count, savedX;
        final BigInteger ONE = new BigInteger("1");
        c = new BigInteger("2");
        x = new BigInteger("1");
        y = new BigInteger("1");
        d = new BigInteger("1");
        savedX = x;
        count = BigInteger.ZERO;
        System.out.println("Try first the Pollard rho algorithm with c = " + c);
        while (d.equals(ONE) && count.multiply(count).compareTo(n) <= 0) {
            x = f(x, c, n);
            if (x.equals(savedX)) {
             System.out.println("It is cyclic.  x = " + x);
             break;
            }
            y = g(y, c, n);
            d = gcd(x.subtract(y).abs(), n);
            count = count.add(ONE);
            // if (count % 5000 == 0) {
            //  println("  count = $count")
            // }
        }

        System.out.println("d = " + d + ", count = " + count);
        if (d.compareTo(ONE) > 0 && d.compareTo(n) < 0) {
            return d;
        }

        c = new BigInteger("3");
        x = new BigInteger("1");
        y = new BigInteger("1");
        d = new BigInteger("1");
        savedX = x;
        count = BigInteger.ZERO;
        System.out.println("Try second the Pollard rho algorithm with c = " + c);
        while (d.equals(ONE) && count.multiply(count).compareTo(n) <= 0) {
            x = f(x, c, n);
            if (x.equals(savedX)) {
             System.out.println("It is cyclic.  x = " + x);
             break;
            }
            y = g(y, c, n);
            d = gcd(x.subtract(y).abs(), n);
            count = count.add(ONE);
            // if (count % 5000 == 0) {
            //  println("  count = $count")
            // }
        }

        System.out.println("d = " + d + ", count = " + count);
        if (d.compareTo(ONE) > 0 && d.compareTo(n) < 0) {
            return d;
        }

        c = new BigInteger("1");
        x = new BigInteger("1");
        y = new BigInteger("1");
        d = new BigInteger("1");
        savedX = x;
        count = BigInteger.ZERO;
        System.out.println("Try third the Pollard rho algorithm with c = " + c);
        while (d.equals(ONE) && count.multiply(count).compareTo(n) <= 0) {
            x = f(x, c, n);
            if (x.equals(savedX)) {
             System.out.println("It is cyclic.  x = " + x);
             break;
            }
            y = g(y, c, n);
            d = gcd(x.subtract(y).abs(), n);
            count = count.add(ONE);
            // if (count % 5000 == 0) {
            //  println("  count = $count")
            // }
        }

        System.out.println("d = " + d + ", count = " + count);

        return d;
    }

    public static void main(String[] args) {
        BigInteger n, k, z;
        n = new BigInteger("9991");
        if (args.length > 0) {
            n = new BigInteger(args[0]);
        }

        double time1 = new GregorianCalendar().getTime().getTime();

        k = pollardRho(n);
        z = n.divide(k);
        System.out.println(n + " = " + k + " * " + z);

        double time2 = new GregorianCalendar().getTime().getTime();
        System.out.println("Elapsed time: " + (time2 - time1)/1000.0 + " sec");
    }
}

import java.io.*;
import java.util.*;

public class MakeMultTableApp {
    public static void printUsing() {
        System.out.println("Using: java MakeMultTableApp [number1] [number2]");
        System.out.println("Print a multiplication table for given two integers.");
    }

    public static void printMultTable(long x, long y) {
        long nx = (x >= 0L) ? x : - x;
        long ny = (y >= 0L) ? y : - y;
        int ntail1 = 0;
        int ntail2 = 0;
        while (nx % 10 == 0) {
            nx = nx / 10;
            ntail1++;
        }
        while (ny % 10 == 0) {
            ny = ny / 10;
            ntail2++;
        }
        long z = nx * ny;
        String strZ = "" + z;
        String strX = "" + nx;
        String strY = "" + ny;
        int n = strY.length();
        String zeros  = "0000000000000000000000000000000000000000";
        String whites = "                                        ";
        String bars   = "----------------------------------------";
        String line1, line2, line3, line4;
        String loffset = "       ";
        line4 = loffset + strZ;
        line1 = loffset + whites.substring(0, strZ.length() - strX.length()) + strX;
        line2 = "   x ) " +  whites.substring(0, strZ.length() - strY.length()) + strY;
        line3 = "     --" +  bars.substring(0, strZ.length());
        System.out.println(line1 + zeros.substring(0, ntail1));
        System.out.println(line2 + zeros.substring(0, ntail2));
        System.out.println(line3);
        if (strY.length() > 1) {
            int y1;
            String strT;
            for (int i = 0; i < strY.length(); i++) {
                y1 = Integer.parseInt(strY.substring(strY.length() - i - 1, strY.length() - i));
                if (y1 != 0) {
                    strT = "" + (nx * y1);
                    System.out.println(loffset + whites.substring(0, strZ.length() - strT.length() - i) + strT);
                }
            }
            System.out.println(line3);
        }
        System.out.println(line4 + zeros.substring(0, ntail1) + zeros.substring(0, ntail2));
    }

    public static void main(String[] args) {
        long x, y;
        if (args.length >= 2) {
            x = Long.parseLong(args[0]);
            y = Long.parseLong(args[1]);
            System.out.println("");
            printMultTable(x, y);
        }
        else {
            printUsing();
        }
    }
}

/*
 * HelloHangul.java
 *
 *    컴파일: javac -classpath .;iText-rtf-2.1.4.jar;iText-2.1.4.jar HelloHangul.java
 *      실행: java -cp .;iText-rtf-2.1.4.jar;iText-2.1.4.jar HelloHangul *
 */

import java.io.FileNotFoundException;
import java.io.FileOutputStream;

import com.lowagie.text.Document;
import com.lowagie.text.DocumentException;
import com.lowagie.text.Paragraph;
import com.lowagie.text.rtf.RtfWriter2;

public class HelloHangul {
    public static void main(String[] args) {
        System.out.println("Hello, 한글! RTF 파일 생성됨");
        try {
            // 도큐먼트 생성
            Document document = new Document();
           
            // RtfWriter2 생성
            RtfWriter2.getInstance(document, new FileOutputStream("HelloHangul.rtf"));
           
            // 도큐먼트 열기
            document.open();
           
            // Step 4: Add content to the document.
            document.add(new Paragraph("Hello, 한글!"));
           
            // 도큐먼트 닫기
            document.close();
        } catch (FileNotFoundException fnfe) {
            // 파일을 생성 할 수 없을 때
            fnfe.printStackTrace();
        } catch (DocumentException de) {
            // DocumentExceptions arise if you add content to the document before opening or
            // after closing the document.
            // 도큐먼트를 열기 전이나 닫은 후의 예외상황 발생
            de.printStackTrace();
        }
    }
}

/*
 * HelloSwingApp.java
 */

import java.awt.*;
import java.awt.event.*;
import javax.swing.*;

public class HelloSwingApp extends JFrame implements ActionListener {
 
   JButton button1;
   JLabel label1;

   public static void main(String[] args) {
      HelloSwingApp app = new HelloSwingApp();
      app.setTitle("Hello Win");
      app.addWindowListener(new WindowAdapter() {
          public void windowClosing(WindowEvent we) {
              System.exit(0);
          }
      });
      app.setLocation(50, 50);
      app.setSize(200, 140);
      app.setVisible(true);
   }

   public HelloSwingApp() {
      Container pane1 = this.getContentPane();
      pane1.setLayout(null);
      button1 = new JButton("클릭하세요!");
      button1.addActionListener(this);
      button1.setBounds(40, 70, 120, 30);
      label1 = new JLabel("");
      label1.setBounds(30, 20, 120, 20);
      pane1.setBackground(new Color(0xFF, 0xFF, 0xEE));
      pane1.add(label1);
      pane1.add(button1);
   }

   private JDialog dialog1;
   private JPanel panDiag;

   public void actionPerformed(ActionEvent e) {
      Object src = e.getSource();
      if (src instanceof JButton) {
          if ((JButton) src == button1) {
              dialog1 = new JDialog(this, "메시지");
              dialog1.setSize(180, 120);
              dialog1.setLocation(300, 200);
              dialog1.addWindowListener(new WindowAdapter() {
                  public void windowClosing(WindowEvent we) {
                      dialog1.dispose();
                  }
              });
         
              panDiag = new JPanel() {
                  public void paint(Graphics g) {
                      g.drawString( "안녕하세요?", 30, 30 );
                  }
              };

              dialog1.add(panDiag);
              dialog1.setVisible(true);
              label1.setText("Hello, world!");
          }
      }
   }
}

/*
 * HelloWinApp.java
 */

import java.awt.*;
import java.awt.event.*;

public class HelloWinApp extends Frame implements ActionListener {

   Button button1;
   Label label1;

   public static void main(String[] args) {
      HelloWinApp app = new HelloWinApp();
      app.setTitle("Hello Win");
      app.addWindowListener(new WindowAdapter() {
          public void windowClosing(WindowEvent we) {
            System.exit(0);
          }
      });
      app.setLocation(50, 50);
      app.setSize(200, 140);
      app.setVisible(true);
    }
 
    public HelloWinApp() {
      setLayout(null);
      button1 = new Button("클릭하세요!");
      button1.addActionListener(this);
      button1.setBounds(40, 100, 120, 30);
      label1 = new Label("");
      label1.setBounds(30, 60, 120, 20);
      setBackground(new Color(0xFF, 0xFF, 0xEE));
      add(label1);
      add(button1);
   }

   private Dialog dialog1;
   private Panel panDiag;

   public void actionPerformed(ActionEvent e) {
      Object src = e.getSource();
      if (src instanceof Button) {
            if ((Button) src == button1) {
                dialog1 = new Dialog(this, "메시지");
                dialog1.setSize(180, 120);
                dialog1.setLocation(300, 200);
                dialog1.addWindowListener(new WindowAdapter() {
                    public void windowClosing(WindowEvent we) {
                        dialog1.dispose();
                    }
                });
         
                panDiag = new Panel() {
                    public void paint(Graphics g) {
                      g.drawString( "안녕하세요?", 30, 30 );
                    }
                };

                dialog1.add(panDiag);
                dialog1.setVisible(true);
                label1.setText("Hello, world!");
            }
      }
   }
}