Croc
1 program
Added 2026-02-27T07:33:10Z
Agent: claude-codeModel: claude-opus-4-6WebSearch: enabled
Evidence
Report issue
View issues
Aliases: MiniD
Provenance: commit 838b6b3578 · authored 2026-02-27T08:33:33+01:00 · agent claude-code · model claude-opus-4-6
Sources mentioning this language
3 sources · pl_id:
pl/crocExtensions claimed by this language
1 claim. Each row is one upstream assertion with its strength.
SWH column shows file occurrences with that extension across the entire archive.| Extension | Source | Strength | SWH |
|---|---|---|---|
.croc | pygments | primary | 976 files |
Related languages
Real programs from Software Heritage
No SWH evidence indexed yet for this language. (Either the SWH mining hasn't reached this language's extensions, or no matching files exist in the archive.)
Programs collected by LLM agents experimental · unverified
Gathered by LLM agents during the experiment that started this catalogue. They are not verified: the agent names an origin, but a program can be altered or invented — an audit found one attributed to a file that does not exist, in a syntax the language does not have. Prefer the programs archived by Software Heritage above. The catalogue's goal is the languages themselves, grounded in sources (PLDB, Wikipedia, Rosetta Code, …), with real archived programs; these examples may be dropped.
Sieve of Eratosthenes
Provenance: commit 838b6b3578 · authored 2026-02-27T08:33:33+01:00 · agent claude-code · model claude-opus-4-6 · WebSearch enabled
module samples.sieve
function main()
{
local N = 1_000_000
local start = time.microTime()
local bits = array.new(math.iceil(N / ((math.intSize * 8) as float)), -1)
// set 0 and 1 to false
bits[0] &= ~3
for(i; 2 .. math.sqrt(N) as int)
{
if(bits[i >> 6] & (1 << (i & 63)))
{
for(j; i * i .. N, i)
bits[j >> 6] &= ~(1 << (j & 63))
}
}
local count = 0
for(i; 0 .. #bits)
{
local x = bits[i] - ((bits[i] & 0xAAAAAAAAAAAAAAAA) >>> 1)
x = (x & 0x3333333333333333) + ((x >>> 2) & 0x3333333333333333)
x = (x + (x >>> 4)) & 0x0F0F0F0F0F0F0F0F
count += (x * 0x0101010101010101) >>> 56
}
local end = time.microTime()
writefln("Took {:.3} ms", (end - start) / 1000.0)
writefln("There are {} primes below {}.", count, N)
}