SelfAwarePotato

-

String Encodings? Unicode? ASCII? UTF-8? ãéîöû?

Setup Hadoop on Mac using HomeBrew - July 2020

Enjoy quickies with supplyAsync by knowing how to handle exceptions.

Singletons!

A Generic method to convert ResultSetFuture (of Datastax Java driver for Cassandra) to a list of table-row-model(POJO) for any table query

Converting google/guava ListenableFuture to Java 8 CompletableFuture

Euler Path in a graph using Hierholzer's algorithm

Comments

Post a Comment

Popular posts from this blog

Converting google/guava ListenableFuture to Java 8 CompletableFuture

-
Java was a bit late in bringing Javascript's promise-like functionality. Future was there but wasn't as cool. So people at google made ListenableFuture . Now that java has CompletableFuture , it is common to run into problems like converting a ListenableFuture to a CompletableFuture. This can be because part of your older code uses ListenableFuture and now you have to compose your new logics utilising the newer and Java native technique. Following is one possible way to do it. 1 2 3 4 5 6 7 8 9 10 11 12 13 14 public class FutureConverter { public static CompletableFuture toCompletableFuture ( ListenableFuture listenableFuture ) { final CompletableFuture completableFuture = new CompletableFuture (); Futures . addCallback ( listenableFuture , new FutureCallback () { public void onFailure ( Throwable throwable ) { completableFuture . completeException...
Read more

Euler Path in a graph using Hierholzer's algorithm

-
We will discuss how to find the Euler path(path is a sequence of vertices connected by edges) in a graph. The assumption we are taking in this article is, the given graph is connected and there is a Euler path in the given graph, although we will discuss a criteria which will help us know if there is any Euler path in graph. Moreover, we will present the pseudo code of one of the algorithm and pick up a problem and solve it using the algorithm discussed in the aricle. Intro: Definition: Euler path is a path such that we travel all the edges of the graph exactly once (repetion of vertices is allowed). Euler path example In the above example, one of the Euler path is: 1,2,3,4,2,6,2,5 Euler path can be a closed path i.e. a cycle also called Euler circuit or it can be an open path as in the above example aslo called Euler walk. Prerequisite Degree of a ve...
Read more