1. Chapter 6 Conditions

2. This chapter discusses n Conditions and conditional statements. n Preconditions, postconditions, and class invariants. n Boolean expressions.

3. Conditions n postcondition: a condition the implementor (server) guarantees will hold when a method completes execution. n invariant: a condition that always holds true. n class invariant: an invariant regarding properties of class instances: that is, a condition that will always be true for all instances of a class.

4. Counter class class invariant: component variable tally will always be greater than or equal to zero. n This holds true with the methods currently defined. postcondition: the method count must make sure that tally is greater or equal to zero when the method completes execution.

5. Counter class (cont.) Adding a method decrementCount threatens the class invariant constraint that tally be greater than or equal to zero. public void decrementCount () { tally = tally - 1; } n We must guard the assignment statement with a condition statement.

6. Specifications n Postconditions and class invariants are part of class specification but not the implementation. Therefore they should be included in comments but not in the implementation. /** * Current count;the number of items * counted. * ensure: *count >= 0 */ public int count () { … }

7. Specifications (cont.) private int tally; //current count //invariant: // tally >= 0

8. if-then statement Syntax: if (condition) statement n A composite statement.

9. Counter class /** *Decrement positive count by 1 */ public void decrementCount () { if (tally > 0) tally = tally - 1; }

10. Explorer Class /** * Damage (hit points) required to defeat * this Explorer. * ensure: *stamina >= 0 */ public int stamina () { return staminaPoints; } … private int staminaPoints;//current stamina //invariant: //staminaPoints >= 0

11. Explorer Class If stamina reaches 0, an explorer is defeated. n One possible solution: public void takeHit (int hitStrength){ if (hitStrength <= staminaPoints) staminaPoints = staminaPoints - hitStrength; } But this rarely lets the staminaPoints reach zero.

12. Another possible approach public void takeHit (int hitStrength){ if (hitStrength <= staminPoint) staminaPoints = staminaPoints - hitStrength; if (hitstrength > staminaPoints) staminaPoints = 0; } n What is wrong with this approach?

13. Another possible approach (cont.) n It may meet the first condition and then in its changed state, meet the second condition as well.

14. If-then-else statement Syntax: if (condition) statement 1 else statement 2

15. Explorer class public Explorer(…, int stamina, …) { … if (stamina >=0) staminaPoints = stamina; else staminaPoints = 0; … } public void takeHit (int hitStrength){ if (hitStrength <= staminaPoints) staminaPoints = staminaPoints - hitStrength; else staminaPoints = 0; }

16. Explorer constructor What should we do if the constructor is called with a negative value for the parameter stamina ? public Explorer (String name, rooms.Room location, int hitStrength, int stamina) { … if (stamina >= 0) staminaPoints = stamina; else staminaPoints = 0; … }

17. Compound statements Syntax: { statement 1 statement 2 … } n In this statement, if (hitStrength <= staminaPoints) staminaPoints = staminaPoints - hitStrength; else staminaPoints = 0; strengthPoints = 0; The last statement is not part of the else condition.

18. Compound statements (cont.)

19. n Braces are used to create a block or compound statement, which is a single composite statement. if (condition) {if (condition) { statement 1 … statement n }} else { statement 1 … statement n }

20. Compound statements (cont.) if (hitStrength <= staminaPoints) staminaPoints = staminaPoints - hitStrength; else { staminaPoints = 0; strengthPoints = 0; }

21. Relational expressions n Relational operators: < less than <= less than or equal > greater than >= greater than or equal == equal (A single = denotes assignment.) != not equal n A relational expression consists of two expressions joined with a relational operator.

22. Relational expressions (cont.) Let i1=10, i2=-20, i3=30. i1 true i3 == i1 -> false i1 != 2 -> true i1 false i2 > 0 -> false 2*i1 == i2+40 -> true i2*(-1) != i1+i1 -> false

23. Relational expressions (cont.) An expression like a<b<c is illegal. If one operand is an int and the other is a double, the int is first converted to a double. 10 > 2.5 10.0 > 2.5 n Since floating point values are approximations for real numbers, we should avoid using equality or inequality operators with them. (1.0/6.0+1.0/6.0+1.0/6.0+ 1.0/6.0+1.0/6.0+1.0/6.0) == 1.0 false

24. Boolean variables n Booleans can be stored as variables. private boolean tooBig; tooBig = true; tooBig = i1 > 10;

25. Boolean operators ! not && and || or ! booleanExpression booleanExpression && booleanExpression booleanExpression || booleanExpression A boolean expression evaluates to either true or false.

26. The not operator Not reverses boolean values. i.e. !true false !false true i1=10 !( i1 > 9) !(true) false Not has high precedence. ! i1 > 9 (!i1) > 9 illegal n Generally avoid the not operator.

27. And and or (i1>10)||(i1==10) false||true true (i1>10)||(i1<0) false||false false (i1>0)&&(i1<5) true&&false false (i1>0)&&(i1<20) true&&true true

28. And and or (cont.) The && and || have lower precedence than the relational operators, but parentheses are still useful because they enhance readability. The && and || are lazy operators that evaluate only the left operand only when that suffices.

