Programming paradigms

Pathfinding in directed graphs – brief introduction to Prolog

Let’s imagine, that you have directed graph (like this I drawn and pasted below) and you have to write some part of code to find all paths between two nodes. Why not to do that using another paradigm than those to which we have got used to?


Continue reading


@Data to de-boilerplate them all

Do you remember writing each and every time the same part of code? Generating getters, setters, constructors, hashCode(), equals() and toString()? There is simple solution to avoid that! You will never need to write these parts again on your own, nor generate it using IDE tools. The answer is simple – Lombok.

Continue reading