exercise programming style aop

Exercises in Aspect-Oriented Programming Style

This is the 12th post in the Exercises in Programming Style focus series. This week, we will focus on Aspect-Oriented Programming, a powerful programming technique: In computing, Aspect-Oriented Programming is a programming paradigm that aims to increase modularity by allowing the separation of cross-cutting concerns. It does so by adding additional behavior to existing code without modifying the code itself, instead separately specifying which code is modified via a 'pointcut' specification, suc

exercise programming style

Exercises in Programming Style and the Event Bus

This is the 10th post in the Exercises in Programming Style focus series. In last week’s post, we solved the now familiar top-25-word-frequencies-in-a-text-file problem by using Event-Driven Programming. When the number of observer-subject pairs grows, an alternative is to migrate to the Event Bus. The Observer pattern is a messaging pattern: an Observer subscribes to a Subject. When the later emits an event, the former is notified. This is End-to-Point messaging: if multiple observers are

exercise programming style

Exercises in Programming Style: Event-Driven Programming

This is the 9th post in the Exercises in Programming Style focus series. In the post from two weeks ago, we solved the problem using Object-Oriented Programming: we modeled the problem space using objects. For an object to communicate with another one, a dispatch() method was made available. Remember before the web was ubiquitous? Graphical user interfaces were already a thing. One great and widespread way to handle user interactions is Event-Driven Programming: this has been popularized as the

exercise programming style

Exercises in Programming Style: maps are objects too

This is the 8th post in the Exercises in Programming Style focus series. Last week’s post was dedicated to OOP. Despite popular belief, the exercise was solved using neither accessors i.e. getters and setters, nor shared mutable state. The solution’s implementation was based on traditional OOP constructs offered by the Kotlin language: classes, inheritance and overriding. Other languages may offer different ways to do OOP.

exercise programming style

Exercises in Programming Style, back to Object-Oriented Programming

This is the 7th post in the Exercises in Programming Style focus series. The post of this week is special, as it’s about Object-Oriented Programming. It’s quite popular nowadays to dismiss OOP. There’s a lot of confusion around it. Some people conflate OOP with accessors (i.e. getters and setters), or shared mutable state (or even both). This is not true, as we will see in this post.

exercise programming style

Composing Exercises in Programming Style

This is the 6th post in the Exercises in Programming Style focus series. Last week saw us using higher-order functions by passing them as the parameter to another function, and dynamically calling them. The parameter passing is quite nice, but it’s not easy to follow the flow of the program. This week we are going to keep those functions, but make use of them in a different way, with function composition.

exercise programming style

Exercises in Programming Style with higher-order functions

This is the 5th post in the Exercises in Programming Style focus series. This week, the chapter is named 'Kick forward'. The style’s constraint is not to call a function directly, but to pass it to the next function as a parameter, to be called later. I’m not sure whether the concept of higher-order functions has its roots in Functional Programming. However, the concept itself is easy to grasp. A higher-order function can be used as a function parameter - or as a return value - of ano

exercise programming style

Exercises in Programming Style, recursion

This is the 4th post in the Exercises in Programming Style focus series. This week’s post will be back to fundamentals, as the constraint is to use recursion. Recursion in computer science is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem (as opposed to iteration). The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.