GapList combines the strengths of both ArrayList and LinkedList. It offers both efficient random access to elements by index (as ArrayList does) and at the same time efficient adding and removing elements to and from beginning and end (as LinkedList does).
There’s healthy paranoia, then there’s over-the-top-error-checking, and then there’s bat shit crazy crippling paranoia – where defensive programming takes over and turns in on itself. Jim Bird shows us some tips for defensive (paranoid) programming that aren't over-the-top.
Ranjib Dey explores what he thinks are the few critical points that make CD or continuous delivery feasible now. Contrasting his viewpoints is some commentary from Dave Farely, the author of "Continuous Delivery".
Recently I posted how to leverage EclipseLink JAXB (MOXy)'s JSON binding to create a RESTful service. In this post I will demonstrate how easy it is to take advantage of MOXy's JSON binding on the client side.
The Apriori algorithm is a basic method for finding frequent itemsets. The latter is used to generate association rules with high confidence and high interest. Here is my summary of it along with a running example. The following set of baskets will be used: