Tweet
Tweet

Slide 1

Slide 1 text

This slide is intentionally left blank

Slide 2

Slide 2 text

JAVA PUZZLERS NG DOWN THE RABBIT HOLE http://www.davidfloresmedia.com/philly-rocky-statue/

Slide 3

Slide 3 text

@gAmUssA @hazelcast #jbreak #hazelcastjet > whoami

Slide 4

Slide 4 text

@gAmUssA @hazelcast #jbreak #hazelcastjet Solutions Architect > whoami

Slide 5

Slide 5 text

@gAmUssA @hazelcast #jbreak #hazelcastjet Solutions Architect Developer Advocate > whoami

Slide 6

Slide 6 text

@gAmUssA @hazelcast #jbreak #hazelcastjet Solutions Architect Developer Advocate @gamussa in internetz > whoami

Slide 7

Slide 7 text

@gAmUssA @hazelcast #jbreak #hazelcastjet Solutions Architect Developer Advocate @gamussa in internetz Please, follow me on Twitter > whoami

Slide 8

Slide 8 text

@gAmUssA @hazelcast #jbreak #hazelcastjet Solutions Architect Developer Advocate @gamussa in internetz Please, follow me on Twitter I’m very interesting © > whoami

Slide 9

Slide 9 text

No content

Slide 10

Slide 10 text

No content

Slide 11

Slide 11 text

Developer Advocate @JFrog on the internetz Developer Advocate @Hazelcast @gAmUssA on the internetz

Slide 12

Slide 12 text

CLICK AND HACK THE TYPE-IT BROTHERS

Slide 13

Slide 13 text

@tagir_valeev @gamussa #PhillyETE

Slide 14

Slide 14 text

@gamussa #PhillyETE

Slide 15

Slide 15 text

@gamussa #PhillyETE

Slide 16

Slide 16 text

@gamussa #PhillyETE

Slide 17

Slide 17 text

No content

Slide 18

Slide 18 text

1. Two One entertaining guy on the stage

Slide 19

Slide 19 text

1. Two One entertaining guy on the stage 2. Funny puzzling questions

Slide 20

Slide 20 text

1. Two One entertaining guy on the stage 2. Funny puzzling questions 3. You think and vote

Slide 21

Slide 21 text

1. Two One entertaining guy on the stage 2. Funny puzzling questions 3. You think and vote 4.Official twitter hashtags #javapuzzlersng #PhillyETE

Slide 22

Slide 22 text

FIRST RULE OF THE PUZZLERS: NO CHEATING!

Slide 23

Slide 23 text

Which Java version are you on? @gamussa #PhillyETE

Slide 24

Slide 24 text

Which Java version are you on? A. Java 7 @gamussa #PhillyETE

Slide 25

Slide 25 text

Which Java version are you on? A. Java 7 B. Java 8 @gamussa #PhillyETE

Slide 26

Slide 26 text

Which Java version are you on? A. Java 7 B. Java 8 C. Java 9 @gamussa #PhillyETE

Slide 27

Slide 27 text

Which Java version are you on? A. Java 7 B. Java 8 C. Java 9 D. Java 6 @gamussa #PhillyETE

Slide 28

Slide 28 text

Which Java version are you on? A. Java 7 B. Java 8 C. Java 9 D. Java 6 E. Java 5 @gamussa #PhillyETE

Slide 29

Slide 29 text

Which Java version are you on? A. Java 7 B. Java 8 C. Java 9 D. Java 6 E. Java 5 F. Java 2 @gamussa #PhillyETE

Slide 30

Slide 30 text

Which Java version are you on? A. Java 7 B. Java 8 C. Java 9 D. Java 6 E. Java 5 F. Java 2 @gamussa #PhillyETE

Slide 31

Slide 31 text

Watching the puzzlers like… #dafaq @gamussa #PhillyETE

Slide 32

Slide 32 text

Watching the puzzlers like… #dafaq @gamussa #PhillyETE

Slide 33

Slide 33 text

Everything works (or doesn't) 
 in the latest Java 8 and/or 9 update @gamussa #PhillyETE

Slide 34

Slide 34 text

No content

Slide 35

Slide 35 text

RUSSIAN HACKERS HACKING THE BANK

Slide 36

Slide 36 text

public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }


