In general, I do not repost articles written by others, but this one got my attention.
Sean Toner write this nice article about Functional programming and the notion of Pure functions. Have a read on DZone: Functional Programming Is Not What You (Probably) Think
I the previous post I described simple actions that you can take to harden your web server. It showed you headers that you can alter without too much interference on the functioning.
In this post, I go into more details on the TLS connection itself. The modern browser does quite a lot when a TSL connection is established. There are multiple versions available to initiate a TLS/SSL connection. Not all of the supported versions are secure.
Just recently I finished an article for the Dutch Java magazine about securing your website by means of https connections. In the article, we (Ivo Woltring and I) describe details on how to get a certificate for your Webserver from the LetsEncrypt CA.
The end result of those steps is a site that only allows for https connections. This solved the problem of others listening in on your visitors. Hacking your site is definitely more difficult, but not all possibilities are resolved.
This post describes a implementation for streaming a String of space separated Key Values with Java 8. In order to implement a streaming keyvalue reader two simple classes are implemented. One to handle navigation in the string and one to make a Iterable from the String. The implementation I provide is basic but has enough extension points to meet more extensive requirements.
The problem. We all have faced the same problem when dealing with data from other sources.
This post is part of a multipart series about creating a graph off all available Maven dependencies.
In the article for the Neo4j extension I described the input for the extension. This article describes the model that is used to create the required JSon. I start of with a small introduction to Vertices and edges before going into the implementation.
Vertices and Edges In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).