Introducing Eager Design
•
4 gefällt mir•1,618 views
What happens when the very frameworks, tools and patterns we cherish take the reins and forces us to focus on all the boilerplate scaffolding things, distracting us from really solving the real problems? Sometimes the outside-in approach can lead us to code that is more complex and coupled than it has to be. Eager Design offers a fresh approach. Instead of being led by the delivery mechanisms, frameworks and patterns, we focus on the problems worth solving. Inspired by functional programming and Domain Driven Design, the principles of Eager Design helps us isolate and solve complex problems in a more focused and decouple manner.
Empfohlen
Weitere ähnliche Inhalte
Was ist angesagt?
Was ist angesagt? (20)
Andere mochten auch
Ähnlich wie Introducing Eager Design
Ähnlich wie Introducing Eager Design (20)
Mehr von Marcello Duarte
Mehr von Marcello Duarte (10)
Kürzlich hochgeladen
Kürzlich hochgeladen (20)
Introducing Eager Design
- 13. outside-in ♞
- 16. therightoutside http://bit.ly/modellingbyexample http://bit.ly/whencucumbersgobad @_md#EagerDesign
- 18. when?
- 19. EagerDesign when done trivial done nottrivial notdone noidea [based on Cynefin, Snowden 03] @_md#EagerDesign
- 20. EagerDesign when done trivial done nottrivial notdone noidea [based on Cynefin, Snowden 03] Outside-in @_md#EagerDesign
- 21. EagerDesign when done trivial done nottrivial notdone noidea [based on Cynefin, Snowden 03] EagerDesign Outside-in @_md#EagerDesign
- 22. EagerDesign when done trivial done nottrivial notdone noidea [based on Cynefin, Snowden 03] EagerDesign Outside-in ¯_(ツ)_/¯ @_md#EagerDesign
- 23. Example
- 28. Letmethink
- 29. a b c d e f g h List of things
- 30. a b c d e f g h List of things Pairs a b c d h g f e
- 31. Pairs a b c d h g f e
- 32. Shift to the right a b c d h g f ee
- 33. We haz roundz! :o) a b c d h g f ee
- 34. r1 r2 r3 r4 r5 r6 r7 + r1 r2 r3 r4 r5 r6 r7 inverse ( )
- 36. r1 r2 r3 r4 r5 r6 r7 r8 r9 r10 r11 r12 r13 r14 shuffle ( )
- 41. ImmList a b c d e f g hhead a b c d e f g htail a b c d e f g hinit a b c d e f g hlast
- 43. function shift(ImmList $players) { return concat(head($players), last($players), init(tail($players)) ); }
- 44. function shift(ImmList $players) { return concat(head($players), last($players), init(tail($players)) ); }
- 45. function round(ImmList $players) { $sides = $players->splitAt($players->length/2); return $sides->_1->zip($sides->_2->reverse()); }
- 47. function rounds(ImmList $players, $rounds = []) { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); }
- 48. function rounds(ImmList $players, $rounds = []) { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); }
- 49. function rounds(ImmList $players, $rounds = []) { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); }
- 50. function rounds(ImmList $players, $rounds = []) { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); } #3Compose
- 51. function rounds(ImmList $players, $rounds = []) { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); } #4Avoidmutablestate
- 52. function rounds(ImmList $players, $rounds = []) { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); }
- 53. function schedule(ImmList $players) { return concat(rounds($players), inverse(rounds($players)); }
- 59. type Player = string; type Players = ImmList<Player>; type Match = Pair<Player,Player> type Round = ImmList<Match>; type Rounds = ImmList<Round>; type Schedule = Rounds;
- 61. function shift(Players $players): Players { return concat(head($players), last($players), init(tail($players)) ); }
- 62. function round(Players $players): Round { $sides = $players->splitAt($players->length/2); return $sides->_1->zip($sides->_2->reverse()); }
- 63. function rounds(Players $players, $rounds = []) : Rounds { $rounds[] = round($players); return count($rounds) < $players->length - 1 ? rounds(shift($players), $rounds) : ImmList(...$rounds); }
- 64. function schedule(Players $players): Rounds { return concat(rounds($players), inverse(rounds($players)); }
- 66. namespace MdChessScheduleGeneration; shift(Players $players): Players round(Players $players): Round rounds(Players $players): Rounds schedule(Players $players): Schedule
- 68. Players => Rounds => Schedule ♞
- 69. Players => Round => Rounds => Schedule ♞
- 76. def request def decline def amend def accept def done
- 77. def request(details:JobDetails): Job def decline(ref:JobRef): Job def amend(details:JobDetails): Job => Option[TimeSheet] def accept(ref:JobRef): Job => Option[TimeSheet] def done(ref:JobRef): TimeSheet => Remittance
- 78. trait JobService { def request(details:JobDetails): Job def decline(ref:JobRef): Job def amend(details:JobDetails):Job => Option[TimeSheet] def accept(ref:JobRef): Job => Option[TimeSheet] def done(ref:JobRef): TimeSheet => Remittance }
- 79. trait JobService { def request(details:JobDetails): Job def decline(ref:JobRef): Job def amend(details:JobDetails):Job => Option[TimeSheet] def accept(ref:JobRef): Job => Option[TimeSheet] def done(ref:JobRef): TimeSheet => Remittance }
- 81. f(a:A):M[B] f(a) map g = M[M[C]] g(a:B):M[C]
- 82. f(a:A):M[B] join f(a) map g = M[C] g(a:B):M[C]
- 85. def execute(input:Input): Unit path = input("path").getOrElse("specs") loadSpecs(path) andThen runSpecs andThen presentResults
- 90. if ($this->value == $another->value) { return Pair(Cell(), Cell($this->value + $another->value)); } elseif ($another->isEmpty()) { return Pair(Cell(), Cell($this->value)); } return Pair(Cell($this->value), Cell($another->value));
- 91. if ($this->value == $another->value) { return Pair(Cell(), Cell($this->value + $another->value)); } elseif ($another->isEmpty()) { return Pair(Cell(), Cell($this->value)); } return Pair(Cell($this->value), Cell($another->value));
- 92. if ($this->value == $another->value) { return Pair(Cell(), Cell($this->value + $another->value)); } elseif ($another->isEmpty()) { return Pair(Cell(), Cell($this->value)); } return Pair(Cell($this->value), Cell($another->value));
- 93. function swipe($lines) { return $lines->map(function ($line) { $lineCopy = mergeLine($line); while (!isLineMerged($lineCopy)) { $lineCopy = mergeLine($lineCopy); } return $lineCopy; }); }