Slide 37

Slide 37 text

public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }
 A. IllegalArgumentException – can’t create semaphore with negative

Slide 38

Slide 38 text

public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }
 A. IllegalArgumentException – can’t create semaphore with negative B. UnsupportedOperationException – can’t drain when negative

Slide 39

Slide 39 text

public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }
 A. IllegalArgumentException – can’t create semaphore with negative B. UnsupportedOperationException – can’t drain when negative C. 0

Slide 40

Slide 40 text

public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }
 A. IllegalArgumentException – can’t create semaphore with negative B. UnsupportedOperationException – can’t drain when negative C. 0 D. -42

Slide 41

Slide 41 text

public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }
 A. IllegalArgumentException – can’t create semaphore with negative B. UnsupportedOperationException – can’t drain when negative C. 0 D. -42

Slide 42

Slide 42 text

@gamussa #PhillyETE

Slide 43

Slide 43 text

@gamussa #PhillyETE

Slide 44

Slide 44 text

@gamussa #PhillyETE

Slide 45

Slide 45 text

A. IllegalArgumentException – can’t create semaphore with negative B. UnsupportedOperationException – can’t drain when negative C. 0 D. -42 public class PerfectRobbery {
 private Semaphore bankAccount = new Semaphore(-42);
 public static void main(String[] args) {
 PerfectRobbery perfectRobbery = new PerfectRobbery();
 perfectRobbery.takeAllMoney();
 perfectRobbery.checkBalance();
 }
 public void takeAllMoney(){
 bankAccount.drainPermits();
 }
 public void checkBalance(){
 System.out.println(bankAccount.availablePermits());
 }
 }


Slide 46

Slide 46 text

@gamussa #PhillyETE

Slide 47

Slide 47 text

@gamussa #PhillyETE

Slide 48

Slide 48 text

@gamussa #PhillyETE

Slide 49

Slide 49 text

Available -42?! @gamussa #PhillyETE

Slide 50

Slide 50 text

Available -42?! @gamussa #PhillyETE

Slide 51

Slide 51 text

@gamussa #PhillyETE

Slide 52

Slide 52 text

Collections.emptyList() == Collections.emptyList();
 Collections.emptyIterator() == Collections.emptyIterator();
 @gamussa #PhillyETE

Slide 53

Slide 53 text

A. true/true Collections.emptyList() == Collections.emptyList();
 Collections.emptyIterator() == Collections.emptyIterator();
 @gamussa #PhillyETE

Slide 54

Slide 54 text

A. true/true B. true/false Collections.emptyList() == Collections.emptyList();
 Collections.emptyIterator() == Collections.emptyIterator();
 @gamussa #PhillyETE

Slide 55

Slide 55 text

A. true/true B. true/false C. false/true Collections.emptyList() == Collections.emptyList();
 Collections.emptyIterator() == Collections.emptyIterator();
 @gamussa #PhillyETE

Slide 56

Slide 56 text

A. true/true B. true/false C. false/true D. false/false Collections.emptyList() == Collections.emptyList();
 Collections.emptyIterator() == Collections.emptyIterator();
 @gamussa #PhillyETE

Slide 57

Slide 57 text

A. true/true B. true/false C. false/true D. false/false Collections.emptyList() == Collections.emptyList();
 Collections.emptyIterator() == Collections.emptyIterator();
 @gamussa #PhillyETE

Slide 58

Slide 58 text

@gamussa #PhillyETE

Slide 59

Slide 59 text

@gamussa #PhillyETE

Slide 60

Slide 60 text

Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();


Slide 61

Slide 61 text

A. true/true Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();


Slide 62

Slide 62 text

A. true/true B. true/false Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();


Slide 63

Slide 63 text

A. true/true B. true/false C. false/true Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();


Slide 64

Slide 64 text

A. true/true B. true/false C. false/true D. false/false Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();


Slide 65

Slide 65 text

A. true/true B. true/false C. false/true D. false/false Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();


Slide 66

Slide 66 text

Singleton Strikes Back! @gamussa #PhillyETE

Slide 67

