Category:OoRexx
OoRexx
This programming language may be used to instruct a computer to perform a task.
Listed below are all of the tasks on Rosetta Code which have been solved using OoRexx.
This programming language may be used to instruct a computer to perform a task.
Official website |
---|
See Also: |
|
---|
OoRexx is an implementation of REXX.
Other implementations of REXX.
ooRexx (aka Open Object Rexx) is an object oriented successor of 'Classic' Rexx (another one is NetRexx). Both Open Object Rexx and NetRexx were created by IBM and are now, open sourced, maintained by the Rexx Language Association.
ooRexx can be used to run many programs shown here in the REXX category.
See http://rosettacode.org/wiki/Rosetta_Code:Village_Pump/Dialects#REXX.2C_ooRexx.2C_and_others for differences.
Subcategories
This category has the following 3 subcategories, out of 3 total.
@
- OoRexx Implementations (1 P)
- OoRexx User (5 P)
Pages in category "OoRexx"
The following 200 pages are in this category, out of 234 total.
(previous page) (next page)2
A
- A+B
- Abstract type
- Accumulator factory
- Ackermann function
- Active Directory/Search for a user
- Active object
- Add a variable to a class instance at runtime
- Address of a variable
- Align columns
- Anagrams
- Anagrams/Deranged anagrams
- Animate a pendulum
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Arbitrary-precision integers (included)
- Arena storage pool
- Arithmetic evaluation
- Arithmetic-geometric mean
- Arithmetic/Complex
- Arithmetic/Rational
- Array concatenation
- Array length
- Arrays
- Associative array/Creation
- Associative array/Iteration
- Averages/Arithmetic mean
- Averages/Mean angle
- Averages/Mean time of day
- Averages/Median
- Averages/Mode
- Averages/Pythagorean means
- Averages/Root mean square
- Averages/Simple moving average
C
- Call a function
- Call an object method
- Catalan numbers
- Check Machin-like formulas
- Check that file exists
- Cholesky decomposition
- Circles of given radius through two points
- Classes
- Collect and sort square numbers in ascending order from three lists
- Collections
- Comments
- Compare a list of strings
- Compound data type
- Concurrent computing
- Conditional structures
- Constrained genericity
- Conway's Game of Life
- Copy a string
- Count occurrences of a substring
- CRC-32
- Create a two-dimensional array at runtime
- Cumulative standard deviation
- Curve that touches three points
- Cycle detection
D
F
G
H
I
J
L
M
N
P
R
- Ramer-Douglas-Peucker line simplification
- Random numbers
- Range expansion
- Range extraction
- Read a configuration file
- Read entire file
- Real constants and functions
- Reflection/List properties
- Regular expressions
- Remove duplicate elements
- Respond to an unknown method call
- Return multiple values
- Roots of a function
- Roots of unity
- Rosetta Code/Rank languages by popularity
- Runtime evaluation
- Runtime evaluation/In an environment
S
- Search a list
- Selective file copy
- Self-describing numbers
- Set
- Set consolidation
- Shell one-liner
- Short-circuit evaluation
- Sieve of Eratosthenes
- Simple windowed application
- Singleton
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Sleep
- Sort an array of composite structures
- Sort an integer array
- Sort disjoint sublist
- Sort stability
- Sort using a custom comparator
- Sorting algorithms/Bead sort
- Sorting algorithms/Bubble sort
- Sorting algorithms/Cocktail sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Insertion sort
- Sorting algorithms/Quicksort
- Sorting algorithms/Selection sort
- Sorting algorithms/Shell sort