java

hoplin.io A lightweight RabbitMQ client for Java (built on top of rabittmq java client)

A lightweight RabbitMQ client for Java (built on top of rabittmq java client) Documentation and project available at GitHub repohttps://github.com/gregbugaj/hoplin.io To make working with RabbitMQ as simple as possible with minimum dependencies. Minimal dependencies, simple configuration and API. Subscriber client Publisher client Async RPC Client Creating simple RabbitMQ client can be done in couple different …

hoplin.io A lightweight RabbitMQ client for Java (built on top of rabittmq java client) Read More »

Data retrieval service with exponential backoff

Here we will create Data retrieval service with exponential backoff that we covered in the previous post. Implementation   package com.rms.blueprint.data;   import java.util.Date; import java.util.Objects; import java.util.concurrent.TimeUnit; import java.util.function.Function; import java.util.function.ObjLongConsumer; import java.util.function.Supplier;   import org.slf4j.Logger; import org.slf4j.LoggerFactory;   public class DataRetrievalWithBackoff implements Runnable { public final Logger LOGGER = LoggerFactory.getLogger(DataRetrievalWithBackoff.class);   private final …

Data retrieval service with exponential backoff Read More »

Calculate centroid of 2D non crossing polygon

Calculate centroid of 2D non crossing polygon,To accommodate that points are correct using Gift wrapping algorithm(Finding Convex Hull) Test case import static org.junit.Assert.assertEquals; import static org.junit.Assert.assertNotNull; import java.awt.Point; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import org.junit.Test; public class MathUtilTest { @Test public void computeCentroidWithHull() { Point p1 = new Point(1, 1); Point p2 = new …

Calculate centroid of 2D non crossing polygon Read More »

Find Convex hull of given points using Gift wrapping algorithm

Find Convex hull of given points using Gift wrapping algorithm This is implementation of Grift wrapping algorithm for finding convex hull.   private static final Integer ZERO = new Integer(0);     /** * Find Convex hull of given points * * @ref http://en.wikipedia.org/wiki/Gift_wrapping_algorithm * @param vertices * @return */ private static List<Point> findConvexHull(final List<Point> …

Find Convex hull of given points using Gift wrapping algorithm Read More »