Slide 67 text

Singleton Strikes Back! @gamussa #PhillyETE

Slide 68

Slide 68 text

A. true/true B. true/false C. false/true D. false/false Spliterators.emptySpliterator() == Spliterators.emptySpliterator();
 Stream.empty() == Stream.empty();
 @gamussa #PhillyETE

Slide 69

Slide 69 text

Even empty Stream has state! @gamussa #PhillyETE

Slide 70

Slide 70 text

Even empty Stream has state! @gamussa #PhillyETE

Slide 71

Slide 71 text

Even empty Stream has state! @gamussa #PhillyETE

Slide 72

Slide 72 text

No content

Slide 73

Slide 73 text

”Identical” 1. Has the same state 2. Not related to “equals and hashcode” contract 3. Not related to references to objects in memory @gamussa #PhillyETE

Slide 74

Slide 74 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 @gamussa #PhillyETE

Slide 75

Slide 75 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 A. Absolutely identical empty lists @gamussa #PhillyETE

Slide 76

Slide 76 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 A. Absolutely identical empty lists B. Absolutely identical non-empty lists @gamussa #PhillyETE

Slide 77

Slide 77 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 A. Absolutely identical empty lists B. Absolutely identical non-empty lists C. Non-identical empty lists @gamussa #PhillyETE

Slide 78

Slide 78 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 A. Absolutely identical empty lists B. Absolutely identical non-empty lists C. Non-identical empty lists D. Non-identical non-empty lists @gamussa #PhillyETE

Slide 79

Slide 79 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 A. Absolutely identical empty lists B. Absolutely identical non-empty lists C. Non-identical empty lists D. Non-identical non-empty lists @gamussa #PhillyETE

Slide 80

Slide 80 text

@gamussa #PhillyETE

Slide 81

Slide 81 text

@gamussa #PhillyETE

Slide 82

Slide 82 text

List[] twins = new List[2];
 Arrays.setAll(twins, ArrayList::new);
 A. Absolutely identical empty lists B. Absolutely identical non-empty lists C. Non-identical empty lists D. Non-identical non-empty lists @gamussa #PhillyETE

Slide 83

Slide 83 text

@gamussa #PhillyETE

Slide 84

Slide 84 text

@gamussa #PhillyETE

Slide 85

Slide 85 text

@gamussa #PhillyETE

Slide 86

Slide 86 text

How single is a Single Abstract Method Interface? @gamussa #PhillyETE

Slide 87

Slide 87 text

public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 88

Slide 88 text

A. WTF?! ’Single’ means one, not three! public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 89

Slide 89 text

A. WTF?! ’Single’ means one, not three! B. Problem is with partyHard(T), remove it and it will work public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 90

Slide 90 text

A. WTF?! ’Single’ means one, not three! B. Problem is with partyHard(T), remove it and it will work C. Problem is the drinkIn methods, removing one of them and it will work public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 91

Slide 91 text

A. WTF?! ’Single’ means one, not three! B. Problem is with partyHard(T), remove it and it will work C. Problem is the drinkIn methods, removing one of them and it will work D. It will work fine! Both partyHard() and drinkIn() are merged in SingleAndHappy, leaving one abstract method public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 92

Slide 92 text

A. WTF?! ’Single’ means one, not three! B. Problem is with partyHard(T), remove it and it will work C. Problem is the drinkIn methods, removing one of them and it will work D. It will work fine! Both partyHard() and drinkIn() are merged in SingleAndHappy, leaving one abstract method public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 93

Slide 93 text

No content

Slide 94

Slide 94 text

No content

Slide 95

Slide 95 text

A. WTF?! ’Single’ means one, not three! B. Problem is with partyHard(T), remove it and it will work C. Problem are the drinkIn methods, removing it will leave one abstract method D. Yes! Both partyHard() and drinkIn() are merged in SingleAndHappy, leaving one abstract method public interface Single {
 default void partyHard(String songName) { System.out.println(songName); }
 void partyHard(T songName);
 void drinkIn(T drinkName);
 void drinkIn(String dringName);
 
 }
 @FunctionalInterface
 public interface SingleAndHappy extends Single { } @gamussa #PhillyETE

