Reports:Tasks not implemented in Seed7
From Rosetta Code
Awareness
If Seed7 is a language you like, or are interested in, please inform your fellow members of the Seed7 community; this page can't be emptied without your and their participation.
If Seed7 is a language you like, or are interested in, please inform your fellow members of the Seed7 community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in Seed7. Please implement some if you can. If any tasks are not possible or too complex in Seed7, they should not be on this list. To mark a task as such, add {{omit from|Seed7}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
A
- AVL tree
- Abbreviations, automatic
- Abbreviations, easy
- Abbreviations, simple
- Abelian sandpile model
- Abundant odd numbers
- Accumulator factory
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Add a variable to a class instance at runtime
- Address of a variable
- Aliquot sequence classifications
- Amicable pairs
- Anagrams/Deranged anagrams
- Angles (geometric), normalization and conversion
- Animate a pendulum
- Animation
- Append a record to the end of a text file
- Apply a callback to an array
- Apply a digital filter (direct form II transposed)
- Approximate Equality
- Arena storage pool
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic evaluation
- Assertions
- Atomic updates
- Attractive numbers
- Averages/Mean time of day
- Averages/Simple moving average
B
- Balanced ternary
- Barnsley fern
- Benford's law
- Bitmap/Bresenham's line algorithm
- Bitmap/Bézier curves/Cubic
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/Midpoint circle algorithm
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Break OO privacy
- Bulls and cows/Player
C
- CUSIP
- Call a foreign-language function
- Call a function in a shared library
- Call an object method
- Canny edge detector
- Cantor set
- Cartesian product of two or more lists
- Catamorphism
- Catmull–Clark subdivision surface
- Chaocipher
- Chaos game
- Chat server
- Checkpoint synchronization
- Chowla numbers
- Church Numerals
- Classes
- Closures/Value capture
- Color of a screen pixel
- Color quantization
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Combinations and permutations
- Combinations with repetitions
- Commatizing numbers
- Compare a list of strings
- Compare sorting algorithms' performance
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Concurrent computing
- Conjugate transpose
- Constrained genericity
- Constrained random points on a circle
- Continued fraction
- Continued fraction/Arithmetic/Construct from rational number
- Convert seconds to compound duration
- Convex hull
- Conway's Game of Life
- Cramer's rule
- Create a file on magnetic tape
- Create an object at a given address
- Cuban primes
- Cumulative standard deviation
- Currency
- Currying
- Cut a rectangle
D
- De Bruijn sequences
- Death Star
- Deconvolution/1D
- Deconvolution/2D+
- Deepcopy
- Define a primitive data type
- Delegates
- Deming's Funnel
- Department Numbers
- Determinant and permanent
- Determine if only one instance is running
- Digital root/Multiplicative digital root
- Dijkstra's algorithm
- Dinesman's multiple-dwelling problem
- Dining philosophers
- Distributed programming
- Documentation
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Doubly-linked list/Traversal
- Draw a cuboid
- Draw a pixel
- Draw a rotating cube
- Draw a sphere
- Dutch national flag problem
- Dynamic variable names
E
F
- Factorial base numbers indexing permutations of a collection
- Farey sequence
- Fast Fourier transform
- Fibonacci word/fractal
- Find largest left truncatable prime in a given base
- Find limit of recursion
- Find palindromic numbers in both binary and ternary bases
- Find the intersection of two lines
- First-class functions
- First-class functions/Use numbers analogously
- First class environments
- First perfect square in base N with N unique digits
- Fixed length records
- Flatten a list
- Flipping bits game
- Flow-control structures
- Floyd-Warshall algorithm
- Forest fire
- Fork
- Formal power series
- Four bit adder
- Four is magic
- Four is the number of letters in the ...
- Function composition
- Function frequency
- Function prototype
- Functional coverage tree
- Fusc sequence
G
H
- HTTPS/Authenticated
- HTTPS/Client-authenticated
- Handle a signal
- Hash join
- Hello world/Newbie
- Here document
- Heronian triangles
- Higher-order functions
- History variables
- Hofstadter-Conway $10,000 sequence
- Hofstadter Figure-Figure sequences
- Honeycombs
- Hough transform
- Huffman coding
- Humble numbers
- Hunt The Wumpus
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
- Index finite lists of positive integers
- Inheritance/Multiple
- Interactive programming
- Intersecting Number Wheels
- Introspection
- Inverted index
- Inverted syntax
- Iterated digits squaring
K
L
- LU decomposition
- Largest int from concatenated ints
- Largest number divisible by its digits
- Latin Squares in reduced form
- Law of cosines - triples
- List comprehensions
- Long primes
- Longest Common Substring
- Longest increasing subsequence
- Longest string challenge
- Loop over multiple arrays simultaneously
- Loops/Break
- Loops/Continue
- Loops/with multiple ranges
- Lucky and even lucky numbers
- Lychrel numbers
M
- MAC Vendor Lookup
- Machine code
- Magic squares of doubly even order
- Magic squares of singly even order
- Main step of GOST 28147-89
- Man or boy test
- Mastermind
- Matrix Digital Rain
- Matrix chain multiplication
- Maximum triangle path sum
- Mayan numerals
- Maze generation
- Maze solving
- McNuggets Problem
- Median filter
- Memory allocation
- Memory layout of a data structure
- Metaprogramming
- Metered concurrency
- Metronome
- Mian-Chowla sequence
- Mind boggling card trick
- Minesweeper game
- Morse code
- Move-to-front algorithm
- Multi-dimensional array
- Multiple regression
- Multisplit
- Munchausen numbers
- Munching squares
N
- N-smooth numbers
- Named parameters
- Naming conventions
- Narcissist
- Narcissistic decimal number
- Natural sorting
- Nested templated data
- Nim Game
- Nonoblock
- Nonogram solver
- Null object
- Numeric error propagation
- Numerical and alphabetical suffixes
- Numerical integration
- Numerical integration/Gauss-Legendre Quadrature
O
P
- P-value correction
- Parallel Brute Force
- Parallel calculations
- Parse an IP Address
- Parsing/RPN calculator algorithm
- Parsing/RPN to infix conversion
- Parsing/Shunting-yard algorithm
- Partial function application
- Partition an integer X into N primes
- Pascal's triangle/Puzzle
- Pascal matrix generation
- Pathological floating point problems
- Pattern matching
- Peaceful chess queen armies
- Peano curve
- Pell's equation
- Penney's game
- Pentagram
- Percentage difference between images
- Percolation/Bond percolation
- Percolation/Mean cluster density
- Percolation/Mean run density
- Percolation/Site percolation
- Perfect shuffle
- Perfect totient numbers
- Permutations/Derangements
- Permutations/Rank of a permutation
- Permutations by swapping
- Pig the dice game
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Playing cards
- Plot coordinate pairs
- Pointers and references
- Polymorphic copy
- Polynomial long division
- Polynomial regression
- Polyspiral
- Pragmatic directives
- Primes - allocate descendants to their ancestors
- Primorial numbers
- Priority queue
- Problem of Apollonius
- Pythagoras tree
- Pythagorean quadruples
R
- RCRPG
- Ramer-Douglas-Peucker line simplification
- Random number generator (device)
- Range consolidation
- Ranking methods
- Rare numbers
- Rate counter
- Ray-casting algorithm
- Recaman's sequence
- Record sound
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Regular expressions
- Rendezvous
- Resistor mesh
- Respond to an unknown method call
- Retrieve and search chat history
- Roots of a function
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Fix code tags
- Runge-Kutta method
- Runtime evaluation
- Runtime evaluation/In an environment
S
- S-Expressions
- 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 a list
- Search a list of records
- Secure temporary file
- Self-referential sequence
- Send an unknown method call
- Send email
- 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 consolidation
- Set of real numbers
- Set puzzle
- Seven-sided dice from five-sided dice
- Sexy primes
- Shell one-liner
- Shoelace formula for polygonal area
- Shortest common supersequence
- Sierpinski pentagon
- Simple database
- Simple windowed application
- Simulate input/Keyboard
- Simulate input/Mouse
- Singleton
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Smarandache prime-digital sequence
- Smith numbers
- Sokoban
- 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 disjoint sublist
- Sort numbers lexicographically
- Sort stability
- Sort using a custom comparator
- Sorting algorithms/Bogosort
- Sorting algorithms/Comb sort
- Sorting algorithms/Counting sort
- Sorting algorithms/Gnome sort
- Sorting algorithms/Pancake sort
- Sorting algorithms/Patience sort
- Sorting algorithms/Permutation sort
- Sorting algorithms/Radix sort
- Sorting algorithms/Sleep sort
- Sorting algorithms/Stooge sort
- Sorting algorithms/Strand sort
- Soundex
- Special variables
- Speech synthesis
- Spelling of ordinal numbers
- Spinning rod animation/Text
- Split a character string based on change of character
- Square-free integers
- Square but not cube
- Stack traces
- State name puzzle
- Statistics/Basic
- Statistics/Normal distribution
- Stern-Brocot sequence
- Straddling checkerboard
- Stream Merge
- Strong and weak primes
- Subleq
- Successive prime differences
- Sudoku
- Suffixation of decimal numbers
- Sum and Product Puzzle
- Sum to 100
- Sunflower fractal
- Superellipse
- Superpermutation minimisation
- Sutherland-Hodgman polygon clipping
- Synchronous concurrency
T
- Table creation/Postal addresses
- Tarjan
- Taxicab numbers
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Hiding the cursor
- Terminal control/Inverse video
- Terminal control/Positional read
- Terminal control/Preserve screen
- Test a function
- Test integerness
- Text processing/1
- Text processing/2
- Textonyms
- The ISAAC Cipher
- The Name Game
- Thiele's interpolation formula
- Thue-Morse
- Tic-tac-toe
- Tokenize a string with escaping
- Tonelli-Shanks algorithm
- Top rank per group
- Topic variable
- Topological sort
- Topswops
- Total circles area
- Totient function
- Trabb Pardo–Knuth algorithm
- Tree traversal
- Truncatable primes
- Truncate a file
- Truth table
- Twelve statements
U
V
- Validate International Securities Identification Number
- Vampire number
- Van Eck sequence
- Variable size/Get
- Variable size/Set
- Variadic function
- Verify distribution uniformity/Chi-squared test
- Verify distribution uniformity/Naive
- Video display modes
- Vigenère cipher/Cryptanalysis
- Visualize a tree
- Vogel's approximation method
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 Seed7 (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
- Check input device is a terminal
- Check output device is a terminal
- Checksumcolor
- 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)
- Copy stdin to stdout
- Create an object/Native demonstration
- Curve that touches three points
- Cycle detection
D
- Damm algorithm
- Data Encryption Standard
- Days between dates
- Decimal floating point number to binary
- 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
- Factorions
- 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 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
- Modulinos
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Montgomery reduction
- Morpion solitaire
- Most frequent k chars distance
- Multidimensional Newton-Raphson method
- Multiline shebang
- Musical scale
N
O
P
- Palindromic gapful numbers
- Parse EBNF
- Parse command-line arguments
- Particle Swarm Optimization
- Penrose tiling
- Pentomino tiling
- Perceptron
- Perlin noise
- Permutations with repetitions
- Permutations with some identical elements
- Pierpont primes
- Playfair cipher
- Polynomial synthetic division
- Print debugging statement
- Process SMIL directives in XML data
- Proof
R
- Railway circuit
- Ramanujan's constant
- Ramsey's theorem
- Random Latin Squares
- Raster bars
- Readline interface
- Recursive descent parser generator
- Reflection/List methods
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Repeat
- 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
- Sattolo cycle
- Selective File Copy
- Self-hosting compiler
- Separate the house number from the street name
- Simulated annealing
- Sine wave
- 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
- Spoof game
- Starting a web browser
- Stirling numbers of the first kind
- Stirling numbers of the second kind
- Subset sum problem
- Substitution Cipher
- Suffix tree
- Sum data type
- 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
- Two Sum
- Type detection
U
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in Seed7, 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 Seed7 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 Seed7 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.
