Reports:Tasks not implemented in 11l
From Rosetta Code
Awareness
If 11l is a language you like, or are interested in, please inform your fellow members of the 11l community; this page can't be emptied without your and their participation.
If 11l is a language you like, or are interested in, please inform your fellow members of the 11l community; this page can't be emptied without your and their participation.
Contents
Not implemented[edit]
These are currently not implemented in 11l. Please implement some if you can. If any tasks are not possible or too complex in 11l, they should not be on this list. To mark a task as such, add {{omit from|11l}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
2
A
- ASCII art diagram converter
- AVL tree
- Achilles numbers
- Active Directory/Connect
- Active Directory/Search for a user
- Active object
- Add a variable to a class instance at runtime
- Address of a variable
- Algebraic data types
- Animate a pendulum
- Animation
- Append a record to the end of a text file
- Approximate equality
- Archimedean spiral
- Arena storage pool
- Arithmetic-geometric mean/Calculate Pi
- Arithmetic/Rational
- Arithmetic numbers
- Ascending primes
- Atomic updates
B
- Barnsley fern
- Base64 decode data
- Bernoulli numbers
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap/Bézier curves/Quadratic
- Bitmap/Flood fill
- Bitmap/Histogram
- Bitmap/PPM conversion through a pipe
- Bitmap/Read an image through a pipe
- Break OO privacy
- Brilliant numbers
- Brownian tree
- Bulls and cows
- Bulls and cows/Player
C
- Calendar
- Calendar - for "REAL" programmers
- Call a foreign-language function
- Call a function in a shared library
- Call an object method
- Canny edge detector
- Catmull–Clark subdivision surface
- Chaos game
- Chat server
- Check Machin-like formulas
- Check input device is a terminal
- Check output device is a terminal
- Checkpoint synchronization
- Chernick's Carmichael numbers
- Church numerals
- Circular primes
- Cistercian numerals
- Closest-pair problem
- Color of a screen pixel
- Color quantization
- Color wheel
- Colorful numbers
- Colour bars/Display
- Colour pinstripe/Display
- Colour pinstripe/Printer
- Compare length of two strings
- Compare sorting algorithms' performance
- Compile-time calculation
- Compiler/AST interpreter
- Compiler/code generator
- Compiler/lexical analyzer
- Compiler/syntax analyzer
- Compiler/virtual machine interpreter
- Composite numbers k with no single digit factors whose factors are all substrings of k
- Concurrent computing
- Constrained genericity
- Copy stdin to stdout
- Count in octal
- Create a file on magnetic tape
- Create an object at a given address
- Cuban primes
- Cullen and Woodall numbers
- Curzon numbers
- Cyclops numbers
- Cyclotomic polynomial
D
- DNS query
- Deceptive numbers
- Deconvolution/2D+
- Deepcopy
- Define a primitive data type
- Delegates
- Descending primes
- Detect division by zero
- Determine if a string is numeric
- Determine if only one instance is running
- Dining philosophers
- Disarium numbers
- Discordian date
- Display an outline as a nested table
- Distributed programming
- Documentation
- Doubly-linked list/Definition
- Doubly-linked list/Element definition
- Doubly-linked list/Element insertion
- Doubly-linked list/Traversal
- Dragon curve
- Draw a clock
- Draw a pixel
- Draw a rotating cube
- Duffinian numbers
- Dynamic variable names
E
- Earliest difference between prime gaps
- Echo server
- Egyptian fractions
- Element-wise operations
- Elliptic Curve Digital Signature Algorithm
- Entropy/Narcissist
- Equal prime and composite sums
- Erdös-Selfridge categorization of primes
- Euler's constant 0.5772...
- Events
- Executable library
- Execute Computer/Zero
- Exponentiation with infix operators in (or operating on) the base
- Extend your language
- Extensible prime generator
- Extreme floating point values
F
- FTP
- Factorial base numbers indexing permutations of a collection
- Faulhaber's formula
- Faulhaber's triangle
- Fermat numbers
- Fibonacci word/fractal
- File modification time
- File size distribution
- Find Chess960 starting position identifier
- Find duplicate files
- Find largest left truncatable prime in a given base
- Find limit of recursion
- First-class functions
- First class environments
- Five weekends
- Fixed length records
- Flatten a list
- Forest fire
- Fork
- Formal power series
- Four is the number of letters in the ...
- French Republican calendar
- Function frequency
- Function prototype
- Functional coverage tree
G
H
I
K
L
M
- MAC Vendor Lookup
- MD4
- MD5
- Machine code
- Magic constant
- Magnanimous numbers
- Main step of GOST 28147-89
- Man or boy test
- Marching squares
- Matrix digital rain
- Mayan calendar
- Median filter
- Memory allocation
- Memory layout of a data structure
- Metallic ratios
- Metaprogramming
- Metered concurrency
- Minesweeper game
- Minimum multiple of m where digital sum equals m
- Modular arithmetic
- Monads/List monad
- Monads/Maybe monad
- Monads/Writer monad
- Morse code
- Motzkin numbers
- Mouse position
- Multi-base primes
- Multiple regression
- Munching squares
- Musical scale
- Mutex
- Mutual recursion
- Möbius function
N
P
- P-Adic numbers, basic
- P-Adic square roots
- P-value correction
- Palindromic gapful numbers
- Pancake numbers
- Parallel brute force
- Parallel calculations
- Parameterized SQL statement
- Parametric polymorphism
- Parse an IP Address
- Particle fountain
- Password generator
- Pathological floating point problems
- Peano curve
- Pell numbers
- Pentagram
- Pentomino tiling
- Percentage difference between images
- Periodic table
- Peripheral drift illusion
- Pierpont primes
- Pig the dice game/Player
- Pinstripe/Display
- Pinstripe/Printer
- Plasma effect
- Play recorded sounds
- Playing cards
- Plot coordinate pairs
- Pointers and references
- Polymorphic copy
- Polymorphism
- Polyspiral
- Pragmatic directives
- Prime triangle
- Probabilistic choice
- Pseudo-random numbers/Middle-square method
- Pythagoras tree
R
- RCRPG
- RIPEMD-160
- Ramanujan's constant
- Ramanujan primes/twins
- Random number generator (device)
- Random numbers
- Random sentence from book
- Rare numbers
- Rate counter
- Read a file character by character/UTF8
- Read a file line by line
- Record sound
- Reflection/Get source
- Reflection/List methods
- Reflection/List properties
- Rendezvous
- Repunit primes
- Respond to an unknown method call
- Retrieve and search chat history
- Rhonda numbers
- Rosetta Code/Count examples
- Rosetta Code/Find bare lang tags
- Rosetta Code/Find unimplemented tasks
- Rosetta Code/Rank languages by number of users
- Rosetta Code/Rank languages by popularity
- Runtime evaluation
- Runtime evaluation/In an environment
- Ruth-Aaron numbers
S
- SHA-1
- SHA-256
- SHA-256 Merkle tree
- SOAP
- SQL-based authentication
- Safe addition
- Safe primes and unsafe primes
- Same fringe
- Scope/Function names and labels
- Search in paragraph's text
- Secure temporary file
- Selectively replace multiple instances of a character within a string
- Self numbers
- Send an unknown method call
- Send email
- Sequence: nth number with exactly n divisors
- Sequence of primorial primes
- Set consolidation
- Set of real numbers
- Set puzzle
- Set right-adjacent bits
- Show the epoch
- Sierpinski pentagon
- Sierpinski triangle/Graphical
- Simple turtle graphics
- Simple windowed application
- Simulate input/Keyboard
- Simulate input/Mouse
- Singleton
- Singly-linked list/Element definition
- Singly-linked list/Element insertion
- Singly-linked list/Traversal
- Smallest number k such that k+2^m is composite for all m less than k
- Snake
- Sockets
- Sort an outline at every level
- Sorting algorithms/Sleep sort
- Sparkline in unicode
- Spelling of ordinal numbers
- Square form factorization
- Stack traces
- Start from a main routine
- Statistics/Normal distribution
- Strassen's algorithm
- Stream merge
- String length
- Superellipse
- Synchronous concurrency
T
- Table creation/Postal addresses
- Terminal control/Coloured text
- Terminal control/Cursor movement
- Terminal control/Cursor positioning
- Terminal control/Dimensions
- Terminal control/Hiding the cursor
- Terminal control/Positional read
- Terminal control/Unicode output
- Ternary logic
- Test a function
- The ISAAC Cipher
- Topic variable
- Tree from nesting levels
- Twin primes
U
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 11l (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
- Card shuffles
- Checksumcolor
- Chemical calculator
- Chess player
- Code Golf: Code Golf
- Code segment unload
- Combinations with repetitions/Square digit chain
- Compiler/Preprocessor
- Compiler/Simple file inclusion pre processor
- Compiler/Verifying syntax
- Conjugate a Latin verb
- Continued fraction/Arithmetic/G(matrix ng, continued fraction n1, continued fraction n2)
- Count the coins/0-1
- Create an object/Native demonstration
- Create your own text control codes
- Cross compilation
- Curve that touches three points
- Cycles of a permutation
D
F
G
I
L
M
P
- Pandigital prime
- Parse EBNF
- Parse command-line arguments
- Particle swarm optimization
- Penrose tiling
- Permuted multiples
- Polynomial derivative
- Powerful numbers
- Prime numbers p for which the sum of primes less than or equal to p is prime
- Print debugging statement
- Process SMIL directives in XML data
- Proof
- Pseudorandom number generator image
R
- Railway circuit
- Ramanujan primes
- Raster bars
- Recursive descent parser generator
- Red black tree sort
- Remote agent/Agent interface
- Remote agent/Agent logic
- Remote agent/Simulation
- Robots
- Rodrigues’ rotation formula
- 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 mode
- Sanitize user input
- Segmentation fault protection
- Selective file copy
- Self-hosting compiler
- Sierpinski curve
- Simulated annealing
- Sine wave
- Singly-linked list/Element removal
- Solve a Rubik's Cube
- Solve equations with substitution method
- Solve hanging lantern problem
- Solving coin problems
- Sort primes from list to a list
- Sorting algorithms/Tree sort on a linked list
- Special divisors
- Spoof game
- Square root by hand
- Starting a web browser
- Steady squares
- Sum data type
- Sum of square and cube digits of an integer are primes
- Sum of two adjacent numbers are primes
- Summation of primes
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
- Three word location
- Time-based one-time password algorithm
- Transliterate English text using the Greek alphabet
- Transportation problem
- Tropical algebra overloading
- Type detection
U
W
Requiring Attention[edit]
Examples[edit]
These tasks have implementations in 11l, 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 11l 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 11l 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.