Slide 96

Slide 96 text

@gamussa #PhillyETE

Slide 97

Slide 97 text

RUSSIAN HACKERS STILL TRYING TO HACK THE BANK

Slide 98

Slide 98 text

Hacking the bank ☑Bank software written in Java ☑Hack into it ☑Analyze the accounts @gamussa #PhillyETE

Slide 99

Slide 99 text

Given the code above, which statement is wrong: Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 100

Slide 100 text

Given the code above, which statement is wrong: A. The Set is ordered by hashcode Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 101

Slide 101 text

Given the code above, which statement is wrong: A. The Set is ordered by hashcode B. The order is predictable across multiple runs of the JVM on the same machine Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 102

Slide 102 text

Given the code above, which statement is wrong: A. The Set is ordered by hashcode B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 103

Slide 103 text

Given the code above, which statement is wrong: A. The Set is ordered by hashcode B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable D. Statements A & B are correct Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 104

Slide 104 text

Given the code above, which statement is wrong: A. The Set is ordered by hashcode B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable D. Statements A & B are correct Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 105

Slide 105 text

No content

Slide 106

Slide 106 text

No content

Slide 107

Slide 107 text

Given the code above, which statement is wrong: A. The Set is ordered B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable D. Statements A & B are correct Set accounts= new HashSet<>(Arrays.asList("Gates", "Buffett", "Bezos", "Zuckerberg"));
 System.out.println(”accounts= " + accounts);
 @gamussa #PhillyETE

Slide 108

Slide 108 text

public boolean add(E e) {
 return map.put(e, PRESENT)==null;
 } @gamussa #PhillyETE

Slide 109

Slide 109 text

Your turn, FBI @gamussa #PhillyETE

Slide 110

Slide 110 text

No content

Slide 111

Slide 111 text

Given the code above, which statement is wrong: Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 112

Slide 112 text

Given the code above, which statement is wrong: A. The Set is ordered Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 113

Slide 113 text

Given the code above, which statement is wrong: A. The Set is ordered B. The order is predictable across multiple runs of the JVM on the same machine Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 114

Slide 114 text

Given the code above, which statement is wrong: A. The Set is ordered B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 115

Slide 115 text

Given the code above, which statement is wrong: A. The Set is ordered B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable D. Statements A & B are correct Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 116

Slide 116 text

Given the code above, which statement is wrong: A. The Set is ordered B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable D. Statements A & B are correct Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 117

Slide 117 text

@gamussa #PhillyETE

Slide 118

Slide 118 text

@gamussa #PhillyETE

Slide 119

Slide 119 text

@gamussa #PhillyETE

Slide 120

Slide 120 text

Given the code above, which statement is wrong: A. The Set is ordered B. The order is predictable across multiple runs of the JVM on the same machine C. The order of elements in Set is not predictable D. Statements A & B are correct Set accounts = Set.of("Gates", "Buffett", "Bezos", "Zuckerberg");
 System.out.println(”accounts= " + accounts); @gamussa #PhillyETE

Slide 121

Slide 121 text

private int probe(Object pe) {
 int idx = Math.floorMod(pe.hashCode() ^ SALT, elements.length);
 while (true) {
 E ee = elements[idx];
 if (ee == null) {
 return -idx - 1;
 } else if (pe.equals(ee)) {
 return idx;
 } else if (++idx == elements.length) {
 idx = 0;
 }
 }
 } @gamussa #PhillyETE

Slide 122

Slide 122 text

Juggling Accident

Slide 123

Slide 123 text

Juggling Accident

Slide 124

Slide 124 text

What’s correct? @gamussa #PhillyETE

Slide 125

Slide 125 text

What’s correct? A. If you convert your application to module, classpath dependencies will still be resolved correctly @gamussa #PhillyETE

Slide 126

Slide 126 text

What’s correct? A. If you convert your application to module, classpath dependencies will still be resolved correctly B. If one of the dependencies was converted to a module, you have to declare it in module-info in order to use @gamussa #PhillyETE

Slide 127

Slide 127 text

What’s correct? A. If you convert your application to module, classpath dependencies will still be resolved correctly B. If one of the dependencies was converted to a module, you have to declare it in module-info in order to use C. Once you added the module-info to your project you have to declare the dependencies twice, in classpath and in module-info @gamussa #PhillyETE

Slide 128

Slide 128 text

What’s correct? A. If you convert your application to module, classpath dependencies will still be resolved correctly B. If one of the dependencies was converted to a module, you have to declare it in module-info in order to use C. Once you added the module-info to your project you have to declare the dependencies twice, in classpath and in module-info D. None of the above @gamussa #PhillyETE

Slide 129

Slide 129 text

What’s correct? A. If you convert your application to module, classpath dependencies will still be resolved correctly B. If one of the dependencies was converted to a module, you have to declare it in module-info in order to use C. Once you added the module-info to your project you have to declare the dependencies twice, in classpath and in module-info D. None of the above @gamussa #PhillyETE

Slide 130

Slide 130 text

No content

Slide 131

Slide 131 text

No content

Slide 132

Slide 132 text

What’s correct? A. If you convert your application to module, classpath dependencies will still be resolved correctly B. If one of the dependencies was converted to a module, you have to declare it in module-info in order to use C. Once you added the module-info to your project you have to declare the dependencies twice, in classpath and in module-info D. None of the above @gamussa #PhillyETE

Slide 133

Slide 133 text

@gamussa #PhillyETE

Slide 134

Slide 134 text

@gamussa #PhillyETE

Slide 135

Slide 135 text

No content

Slide 136

Slide 136 text

static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 137

Slide 137 text

A. You killed them all static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 138

Slide 138 text

A. You killed them all B. You killed only even ones static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 139

Slide 139 text

A. You killed them all B. You killed only even ones C. They all survived static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 140

Slide 140 text

A. You killed them all B. You killed only even ones C. They all survived D. You killed only odd ones static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 141

Slide 141 text

A. You killed them all B. You killed only even ones C. They all survived D. You killed only odd ones E. All answers are correct static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 142

Slide 142 text

A. You killed them all B. You killed only even ones C. They all survived D. You killed only odd ones E. All answers are correct static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 143

Slide 143 text

@gamussa #PhillyETE

Slide 144

Slide 144 text

@gamussa #PhillyETE

Slide 145

Slide 145 text

A. You killed them all B. You killed only even ones C. They all survived D. You killed only odd ones E. All answers are correct static void killThemAll(Collection expendables) {
 Iterator heroes = expendables.iterator();
 heroes.forEachRemaining(e -> {
 if (heroes.hasNext()) {
 heroes.next();
 heroes.remove();
 }
 });
 System.out.println(expendables);
 }


Slide 146

Slide 146 text

Don’t do that. Really, don’t. @gamussa #PhillyETE

Slide 147

Slide 147 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] @gamussa #PhillyETE

Slide 148

Slide 148 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] killThemAll(new LinkedList(Arrays.asList("N","S","W","S","L","S","L","V"))); @gamussa #PhillyETE

