All Classes

This is an example Aggregated Hadoop Map/Reduce application.

This is an example Aggregated Hadoop Map/Reduce application.

An arithmetic progression

Input format for the BaileyBorweinPlouffe.BbpMapper.

Reducer for concatenating map outputs.

Bellard's BBP-type Pi formula 1/2^6 \sum_{n=0}^\infty (-1)^n/2^{10n} (-2^5/(4n+1) -1/(4n+3) +2^8/(10n+1) -2^6/(10n+3) -2^2/(10n+5) -2^2/(10n+7) +1/(10n+9)) References: [1] David H.

The sums in the Bellard's formula

A class is a Container if it contains an element.

Applications should implement this to receive the solutions to their problems.

A map/reduce program that uses a BBP-type method to compute exact binary digits of Pi.

Each map takes a line, which represents a prefix move and finds all of the solutions that start with that prefix.

Abstract machine for job execution.

Split for the summations

An InputFormat which partitions a summation

A machine which chooses Machine in runtime according to the cluster status

Use the index for partitioning.

An InputFormat which returns a single summation.

A description of an example program based on its class and a human-readable description.

Modular arithmetics

RecordReader is responsible from extracting records from a chunk of the CombineFileSplit.

To use CombineFileInputFormat, one should extend it, to return a (custom) RecordReader.

Of the "normal" 12 pentominos, 6 of them have distinct shapes when flipped.

Maintain information about a puzzle piece.

A map/reduce program that estimates the value of Pi using a quasi-Monte Carlo (qMC) method.

Reducer class for Pi estimation.

This program uses map/reduce to just run a distributed job where there is no interaction between the tasks and each task write a large unsorted random binary sequence file of BytesWritable.

Compare only the first part of the pair, so that reduce is called once for each value of the first part.

Define a pair of integers that are writable.

Read two integers from each line and generate a key, value pair as ((left, right), right).

This is the trivial map/reduce program that does absolutely nothing other than use the framework to fragment and sort the input values.

This interface is a marker class for the columns created for the Sudoku solver.

A Writable class for Summation

An input format that reads the first 10 characters of each line as the key and the rest of the line as the value.

Generates the sampled split points, launches the job, and waits for it to finish.

TeraSort configurations.

Utility methods

Maps words from line of text into 2 key-value pairs; one key-value pair for counting the word, another for counting its length.

Performs integer summation of all the values for each key.

Maps words from line of text into 3 key-value pairs; one key-value pair for counting the word, one for counting its length, and one for counting the square of its length.