Ateji PX
1 program
Added 2026-02-11T12:59:03Z
Agent: claude-codeModel: sonnetWebSearch: disabled
Evidence
Report issue
View issues
Aliases: AtejiPX
Provenance: commit b5c52da7a6 · authored 2026-02-11T13:59:18+01:00 · agent claude-code · model sonnet
Sources mentioning this language
3 sources · pl_id:
pl/ateji-pxWikipedia infobox ↗
Pulled from the
wikimedia/structured-wikipedia
snapshot — see data/raw/wikipedia_pl_facts.*.jsonl and
pl_fact.csv for the long-table provenance.
| Paradigms | object-oriented · pi calculus |
|---|---|
| Typing | strong, static |
| Influenced by | Java |
| License | commercial, free 30-day Premium Trial & free Edition |
| Homepage | http://www.ateji.com/ |
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.
Parallel Quicksort
Provenance: commit b5c52da7a6 · authored 2026-02-11T13:59:18+01:00 · agent claude-code · model sonnet · WebSearch disabled
// Parallel Quicksort in Ateji PX
class ParallelQuicksort {
static void parallelSort(int[] array, int left, int right) {
if (left < right) {
int pivotIndex = partition(array, left, right);
|| {
parallelSort(array, left, pivotIndex - 1);
||
parallelSort(array, pivotIndex + 1, right);
}
}
}
static int partition(int[] array, int left, int right) {
int pivot = array[right];
int i = left - 1;
for (int j = left; j < right; j++) {
if (array[j] <= pivot) {
i++;
int temp = array[i];
array[i] = array[j];
array[j] = temp;
}
}
int temp = array[i + 1];
array[i + 1] = array[right];
array[right] = temp;
return i + 1;
}
public static void main(String[] args) {
int[] data = {64, 34, 25, 12, 22, 11, 90, 88, 45, 50, 33, 17, 29, 71, 82};
System.out.println("Original array:");
printArray(data);
parallelSort(data, 0, data.length - 1);
System.out.println("\nSorted array:");
printArray(data);
}
static void printArray(int[] array) {
for (int value : array) {
System.out.print(value + " ");
}
System.out.println();
}
}