Reports:Tasks not implemented in AutoHotkey
From Rosetta Code
Awareness
If AutoHotkey is a language you like, or are interested in, please inform your fellow members of the AutoHotkey community; this page can't be emptied without your and their participation.
If AutoHotkey is a language you like, or are interested in, please inform your fellow members of the AutoHotkey community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in AutoHotkey. Please implement some if you can. If any tasks are not possible or too complex in AutoHotkey, they should not be on this list. To mark a task as such, add {{omit from|AutoHotkey}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
- ASCII art diagram converter
- AVL tree
- Abbreviations, automatic
- Abbreviations, simple
- Abelian sandpile model
- Abelian sandpile model/Identity
- Accumulator factory
- Active Directory/Search for a user
- Active object
- Additive primes
- Aliquot sequence classifications
- Almkvist-Giullera formula for pi
- Anti-primes
- Append a record to the end of a text file
- Apply a digital filter (direct form II transposed)
- Approximate equality
- Arena storage pool
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Rational
- Attractive numbers
- Average loop length
B
- Barnsley fern
- Base64 decode data
- Bernoulli numbers
- Binary strings
- Bioinformatics/Sequence mutation
- Bioinformatics/base count
- Biorhythms
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Brazilian numbers
- Break OO privacy
- Burrows–Wheeler transform
C
- Calculating the value of e
- Calkin-Wilf sequence
- Canny edge detector
- Canonicalize CIDR
- Cantor set
- Carmichael 3 strong pseudoprimes
- Cartesian product of two or more lists
- Casting out nines
- Catamorphism
- Catmull–Clark subdivision surface
- Chaos game
- Check Machin-like formulas
- Check input device is a terminal
- Check output device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Chinese remainder theorem
- Chowla numbers
- Church numerals
- Circular primes
- Cistercian numerals
- Closures/Value capture
- Color quantization
- Color wheel
- Colour pinstripe/Printer
- Combinations and permutations
- Commatizing numbers
- Compare a list of strings
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Concurrent computing
- Conjugate transpose
- Consecutive primes with ascending or descending differences
- Constrained genericity
- Continued fraction/Arithmetic/Construct from rational number
- Convex hull
- Copy stdin to stdout
- Cramer's rule
- Create a file on magnetic tape
- Cuban primes
- Currency
- Currying
- Cut a rectangle
- Cyclotomic polynomial
D
E
- EKG sequence convergence
- Eertree
- Egyptian fractions
- Elementary cellular automaton/Infinite length
- Elementary cellular automaton/Random Number Generator
- Elliptic Curve Digital Signature Algorithm
- Elliptic curve arithmetic
- Esthetic numbers
- Euler's constant 0.5772...
- Euler's identity
- Euler's sum of powers conjecture
- Euler method
- Exponentiation order
- Exponentiation with infix operators in (or operating on) the base
- Extend your language
- Extreme floating point values
F
- FTP
- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Fairshare between two and more
- Farey sequence
- Fast Fourier transform
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- File extension is in extensions list
- File size distribution
- Find Chess960 starting position identifier
- Find duplicate files
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- 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
- Floyd-Warshall algorithm
- Formal power series
- Fortunate numbers
- Four is the number of letters in the ...
- Fraction reduction
- French Republican calendar
- Function frequency
- Functional coverage tree
G
H
I
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Image convolution
- Image noise
- Imaginary base numbers
- Increasing gaps between consecutive Niven numbers
- Index finite lists of positive integers
- Infinity
- Inheritance/Multiple
- Isqrt (integer square root) of X
- Iterated digits squaring
J
K
L
- LZW compression
- Lah numbers
- 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
- Law of cosines - triples
- Left factorials
- Legendre prime counting function
- Levenshtein distance/Alignment
- List rooted trees
- Literals/Floating point
- Long literals, with continuations
- Long primes
- Loops/Wrong ranges
- Lucas-Lehmer test
- Lucky and even lucky numbers
- Lychrel numbers
M
- Magic squares of doubly even order
- Magic squares of singly even order
- Magnanimous numbers
- Main step of GOST 28147-89
- Make directory path
- Man or boy test
- Matrix-exponentiation operator
- Matrix chain multiplication
- Matrix digital rain
- Mayan calendar
- Mayan numerals
- McNuggets problem
- Median filter
- Memory layout of a data structure
- Mertens function
- Metallic ratios
- Metaprogramming
- Metered concurrency
- Mian-Chowla sequence
- Minimal steps down to 1
- Minimum positive multiple in base 10 using only 0 and 1
- Minkowski question-mark function
- Modified random distribution
- Modular arithmetic
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Motzkin numbers
- Multi-dimensional array
- Multiple regression
- Multiplicative order
- Munching squares
- Mutex
- Möbius function
N
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
- Parametric polymorphism
- Parametrized SQL statement
- Partial function application
- Partition an integer x into n primes
- Partition function P
- Password generator
- Pathological floating point problems
- Pattern matching
- Peaceful chess queen armies
- Pell's equation
- Pentomino tiling
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Peripheral drift illusion
- Perlin noise
- Permutation test
- Permutations/Rank of a permutation
- Pierpont primes
- Pinstripe/Printer
- Pisano period
- Plasma effect
- Playfair cipher
- Polymorphic copy
- Polynomial long division
- Pragmatic directives
- Primality by Wilson's theorem
- Prime conspiracy
- Primorial numbers
- 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
- Pythagorean quadruples
- Pythagorean triples
R
- RCRPG
- RIPEMD-160
- RPG attributes generator
- RSA code
- Ramanujan's constant
- Ramanujan primes/twins
- Ramer-Douglas-Peucker line simplification
- Random Latin squares
- Random number generator (device)
- Random sentence from book
- Rare numbers
- Recaman's sequence
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Resistor mesh
- Retrieve and search chat history
- Rosetta Code/Rank languages by number of users
- Runge-Kutta method
S
- SHA-256 Merkle tree
- SQL-based authentication
- Safe primes and unsafe primes
- Same fringe
- Scope/Function names and labels
- Search a list of records
- Secure temporary file
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence of primes by trial division
- Sequence of primorial primes
- Set of real numbers
- Set right-adjacent bits
- Sexy primes
- Shortest common supersequence
- Sierpinski square curve
- Simple database
- Sleeping Beauty problem
- Smarandache prime-digital sequence
- Smith numbers
- Sokoban
- Solve a Holy Knight's tour
- Spinning rod animation/Text
- Square-free integers
- Square form factorization
- State name puzzle
- Statistics/Basic
- Statistics/Normal distribution
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Strassen's algorithm
- Stream merge
- Strong and weak primes
- Subleq
- Substitution cipher
- Successive prime differences
- Suffixation of decimal numbers
- Sum and product puzzle
- Summarize primes
- Super-d numbers
- Superpermutation minimisation
- Sutherland-Hodgman polygon clipping
- Sylvester's sequence
- Synchronous concurrency
T
- Table creation/Postal addresses
- Tarjan
- Tau function
- Tau number
- Taxicab numbers
- Terminal control/Display an extended character
- Terminal control/Preserve screen
- Test integerness
- Textonyms
- The ISAAC Cipher
- The sieve of Sundaram
- Thiele's interpolation formula
- Tonelli-Shanks algorithm
- Topic variable
- Topological sort
- Total circles area
- Totient function
- Trabb Pardo–Knuth algorithm
- Tree datastructures
- Tree from nesting levels
- Truth table
- Twin primes
U
V
W
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 AutoHotkey (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
B
C
- CLI-based maze-game
- Camel case and snake case
- Card shuffles
- Chebyshev coefficients
- Checksumcolor
- Chess player
- Cipolla's algorithm
- Code Golf: Code Golf
- Code segment unload
- Collect and sort square numbers in ascending order from three lists
- Combinations with repetitions/Square digit chain
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concatenate two primes is also prime
- 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)
- Coprime triplets
- Coprimes
- Count the coins/0-1
- Cousin primes
- Create an object/Native demonstration
- Create your own text control codes
- Cubic Special Primes
- Cullen and Woodall numbers
- Cycle detection
- Cyclops numbers
D
- Data Encryption Standard
- Dating agency
- Day of the week of Christmas and New Year
- Decimal floating point number to binary
- Digit fifth powers
- Diophantine linear system solving
- Discrete Fourier transform
- Distinct Palindromes within decimal numbers
- Distinct power numbers
- Distribution of 0 Digits in factorial series
- Divide a rectangle into a number of unequal triangles
- Dominoes
- Doomsday rule
- Doubly-linked list/Element removal
- Draw pixel 2
E
F
- Fibonacci heap
- Fibonacci matrix-exponentiation
- Find URI in text
- Find adjacent primes which differ by a square integer
- Find prime n such that reversed n is also prime
- Find prime numbers of the form n*n*n+2
- Finite state machine
- First 9 Prime Fibonacci Number
- Free polyominoes enumeration
- Frobenius numbers
G
I
L
M
N
- N-body problem
- NYSIIS
- Names to numbers
- Native shebang
- Neighbour primes
- Next special primes
- Nice primes
- Number triplets game
- Numbers divisible by their individual digits, but not by the product of their digits.
- Numbers in base-16 representation that cannot be written with decimal digits
- Numbers in base 10 that are palindromic in bases 2, 4, and 16
- Numbers which are not the sum of distinct squares
- Numbers which binary and ternary digit sum are prime
- Numbers whose count of divisors is prime
- Numbers with prime digits whose sum is 13
- Numbers with same digit set in base 10 and base 16
- Numeric separator syntax
- Numerical integration/Adaptive Simpson's method
O
P
- Palindromic primes
- Palindromic primes in base 16
- Pandigital prime
- Parse EBNF
- Particle fountain
- Particle swarm optimization
- Penrose tiling
- Perceptron
- Permutations with some identical elements
- Permuted multiples
- Piprimes
- Polynomial derivative
- Polynomial synthetic division
- Positive decimal integers with the digit 1 occurring exactly twice
- Powerful numbers
- Practical numbers
- Price list behind API
- Prime numbers p which sum of prime numbers less or equal to p is prime
- Prime numbers which contain 123
- Prime triplets
- Prime words
- Primes which contain only one odd digit
- Primes whose first and last number is 3
- Primes whose sum of digits is 25
- Primes with digits in nondecreasing order
- Print debugging statement
- Print itself
- Process SMIL directives in XML data
- Product of divisors
- Proof
- Pseudorandom number generator image
R
- Railway circuit
- Ramanujan primes
- Ramsey's theorem
- Raster bars
- Readline interface
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance calculator
- Resistance network calculator
- Reverse the gender of a string
- Reverse the order of lines in a text file while preserving the contents of each line
- Robots
- 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
- Simple turtle graphics
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Smallest enclosing circle problem
- Smallest number k such that k+2^m is composite for all m less than k
- 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 triangle solitare puzzle
- Solving coin problems
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Special Divisors
- Special factorials
- Special neighbor primes
- Special pythagorean triplet
- Spoof game
- Square root by hand
- Starting a web browser
- Steady Squares
- Strange numbers
- Strange plus numbers
- Strange unique prime triplets
- Subset sum problem
- Substring primes
- Suffix tree
- Sum data type
- Sum of divisors
- Sum of primes in odd positions is prime
- Sum of square and cube digits of an integer are primes
- Sum of two adjacent numbers are primes
- Summation of primes
- Sunflower fractal
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
- Time-based one-time password algorithm
- Topological sort/Extracted top item
- Transportation problem
- Triplet of three numbers
- Tropical algebra overloading
- Two identical strings
- Type detection
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in AutoHotkey, 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.
Other pages[edit]
These are other pages related to AutoHotkey 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 AutoHotkey was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