Slide 149

Slide 149 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] killThemAll(new LinkedList(Arrays.asList("N","S","W","S","L","S","L","V"))); [S,S,S,V] @gamussa #PhillyETE

Slide 150

Slide 150 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] killThemAll(new LinkedList(Arrays.asList("N","S","W","S","L","S","L","V"))); [S,S,S,V] killThemAll(new ArrayDeque(Arrays.asList("N","S","W","S","L","S","L","V")));
 [N,S,W,S,L,S,L,V] @gamussa #PhillyETE

Slide 151

Slide 151 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] killThemAll(new LinkedList(Arrays.asList("N","S","W","S","L","S","L","V"))); [S,S,S,V] killThemAll(new ArrayDeque(Arrays.asList("N","S","W","S","L","S","L","V")));
 [N,S,W,S,L,S,L,V] @gamussa #PhillyETE

Slide 152

Slide 152 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] killThemAll(new LinkedList(Arrays.asList("N","S","W","S","L","S","L","V"))); [S,S,S,V] killThemAll(new ArrayDeque(Arrays.asList("N","S","W","S","L","S","L","V")));
 [N,S,W,S,L,S,L,V] killThemAll(new TreeSet(Arrays.asList("N","S","W","S","L","S","L","V"))); @gamussa #PhillyETE

