Reports:Tasks not implemented in OCaml
From Rosetta Code
Awareness
If OCaml is a language you like, or are interested in, please inform your fellow members of the OCaml community; this page can't be emptied without your and their participation.
If OCaml is a language you like, or are interested in, please inform your fellow members of the OCaml community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in OCaml. Please implement some if you can. If any tasks are not possible or too complex in OCaml, they should not be on this list. To mark a task as such, add {{omit from|OCaml}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
- AVL tree
- Abbreviations, automatic
- Abelian sandpile model
- Abundant, deficient and perfect number classifications
- Abundant odd numbers
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Aliquot sequence classifications
- Almost prime
- Amicable pairs
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Anti-primes
- Append a record to the end of a text file
- Apply a digital filter (direct form II transposed)
- Approximate Equality
- Archimedean spiral
- Arena storage pool
- Atomic updates
- Attractive numbers
- Average loop length
B
C
- CSV data manipulation
- CUSIP
- Calculating the value of e
- Calendar - for "REAL" programmers
- Canny edge detector
- Cantor set
- Carmichael 3 strong pseudoprimes
- Casting out nines
- Chaocipher
- Chaos game
- Chat server
- Checkpoint synchronization
- Chinese zodiac
- Chowla numbers
- Church Numerals
- Circles of given radius through two points
- Color of a screen pixel
- Colour pinstripe/Printer
- Combinations and permutations
- Commatizing numbers
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Conjugate transpose
- Continued fraction/Arithmetic/Construct from rational number
- Convert decimal number to rational
- Convex hull
- Cramer's rule
- Create a file on magnetic tape
- Create an object at a given address
- Cuban primes
- Cut a rectangle
D
- Date manipulation
- De Bruijn sequences
- Death Star
- Deconvolution/1D
- Deconvolution/2D+
- Delegates
- Deming's Funnel
- Department Numbers
- Determinant and permanent
- Digital root
- Digital root/Multiplicative digital root
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Discordian date
- Doubly-linked list/Definition
- Doubly-linked list/Traversal
- Draw a cuboid
- Draw a rotating cube
- Draw a sphere
- Dutch national flag problem
- Dynamic variable names
E
F
- FTP
- Factorial base numbers indexing permutations of a collection
- Factors of a Mersenne number
- Farey sequence
- Fibonacci n-step number sequences
- Fibonacci word
- Fibonacci word/fractal
- Find largest left truncatable prime in a given base
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of two lines
- First class environments
- First perfect square in base N with N unique digits
- Fixed length records
- Floyd-Warshall algorithm
- Formal power series
- Four is magic
- Four is the number of letters in the ...
- Function frequency
- Functional coverage tree
- Fusc sequence
G
- GUI/Maximum window dimensions
- GUI component interaction
- GUI enabling/disabling of controls
- Galton box animation
- General FizzBuzz
- Generate Chess960 starting position
- Generate random chess position
- Generator/Exponential
- Get system command output
- Globally replace text in several files
- Guess the number/With feedback (player)
H
- HTTPS
- HTTPS/Authenticated
- HTTPS/Client-authenticated
- Harshad or Niven series
- Heronian triangles
- Hickerson series of almost integers
- Hilbert curve
- Hofstadter-Conway $10,000 sequence
- Hofstadter Figure-Figure sequences
- Hofstadter Q sequence
- Holidays related to Easter
- Honeycombs
- Hough transform
- Humble numbers
- Hunt The Wumpus
I
- I before E except after C
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Imaginary base numbers
- Index finite lists of positive integers
- Integer overflow
- Intersecting Number Wheels
- Inverted syntax
- Iterated digits squaring
K
- K-d tree
- K-means++ clustering
- Kaprekar numbers
- Kernighans large earthquake problem
- Keyboard input/Flush the keyboard buffer
- Keyboard input/Keypress check
- Keyboard input/Obtain a Y or N response
- Keyboard macros
- Knapsack problem/Bounded
- Knight's tour
- Knuth's power tree
- Koch curve
- Kolakoski sequence
- Kosaraju
- Kronecker product
- Kronecker product based fractals
L
- LU decomposition
- Largest number divisible by its digits
- Last letter-first letter
- Latin Squares in reduced form
- Law of cosines - triples
- Left factorials
- Leonardo numbers
- Linear congruential generator
- Long multiplication
- Long primes
- Longest Common Substring
- Loops/Increment loop index within loop body
- Loops/Wrong ranges
- Loops/with multiple ranges
- Lucas-Lehmer test
- Lucky and even lucky numbers
- Ludic numbers
- Lychrel numbers
M
- MAC Vendor Lookup
- MD4
- MD5/Implementation
- Machine code
- Mad Libs
- Magic squares of doubly even order
- Magic squares of odd order
- Magic squares of singly even order
- Main step of GOST 28147-89
- Make directory path
- Mastermind
- Matrix Digital Rain
- Matrix chain multiplication
- Maximum triangle path sum
- Mayan numerals
- Maze solving
- McNuggets Problem
- Memory allocation
- Metaprogramming
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Miller–Rabin primality test
- Mind boggling card trick
- Move-to-front algorithm
- Multi-dimensional array
- Multifactorial
- Multiple regression
- Multiplicative order
- Multisplit
- Munchausen numbers
N
P
- P-value correction
- Paraffins
- Parallel Brute Force
- Parallel calculations
- Parametrized SQL statement
- Parse an IP Address
- Parsing/RPN to infix conversion
- Partition an integer X into N primes
- Pascal's triangle/Puzzle
- Pascal matrix generation
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penney's game
- Pentagram
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Perfect totient numbers
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pernicious numbers
- Phrase reversals
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Poker hand analyser
- Polynomial regression
- Polyspiral
- Population count
- Pragmatic directives
- Prime conspiracy
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Proper divisors
- Pythagoras tree
- Pythagorean quadruples
R
- RCRPG
- RIPEMD-160
- RPG Attributes Generator
- RSA code
- Ramer-Douglas-Peucker line simplification
- Range consolidation
- Ranking methods
- Rare numbers
- Rate counter
- Recaman's sequence
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Rendezvous
- Rep-string
- Resistor mesh
- Retrieve and search chat history
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Rank languages by popularity
- Runtime evaluation
- Runtime evaluation/In an environment
S
- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Scope modifiers
- Self-describing numbers
- Self-referential sequence
- Semiprime
- Send an unknown method call
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence: smallest number with exactly n divisors
- Sequence of primes by trial division
- Sequence of primorial primes
- Set of real numbers
- Set puzzle
- Sexy primes
- Shoelace formula for polygonal area
- Shortest common supersequence
- Show Ascii table
- Sierpinski pentagon
- Simple database
- Simulate input/Mouse
- Smarandache prime-digital sequence
- Smith numbers
- Solve a Hidato puzzle
- Solve a Holy Knight's tour
- Solve a Hopido puzzle
- Solve a Numbrix puzzle
- Solve the no connection puzzle
- Sort a list of object identifiers
- Sort numbers lexicographically
- Sorting algorithms/Radix sort
- Sorting algorithms/Sleep sort
- Sparkline in unicode
- Speech synthesis
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Split a character string based on change of character
- Square-free integers
- Start from a main routine
- State name puzzle
- Statistics/Basic
- Statistics/Normal distribution
- Stern-Brocot sequence
- Straddling checkerboard
- Stream Merge
- String comparison
- Strip block comments
- Strong and weak primes
- Subleq
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sum to 100
- Sunflower fractal
- Superellipse
- Superpermutation minimisation
T
- Table creation/Postal addresses
- Tarjan
- Taxicab numbers
- Terminal control/Cursor movement
- Terminal control/Display an extended character
- Terminal control/Hiding the cursor
- Terminal control/Positional read
- Terminal control/Preserve screen
- Terminal control/Ringing the terminal bell
- Terminal control/Unicode output
- Test integerness
- Textonyms
- The ISAAC Cipher
- The Name Game
- The Twelve Days of Christmas
- Tic-tac-toe
- Tonelli-Shanks algorithm
- Topswops
- Total circles area
- Totient function
- Truncatable primes
- Truth table
- Twelve statements
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 OCaml (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.
2
A
B
C
- Card shuffles
- Chebyshev coefficients
- Chemical Calculator
- Chernick's Carmichael numbers
- Cheryl's Birthday
- Chess player
- Chess player/Move generation
- Chess player/Program options and user interface
- Chess player/Search and evaluation
- Cipolla's algorithm
- Code segment unload
- Color wheel
- Combinations with repetitions/Square Digit Chain
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)
- Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)
- Create an object/Native demonstration
- Curve that touches three points
- Cycle detection
D
- Damm algorithm
- Data Encryption Standard
- Days between dates
- Decision tables
- Determine if a string has all the same characters
- Determine if a string has all unique characters
- Determine if two triangles overlap
- Dice game probabilities
- Display a linear combination
- Display an outline as a nested table
- Diversity prediction theorem
- Draw pixel 2
E
F
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- Fibonacci heap
- File extension is in extensions list
- File size distribution
- Find URI in text
- Find duplicate files
- Find first and last set bit of a long integer
- Find the intersection of a line with a plane
- Finite state machine
- Fraction reduction
- Free polyominoes enumeration
- French Republican calendar
G
H
I
L
M
- Magic 8-Ball
- Make a backup file
- Markov chain text generator
- Mayan calendar
- Mersenne primes
- Metallic ratios
- Modular arithmetic
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Musical scale
O
P
- Palindromic gapful numbers
- Parse EBNF
- Parse command-line arguments
- Particle Swarm Optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Permutations with repetitions
- Permutations with some identical elements
- Pierpont primes
- Playfair cipher
- Polynomial synthetic division
- Print debugging statement
- Process SMIL directives in XML data
R
- Railway circuit
- Ramanujan's constant
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Resistance Calculator
- Resistance Network Calculator
- Reverse the gender of a string
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Run examples
- Rosetta Code/Tasks sorted by average lines of code
- Rosetta Code/Tasks without examples
- Run as a daemon or service
S
- Safe mode
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Simulated annealing
- Singly-linked list/Element removal
- Snake And Ladder
- Solve a Rubik's Cube
- Solving coin problems
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cycle sort
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Starting a web browser
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Substitution Cipher
- Suffix tree
- Super-d numbers
T
- Table creation
- Tamagotchi emulator
- Teacup rim text
- Terminal control/Restricted width positional input/No wrapping
- Terminal control/Restricted width positional input/With wrapping
- Tetris
- Text between
- Text to HTML
- Time-based One-time Password Algorithm
- Topological sort/Extracted top item
- Transportation problem
- Tree datastructures
- Type detection
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in OCaml, 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 OCaml 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 OCaml was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.
A
R
S
T
V
End of List[edit]
Again, feel free to try your hand at any of the tasks listed on this page.
