1.1 (1) (2) (3) (4) 2

Size: px

Start display at page:

Download "1.1 (1) (2) (3) (4) 2"

きみえさかいざわ
5 years ago
Views:

1 1 Part

2 1.1 (1) (2) (3) (4) 2

3 2 JAVA (*) Java : 1. Java Java Java 3

4 3 int[] a; a = new int[3]; new int[3] a i a[i] 32bit a[i] 4

5 4 class Point { // double x, y, weight; // Point(double x, double y, double w) { this.x=x; this.y=y; weight=w; // // // void show() { System.out.println( "x="+x+", y="+y+ " with weight "+weight); this x a.x Point a x x Note: 5

6 5 Yes No 6

7 6 Point Point (1) (2) 7

8 7 class Point { MyVector drawvector(point ap) { double vx = ap.x - this.x ; double vy = ap.y - this.y; return new MyVector(vx, vy); void nantok(vector p1) { MyVector mv = p1.drawvector(p2)... ( ) = 8

9 8 class Triangle { // static final int nofpoints=3; // Point[] points = new Point[nofPoints]; // // void show() { for (short i=0;i<nofpoints;i++) points[i].show(); // show() show() ( ) static final int nofpoints=3; final

10 9 Triangle t = Point[] points new Triangle(); = new Point[nofPoints]; Triangle t = new Triangle(p0,p1,p2); ( oid) t Triangle( // Point p0, Point p1, Point p2) { points[0]=p0; points[1]=p1; points[2]=p2; Triangle() { Triangle() 10

11 10 class triangletest { public static void main(string args[]) { Triangle t = new Triangle( new Point(1,2,3), // new Point(4,5,6), new Point(7,8,9) ); // ( ) // t.show(); // t show() // // (OOLP) (Common LISP) COBOL! 11

12 11 class Point { // // x.length(p) : x length p double x, y, weight; double length(point p) {// return Math.sqrt(Math.pow(x-p.x,2)+Math.pow(y-p.y,2)); // sqrt: pow Math // Math.pow(...) : Math pow... Point(double x, double y, double weight) { // // this.x=x; this.y=y; this.weight=weight; class Triangle { static final int nofpoints = 3; // Point[] points = new Point[nofPoints]; // double sumoflength() {// double sumoflength = 0.0; for (int i=0;i<nofpoints;i++) // i++ i=i+1 sumoflength += points[i].length(points[(i+1)%nofpoints]); return sumoflength; // n, m n % m m void show() {... Triangle(...) {... public static void main(string args[]) { Triangle t = new Triangle( new Point(1,2,3), new Point(4,5,6), new Point(7,8,9) ); if (t.checktriangle()) System.out.println(" = "+ t.sumoflength()); else { System.out.println(" "); t.show(); ; 12

13 12 ( ) Java 13

14 13 14

15 14 Java private: public class A { private int aint; // private int aint() {return aint; // A(int x) {aint=x; // int subtract(int x) {return aint+minus(x); // private int minus(int x) {return -x; // e.g. (new A()).minus(10) // class B { int h(int x, int y) { A a = new A(x); return a.subtract(y); private B() { // // object public static void main(string args[]) { int a1 = Integer.parseInt(args[0]), a2= Integer.parseInt(args[1]); System.out.println( new B().h(a1,a2) ); private getattr() setattr(...) 15

14.1... private public public static void

16 private public public static void main(string[]) interface nesting 16

17 15 x 1, x 2..., x n null class IntCell {// private int value ; int getvalue() {return value; private IntCell next; IntCell next() {return next; IntCell(int value) {this.value = value; IntCell(int value, IntCell cell) { this.value = value; next = cell; void showvalue() {System.out.print(value+" "); class IntList { private int size = 0; private IntCell firstcell = null; void tail() { firstcell = firstcell.next(); size--; void cons(int x) { if (size == 0) firstcell = new IntCell(x); else { IntCell nextfirstcell = new IntCell(x,firstCell); firstcell = nextfirstcell; ; size++; void show() { IntCell presentcell = firstcell; for (int i=0;i<size;i++) { presentcell.showvalue(); presentcell = presentcell.next(); ; System.out.println("#end_of_list"); 17

18 16 32 bit 31 1 a.intvalue() x int b b class A{ public static void main(string[] args) { System.out.println("Integer.MAX_VALUE = "+Integer.MAX_VALUE); System.out.println("Math.pow(2,31) = "+(int)math.pow(2,31)); System.out.println("Integer.MAX_VALUE +1 = "+(Integer.MAX_VALUE +1)); c:\users\makoto\home\lecture\pl\resume>java A Integer.MAX_VALUE = Math.pow(2,31) = Integer.MAX_VALUE +1 =

19 17 obj.m(p1,.., pn) obj m(p1,.., pn) obj m(p1,.., pn) obj m(p1,..,pn) 19

20 18 obj m p1,.., pn m class Teacher {... void assignrept(student st, Task task) { Answer ans = st.report(task); // st report // // ans if (ok(ans)) {... else {...;... class Student { // // Answer report(task task) {... Answer myanswer = new Answer(...); return myanswer; // myanswer (statisfa.java, fa.java) 20

21 yes a = new Friend(...);... if (a.fine()) a.dotask1(...)... Friend fine friend 21

22 19 / str next next process class State { private static final short nofsymbols = 2; // {0,1 private String name; private boolean accept; // private State(String n, boolean f) {name = n; accept = f; private State[] nextstates = new State[nofSymbols]; void definenextstate(state next0, State next1) { nextstates[0] = next0; nextstates[1] = next1; private short head(string str) {return Short.parseShort(str.substring(0,1)); private String tail(string str) {return str.substring(1,str.length()); private void process(string input) { if (input.length()!=0) nextstates[head(input)].process(tail(input)); else if (accept) System.out.println("OK"); else System.out.println("NG"); public static void main(string args[]) { State q0 = new State("q0", false), q1 = new State("q1", false), q2 = new State("q2", true), q3 = new State("q3", false) ; q0.definenextstate(q1, q3); q1.definenextstate(q3, q2); q2.definenextstate(q1, q3); q3.definenextstate(q3, q3); q0.process(args[0]); main(string[]) private private 22

23 20 Definition of consists of 1, 2,... or j part of, has_a isa, or is defined as a such that... extends... has a role/function of implements 23

24 21 class Point { private double x,y; Point(double x, double y) { this.x = x; this.y =y; void show() { System.out.println(" x="+x +", y="+y); class Triangle { private static final int nofpoints=3; private Point[] points = new Point[nofPoints]; private Triangle(Point p0, Point p1, Point p2) { points[0]=p0; points[1]=p1; points[2]=p2; private void show() { for (short i=0;i<nofpoints;i++) points[i].show(); public static void main(string args[]) { Triangle t = new Triangle( new Point(1,2), new Point(4,5), new Point(7,8) ); t.show(); //void main(string[]) // Triangle static variable : this (static) public static void main(string args[]) java main void main(string[]) main Triangle main Triangle(...) void show() private 24

25 22 static final Math int Integer.parseInt(String), double Math.sqrt(double) 25

26 23 C Java static, instance methods f g g = f // f(n)=f(n-1)+f(n-2), f(1)=f(0)=1 class Fibonacci{ static int rec_fib(int n) {// if (n==0 n==1) return 1; return rec_fib(n-1)+rec_fib(n-2); static int it_fib(int n) {// // if (n==0 n==1) return 1; int nminus1 = 1, nminus2 = 1, tmp; for (int i=1;i<n;i++) { tmp = nminus1; nminus1 = nminus1 + nminus2; nminus2 = tmp; ; return nminus1; 26

27 24 static void main(string args[]) static 27

28 25 28

29 26 static int nofitems = 0; // static int[] stock = new int[10000], price = new int[10000]; static String[] itemname = new String[10000];... static void additem(int initialstock, int price, String itemname) { if (nofitems == 10000) { System.out.println("sorry, full list"); return; ; stock[nofitems] = initialstock; price[nofitems] = price; itemname[nofitem++] = itemname; static int[] code = int[10000]; static void additem( int initialstock, int price, String itemname, int codenumber) {... code[nofitems] = codenumber; code stock, price, itemname 29

30 27 class Item { private int stock, price; Item(int initialstock, int price) { stock=initialstock; this.price=price; class ItemList { private static int MaxNof = 10000; private int nof = 0; private Item[] list = new Item[MaxNof]; void add(item item) { if (nof!= MaxNof) list[nof++] = item; else System.out.println("full list"); code name add(item) item.code Item tmp = itemlist[i]; itemlist[i] = itemlist[j]; itemlist[j] = tmp; ItemList itemlist = new ItemList(); itemlist.add(new Item(100,1200," ")); java.util class MyList { private static int MaxNof = 10000; private int nof = 0; private Object[] list = new Object[MaxNof]; void add(object obj) { if (nof!= MaxNof) list[nof++] = obj; else System.out.println("sorry, full list"); 30

31 28 31

32 29 Java Java 32

33 MyVector 1. Point boolean checkpointonline(point p1, Point p2); true, otherwise false. 2. Triangle double computearea(); (a) (b) (1) (2) static Java 33

34 30 q0 q2 {(01) n n 1 1. {0, 1 2. σ 0 σ 1...σ n 1 n (1) σ 0 q next (2) q next σ 1...σ n 1 3. n = 0 State ( ) 34

DVIOUT-oolin

DVIOUT-oolin オブジェクト指向操作対象の理解と言語の効率性プログラム理論と言語 Part2-1-1 関連したデータの塊を1つのものとして認識 (1) クラス= ものとものに付随した操作系 (2) クラスのことはクラス内部で処理ブラックボックス化し外部仕様を明確化部品としての再利用安全性