# Reports:Tasks not implemented in Tcl

**Awareness**

If

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

## Contents

## Not implemented[edit]

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

### 2

### A

### B

### C

- Canonicalize CIDR
- Cantor set
- Chaocipher
- Chaos game
- Chernick's Carmichael numbers
- Cheryl's Birthday
- Chowla numbers
- Church Numerals
- Circular primes
- Color wheel
- Commatizing numbers
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Copy stdin to stdout
- Cuban primes
- Cyclotomic Polynomial

### D

### F

- Faces from a mesh
- Factorial base numbers indexing permutations of a collection
- Factorions
- Fairshare between two and more
- Faulhaber's formula
- Faulhaber's triangle
- Feigenbaum constant calculation
- Fermat numbers
- File size distribution
- Find the intersection of a line with a plane
- Find the intersection of two lines
- 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
- Four is magic
- Four is the number of letters in the ...
- Fraction reduction
- Functional coverage tree

### I

### L

### M

- Magic 8-Ball
- Magic squares of doubly even order
- Magic squares of singly even order
- Mastermind
- Matrix Digital Rain
- Matrix chain multiplication
- Mayan numerals
- McNuggets Problem
- Mertens function
- Metallic ratios
- Mian-Chowla sequence
- Mind boggling card trick
- Minimal steps down to 1
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Munchausen numbers

### N

### P

- P-value correction
- Palindrome dates
- Palindromic gapful numbers
- Parallel Brute Force
- Partition an integer X into N primes
- Password generator
- Pathological floating point problems
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Perfect totient numbers
- Pierpont primes
- Plasma effect
- Polyspiral
- Primality by Wilson's theorem
- Prime conspiracy
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Pseudo-random numbers/Combined recursive generator MRG32k3a
- Pseudo-random numbers/PCG32
- Pseudo-random numbers/Xorshift star
- Pythagoras tree
- Pythagorean quadruples

### R

### S

- Safe primes and unsafe primes
- Self numbers
- Sequence: nth number with exactly n divisors
- Sequence: smallest number greater than previous term with exactly n divisors
- Sequence of primorial primes
- Sexy primes
- Shoelace formula for polygonal area
- Sierpinski pentagon
- Smarandache prime-digital sequence
- Sort numbers lexicographically
- Sorting Algorithms/Circle Sort
- Sorting algorithms/Cocktail sort with shifting bounds
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Square but not cube
- Strong and weak primes
- Successive prime differences
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sunflower fractal
- Super-d numbers
- Superellipse
- Superpermutation minimisation

### T

### 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 Tcl (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

### E

### F

### G

### H

### L

### M

### N

### P

### R

- Railway circuit
- Random Latin Squares
- Range modifications
- Raster bars
- Readline interface
- Recursive descent parser generator
- Remove vowels from a string
- Resistance Calculator
- Resistance Network Calculator
- Robots
- Rosetta Code/List authors of task descriptions
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Tasks without examples

### S

- Safe mode
- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Sierpinski arrowhead curve
- Sierpinski curve
- Sierpinski square curve
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Snake
- Snake And Ladder
- Solve a Rubik's Cube
- Solve triangle solitare puzzle
- Solving coin problems
- Sort an outline at every level
- Sorting algorithms/Tree sort on a linked list
- Spoof game
- Square Root by Hand
- Strassen's algorithm
- Suffix tree
- Sum data type

### T

### U

### W

## Requiring Attention[edit]

### Examples[edit]

These tasks have implementations in Tcl, 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.

### A

### D

### M

### P

### Other pages[edit]

These are other pages related to Tcl which require attention; with your knowledge and assistance, we can improve the quality of the site's content.

## Not Considered[edit]

These tasks are not generally counted toward "unimplemented", as somebody, somewhere, decided that Tcl 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.