ranking 
|
date 
|
member
|
date
|
member
2
Sun. Apr. 29th, 2007 9:58 PM 
A possible implementation of the Sieve of Eratosthenes for generating prime numbers below some limit.
2
Generate prime numbers below some limit. This snippet incorporates some DSL like keywords to describe the prime algorithm.
2
The tests for the Sieve of Eratosthenes snippets.
2
Answer to a groovier solution to Hamlet D'Arcy's Rot13 algorithm.
3
Answer to a groovier solution to Hamlet D'Arcy's Rot13 algorithm. This is the refactored version with less redundance.
5
SQL-like DSL for finding classes and methods
5
Generate prime numbers blow some limit using the Sieve of Eratosthenes algorithm. This snippet uses some object abstractions to simplify the algorithm.
5
Generate prime numbers below some limit. This snippet uses groovy categories to locate the appropriate methods in common classes.
6
Using a JGroups ReplicatedHashtable from Groovy
6
Recursively iterate over folders and files to check for differences.