Slide 153

Slide 153 text

Don’t do that. Really, don’t. killThemAll(new ArrayList(Arrays.asList("N","S","W","S","L","S","L","V")));
 [] killThemAll(new LinkedList(Arrays.asList("N","S","W","S","L","S","L","V"))); [S,S,S,V] killThemAll(new ArrayDeque(Arrays.asList("N","S","W","S","L","S","L","V")));
 [N,S,W,S,L,S,L,V] killThemAll(new TreeSet(Arrays.asList("N","S","W","S","L","S","L","V"))); [N,W,L,L] @gamussa #PhillyETE

Slide 154

Slide 154 text

Subtle Difference @gamussa #PhillyETE

Slide 155

Slide 155 text

@FunctionalInterface
 public interface OriginalPredicate {
 boolean test(T t);
 } OriginalPredicate lambda = (Object obj) -> "adidas".equals(obj);
 OriginalPredicate methodRef = "adidas"::equals;

Slide 156

Slide 156 text

A. Both work just fine @FunctionalInterface
 public interface OriginalPredicate {
 boolean test(T t);
 } OriginalPredicate lambda = (Object obj) -> "adidas".equals(obj);
 OriginalPredicate methodRef = "adidas"::equals;

Slide 157

Slide 157 text

A. Both work just fine B. Lambda works, method ref fails @FunctionalInterface
 public interface OriginalPredicate {
 boolean test(T t);
 } OriginalPredicate lambda = (Object obj) -> "adidas".equals(obj);
 OriginalPredicate methodRef = "adidas"::equals;

Slide 158

Slide 158 text

A. Both work just fine B. Lambda works, method ref fails C. Method ref works, lambda fails @FunctionalInterface
 public interface OriginalPredicate {
 boolean test(T t);
 } OriginalPredicate lambda = (Object obj) -> "adidas".equals(obj);
 OriginalPredicate methodRef = "adidas"::equals;

Slide 159

Slide 159 text

A. Both work just fine B. Lambda works, method ref fails C. Method ref works, lambda fails D. Won’t compile @FunctionalInterface
 public interface OriginalPredicate {
 boolean test(T t);
 } OriginalPredicate lambda = (Object obj) -> "adidas".equals(obj);
 OriginalPredicate methodRef = "adidas"::equals;

Slide 160

Slide 160 text

A. Both work just fine B. Lambda works, method ref fails C. Method ref works, lambda fails D. Won’t compile @FunctionalInterface
 public interface OriginalPredicate {
 boolean test(T t);
 } OriginalPredicate lambda = (Object obj) -> "adidas".equals(obj);
 OriginalPredicate methodRef = "adidas"::equals;

Slide 161

Slide 161 text

No content

Slide 162

Slide 162 text

No content

Slide 163

Slide 163 text

A. Both work just fine B. Lambda works, method ref fails C. Method ref works, lambda fails D. Not a functional interface, will fail on annotation processing @FunctionalInterface public interface CopyCatPredicate {
 boolean test(T t);
 } CopyCatPredicate lambda = (Object obj) -> "adadas".equals(obj);
 CopyCatPredicate methodRef = "adadas"::equals;


Slide 164

Slide 164 text

A. Both work just fine B. Lambda works, method ref fails C. Method ref works, lambda fails D. Not a functional interface, will fail on annotation processing @FunctionalInterface public interface CopyCatPredicate {
 boolean test(T t);
 } CopyCatPredicate lambda = (Object obj) -> "adadas".equals(obj);
 CopyCatPredicate methodRef = "adadas"::equals;


Slide 165

Slide 165 text

No content

Slide 166

Slide 166 text

No content

Slide 167

Slide 167 text

No content

Slide 168

Slide 168 text

A. Both work just fine B. Lambda works, method ref fails C. Method ref works, lambda fails D. Not a functional interface, will fail on annotation processing @FunctionalInterface public interface CopyCatPredicate {
 boolean test(T t);
 } CopyCatPredicate lambda = (Object obj) -> "adadas".equals(obj);
 CopyCatPredicate methodRef = "adadas"::equals;


