# Reports:Tasks not implemented in Clojure

**Awareness**

If

**Clojure**is a language you like, or are interested in, please inform your fellow members of the Clojure community; this page can't be emptied without your and their participation.

## Contents

## Not implemented[edit]

These are currently not implemented in Clojure. Please implement some if you can. If any tasks are not possible or too complex in Clojure, they should not be on this list. To mark a task as such, add **{{omit from|Clojure}}**, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.

### A

### B

- Balanced ternary
- Barnsley fern
- Binary strings
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/PPM conversion through a pipe
- Bitmap/Read a PPM file
- Bitmap/Read an image through a pipe
- Bitmap/Write a PPM file
- Bitwise IO
- Brace expansion
- Brownian tree
- Bulls and cows/Player

### C

- CUSIP
- Calendar
- Call a function
- Call a function in a shared library
- Canny edge detector
- Cartesian product of two or more lists
- Casting out nines
- Catalan numbers/Pascal's triangle
- Catmull–Clark subdivision surface
- Chaos game
- Chat server
- Circles of given radius through two points
- Color quantization
- Colour bars/Display
- Colour pinstripe/Display
- 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
- Convert seconds to compound duration
- Cramer's rule
- Cut a rectangle

### D

### E

### F

- FTP
- Farey sequence
- Fast Fourier transform
- 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
- Flow-control structures
- Floyd-Warshall algorithm
- Fractran
- Function frequency

### G

### H

### K

### L

### M

### N

### O

### P

- Paraffins
- Parallel Brute Force
- Parse an IP Address
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partition an integer X into N primes
- Pascal matrix generation
- Pathological floating point problems
- Pentagram
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Permutation test
- Permutations/Derangements
- Permutations/Rank of a permutation
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Poker hand analyser
- Polymorphic copy
- Polynomial regression
- Polyspiral
- Population count
- Pragmatic directives
- Primes - allocate descendants to their ancestors
- Problem of Apollonius
- Pythagoras tree
- Pythagorean quadruples

### R

- RSA code
- Ramer-Douglas-Peucker line simplification
- Random number generator (device)
- Range extraction
- Ranking methods
- Rate counter
- Ray-casting algorithm
- Record sound
- Reduced row echelon form
- Reflection/List properties
- Rendezvous
- Rep-string
- Resistor mesh
- Respond to an unknown method call
- Retrieve and search chat history
- Roots of unity
- Rosetta Code/Find bare lang tags
- Rosetta Code/Fix code tags
- Rosetta Code/Rank languages by popularity
- Runge-Kutta method
- Runtime evaluation

### S

- S-Expressions
- SOAP
- SQL-based authentication
- Safe addition
- Sailors, coconuts and a monkey problem
- Scope/Function names and labels
- Scope modifiers
- Search a list of records
- Self-describing numbers
- Send an unknown method call
- Set consolidation
- Set puzzle
- Shoelace formula for polygonal area
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple database
- Simulate input/Mouse
- Singleton
- Smith numbers
- 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 a list of object identifiers
- Sort three variables
- Sorting algorithms/Cocktail sort
- Sorting algorithms/Comb sort
- Sorting algorithms/Counting sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Shell sort
- Sorting algorithms/Stooge sort
- Stable marriage problem
- State name puzzle
- Statistics/Basic
- Statistics/Normal distribution
- Stem-and-leaf plot
- Straddling checkerboard
- Stream Merge
- String comparison
- Subleq
- Sum and Product Puzzle
- Sum to 100
- Superellipse
- Sutherland-Hodgman polygon clipping

### T

- Terminal control/Clear the screen
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Ternary logic
- Test integerness
- Text processing/1
- Text processing/2
- The ISAAC Cipher
- The Name Game
- Thiele's interpolation formula
- Thue-Morse
- Tic-tac-toe
- Tokenize a string with escaping
- Topswops
- Total circles area
- Trabb Pardo–Knuth algorithm
- Truncate a file
- Truth table
- Twelve statements

### U

### V

### W

### Draft tasks without implementation[edit]

These tasks as drafts, meaning they largely need more work to turn them into full tasks. Perhaps you can help by trying to implement them in Clojure (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
- ASCII art diagram converter
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Addition-chain exponentiation
- Addition chains
- Arithmetic coding/As a generalized change of radix
- Aspect Oriented Programming
- Assertions in design by contract
- AudioAlarm
- Audio Overlap Loop
- Audio frequency generator

### B

### C

- Calculating the value of e
- Cantor set
- Card shuffles
- Chaocipher
- Chebyshev coefficients
- Check output device is a terminal
- 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)
- Convex hull
- Create an object/Native demonstration
- Cycle detection

### D

### E

### F

- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- 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
- Fivenum
- Four is magic
- Four is the number of letters in the ...
- Free polyominoes enumeration
- French Republican calendar
- Functional coverage tree

### G

### I

- I.Q. Puzzle
- IPC via named pipe
- IRC gateway
- Idiomatically determine all the characters that can be used for symbols
- Idiomatically determine all the lowercase and uppercase letters
- Imaginary base numbers
- Implicit type conversion
- Index finite lists of positive integers
- Input/Output for Lines of Text
- Input/Output for Pairs of Numbers
- Integer roots

### L

### M

### O

### P

### R

- Railway circuit
- Ramsey's theorem
- Read a file character by character/UTF8
- Readline interface
- Recursive descent parser generator
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- 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

- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Shortest common supersequence
- Simulated annealing
- Singly-linked list/Element removal
- Snake
- 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
- Spelling of ordinal numbers
- Spoof game
- Starting a web browser
- Subset sum problem
- Substitution Cipher
- Suffix tree
- Superpermutation minimisation

### T

- Table creation
- Tamagotchi emulator
- Tarjan
- 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
- Tonelli-Shanks algorithm
- Topological sort/Extracted top item
- Transportation problem
- Two Sum
- Type detection

### U

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Clojure, 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 Clojure 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 Clojure was inappropriate for these tasks, or implementations of them would be unenlightening. Feel free to try your hand at them anyway.

### A

### C

## End of List[edit]

Again, feel free to try your hand at any of the tasks listed on this page.