mxm

% Copyright (c) 2010-2014, Lars Buitinck
% May be used, redistributed and modified under the terms of the
% GNU Lesser General Public License (LGPL), version 2.1 or later

% Heaps/priority queues in Erlang

% Heaps are data structures that return the entries inserted into them in
% sorted order. This makes them the data structure of choice for implementing
% priority queues, a central element of algorithms such as best-first/A*
% search and Kruskal's minimum-spanning-tree algorithm. 

mxm

#!/usr/bin/env ruby

# modified from https://gist.github.com/pbock/3ab260f3862c350e6b5f #

require 'watir-webdriver'

class BurgerBot

  def initialize
    @attempt_count = 0

mxm

import com.google.common.annotations.VisibleForTesting;
import org.apache.flink.api.common.functions.CoGroupFunction;
import org.apache.flink.api.common.functions.MapFunction;
import org.apache.flink.api.common.functions.ReduceFunction;
import org.apache.flink.api.common.state.ReducingState;
import org.apache.flink.api.common.state.ReducingStateDescriptor;
import org.apache.flink.api.common.typeutils.base.LongSerializer;
import org.apache.flink.api.java.functions.KeySelector;
import org.apache.flink.api.java.tuple.Tuple;
import org.apache.flink.api.java.tuple.Tuple2;

mxm

#!/bin/sh

# OPTIONS:
#   -d: start the daemon in the background
#   -p <filename>: log the pid to a file (useful to kill it later)
#   -v: print crate version to stdout
#   -h: print usage information
#   -D: set a java system property value
#   -C: set a Crate property value
#   -X: set a nonstandard java option