Chapter 6 Methods Liang Introduction to Java Programming

  • Slides: 57
Download presentation
Chapter 6 Methods Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education,

Chapter 6 Methods Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 1

Opening Problem Find the sum of integers • from 1 to 10, • from

Opening Problem Find the sum of integers • from 1 to 10, • from 20 to 30, and • from 35 to 45, respectively. • Motivation Learn to define methods that can be used again and again. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 2

Solutions of Opening Problem int sum = 0; // sum of integers from 1

Solutions of Opening Problem int sum = 0; // sum of integers from 1 to 10 for (int i = 1; i <= 10; i++) sum += i; System. out. println("Sum from 1 to 10 is " + sum); sum = 0; // sum of integers from 20 to 30 for (int i = 20; i <= 30; i++) sum += i; System. out. println("Sum from 20 to 30 is " + sum); sum = 0; // sum of integers from 35 to 45 for (int i = 35; i <= 45; i++) sum += i; System. out. println("Sum from 35 to 45 is " + sum); Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 3

Modularized Solutions of Opening Problem public static int sum(int i 1, int i 2)

Modularized Solutions of Opening Problem public static int sum(int i 1, int i 2) { int sum = 0; for (int i = i 1; i <= i 2; i++) sum += i; return sum; } (p. 228) Method. Demo. java Method. Demo Run public static void main(String[] args) { System. out. println("Sum from 1 to 10 is " + sum(1, 10)); System. out. println("Sum from 20 to 30 is " + sum(20, 30)); System. out. println("Sum from 35 to 45 is " + sum(35, 45)); } Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 4

