Objects + Tests = Magic

Recommendations

Info

Computing Price for b ∈ Basket b is empty => 0.0 Let discounts = {d ∈ Discount | d can be applied to b} discounts is empty => |books|b * PRICE Let candidates = { p ∈ R | d ∈ discounts, p = compute(b,d) } => min(candidates) NAIVE
Computing a price with a discount d for b Let local price = d applied to b Let remaining = clone of b without the books used in d => local price + compute(remaining) NAIVE
Page 1: pictures: sxc.hu pictures: sxc.hu O
Page 4 and 5: Reference
Page 6 and 7: The problem: Selling Harry Potter b
Page 8 and 9: Pricing Policy Example B1 B1 B2 B2
Page 10 and 11: Combinatorial situation! B1 B2 B3 O
Page 12 and 13: Yes we can !
Page 14 and 15: http://bfindeiss.blogspot.fr/2013/0
Page 17 and 18: Yes we Seriously? can !
Page 19 and 20: “ Bon, j'ai réfléchi un peu à
Page 21 and 22: Complexity survival guide if (chris
Page 23 and 24: How can one encapsulate the computa
Page 25 and 26: Software engineering rule of three
Page 27 and 28: SOLIDity applied to OO code • S :
Page 29: Modularisation Basket Book Discount
Page 33 and 34: https://www.youtube.com/playlist?li
Page 35 and 36: Internal implementation We don’t
Page 37 and 38: Testing Critical Cases ~ ✔
Page 40 and 41: Testing the Discount concept
Page 42 and 43: is empty => 0.0 Let discounts = {d
Page 44 and 45: Let the battle begin! Benchmarking
Page 46 and 47: Each bench is executed 10 times 20
Page 48: # Run complete. Total time: 00:40:4

Objects + Tests = Magic

Create successful ePaper yourself

Delete template?

Save as template?