Slide 169

Slide 169 text

@gamussa #PhillyETE

Slide 170

Slide 170 text

A generic function type for a functional interface may be implemented by a method reference expression (§15.13), but not by a lambda expression (§15.27) as there is no syntax for generic lambda expressions. “ @gamussa #PhillyETE

Slide 171

Slide 171 text

No content

Slide 172

Slide 172 text

List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 173

Slide 173 text

A.[Data, Kirk, Spock] List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 174

Slide 174 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 175

Slide 175 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] C.[Spock, Kirk, Data] List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 176

Slide 176 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] C.[Spock, Kirk, Data] D.[Data, Data, Kirk, Kirk, Spock, Spock] List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 177

Slide 177 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] C.[Spock, Kirk, Data] D.[Data, Data, Kirk, Kirk, Spock, Spock] E.Are you nuts? Won’t compile! Data with Kirk?! List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 178

Slide 178 text

No content

Slide 179

Slide 179 text

No content

Slide 180

Slide 180 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] C.[Spock, Kirk, Data] D.[Data, Data, Kirk, Kirk, Spock, Spock] E.Are you nuts? Won’t compile! Data with Kirk?! List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 181

Slide 181 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] C.[Spock, Kirk, Data] D.[Data, Data, Kirk, Kirk, Spock, Spock] E.Are you nuts? Won’t compile! Data with Kirk?! List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 182

Slide 182 text

No content

Slide 183

Slide 183 text

No content

Slide 184

Slide 184 text

A.[Data, Kirk, Spock] B.[Spock, Kirk, Data, Data, Kirk, Spock] C.[Spock, Kirk, Data] D.[Data, Data, Kirk, Kirk, Spock, Spock] E.Are you nuts? Won’t compile! Data with Kirk?! List list = Stream.of("Spock", "Kirk", "Data", "Data", "Kirk", "Spock").sequential()
 .filter(new TreeSet<>()::add).collect(Collectors.toList());
 System.out.println(list);
 @gamussa #PhillyETE

Slide 185

Slide 185 text

@gamussa #PhillyETE

Slide 186

Slide 186 text

filter(new TreeSet<>()::add) @gamussa #PhillyETE

Slide 187

Slide 187 text

filter(new TreeSet<>()::add) filter(i -> new TreeSet<>().add(i)) @gamussa #PhillyETE

Slide 188

Slide 188 text

filter(new TreeSet<>()::add) filter(i -> new TreeSet<>().add(i)) != @gamussa #PhillyETE

Slide 189

Slide 189 text

filter(new TreeSet<>()::add) filter(i -> new TreeSet<>().add(i)) != New instance is created every time! @gamussa #PhillyETE

Slide 190

Slide 190 text

filter(new TreeSet<>()::add) filter(i -> new TreeSet<>().add(i)) != New instance is created every time! Instance method is created once! @gamussa #PhillyETE

Slide 191

Slide 191 text

@gamussa #PhillyETE

Slide 192

Slide 192 text

Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 193

Slide 193 text

A. obvious / obvious Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 194

Slide 194 text

A. obvious / obvious B. obvious / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 195

Slide 195 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 196

Slide 196 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious D. NullPointerException / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 197

Slide 197 text

@gamussa #PhillyETE

Slide 198

Slide 198 text

@gamussa #PhillyETE

Slide 199

Slide 199 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious D. NullPointerException / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 200

Slide 200 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious D. NullPointerException / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); Will never happen @gamussa #PhillyETE

Slide 201

Slide 201 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious D. NullPointerException / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); Will never happen Will never happen @gamussa #PhillyETE

Slide 202

Slide 202 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious D. NullPointerException / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); Will never happen Will never happen @gamussa #PhillyETE

Slide 203

Slide 203 text

@gamussa #PhillyETE

Slide 204

Slide 204 text

@gamussa #PhillyETE

Slide 205

Slide 205 text

A. obvious / obvious B. obvious / NullPointerException C. NullPointerException / obvious D. NullPointerException / NullPointerException Optional.of("obvious").orElseGet(null);
 Optional.empty().map(null).orElse("obvious"); @gamussa #PhillyETE

Slide 206

