Objects + Tests = Magic
08_katapotter 08_katapotter
# Run complete. Total time: 00:40:41 Benchmark Mode Cnt Score Error Units PotterBenchmark.ooBasics avgt 200 0.008 ± 0.001 ms/op PotterBenchmark.ooDiscount avgt 200 0.012 ± 0.001 ms/op PotterBenchmark.ooEdge avgt 200 29.504 ± 0.487 ms/op PotterBenchmark.rawBasics avgt 200 ≈ 10−⁴ ms/op PotterBenchmark.rawDiscount avgt 200 ≈ 10−⁴ ms/op PotterBenchmark.rawEdge avgt 200 ≈ 10−⁴ ms/op So who’s the winner ?
- 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 and 30: Modularisation Basket Book Discount
- Page 31 and 32: Computing a price with a discount d
- 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
# Run complete. Total time: 00:40:41<br />
Benchmark Mode Cnt Score Error Units<br />
PotterBenchmark.ooBasics avgt 200 0.008 ± 0.001 ms/op<br />
PotterBenchmark.ooDiscount avgt 200 0.012 ± 0.001 ms/op<br />
PotterBenchmark.ooEdge avgt 200 29.504 ± 0.487 ms/op<br />
PotterBenchmark.rawBasics avgt 200 ≈ 10−⁴ ms/op<br />
PotterBenchmark.rawDiscount avgt 200 ≈ 10−⁴<br />
ms/op<br />
PotterBenchmark.rawEdge avgt 200 ≈ 10−⁴ ms/op<br />
So who’s the winner ?
Change language