Structure of the Modularized Solution public class Method. Demo { … sum(int i 1,

Structure of the Modularized Solution public class Method. Demo { … sum(int i 1, int i 2) { … } (p. 228) Method. Demo. java Method. Demo Run … main(String[] args) { … (…+ sum(1, 10)); … (…+ sum(20, 30)); … (…+ sum(35, 45)); } } Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 5

Objectives § § § § § To define methods with formal parameters (形式參數, §

Objectives § § § § § To define methods with formal parameters (形式參數, § 6. 2). To invoke methods with actual parameters (i. e. , arguments,實際參數). To define methods with a return value (§ 6. 3). To define methods without a return value (§ 6. 4). To pass arguments by value (§ 6. 5). To develop reusable code that is modular, easy to read, easy to debug, and easy to maintain (§ 6. 6). To use method overloading and understand ambiguous overloading (§ 6. 8). To determine the scope of variables (§ 6. 9). To apply the concept of method abstraction in software development (§ 6. 10). To design and implement methods using stepwise refinement (§ 6. 10). Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 6

Defining Methods A method is a collection of statements that are grouped together to

Defining Methods A method is a collection of statements that are grouped together to perform a particular operation. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 7

Defining Methods A method is a collection of statements that are grouped together to

Defining Methods A method is a collection of statements that are grouped together to perform an operation. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 8

Method Signature (簽章、標記) Method signature is the combination of the method name and the

Method Signature (簽章、標記) Method signature is the combination of the method name and the parameter list (參數序列). Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 9

Formal Parameters The variables defined in the method header are known as formal parameters.

Formal Parameters The variables defined in the method header are known as formal parameters. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 10

Actual Parameters When a method is invoked (呼叫), you pass to each parameter a

Actual Parameters When a method is invoked (呼叫), you pass to each parameter a value which is referred to as actual parameter or argument. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 11

Return Value Type • A method may return a value. The return. Value. Type

Return Value Type • A method may return a value. The return. Value. Type is the data type of the value the method returns. • If the method does not return a value, the return. Value. Type is the keyword void. • E. g. , the return. Value. Type in the main method is void. main eample Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 12

Calling Methods Testing the max method This program demonstrates calling a method max to

Calling Methods Testing the max method This program demonstrates calling a method max to return the largest of the int values Listing 6. 1 (p. 230) Method. Demo. java Test. Max Run program flow Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 13

animation Calling Methods, cont. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson

animation Calling Methods, cont. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 14

animation Trace Method Invocation i is now 5 Liang, Introduction to Java Programming, Eleventh

animation Trace Method Invocation i is now 5 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 15

animation Trace Method Invocation j is now 2 Liang, Introduction to Java Programming, Eleventh

animation Trace Method Invocation j is now 2 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 16

animation Trace Method Invocation Invoke (呼叫) max(i, j) Liang, Introduction to Java Programming, Eleventh

animation Trace Method Invocation Invoke (呼叫) max(i, j) Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 17

animation Trace Method Invocation invoke max(i, j) Pass the value of i to num

animation Trace Method Invocation invoke max(i, j) Pass the value of i to num 1 Pass the value of j to num 2 i=5 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. j=2 18

animation Trace Method Invocation declare variable result Liang, Introduction to Java Programming, Eleventh Edition,

animation Trace Method Invocation declare variable result Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 19

animation Trace Method Invocation (num 1 > num 2) is true since num 1

animation Trace Method Invocation (num 1 > num 2) is true since num 1 is 5 and num 2 is 2 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 20

animation Trace Method Invocation result is now 5 Liang, Introduction to Java Programming, Eleventh

animation Trace Method Invocation result is now 5 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 21

animation Trace Method Invocation return result, which is 5 Liang, Introduction to Java Programming,

animation Trace Method Invocation return result, which is 5 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 22

animation Trace Method Invocation return max(i, j) and assign the return value to k

animation Trace Method Invocation return max(i, j) and assign the return value to k Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 23

animation Trace Method Invocation Execute the print statement Liang, Introduction to Java Programming, Eleventh

animation Trace Method Invocation Execute the print statement Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 24

CAUTION A return statement is required for a value-returning method. The method shown below

CAUTION A return statement is required for a value-returning method. The method shown below in (a) is logically correct, but it has a compilation error because the Java compiler thinks it possible that this method does not return any value. To fix this problem, delete if (n < 0) in (a), so that the compiler will see a return statement to be reached regardless of how the if statement is evaluated. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 25

Reuse Methods from Other Classes NOTE: l One of the benefits of methods is

Reuse Methods from Other Classes NOTE: l One of the benefits of methods is for reuse. l The max method can be invoked from any class besides Test. Max. l If you create a new class Test, you can invoke the max method using Class. Name. method. Name (e. g. , Test. Max. max). Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 26

Call Stacks (呼叫堆疊) 1 2 3 4 5 detailed steps Liang, Introduction to Java

Call Stacks (呼叫堆疊) 1 2 3 4 5 detailed steps Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 27

animation Trace Call Stack i is declared and initialized Liang, Introduction to Java Programming,

animation Trace Call Stack i is declared and initialized Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 28

animation Trace Call Stack j is declared and initialized Liang, Introduction to Java Programming,

animation Trace Call Stack j is declared and initialized Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 29

animation Trace Call Stack Declare k Liang, Introduction to Java Programming, Eleventh Edition, (c)

animation Trace Call Stack Declare k Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 30

animation Trace Call Stack Invoke max(i, j) All Steps Liang, Introduction to Java Programming,

animation Trace Call Stack Invoke max(i, j) All Steps Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 31

animation Trace Call Stack pass the values of i and j to num 1

animation Trace Call Stack pass the values of i and j to num 1 and num 2 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 32

animation Trace Call Stack Declare result All Steps Liang, Introduction to Java Programming, Eleventh

animation Trace Call Stack Declare result All Steps Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 33

animation Trace Call Stack (num 1 > num 2) is true Liang, Introduction to

animation Trace Call Stack (num 1 > num 2) is true Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 34

animation Trace Call Stack Assign num 1 to result All Steps Liang, Introduction to

animation Trace Call Stack Assign num 1 to result All Steps Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 35

animation Trace Call Stack Return result and assign it to k Liang, Introduction to

animation Trace Call Stack Return result and assign it to k Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 36

animation Trace Call Stack Execute print statement All Steps Liang, Introduction to Java Programming,

animation Trace Call Stack Execute print statement All Steps Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 37

void Method Example This type of method does not return a value. The method

void Method Example This type of method does not return a value. The method performs some actions. Listing 6. 2 (p. 233) Test. Void. Method. java Test. Void. Method Run Listing 6. 3 (p. 233) Test. Return. Grade. Method. java Test. Return. Grade. Method Run Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 38

Passing Parameters public static void n. Println(String message, int n) { for (int i

Passing Parameters public static void n. Println(String message, int n) { for (int i = 0; i < n; i++) System. out. println(message); } Suppose you invoke the method using n. Println(“Welcome to Java”, 5); What is the output? Suppose you invoke the method using n. Println(“Computer Science”, 15); What is the output? Can you invoke the method using n. Println(15, “Computer Science”); Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 39

Pass by Value This program demonstrates passing values to the methods. Listing 6. 4

Pass by Value This program demonstrates passing values to the methods. Listing 6. 4 (p. 236) Increment. java Increment Run Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 40

Pass by Value Testing Pass by value This program demonstrates passing values to the

Pass by Value Testing Pass by value This program demonstrates passing values to the methods. Listing 6. 5 (p. 237) Test. Pass. By. Value. java Test. Pass. By. Value Run 場景 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 41

Pass by Value, cont. 1 2 3 4 Liang, Introduction to Java Programming, Eleventh

Pass by Value, cont. 1 2 3 4 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 5 42

Overloading Methods Overloading the max Method public static double max(double num 1, double num

Overloading Methods Overloading the max Method public static double max(double num 1, double num 2) { if (num 1 > num 2) return num 1; Another max Method else return num 2; } Listing 6. 9 (p. 244) Test. Method. Overloading. java Test. Method. Overloading Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. Run 43

Ambiguous Invocation (分不清的呼叫) Sometimes there may be two or more possible matches for an

Ambiguous Invocation (分不清的呼叫) Sometimes there may be two or more possible matches for an invocation of a method, but the compiler cannot determine the most specific match. This is referred to as ambiguous invocation. Ambiguous invocation is a compile error. 例子 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 44

Ambiguous Invocation public class Ambiguous. Overloading { public static void main(String[] args) { System.

Ambiguous Invocation public class Ambiguous. Overloading { public static void main(String[] args) { System. out. println(max(1, 2)); } public static double max(int num 1, double num 2) { if (num 1 > num 2) return num 1; else return num 2; } public static double max(double num 1, int num 2) { if (num 1 > num 2) return num 1; else return num 2; } } Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 45

Scope of Local Variables l l l Local variable: a variable defined inside a

Scope of Local Variables l l l Local variable: a variable defined inside a method. Scope: the part of the program where the variable can be referenced. The scope of a local variable l starts from its declaration, and l continues to the end of the block that contains the variable. l l A local variable must be declared before it can be used. A local variable can be declared with the same name multiple times in different non-nesting (非從屬的) blocks in a method, but you cannot declare a local variable twice in nested blocks. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 46

Scope of Local Variables, cont. l l A variable declared in the initial action

Scope of Local Variables, cont. l l A variable declared in the initial action part of a for loop header has its scope in the entire loop. A variable declared inside a for loop body has its scope limited in the loop body from its declaration and to the end of the block that contains the variable. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 47

Scope of Local Variables, cont. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018

Scope of Local Variables, cont. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 48

Scope of Local Variables, cont. // Fine with no errors public static void correct.

Scope of Local Variables, cont. // Fine with no errors public static void correct. Method() { int x = 1; int y = 1; // i is declared for (int i = 1; i < 10; i++) { x += i; } // i is declared again for (int i = 1; i < 10; i++) { y += i; } } Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 49

Scope of Local Variables, cont. // With errors : x is declared twice public

Scope of Local Variables, cont. // With errors : x is declared twice public static void incorrect. Method() { int x = 1; int y = 1; for (int i = 1; i < 10; i++) { int x = 0; x += i; } } Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 50

Case Study: Generating Random Characters l l You have seen many examples that involve

Case Study: Generating Random Characters l l You have seen many examples that involve numerical data. It is also important to understand characters and how to process them. Each character has a unique Unicode between 0 and FFFF in hexadecimal (65535 in decimal) - Section 4. 3. To generate a random character is to generate a random integer between 0 and 65535 using the following expression: (int) (Math. random() * (65535 + 1)) Note that since 0 <= Math. random() < 1. 0, you have to add 1 to 65535. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 51

Case Study: Generating Random Characters, cont. Now let us consider how to generate a

Case Study: Generating Random Characters, cont. Now let us consider how to generate a random lowercase letter. l The Unicode for lowercase letters are consecutive integers starting from the Unicode for 'a', then for 'b', 'c', . . . , and 'z'. l The Unicode for 'a' is (int) 'a' l So, a random integer between (int)'a' and (int)'z' is (int) ( (int) 'a' + Math. random( ) * ( (int) 'z' - (int) 'a' + 1 ) l 8 5 7 6 1 3 2 Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 4 52

Case Study: Generating Random Characters, cont. As discussed in Chapter 2, all numeric operators

Case Study: Generating Random Characters, cont. As discussed in Chapter 2, all numeric operators can be applied to the char operands. (Overloading) l The char operand is cast into a number if the other operand is a number or a character. l So, the preceding expression can be simplified as follows: 'a' + Math. random() * ('z' - 'a' + 1) l So a random lowercase letter is l (char) ('a' + Math. random() * ('z' - 'a' + 1)) Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 53

Case Study: Generating Random Characters, cont. l To generalize the foregoing discussion, a random

Case Study: Generating Random Characters, cont. l To generalize the foregoing discussion, a random character between any two characters ch 1 and ch 2 with ch 1 < ch 2 can be generated as follows: (char) (ch 1 + Math. random() * (ch 2 – ch 1 + 1)) Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 54

The Random. Character Class // Random. Character. java: Generate random characters public class Random.

The Random. Character Class // Random. Character. java: Generate random characters public class Random. Character { /** Generate a random character between ch 1 and ch 2 */ public static char get. Random. Character(char ch 1, char ch 2) { return (char)(ch 1 + Math. random() * (ch 2 - ch 1 + 1)); } /** Generate a random lowercase letter */ public static char get. Random. Lower. Case. Letter() { return get. Random. Character('a', 'z'); } /** Generate a random uppercase letter */ public static char get. Random. Upper. Case. Letter() { return get. Random. Character('A', 'Z'); } /** Generate a random digit character */ public static char get. Random. Digit. Character() { return get. Random. Character('0', '9'); } /** Generate a random character */ public static char get. Random. Character() { return get. Random. Character('u 0000', 'u. FFFF'); } } Listing 6. 10 (p. 248) Random. Character. java Random. Character Listing 6. 11 (p. 248) Test. Random. Character. java Test. Random. Character Run Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 55

Method Abstraction You can think of the method body as a black box that

Method Abstraction You can think of the method body as a black box that contains the detailed implementation for the method. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 56

Benefits of Methods • Write a method once and reuse it anywhere. • Information

Benefits of Methods • Write a method once and reuse it anywhere. • Information hiding. Hide the implementation from the user. • Reduce complexity. Liang, Introduction to Java Programming, Eleventh Edition, (c) 2018 Pearson Education, Ltd. All rights reserved. 57