29. And and or (cont.) n Consider: (5 == 4) && ???? (5 != 4) || ???? n Does it matter what the second operands are? n This can protect against runtime errors such as an attempt to divide by zero. Example: (x == 0) || (y/x < 10) (x != 0) && (y/x < 10)

30. DeMorgans laws n Useful for simplifying expressions. !(b1 && b2) !b1 || !b2 !(b1 || b2) !b1 && !b2 !(i1>5 && i1 5) || !(i1<8)

31. Operation precedence

32. Handling multiple cases n Consider a method that determines if a year is a leap year. n The Gregorian calendar stipulates that a year is a leap year if it is divisible by 4, unless it is also divisible by 100, in which case it is a leap year if and only if it is divisible by 400. For example, 1900 is not a leap year, but 2000 is. (year % 100 != 0 && year % 4 == 0) || (year % 100 == 0 && year % 400 == 0)

33. LeapYear method Another way of representing these rules uses cases and nested conditional statements. public boolean isLeapYear (int year) { boolean aLeapYear; if (year % 4 == 0) if (year % 100 == 0) aLeapYear = (year % 400 == 0); else aLeapYear = true; else aLeapYear = false; return aLeapYear; }

34. LeapYear method (cont.)

35. TrafficSignal class n The traffic signal class cycles through 4 states: LEFT (left turn arrow) GO (green light) CAUTION (yellow light) STOP (red light) The component variable currentState will hold one of these states.

36. TrafficSignal class (cont.) advance moves currentState to the next state. public void advance () { private int currentState; if (currentState == LEFT) currentState = GO; else if (currentState == GO) currentState = CAUTION; else if (currentState == CAUTION) currentState = STOP; else //currentState == STOP currentState = LEFT; }

37. TrafficSignal class (cont.)

38. Dangling else Which if statement is this else statement associated with? if (condition1) if (condition2) statement1 else statement2

39. Dangling else (cont.) It is associated with the second if (B). To associate it with the first, add braces around everything contained between the first if and the else. if (condition1) { if (condition2) statement1 } else statement2

40. Example: combination lock n Responsibilities: u Know: F The combination F whether unlocked or locked u Do: F lock F unlock

41. CombinationLock class n Class: CombinationLock n Queries: u is open n Commands: u lock u unlock

42. Class CombinationLock specifications public class CombinationLock n Contructor: public CombinationLock (int combination) n Queries: public boolean isOpen() n Commands: public void close () public void open(int combination)

43. Class CombinationLock implementation n Component variables: private int combination; private boolean isOpen;

44. Class CombinationLock implementation (cont.) n The straightforward implementations: public boolean isOpen () { return isOpen; } public void close () { isOpen = false; }

45. Class CombinationLock implementation (cont.) When the constructor is being executed, there are two distinct variables with the same name. (Component variable and local variable combination ). The keyword this refers to the current object. Therefore this.combination refers to the component variable. If the variable does not include the object reference this in front of it, it is a reference to the local variable.

46. Class CombinationLock implementation (cont.)

47. public CombinationLock (int combination) { this.combination = combination; isOpen = false; } n We could write the second assignment as this.isOpen = false; n But there is no ambiguity, so it is not needed.

48. Class CombinationLock implementation (cont.) n A final method: public void open (int combination) { if (this.combination == combination) isOpen = true; }

49. Digit by digit lock: n This lock has a 3 digit combination. n To open the lock, the client provides the digits one at a time. n If the client enters the three digits of the combination in order, the lock opens. n It doesnt matter how many digits the client provides, as long as the combination is given.

50. Digit by digit lock: (cont.) Digit Entered 4 1 2 4 3 1 2 3 Digit Entered 1 2 3 4 7 Lock Status closed open Lock Status closed open

51. Class CombinationLock public class CombinationLock n Constructor: public CombinationLock (int combination) require: combination >= 0 && combination <=999 n Queries: public boolean isOpen () n Commands: public void close () public void enter (int digit) require: digit >=0 && digit <=9

52. Precondition n A condition the client of a method must make sure holds when the method is invoked. The constructor and method enter have certain requirements that must be met for them to execute properly. These are the require :s found it the definition on the previous slide. n Somewhat like the unleaded gas only sign near the gas cap on an automobile.

53. CombinationLock responsibilities n Know: u the 3-digit combination. u whether locked or unlocked. u the last three digits entered. n Do: u lock. u unlock, when given the proper combination. u accept a digit.

54. Getting digits from integers. Using the % and / operator, we can extract each digit. n Suppose a combination 123. 123 % 10 -> 3 123 / 10 -> 12 12 % 10 -> 2 12 / 10 -> 1 % 10 gets the last digit and / 10 get the remaining digits.

55. CombinationLock implementation // entered1, entered2, entered3 are the last three // digits entered, with entered3 the most recent. // a value of -1 indicates the digit has not been // entered. private int entered1; private int entered2; private int entered3; // invariant: // entered1 >= -1 && entered1 <= 9 && // entered2 >= -1 && entered2 <= 9 && // entered3 >= -1 && entered3 <= 9

60. Weve covered n Boolean expressions. n Conditional statements. u if (condition) statement u if (condition) statement 1 else statement 2 Compound statements { statement 1 statement 2 … statement n }. n Preconditions, postconditions, invariants.

61. Glossary

62. Glossary (cont.)