by Peter | Apr 27, 2018 | Java, Projects
Part of my daily routine is to consume, design and deliver services built for HTTP clients. This might manifest in something special like WebSocket, Protobuf but most often a plain JSON REST API. In any case, the performance is key, and an Undertow REST API with...
by Peter | Dec 16, 2017 | Golang, Notes
The flyweight pattern is a design pattern I am not seeing that often in code bases but can be a good design pattern to reduce memory. The core idea is to initialize objects an share them as often as possible for reuse. Mostly the flyweight pattern can be seen in...
by Peter | Oct 15, 2017 | Golang
There are a number of design patterns I am using on daily bases, and one of them is the Singleton pattern. In Golang penalties in performance are not so harsh as in other languages, if the application is not designed and written to perform with minimal CPU and memory...
by Peter | Jul 18, 2017 | Golang
This post is a walkthrough on my approach to develop and deploy Golang web service in Docker container. There are many reasons for integrating Docker into the daily routine as a developer, one being the simplification of setting up a separated runtime environment....
by Peter | Feb 18, 2017 | Testing
In most cases web applications are well covered with unit tests, to covert a functional requirements and acceptance tests. Unit tests combined with Continuous Integration can improve the deviling rate of a team/company. At the same time it can remove the need of...
by Peter | Dec 1, 2016 | Data Structures & Algorithms, Java, Notes
Heapsort algorithm details: Worst-case Time Complexity: O(n log(n)) Space Complexity: O(1) The algorithm The heapsort algorithm is an in-place, comparison based sorting algorithm. In the core of the algorithm (as the name suggest), the use of the heap data...
by Peter | Nov 16, 2016 | Data Structures & Algorithms, Java, Notes
Merge sort algorithm details: Worst-case Time Complexity: O(n log(n)) Space Complexity: O() The algorithm Merge sort is comparison based algorithm, from the efficient sorting category. The algorithm is based on “Divide and conquer” (John Van Neumann),...
by Peter | Nov 14, 2016 | Data Structures & Algorithms, Java, Notes
Algorithm details: Worst-case Time Complexity: O(n^2) Space Complexity: O(1) The algorithm Bubble sort is a very simple sorting algorithm, with straight forward implementation. The algorithm is based on comparison of all elements to each other. The compared...
by Peter | Sep 22, 2016 | Cassandra
I upgraded my Ubuntu 14.04 development system to 16.04 in August with the first point release. I have to say the upgrade process when really smooth. There where small issues with PHP and Python. The only painful issue I had was with Cassandra and CqlSh. The python...
by Peter | Sep 18, 2016 | Golang
I am always really excited reading peoples notes about new languages and technologies, and this was not different with Golang. I read about the language and an implementation roughly 4 years ago. After reading the article I looked around to find more details about the...