Slide 206 text

@gamussa #PhillyETE

Slide 207

Slide 207 text

@gamussa #PhillyETE

Slide 208

Slide 208 text

@gamussa #PhillyETE

Slide 209

Slide 209 text

@gamussa #PhillyETE

Slide 210

Slide 210 text

Identical? @gamussa #PhillyETE

Slide 211

Slide 211 text

When agentA == agentB?

Slide 212

Slide 212 text

1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); When agentA == agentB?

Slide 213

Slide 213 text

1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; When agentA == agentB?

Slide 214

Slide 214 text

1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 215

Slide 215 text

1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 216

Slide 216 text

A.All 1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 217

Slide 217 text

A.All B.3 and 4 1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 218

Slide 218 text

A.All B.3 and 4 C.Only 3 1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 219

Slide 219 text

A.All B.3 and 4 C.Only 3 D.Other 1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 220

Slide 220 text

A.All B.3 and 4 C.Only 3 D.Other 1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 221

Slide 221 text

@gamussa #PhillyETE

Slide 222

Slide 222 text

@gamussa #PhillyETE

Slide 223

Slide 223 text

A.All B.3 and 4 C.Only 3 D.Other 1. Consumer agentA = s -> System.out.println(s);
 Consumer agentB = s -> System.out.println(s); 2. Consumer agentA = System.out::println;
 Consumer agentB = System.out::println; 3. Supplier> supplier = () -> s -> System.out.println(s);
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); 4. Supplier> supplier = () -> System.out::println;
 Consumer agentA = supplier.get();
 Consumer agentB = supplier.get(); When agentA == agentB?

Slide 224

Slide 224 text

Reuse is only possible for pure functions @gamussa #PhillyETE

Slide 225

Slide 225 text

Reuse is only possible for pure functions Consumers accept parameters == have state @gamussa #PhillyETE

Slide 226

Slide 226 text

Reuse is only possible for pure functions Consumers accept parameters == have state Supplier in 4 has state – the resolved method reference @gamussa #PhillyETE

Slide 227

Slide 227 text

Conclusions @gamussa #PhillyETE

Slide 228

Slide 228 text

No content

Slide 229

Slide 229 text

-Write readable code!

Slide 230

Slide 230 text

-Write readable code! -Comment all the tricks

Slide 231

Slide 231 text

-Write readable code! -Comment all the tricks -Sometimes it’s just a bug

Slide 232

Slide 232 text

-Write readable code! -Comment all the tricks -Sometimes it’s just a bug -Static code analysis FTW - IntelliJ IDEA!

Slide 233

Slide 233 text

-Write readable code! -Comment all the tricks -Sometimes it’s just a bug -Static code analysis FTW - IntelliJ IDEA! -RTFM!

Slide 234

Slide 234 text

-Write readable code! -Comment all the tricks -Sometimes it’s just a bug -Static code analysis FTW - IntelliJ IDEA! -RTFM! -Don’t abuse lambdas and streams!

Slide 235

Slide 235 text

No content

Slide 236

Slide 236 text

-Trust us, we have much more where those came from.

Slide 237

Slide 237 text

-Trust us, we have much more where those came from. -Puzzlers? Gotchas? Fetal position inducing behavior?

Slide 238

Slide 238 text

-Trust us, we have much more where those came from. -Puzzlers? Gotchas? Fetal position inducing behavior? [email protected]

Slide 239

Slide 239 text

No content

Slide 240

Slide 240 text

-Did you like it?

Slide 241

Slide 241 text

-Did you like it? -Praise me on twitter!

Slide 242

Slide 242 text

-Did you like it? -Praise me on twitter! -#javapuzzlersng #PhillyETE

Slide 243

Slide 243 text

-Did you like it? -Praise me on twitter! -#javapuzzlersng #PhillyETE -@gamussa

Slide 244

Slide 244 text

-Did you like it? -Praise me on twitter! -#javapuzzlersng #PhillyETE -@gamussa -Didn’t like it?

Slide 245

Slide 245 text

-Did you like it? -Praise me on twitter! -#javapuzzlersng #PhillyETE -@gamussa -Didn’t like it? -/dev/null