1. Methods Instructor : BehnamHajian bhajian@scs.carleton.ca Introduction to Systems Programming - COMP 1005, 1405

2. Objectives • To declare methods, invoke methods, and pass arguments to a method • To use method overloading and know ambiguous overloading • To determine the scope of local variables • To learn the concept of method abstraction • To know how to use the methods in the Mathclass • To design and implement methods using stepwise refinement • To group classes into packages

3. Developing Large Programs • Difficult to manage large code • Teams of people may be involved • Easy to forget what the project is all about • People may leave the company Result: Code should be • well organized • well commented and documented • Organized in a modular form (small coherent parts)

4. Top Down Design • Begin with the main problem/idea • Divide it into smaller problem/ideas • Further divide each small problem/idea into smaller more manageable parts. The process is termed: Divide and Conquer When to stop? • When the sub-problem/idea is understood and manageable • Coding rule of thumb – a module is 5-30 lines (one page)

5. Top-Down Module Example

6. Functions : Organized Development • Allow organized development • Develop and test small pieces of code • Functions assignable to team members • Permit code reusability

7. Function and Organization

8. What is a Function ? • A function is a module (piece of code) aimed at accomplishing a single task • Note: the scope of the task or its objective may large (recall breakdown of a problem/ideas)

9. What is a Function ?

12. setup() function in processing

14. Functions as Modules of Code Functions are the basic modulesin structural programming languages. • Everyprogram has a main function • The main function uses other functions • Each function may use other functions • Functions help organize and develop code

21. Method Abstraction You can think of the method body as a black box that contains the detailed implementation for the method.

22. Benefits of Methods • Write a method once and reuse it anywhere. • Information hiding. Hide the implementation from the user. • Reduce complexity.

23. Introducing Methods A method is a collection of statements that are grouped together to perform an operation.

24. Introducing Methods, cont. • Method signature is the combination of the method name and the parameter list. • The variables defined in the method header are known as formal parameters. • When a method is invoked, you pass a value to the parameter. This value is referred to as actual parameter or argument.

25. Introducing Methods, cont. • A method may return a value. The returnValueType is the data type of the value the method returns. If the method does not return a value, the returnValueType is the keyword void. For example, the returnValueType in the main method is void.

26. Calling Methods Listing 5.1 Testing the max method This program demonstrates calling a method max to return the largest of the int values

27. Calling Methods, cont.

28. Trace Method Invocation i is now 5

29. Trace Method Invocation j is now 2

30. Trace Method Invocation invoke max(i, j)

31. Trace Method Invocation invoke max(i, j) Pass the value of i to num1 Pass the value of j to num2

32. Trace Method Invocation declare variable result

33. Trace Method Invocation (num1 > num2) is true since num1 is 5 and num2 is 2

34. Trace Method Invocation result is now 5

35. Trace Method Invocation return result, which is 5

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

37. Trace Method Invocation Execute the print statement

38. CAUTION A return statement is required for a nonvoid method. The following method is logically correct, but it has a compilation error, because the Java compiler thinks it possible that this method does not return any value. intsign(int n) { if (n > 0) return 1; else if (n == 0) return 0; else if (n < 0) return –1; } To fix this problem, delete if (n<0) in the code.

44. Scope of Local Variables A 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 starts from its declaration and continues to the end of the block that contains the variable. A local variable must be declared before it can be used.

45. Scope of Local Variables, cont. You can declare a local variable 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.

46. Scope of Local Variables, cont. A variable declared in the initial action part of a for loop header has its scope in the entire loop. But 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.

47. Scope of Local Variables, cont.

48. Scope of Local Variables, cont. // Fine with no errors void correctMethod() { int x = 1; int y = 1; // i is declared for (inti = 1; i < 10; i++) { x += i; } // i is declared again for (inti = 1; i < 10; i++) { y += i; } }

49. 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 compilation error.

50. Ambiguous Invocation public class AmbiguousOverloading { public static void main(String[] args) { System.out.println(max(1, 2)); } public static double max(int num1, double num2) { if (num1 > num2) return num1; else return num2; } public static double max(double num1, int num2) { if (num1 > num2) return num1; else return num2; } }