ashkrit

public class SingleLock<V> implements Lazy<V> {

    private Callable<V> codeBlock;
    private V value;

    public SingleLock(Callable<V> codeBlock) {
        this.codeBlock = codeBlock;
    }

    @Override

ashkrit

 static int rotationPoint(char[] values) {

        int start = 0;
        int end = values.length - 1;
        char startCharacter = values[0];

        while (start <= end) {
            int mid = (start + end) >>> 1;

            if (isRotationPoint(values, mid)) {

ashkrit

static int bruteRotationPoint(char[] values) {

        for (int index = 1; index < values.length; index++) {
            if (values[index] < values[index - 1]) {
                return index;
            }
        }
        return -1;
    }

ashkrit

private static int binarySearch(int[] a, int fromIndex, int toIndex,
                                     int key) {
        int low = fromIndex;
        int high = toIndex - 1; 

        while (low <= high) {
            int mid = (low + high) >>> 1; // This line had the bug - earlier it was int mid = (low + high) / 2;
            int midVal = a[mid];

            if (midVal < key)

ashkrit

1. General Background and Overview

• Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
• Models and Issues in Data Stream Systems
• Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
• Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
• [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep

ashkrit

@Override
    public Object[] init() {
        Object[] localValue;
        int currentSize;

        while ((localValue = arrayValue) == null || localValue.length == 0) {

            if ((currentSize = size) < 0) {
                Thread.yield(); // Array already init
            } else if (unsafe.compareAndSwapInt(this, SIZECTL, currentSize, -1)) {

ashkrit

 @FunctionalInterface
    public interface AutoCodeBlock {
        void execute(AutoCloseable closeable) throws IOException;
    }

    @FunctionalInterface
    public interface ExceptionBlock {
        void execute() throws Exception;
    }
    

ashkrit

@FunctionalInterface
    public interface CodeBlock {
        void execute();
    }
    
     public static void time(String name, CodeBlock codeBlock) {
        long start = System.currentTimeMillis();
        codeBlock.execute();
        long total = System.currentTimeMillis() - start;
        System.out.println(name + " took " + total + " ms");

ashkrit

@FunctionalInterface
    public interface CodeBlock {
        void execute();
    }

    @FunctionalInterface
    public interface Condition {
        boolean test();
    }

ashkrit

public void add(T element) {
        AutoCompactList<T> slot = slots.get(lastSlotIndex());
        if (slot.remainingCapacity() > 0) {
            slot.add(element);
        } else {
            appendNewSlot();
            add(element);
        }
    }