Sandbox: Difference between revisions
m (→Can you use a data URL?: Testing a beta template) |
|||
Line 8: | Line 8: | ||
[[#Text|Text]] |
[[#Text|Text]] |
||
[data:text/html,Hello%20World No.] |
[data:text/html,Hello%20World No.] |
||
{{Unimpl Page/Not implemented/Beta|Java}} |
|||
== What if you transclude a category? == |
== What if you transclude a category? == |
Revision as of 21:53, 12 December 2011
Which mu is the correct mu?
- µ µ U+00B5 Category:µC++
- μ μ U+03BC Category:μC++
- M U+004D Category:MC++
- Μ U+039C Category:ΜC++
Can you use a data URL?
Text [data:text/html,Hello%20World No.]
Not implemented
These are currently not implemented in Java. Please implement some if you can. If any tasks are not possible or too complex in Java, they should not be on this list. To mark a task as such, add {{omit from|Java}}, preserving the capitalization of the language, to that task. It will appear below under the "Not Considered" section.
- 100 doors
- 24 game
- 24 game/Solve
- 9 billion names of God the integer
- AVL tree
- Abstract type
- Accumulator factory
- Ackermann function
- 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
- Align columns
- Amb
- Anagrams
- Animate a pendulum
- Animation
- Anonymous recursion
- Append a record to the end of a text file
- Apply a callback to an array
- Arbitrary-precision integers (included)
- Arena storage pool
- Arithmetic evaluation
- Arithmetic/Complex
- Arrays
- Assertions
- Associative array/Creation
- Associative array/Iteration
- Atomic updates
- Balanced brackets
- Balanced ternary
- Bell numbers
- Best shuffle
- Binary strings
- Bitcoin/address validation
- Bitcoin/public point to address
- Bitmap
- 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 a PPM file
- Bitmap/Read an image through a pipe
- Bitmap/Write a PPM file
- Bitwise IO
Draft tasks without implementation
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 Java (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.
- ABC words
- Addition-chain exponentiation
- Alternade words
- Aspect oriented programming
- Audio frequency generator
- Audio overlap loop
- Banker's algorithm
- Change e letters to i in words
- Code segment unload
- Create an object/Native demonstration
- Cross compilation
- IPC via named pipe
- IRC gateway
- Implicit type conversion
- Linux CPU utilization
- Modulinos
- Multiline shebang
- Native shebang
- Numeric separator syntax
- OpenGL pixel shader
- Parse command-line arguments
- Print itself
- Proof
- Readline interface
- Run as a daemon or service
- Safe mode
- Self-hosting compiler
- Solving coin problems
- Starting a web browser
- Sum data type
- Unicode polynomial equation
- Use a REST API
- Useless instructions
- Using a speech engine to highlight words
- VList
- Waveform analysis/Doh ray me
- Waveform analysis/Top and tail
- Words containing "the" substring
What if you transclude a category?
Follow the articles and subcategories for items requiring maintenance. -- Okay, the member list doesn't show up. No good.
MultiCategorySearch
Special:MultiCategorySearch/include=Maintenance
Semantic MediaWiki (SMW)
- http://semantic-mediawiki.org/wiki/Help:Inline_queries
- http://semantic-mediawiki.org/wiki/Help:Result_formats
These pages need the maintenance!!! (This shows all the pages in Category:Maintenance or its subcategories.)
Randomizer
Random task (or draft task): Remove vowels from a string... further results
Other pages
These are other pages related to AWK OR Dc which require attention; with your knowledge and assistance, we can improve the quality of the site's content.
TITLE
code
pre test
Programming Task
This is a programming task. It lays out a problem which Rosetta Code users are encouraged to solve, using languages they know.
Test Another line Yet another line, this time one which clearly is much longer than the width of the browser window, at least assuming normal screen dimensions and font settings, and assuming the browser window is not wider than the screen (which would be impractical anyway). 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Testing HOPL
Testing new language tags
Z80
<lang z80>; some random instructions
ld a, 80h ld b, 9Ah add a, b adc a, a rst 0 ; reboot :-)</lang>
Whitespace
<lang whitespace>This may not be a meaningful whitespace
program,
but it's just a highlighting test anyway.</lang>
AviSynth
<lang avisynth>AviSource("D:\clip.avi") ConvertToYUY2() PixieDust(5)</lang>
POV-Ray
<lang povray>#declare factorial = function(C) { prod(i, 1, C, i) }
- declare A = factorial(5);
sphere{0,A} // a sphere</lang>
Text
<lang text>Is this actually a programming language, or really just plain text?</lang>
What happens if a language doesn't exist?
<lang somelanguagethatdoesnotexist>some code more code;
- a b -> c /// &a1 ->>> 778
(Probably this is an obfuscated language :-))</lang>
Whitespace test with unicode ZERO WIDTH NO-BREAK SPACE character (U+FEFF)
<lang whitespace>
</lang>
testing
Impl needed
Tcl pages: 987
Tcl/Omit pages: 7
Programming tasks: 1,272
Property query test
The programming languages are 0815, 11l, 1C, 360 Assembly, 4D, 4DOS Batch, 6502 Assembly, 6800 Assembly, 68000 Assembly, 8 1/2, 80386 Assembly, 8051 Assembly, 8080 Assembly, 8086 Assembly, 8th, A+, AArch64 Assembly, ABAP, ABC, ACL2, AHDL, ALGOL, ALGOL 60, ALGOL 68, ALGOL W, ALGOL-M, AMPL, ANSI BASIC, ANT, ANTLR, APL, ARM Assembly, ASIC, ASP, ASP.Net, ATS, AWK, Acornsoft Lisp, Action!, ActionScript, Acurity Architect, Ada, Agda, Agda2, Agena, Aikido, Aime, Algae, Alice ML, Alore... further results
- This uses Property:is language
This should turn up all languages and libraries which provide Graphics: AWT, FLTK, FLTK4d, GTK, JavaFX, JavaFX, Kivy, MINOS, Swing, Tk, XUL::Gui
This should turn up anything which does not provide Graphics: Ayrch, Binary Lambda Calculus, C++, Emacs Lisp, Go, JavaFX, JavaFX, Slope, Swing, TclX, Ultimate++, Unlambda, V (Vlang)
- as I learned now, it instead turns up anything which provides something other than Graphics.
This should turn up anything which provides first class functions: Binary Lambda Calculus, Emacs Lisp, Go, Slope, Unlambda, V (Vlang)
And this should be the intersection of the previous two sets: Binary Lambda Calculus, Emacs Lisp, Go, Slope, Unlambda, V (Vlang)
This should turn up anything that provides or allows Graphics: AWT, Ayrch, C++, FLTK, FLTK4d, GTK, JavaFX, JavaFX, Kivy, MINOS, Swing, Tk, Ultimate++, XUL::Gui
This should turn up anything implemented in a language that provides graphics: Nothing!?
Does "implemented in language" work? Let's see everything implemented in Unlambda: 99 bottles of beer, Comments, Empty program, Function composition, Hello world/Text, Loops/Infinite, Program termination, Quine, Reverse a string, Rot-13, Sierpinski triangle
This should turn up anything implemented in a language that allows graphics: 100 doors, 100 prisoners, 10001th prime, 15 puzzle game, 15 puzzle solver, 2048, 21 game, 24 game, 24 game/Solve, 4-rings or 4-squares puzzle, 9 billion names of God the integer, 99 bottles of beer, A* search algorithm, A+B, ABC problem, ABC words, ADFGVX cipher, AKS test for primes, ASCII art diagram converter, AVL tree, Abbreviations, automatic, Abbreviations, easy, Abbreviations, simple, Abelian sandpile model, Abelian sandpile model/Identity, Abstract type, Abundant odd numbers, Abundant, deficient and perfect number classifications, Accumulator factory, Achilles numbers, Ackermann function, Active object, Addition chains, Additive primes, Address of a variable, Algebraic data types, Align columns, Aliquot sequence classifications, Almkvist-Giullera formula for pi, Almost prime, Alternade words, Amb, Amicable pairs, Anadromes, Anagrams, Anagrams/Deranged anagrams, Anaprimes, Angle difference between two bearings, Angles (geometric), normalization and conversion, Animate a pendulum... further results
This might turn up anything which has a "provides" property: Or it might not. :-)
What about this: AWT, Ayrch, Binary Lambda Calculus, C++, Emacs Lisp, FLTK, FLTK4d, GTK, Go, JavaFX, JavaFX, Kivy, MINOS, Slope, Swing, TclX, Tk, Ultimate++, Unlambda, V (Vlang), XUL::Gui
Is Classes implemented in C++? 1 (1 = yes, 0 = no).
Is Classes implemented in Unlambda? 0 (1 = yes, 0 = no).
The following assumes a (currently non-existent) template "ignore" which takes an argument and ignores it. With that template, if the task Mutex is implemented in C++, nothing would be printed, otherwise a nested ask is executed, which just lists all requirements of Mutex (assuming I've got everything right): Template:Ignore
And now the same with Unlambda instead of C++ (there's of course no Unlambda implementation):
Requires | |
---|---|
Mutex | Capability:Concurrency |
The same without the "Requires" text:
Mutex | Capability:Concurrency |
Memoization
Memoization is a method used to reduce function calls in recursive functions or other functions that are called very frequently. The basic idea behind memoizing is to store results for new sets of inputs (typically in a key-value style) so that the function will not have to re-compute those results later.
Functions which can be memoized are ones that give the same answer for a set of inputs each time those inputs are used. Fibonacci number functions are often memoized to reduce their call trees and calculation times over time. The basic operation of a memoized function would look something like this:
function a with inputs if inputs have been seen before return a stored answer from when they were seen else compute the answer for inputs store that (inputs, answer) pair return that answer end function
Some programs may negate the condition in the "if" and swap the operations.
The overall benefit is that a function frequently called with the same set of inputs can save time by remembering the answer after computing it once -- sacrificing memory for computation time. In systems where memory (or storage depending on the implementation of storing old results) comes at a premium, memoization is not a good option. As long as memory is available and input sets are used repeatedly, memoization can save lots of computation time.
For tasks that use/can benefit from/(whatever) memoization, see Category:Memoization
[[Encyclopedia]][[Category:Memoization]]
Category:Memoization
Memoization is a method used to reduce function calls in recursive functions or other functions that are called very frequently. The basic idea behind memoizing is to store results for new sets of inputs (typically in a key-value style) so that the function will not have to re-compute those results later.
For more information, see Memoization.