Reports:Tasks not implemented in Action!
If Action! is a language you like, or are interested in, please inform your fellow members of the Action! community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Action!. Please implement some if you can. If any tasks are not possible or too complex in Action!, they should not be on this list. To mark a task as such, add {{omit from|Action!}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
- AKS test for primes
- ASCII art diagram converter
- AVL tree
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Abelian sandpile model
- Abelian sandpile model/Identity
- Abstract type
- Abundant odd numbers
- Accumulator factory
- Achilles numbers
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Add a variable to a class instance at runtime
- Additive primes
- Algebraic data types
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Amb
- Anagrams
- Anagrams/Deranged anagrams
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Anonymous recursion
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arbitrary-precision integers (included)
- Arena storage pool
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic evaluation
- Arithmetic numbers
- Array length
- Ascending primes
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Associative array/Merging
- Atomic updates
- Average loop length
- Averages/Mean angle
- Averages/Simple moving average
B
- Babbage problem
- Balanced ternary
- Bell numbers
- Benford's law
- Bernoulli numbers
- Binary strings
- Bioinformatics/Sequence mutation
- Biorhythms
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Bitwise IO
- Brace expansion
- Break OO privacy
- Brilliant numbers
- Bulls and cows/Player
- Burrows–Wheeler transform
C
- CRC-32
- CSV data manipulation
- CSV to HTML translation
- Calendar
- Calendar - for "REAL" programmers
- Calkin-Wilf sequence
- Call a foreign-language function
- Call a function
- Call a function in a shared library
- Call an object method
- Canny edge detector
- Canonicalize CIDR
- Carmichael 3 strong pseudoprimes
- Catamorphism
- Catmull–Clark subdivision surface
- Chaocipher
- Chat server
- Check Machin-like formulas
- Check input device is a terminal
- Check output device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Cheryl's birthday
- Cholesky decomposition
- Chowla numbers
- Church numerals
- Circular primes
- Classes
- Closest-pair problem
- Closures/Value capture
- Collections
- Color quantization
- Color wheel
- Colorful numbers
- Colour pinstripe/Printer
- Combinations and permutations
- Command-line arguments
- Commatizing numbers
- Compare length of two strings
- Compare sorting algorithms' performance
- Compile-time calculation
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concurrent computing
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Conway's Game of Life
- Count the coins
- Cramer's rule
- Cuban primes
- Cullen and Woodall numbers
- Currency
- Currying
- Curzon numbers
- Cut a rectangle
- Cyclops numbers
- Cyclotomic polynomial
D
- DNS query
- Date manipulation
- De Bruijn sequences
- Deal cards for FreeCell
- Death Star
- Deceptive numbers
- Deconvolution/1D
- Deconvolution/2D+
- Deepcopy
- Define a primitive data type
- Delegates
- Deming's Funnel
- Descending primes
- Detect division by zero
- Determinant and permanent
- Determine if only one instance is running
- Determine if two triangles overlap
- Determine sentence type
- Digital root
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Disarium numbers
- Discordian date
- Display a linear combination
- Display an outline as a nested table
- Distributed programming
- Diversity prediction theorem
- Documentation
- Draw a clock
- Draw a rotating cube
- Duffinian numbers
- Dynamic variable names
E
- Earliest difference between prime gaps
- Eban numbers
- Echo server
- Eertree
- Egyptian fractions
- Element-wise operations
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Emirp primes
- Empty directory
- Enforced immutability
- Entropy
- Entropy/Narcissist
- Enumerations
- Environment variables
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Esthetic numbers
- Euler's constant 0.5772...
- Euler's identity
- Euler's sum of powers conjecture
- Euler method
- Evaluate binomial coefficients
- Events
- Evolutionary algorithm
- Exceptions
- Exceptions/Catch an exception thrown in a nested call
- Executable library
- Execute Brain****
- Execute Computer/Zero
- Execute SNUSP
- Execute a Markov algorithm
- Execute a system command
- Exponentiation with infix operators in (or operating on) the base
- Extend your language
- Extensible prime generator
- Extreme floating point values
F
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Factors of a Mersenne number
- Fairshare between two and more
- Farey sequence
- Fast Fourier transform
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- Fibonacci word
- Fibonacci word/fractal
- File modification time
- Find Chess960 starting position identifier
- Find common directory path
- Find duplicate files
- Find if a point is within a triangle
- Find largest left truncatable prime in a given base
- Find limit of recursion
- Find palindromic numbers in both binary and ternary bases
- First-class functions
- First-class functions/Use numbers analogously
- First class environments
- First perfect square in base n with n unique digits
- First power of 2 that has leading decimal digits of 12
- Fivenum
- Fixed length records
- Flatten a list
- Flow-control structures
- Floyd-Warshall algorithm
- Forest fire
- Fork
- Formal power series
- Formatted numeric output
- Fortunate numbers
- Forward difference
- Four is magic
- Four is the number of letters in the ...
- Fraction reduction
- Fractran
- French Republican calendar
- Function composition
- Function definition
- Function frequency
- Function prototype
- Functional coverage tree
- Fusc sequence
G
- GUI/Maximum window dimensions
- GUI component interaction
- GUI enabling/disabling of controls
- Galton box animation
- Gamma function
- Gapful numbers
- Gauss-Jordan matrix inversion
- Gaussian elimination
- Generator/Exponential
- Get system command output
- Globally replace text in several files
- Go Fish
- Goldbach's comet
- Graph colouring
- Greyscale bars/Display
H
- HTTP
- HTTPS
- HTTPS/Authenticated
- HTTPS/Client-authenticated
- Hailstone sequence
- Halt and catch fire
- Hamming numbers
- Handle a signal
- Harmonic series
- Hash from two arrays
- Hash join
- Haversine formula
- Hello world/Newbie
- Hello world/Standard error
- Hello world/Web server
- Here document
- Heronian triangles
- Hickerson series of almost integers
- Higher-order functions
- History variables
- Hofstadter-Conway $10,000 sequence
- Hofstadter Figure-Figure sequences
- Holidays related to Easter
- Home primes
- Honeycombs
- Horizontal sundial calculations
- Hostname
- Hough transform
- Huffman coding
- Humble numbers
- Hunt the Wumpus
I
- IBAN
- I before E except after C
- Idiomatically determine all the characters that can be used for symbols
- Imaginary base numbers
- Increasing gaps between consecutive Niven numbers
- Index finite lists of positive integers
- Infinity
- Inheritance/Multiple
- Inheritance/Single
- Integer overflow
- Interactive programming (repl)
- Intersecting number wheels
- Introspection
- Inverted index
- Inverted syntax
- Isqrt (integer square root) of X
- Iterated digits squaring
J
K
L
- LU decomposition
- LZW compression
- Lah numbers
- Largest int from concatenated ints
- Largest number divisible by its digits
- Largest proper divisor of n
- Last letter-first letter
- Latin Squares in reduced form
- Latin Squares in reduced form/Randomizing using Jacobson and Matthews’ Technique
- Left factorials
- Legendre prime counting function
- Levenshtein distance/Alignment
- Linear congruential generator
- List comprehensions
- List rooted trees
- Literals/Floating point
- Literals/Integer
- Literals/String
- Long literals, with continuations
- Long multiplication
- Long primes
- Longest common subsequence
- Longest increasing subsequence
- Longest string challenge
- Loops/Continue
- Loops/Downward for
- Loops/Increment loop index within loop body
- Loops/With multiple ranges
- Loops/Wrong ranges
- Lucas-Lehmer test
- Lucky and even lucky numbers
- Lychrel numbers
M
- MAC Vendor Lookup
- MD4
- MD5
- MD5/Implementation
- Mad Libs
- Magic constant
- Magic squares of doubly even order
- Magic squares of odd order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Make directory path
- Man or boy test
- Mandelbrot set
- Marching squares
- Matrix-exponentiation operator
- Matrix chain multiplication
- Matrix digital rain
- Mayan calendar
- Mayan numerals
- Memory layout of a data structure
- Merge and aggregate datasets
- Metallic ratios
- Metaprogramming
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Miller–Rabin primality test
- Mind boggling card trick
- Minesweeper game
- Minimal steps down to 1
- Minimum multiple of m where digital sum equals m
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Modular arithmetic
- Modular exponentiation
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Monty Hall problem
- Motzkin numbers
- Mouse position
- Multi-base primes
- Multi-dimensional array
- Multiple regression
- Multiplicative order
- Multisplit
- Mutex
- Mutual recursion
- Möbius function
N
- N-queens problem
- N-smooth numbers
- Named parameters
- Naming conventions
- Narcissist
- Narcissistic decimal number
- Natural sorting
- Nautical bell
- Nested function
- Nested templated data
- Next highest int from digits
- Non-continuous subsequences
- Non-decimal radices/Input
- Non-transitive dice
- Nonogram solver
- Number names
- Numbers which are not the sum of distinct squares
- Numbers with equal rises and falls
- Numeric error propagation
- Numerical and alphabetical suffixes
- Numerical integration
- Numerical integration/Gauss-Legendre Quadrature
O
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Padovan n-step number sequences
- Padovan sequence
- Palindromic gapful numbers
- Pancake numbers
- Paraffins
- Parallel brute force
- Parallel calculations
- Parameterized SQL statement
- Parametric polymorphism
- Parse an IP Address
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partial function application
- Particle fountain
- Partition an integer x into n primes
- Partition function P
- Pascal's triangle/Puzzle
- Pathological floating point problems
- Peaceful chess queen armies
- Pell's equation
- Pell numbers
- Penney's game
- Pentomino tiling
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect totient numbers
- Periodic table
- Perlin noise
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pernicious numbers
- Pi
- Pierpont primes
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Printer
- Pisano period
- Plasma effect
- Play recorded sounds
- Playfair cipher
- Pointers and references
- Poker hand analyser
- Polymorphic copy
- Polymorphism
- Polynomial long division
- Polynomial regression
- Population count
- Power set
- Pragmatic directives
- Primality by Wilson's theorem
- Prime conspiracy
- Prime decomposition
- Prime triangle
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Probabilistic choice
- Problem of Apollonius
- Program name
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/Middle-square method
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Splitmix64
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
- Pythagorean quadruples
R
- RCRPG
- RIPEMD-160
- RSA code
- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random number generator (device)
- Random number generator (included)
- Random numbers
- Random sentence from book
- Ranking methods
- Rare numbers
- Ray-casting algorithm
- Read a configuration file
- Recaman's sequence
- Record sound
- Reduced row echelon form
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Regular expressions
- Remove lines from a file
- Rendezvous
- Repunit primes
- Resistor mesh
- Respond to an unknown method call
- Retrieve and search chat history
- Rhonda numbers
- Rock-paper-scissors
- Roots of a function
- Roots of a quadratic function
- Roots of unity
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Rank languages by popularity
- Rot-13
- Runtime evaluation
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- S-expressions
- SHA-1
- SHA-256
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Same fringe
- Scope/Function names and labels
- Scope modifiers
- Search in paragraph's text
- Secure temporary file
- Selectively replace multiple instances of a character within a string
- Self-describing numbers
- Self numbers
- Semordnilap
- Send an unknown method call
- Send email
- Sequence: nth number with exactly n divisors
- Sequence of non-squares
- Sequence of primorial primes
- Set consolidation
- Set of real numbers
- Set puzzle
- Set right-adjacent bits
- Seven-sided dice from five-sided dice
- Sexy primes
- Shell one-liner
- Shortest common supersequence
- Show the epoch
- Sierpinski arrowhead curve
- Sierpinski square curve
- Simple database
- Simple windowed application
- Simulate input/Keyboard
- Simulate input/Mouse
- Singleton
- Sleeping Beauty problem
- Smallest number k such that k+2^m is composite for all m less than k
- Snake
- Sockets
- Sokoban
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort an outline at every level
- Sort stability
- Sort three variables
- Sorting algorithms/Bead sort
- Sorting algorithms/Heapsort
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Sleep sort
- Sorting algorithms/Strand sort
- Soundex
- Sparkline in unicode
- Special characters
- Special variables
- Speech synthesis
- Spelling of ordinal numbers
- Square-free integers
- Square form factorization
- Stable marriage problem
- Stack traces
- Stair-climbing puzzle
- Start from a main routine
- State name puzzle
- Statistics/Normal distribution
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Straddling checkerboard
- Strassen's algorithm
- Stream merge
- Strip block comments
- Strong and weak primes
- Subleq
- Substitution cipher
- Subtractive generator
- Successive prime differences
- Sudoku
- Suffixation of decimal numbers
- Sum and product puzzle
- Sum to 100
- Summarize and say sequence
- Summarize primes
- Super-d numbers
- Superpermutation minimisation
- Sutherland-Hodgman polygon clipping
- Sylvester's sequence
- Synchronous concurrency
- System time
T
- Table creation/Postal addresses
- Take notes on the command line
- Tarjan
- Taxicab numbers
- Teacup rim text
- Terminal control/Coloured text
- Terminal control/Unicode output
- Test a function
- Test integerness
- Text processing/1
- Text processing/2
- Text processing/Max licenses in use
- Textonyms
- The ISAAC Cipher
- The Name Game
- The sieve of Sundaram
- Thiele's interpolation formula
- Tic-tac-toe
- Tonelli-Shanks algorithm
- Topic variable
- Topological sort
- Topswops
- Total circles area
- Totient function
- Towers of Hanoi
- Trabb Pardo–Knuth algorithm
- Tree datastructures
- Tree from nesting levels
- Trigonometric functions
- Truncatable primes
- Truth table
- Twelve statements
- Twin primes
- Two bullet roulette
U
- URL parser
- Ukkonen’s suffix tree construction
- Ulam spiral (for primes)
- Ultra useful primes
- Unbias a random generator
- Undefined values
- Unicode strings
- Unicode variable names
- Universal Turing machine
- Unix/ls
- Unprimeable numbers
- Untouchable numbers
- Update a configuration file
- Use another language to call a function
- User input/Graphical
V
- Validate International Securities Identification Number
- Vampire number
- Variable-length quantity
- Variable declaration reset
- Variable size/Get
- Variable size/Set
- Variables
- Variadic function
- Verhoeff algorithm
- Verify distribution uniformity/Chi-squared test
- Verify distribution uniformity/Naive
- Vigenère cipher/Cryptanalysis
- Visualize a tree
- Vogel's approximation method
- Voronoi diagram
W
- Walk a directory/Recursively
- War card game
- Web scraping
- Weird numbers
- Wieferich primes
- Wilson primes of order n
- Window creation
- Window creation/X11
- Window management
- Wireworld
- Word frequency
- Word ladder
- Word search
- Word wheel
- Wordiff
- World Cup group stage
- Write float arrays to a text file
- Write to Windows event log
Draft tasks without implementation[edit]
These tasks are drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Action! (after all, one of the key requirements for a task being non-draft is multiple implementations, preferably in widely different languages) but be aware that this may be difficult because of lack of definition of the task itself.
A
- A* search algorithm
- ADFGVX cipher
- Addition-chain exponentiation
- Addition chains
- Air mass
- Alternade words
- Anadromes
- Append numbers at same position in strings
- Arithmetic coding/As a generalized change of radix
- Aspect oriented programming
- Assertions in design by contract
- Audio alarm
- Audio overlap loop
- Autogram checker
B
C
- CLI-based maze-game
- Camel case and snake case
- Card shuffles
- Change e letters to i in words
- Changeable words
- Chebyshev coefficients
- Checksumcolor
- Chemical calculator
- Chess player
- Cipolla's algorithm
- Code segment unload
- Collect and sort square numbers in ascending order from three lists
- Combinations with repetitions/Square digit chain
- Compiler/Preprocessor
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Conjugate a Latin verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n)
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Count the coins/0-1
- Create an object/Native demonstration
- Create your own text control codes
- Cross compilation
- Cycle detection
- Cycles of a permutation
D
- Data Encryption Standard
- Dating agency
- Day of the week of Christmas and New Year
- Decimal floating point number to binary
- Decision tables
- Digit fifth powers
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct palindromes within decimal numbers
- Distribution of 0 digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
- Draw pixel 2
E
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find adjacent primes which differ by a square integer
- Find first and last set bit of a long integer
- Find prime numbers of the form n*n*n+2
- Find square difference
- Find squares n where n+1 is prime
- Finite state machine
- First 9 prime Fibonacci number
- Four sides of square
- Free polyominoes enumeration
G
I
L
- Largest difference between adjacent primes
- Largest five adjacent number
- Largest palindrome product
- Largest prime factor
- Largest product in a grid
- Last list item
- Launch rocket with countdown and acceleration in stdout
- Line circle intersection
- Linux CPU utilization
- Logistic curve fitting in epidemiology
- Long stairs
M
- Make a backup file
- Markov chain text generator
- Matrix with two diagonals
- Mersenne primes
- Minimum number of cells after, before, above and below NxN squares
- Minimum numbers of three lists
- Minimum primes
- Modulinos
- Montgomery reduction
- Morpion solitaire
- Mosaic matrix
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiline shebang
- Multiton
N
O
P
- Pandigital prime
- Parse EBNF
- Parse command-line arguments
- Particle swarm optimization
- Penrose tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Permuted multiples
- Polynomial derivative
- Polynomial synthetic division
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Prime numbers which contain 123
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Proof
- Pseudorandom number generator image
R
- Railway circuit
- Ramanujan primes
- Ramsey's theorem
- Raster bars
- Readline interface
- Recursive descent parser generator
- Red black tree sort
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance calculator
- Resistance network calculator
- Robots
- Rodrigues’ rotation formula
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Run examples
- Rosetta Code/Tasks without examples
- Round-robin tournament schedule
- Run as a daemon or service
S
- Safe and Sophie Germain primes
- Safe mode
- Sanitize user input
- Segmentation fault protection
- Selective file copy
- Self-hosting compiler
- Separate the house number from the street name
- Show the (decimal) value of a number of 1s appended with a 3, then squared
- Simulated annealing
- Sine wave
- Smallest enclosing circle problem
- Smallest multiple
- Smallest numbers
- Smallest power of 6 whose decimal expansion contains n
- Snake and Ladder
- Solve a Rubik's Cube
- Solve equations with substitution method
- Solve hanging lantern problem
- Solve triangle solitare puzzle
- Solving coin problems
- Sort primes from list to a list
- Sorting algorithms/Tree sort on a linked list
- Special factorials
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Starting a web browser
- Steady squares
- Suffix tree
- Sum data type
- Sum of square and cube digits of an integer are primes
- Sum of two adjacent numbers are primes
- Summation of primes
T
- Table creation
- Tamagotchi emulator
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text completion
- Text to HTML
- Three word location
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transliterate English text using the Greek alphabet
- Transportation problem
- Tropical algebra overloading
- Type detection
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Action!, but somebody, somewhere, decided that the example implementation was faulty or in some other way requiring attention. If you're familiar with the task and language, please consider reviewing/correcting the example and removing the notice.
No pages found.
Other pages[edit]
These are other pages related to Action! which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
No pages found.
Not Considered[edit]
These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Action! was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
No pages found.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.