Rosetta Code/Count examples: Difference between revisions
Thundergnat (talk | contribs) m (→{{header|Perl 6}}: Give draft tasks a different background color, add a better progress indicator, add some explanatory verbiage) |
Thundergnat (talk | contribs) m (→{{header|Perl 6}}: secondary sort on task name for initial table order) |
||
Line 1,639:
=={{header|Perl 6}}==
{{works with|Rakudo|2018.03}}
Retrieves counts for both Tasks and Draft Tasks. Save / Display results as a sortable wikitable rather than a static list. Click on a column header to sort on that column. To do a secondary sort, hold down the shift key and click on a second column header. Tasks have a gray (default) background, Draft Tasks have a yellow background.
<lang perl6>use HTTP::UserAgent;
use URI::Escape;
Line 1,732:
# Sort tasks by count then add row
for %tasks.sort: { [-
$out.say:
( $task.value<cat> eq 'Draft'
Line 1,872:
|-
| 159
| [[Array%20concatenation|Array concatenation]]
| Task
|-
| 159
| [[Loops%2FDownward%20for|Loops/Downward for]]
| Task
|-
Line 1,888:
|-
| 155
| [[
| Task
|-
| 155
| [[
| Task
|-
Line 1,904:
|-
| 148
| [[
| Task
|-
| 148
| [[
| Task
|-
| 148
| [[String%
| Task
|-
| 146
| [[Character%20codes|Character codes]]
| Task
|-
| 146
| [[Hailstone%20sequence|Hailstone sequence]]
| Task
|-
| 144
| [[Apply%20a%20callback%20to%20an%20array|Apply a callback to an array]]
| Task
|-
| 144
| [[Loops%2FDo-while|Loops/Do-while]]
| Task
|-
Line 1,956:
|-
| 137
| [[
| Task
|-
| 137
| [[Generic%20swap|Generic swap]]
| Task
|-
| 137
| [[
| Task
|-
| 137
| [[Palindrome%20detection|Palindrome detection]]
| Task
|-
| 137
| [[
| Task
|-
Line 1,980:
|-
| 136
| [[Logical%20operations|Logical operations]]
| Task
|-
| 136
|data-sort-value="rot-0C13"| [[Rot-13|Rot-13]]
| Task
|-
Line 2,020:
|-
| 126
| [[Higher-order%20functions|Higher-order functions]]
| Task
|-
| 126
| [[Remove%20duplicate%20elements|Remove duplicate elements]]
| Task
|-
| 126
| [[Sorting%20algorithms%2FBubble%20sort|Sorting algorithms/Bubble sort]]
| Task
|-
Line 2,040:
|-
| 123
| [[
| Task
|-
| 123
| [[Hello%20world%2FStandard%20error|Hello world/Standard error]]
| Task
|-
| 123
| [[Quine|Quine]]
| Task
|-
| 123
| [[
| Task
|-
Line 2,084:
|-
| 118
| [[Bitwise%20operations|Bitwise operations]]
| Task
|-
Line 2,092:
|-
| 118
| [[Loop%20over%20multiple%20arrays%20simultaneously|Loop over multiple arrays simultaneously]]
| Task
|-
| 117
| [[Least%20common%20multiple|Least common multiple]]
| Task
|-
| 117
| [[Sleep|Sleep]]
| Task
|-
| 116
| [[Day%20of%20the%20week|Day of the week]]
| Task
|-
| 116
| [[Factors%20of%20an%20integer|Factors of an integer]]
| Task
|-
| 116
| [[Sorting%20algorithms%2FQuicksort|Sorting algorithms/Quicksort]]
| Task
|-
| 116
| [[System%20time|System time]]
| Task
|-
Line 2,133 ⟶ 2,129:
| 115
| [[Include%20a%20file|Include a file]]
| Task
|-
| 115
| [[Substring|Substring]]
| Task
|-
Line 2,152:
|-
| 112
| [[Detect%20division%20by%20zero|Detect division by zero]]
| Task
|-
| 112
| [[Pascal%27s%20triangle|Pascal's triangle]]
| Task
|-
| 111
| [[Averages%2FRoot%20mean%20square|Averages/Root mean square]]
| Task
|-
| 111
| [[
| Task
|-
| 111
| [[Flatten%20a%20list|Flatten a list]]
| Task
|-
| 111
| [[Luhn%20test%20of%20credit%20card%20numbers|Luhn test of credit card numbers]]
| Task
|-
| 110
| [[Program%20termination|Program termination]]
| Task
|-
| 110
| [[Stack|Stack]]
| Task
|-
| 109
| [[
| Task
|-
| 109
| [[
| Task
|-
| 108
| [[Compound%20data%20type|Compound data type]]
| Task
|-
| 108
| [[Variables|Variables]]
| Task
|-
Line 2,211 ⟶ 2,207:
| Task
|-
|
| [[
| Task
|-
| 106
| [[
| Task
|-
Line 2,228 ⟶ 2,224:
|-
| 106
| [[
| Task
|-
| 106
| [[Search%20a%20list|Search a list]]
| Task
|-
Line 2,236:
|-
| 104
| [[
| Task
|-
| 104
| [[Count%20in%20octal|Count in octal]]
| Task
|-
| 104
| [[Function%20composition|Function composition]]
| Task
|-
Line 2,252:
|-
| 104
| [[Null%20object|Null object]]
| Task
|-
| 104
| [[Return%20multiple%20values|Return multiple values]]
| Task
|-
| 103
| [[
| Task
|-
| 103
| [[Case-sensitivity%20of%20identifiers|Case-sensitivity of identifiers]]
| Task
|-
| 103
| [[Classes|Classes]]
| Task
|-
| 103
| [[Formatted%20numeric%20output|Formatted numeric output]]
| Task
|-
| 103
| [[
| Task
|-
| 103
| [[Sorting%20algorithms%2FInsertion%20sort|Sorting algorithms/Insertion sort]]
| Task
|-
Line 2,288:
|-
| 102
| [[Count%20occurrences%20of%20a%20substring|Count occurrences of a substring]]
| Task
|-
| 102
| [[Hostname|Hostname]]
| Task
|-
| 101
| [[Arithmetic%2FComplex|Arithmetic/Complex]]
| Task
|-
| 101
| [[Hash%20from%20two%20arrays|Hash from two arrays]]
| Task
|-
Line 2,308:
|-
| 100
| [[HTTP|HTTP]]
| Task
|-
Line 2,316:
|-
| 100
| [[Pick%20random%20element|Pick random element]]
| Task
|-
| 99
| [[Anagrams|Anagrams]]
| Task
|-
| 99
| [[Environment%20variables|Environment variables]]
| Task
|-
| 99
| [[Find%20limit%20of%20recursion|Find limit of recursion]]
| Task
|-
| 99
| [[Matrix%20multiplication|Matrix multiplication]]
| Task
|-
| 99
| [[Matrix%20transposition|Matrix transposition]]
| Task
|-
| 99
| [[N-queens%20problem|N-queens problem]]
| Task
|-
| 99
| [[Pangram%20checker|Pangram checker]]
| Task
|-
Line 2,360:
|-
| 97
| [[Accumulator%20factory|Accumulator factory]]
| Task
|-
Line 2,368:
|-
| 97
| [[Create%20a%20two-dimensional%20array%20at%20runtime|Create a two-dimensional array at runtime]]
| Task
|-
Line 2,376:
|-
| 96
| [[Assertions|Assertions]]
| Task
|-
| 96
| [[Haversine%20formula|Haversine formula]]
| Task
|-
| 96
| [[Identity%20matrix|Identity matrix]]
| Task
|-
| 96
| [[Roman%20numerals%2FDecode|Roman numerals/Decode]]
| Task
|-
| 96
| [[Strip%20a%20set%20of%20characters%20from%20a%20string|Strip a set of characters from a string]]
| Task
|-
| 96
| [[Temperature%20conversion|Temperature conversion]]
| Task
|-
| 95
| [[Averages%2FPythagorean%20means|Averages/Pythagorean means]]
| Task
|-
| 95
| [[Evaluate%20binomial%20coefficients|Evaluate binomial coefficients]]
| Task
|-
| 95
| [[String%20matching|String matching]]
| Task
|-
Line 2,424:
|-
| 93
| [[Catalan%20numbers|Catalan numbers]]
| Task
|-
| 93
| [[Run-length%20encoding|Run-length encoding]]
| Task
|-
| 93
| [[Zero%20to%20the%20zero%20power|Zero to the zero power]]
| Task
|-
| 92
| [[Arithmetic-geometric%20mean|Arithmetic-geometric mean]]
| Task
|-
| 92
| [[Program%20name|Program name]]
| Task
|-
| 92
| [[Shell%20one-liner|Shell one-liner]]
| Task
|-
| 92
| [[Strip%20whitespace%20from%20a%20string%2FTop%20and%20tail|Strip whitespace from a string/Top and tail]]
| Task
|-
| 92
| [[Zig-zag%20matrix|Zig-zag matrix]]
| Task
|-
| 91
| [[Exceptions|Exceptions]]
| Task
|-
| 91
| [[Trigonometric%20functions|Trigonometric functions]]
| Task
|-
Line 2,468:
|-
| 90
| [[Letter%20frequency|Letter frequency]]
| Task
|-
Line 2,476:
|-
| 90
| [[Regular%20expressions|Regular expressions]]
| Task
|-
| 90
| [[String%20interpolation%20%28included%29|String interpolation (included)]]
| Task
|-
Line 2,488:
|-
| 88
|data-sort-value="0C24 game"| [[24%20game|24 game]]
| Task
|-
| 88
| [[Enumerations|Enumerations]]
| Task
|-
| 88
| [[Power%20set|Power set]]
| Task
|-
| 88
| [[Random%20number%20generator%20%28included%29|Random number generator (included)]]
| Task
|-
| 88
| [[Short-circuit%20evaluation|Short-circuit evaluation]]
| Task
|-
| 88
| [[Sierpinski%20triangle|Sierpinski triangle]]
| Task
|-
| 88
| [[Sorting%20algorithms%2FMerge%20sort|Sorting algorithms/Merge sort]]
| Task
|-
| 88
| [[Sorting%20algorithms%2FSelection%20sort|Sorting algorithms/Selection sort]]
| Task
|-
| 87
| [[Collections|Collections]]
| Task
|-
| 87
| [[One-dimensional%20cellular%20automata|One-dimensional cellular automata]]
| Task
|-
Line 2,540:
|-
| 85
| [[Comma%20quibbling|Comma quibbling]]
| Task
|-
| 85
| [[Exponentiation%20operator|Exponentiation operator]]
| Task
|-
| 85
| [[Levenshtein%20distance|Levenshtein distance]]
| Task
|-
Line 2,560:
|-
| 84
| [[Arbitrary-precision%20integers%20%28included%29|Arbitrary-precision integers (included)]]
| Task
|-
| 84
| [[First-class%20functions|First-class functions]]
| Task
|-
| 84
| [[Look-and-say%20sequence|Look-and-say sequence]]
| Task
|-
| 84
| [[Permutations|Permutations]]
| Task
|-
| 84
| [[Range%20extraction|Range extraction]]
| Task
|-
| 84
| [[Reverse%20words%20in%20a%20string|Reverse words in a string]]
| Task
|-
| 84
| [[Walk%20a%20directory%2FNon-recursively|Walk a directory/Non-recursively]]
| Task
|-
Line 2,596:
|-
| 82
| [[Bulls%20and%20cows|Bulls and cows]]
| Task
|-
| 82
| [[Inheritance%2FSingle|Inheritance/Single]]
| Task
|-
Line 2,608:
|-
| 82
| [[
| Task
|-
| 81
| [[Five%20weekends|Five weekends]]
| Task
|-
Line 2,624:
|-
| 81
| [[String%20prepend|String prepend]]
| Task
|-
| 81
|data-sort-value="sum multiples of 0B3 and 0B5"| [[Sum%20multiples%20of%203%20and%205|Sum multiples of 3 and 5]]
| Task
|-
| 81
| [[Symmetric%20difference|Symmetric difference]]
| Task
|-
| 81
| [[
| Task
|-
| 80
| [[Create%20an%20HTML%20table|Create an HTML table]]
| Task
|-
| 80
| [[Evolutionary%20algorithm|Evolutionary algorithm]]
| Task
|-
Line 2,652:
|-
| 80
| [[Y%20combinator|Y combinator]]
| Task
|-
| 79
| [[Forward%20difference|Forward difference]]
| Task
|-
Line 2,664:
|-
| 79
| [[Sum%20digits%20of%20an%20integer|Sum digits of an integer]]
| Task
|-
Line 2,680:
|-
| 78
| [[Monty%20Hall%20problem|Monty Hall problem]]
| Task
|-
| 78
| [[Price%20fraction|Price fraction]]
| Task
|-
| 77
| [[Abstract%20type|Abstract type]]
| Task
|-
| 77
| [[
| Task
|-
| 77
| [[Greatest%20subsequential%20sum|Greatest subsequential sum]]
| Task
|-
| 77
| [[
| Task
|-
| 77
| [[
| Task
|-
| 76
| [[
| Task
|-
| 76
| [[
| Task
|-
| 76
| [[
| Task
|-
| 76
| [[
| Task
|-
| 76
| [[Menu|Menu]]
| Task
|-
Line 2,732:
|-
| 76
| [[Spiral%20matrix|Spiral matrix]]
| Task
|-
| 75
| [[
| Task
|-
| 75
| [[Hello%20world%2FLine%20printer|Hello world/Line printer]]
| Task
|-
| 75
| [[Map%20range|Map range]]
| Task
|-
Line 2,752:
|-
| 75
| [[Walk%20a%20directory%2FRecursively|Walk a directory/Recursively]]
| Task
|-
| 74
| [[Execute%20Brain%2A%2A%2A%2A|Execute Brain****]]
| Task
|-
| 74
| [[Harshad%20or%20Niven%20series|Harshad or Niven series]]
| Task
|-
| 74
| [[JSON|JSON]]
| Task
|-
| 74
| [[Non-decimal%20radices%2FConvert|Non-decimal radices/Convert]]
| Task
|-
| 74
| [[Show%20the%20epoch|Show the epoch]]
| Task
|-
| 74
| [[Simple%20windowed%20application|Simple windowed application]]
| Task
|-
| 74
| [[The%20Twelve%20Days%20of%20Christmas|The Twelve Days of Christmas]]
| Task
|-
| 74
| [[Web%20scraping|Web scraping]]
| Task
|-
| 73
| [[Closures%2FValue%20capture|Closures/Value capture]]
| Task
|-
| 73
| [[
| Task
|-
| 73
| [[
| Task
|-
| 73
| [[Monte%20Carlo%20methods|Monte Carlo methods]]
| Task
|-
| 73
| [[Set|Set]]
| Task
|-
| 73
| [[
| Task
|-
| 72
| [[Introspection|Introspection]]
| Task
|-
| 72
| [[Man%20or%20boy%20test|Man or boy test]]
| Task
|-
| 72
| [[
| Task
|-
| 72
| [[Read%20a%20specific%20line%20from%20a%20file|Read a specific line from a file]]
| Task
|-
| 72
| [[SEDOLs|SEDOLs]]
| Task
|-
| 71
| [[CSV%20to%20HTML%20translation|CSV to HTML translation]]
| Task
|-
| 71
| [[Last%20Friday%20of%20each%20month|Last Friday of each month]]
| Task
|-
| 71
| [[Literals%2FFloating%20point|Literals/Floating point]]
| Task
|-
| 71
| [[Number%20reversal%20game|Number reversal game]]
| Task
|-
| 71
| [[Singly-linked%20list%2FTraversal|Singly-linked list/Traversal]]
| Task
|-
Line 2,856:
|-
| 71
| [[Terminal%20control%2FRinging%20the%20terminal%20bell|Terminal control/Ringing the terminal bell]]
| Task
|-
| 70
| [[Bitmap|Bitmap]]
| Task
|-
Line 2,868:
|-
| 70
| [[Count%20in%20factors|Count in factors]]
| Task
|-
| 70
| [[Keyboard%20input%2FObtain%20a%20Y%20or%20N%20response|Keyboard input/Obtain a Y or N response]]
| Task
|-
| 70
| [[Sorting%20algorithms%2FHeapsort|Sorting algorithms/Heapsort]]
| Task
|-
| 70
| [[URL%20decoding|URL decoding]]
| Task
|-
| 69
| [[Amicable%20pairs|Amicable pairs]]
| Task
|-
| 69
| [[Floyd%27s%20triangle|Floyd's triangle]]
| Task
|-
| 69
| [[Linear%20congruential%20generator|Linear congruential generator]]
| Task
|-
| 69
| [[Sockets|Sockets]]
| Task
|-
Line 2,904:
|-
| 68
| [[Find%20the%20missing%20permutation|Find the missing permutation]]
| Task
|-
| 68
| [[Josephus%20problem|Josephus problem]]
| Task
|-
| 68
|data-sort-value="knapsack problem/0B0-0B1"| [[Knapsack%20problem%2F0-1|Knapsack problem/0-1]]
| Task
|-
Line 2,916 ⟶ 2,920:
|-
| 68
| [[Special%20characters|Special characters]]
| Task
|-
| 68
| [[String%20comparison|String comparison]]
| Task
|-
Line 2,932 ⟶ 2,936:
|-
| 68
| [[XML%2FInput|XML/Input]]
| Task
|-
|
| [[Address%20of%20a%20variable|Address of a variable]]
| Task
|-
| 67
| [[Catamorphism|Catamorphism]]
| Task
|-
Line 2,948 ⟶ 2,952:
|-
| 67
| [[Date%20manipulation|Date manipulation]]
| Task
|-
| 67
| [[Find%20common%20directory%20path|Find common directory path]]
| Task
|-
| 67
| [[Kaprekar%20numbers|Kaprekar numbers]]
| Task
|-
| 67
| [[Number%20names|Number names]]
| Task
|-
Line 2,976:
|-
| 67
| [[Strip%20comments%20from%20a%20string|Strip comments from a string]]
| Task
|-
| 67
| [[Terminal%20control%2FClear%20the%20screen|Terminal control/Clear the screen]]
| Task
|-
| 66
| [[Box%20the%20compass|Box the compass]]
| Task
|-
| 66
| [[Dynamic%20variable%20names|Dynamic variable names]]
| Task
|-
| 66
| [[Non-decimal%20radices%2FOutput|Non-decimal radices/Output]]
| Task
|-
| 66
| [[Playing%20cards|Playing cards]]
| Task
|-
| 66
| [[Singly-linked%20list%2FElement%20definition|Singly-linked list/Element definition]]
| Task
|-
| 66
| [[Soundex|Soundex]]
| Task
|-
| 66
| [[Stair-climbing%20puzzle|Stair-climbing puzzle]]
| Task
|-
| 66
| [[
| Task
|-
| 66
| [[
| Task
|-
| 65
| [[Bitmap%2FBresenham%27s%20line%20algorithm|Bitmap/Bresenham's line algorithm]]
| Task
|-
| 65
| [[Equilibrium%20index|Equilibrium index]]
| Task
|-
Line 3,040 ⟶ 3,036:
|-
| 65
| [[Order%20two%20numerical%20lists|Order two numerical lists]]
| Task
|-
|
| [[Polymorphism|Polymorphism]]
| Task
|-
Line 3,056 ⟶ 3,052:
|-
| 64
| [[Flow-control%20structures|Flow-control structures]]
| Task
|-
| 64
| [[Sorting%20algorithms%2FCounting%20sort|Sorting algorithms/Counting sort]]
| Task
|-
|
| [[Write%20float%20arrays%20to%20a%20text%20file|Write float arrays to a text file]]
| Task
|-
Line 3,072 ⟶ 3,068:
|-
| 63
| [[Averages%2FMean%20angle|Averages/Mean angle]]
| Task
|-
| 63
| [[Forest%20fire|Forest fire]]
| Task
|-
Line 3,084 ⟶ 3,080:
|-
| 63
| [[Here%20document|Here document]]
| Task
|-
| 63
| [[Multifactorial|Multifactorial]]
| Task
|-
| 63
| [[Multiple%20distinct%20objects|Multiple distinct objects]]
| Task
|-
| 63
| [[
| Task
|-
| 63
| [[Parsing%2FRPN%20calculator%20algorithm|Parsing/RPN calculator algorithm]]
| Task
|-
| 63
| [[Read%20a%20configuration%20file|Read a configuration file]]
| Task
|-
| 63
| [[Semordnilap|Semordnilap]]
| Task
|-
| 63
| [[Sorting%20algorithms%2FComb%20sort|Sorting algorithms/Comb sort]]
| Task
|-
|
| [[Word%20wrap|Word wrap]]
| Task
|-
| 62
| [[Compare%20a%20list%20of%20strings|Compare a list of strings]]
| Task
|-
| 62
| [[Constrained%20random%20points%20on%20a%20circle|Constrained random points on a circle]]
| Task
|-
| 62
| [[Convert%20seconds%20to%20compound%20duration|Convert seconds to compound duration]]
| Task
|-
| 62
| [[
| Task
|-
Line 3,140 ⟶ 3,136:
|-
| 62
| [[Euler%20method|Euler method]]
| Task
|-
| 62
| [[Exceptions%2FCatch%20an%20exception%20thrown%20in%20a%20nested%20call|Exceptions/Catch an exception thrown in a nested call]]
| Task
|-
| 62
| [[Fibonacci%20n-step%20number%20sequences|Fibonacci n-step number sequences]]
| Task
|-
| 62
| [[Guess%20the%20number%2FWith%20feedback%20%28player%29|Guess the number/With feedback (player)]]
| Task
|-
| 62
| [[Hofstadter%20Q%20sequence|Hofstadter Q sequence]]
| Task
|-
| 62
| [[
| Task
|-
| 62
| [[Largest%20int%20from%20concatenated%20ints|Largest int from concatenated ints]]
| Task
|-
| 62
| [[Pythagorean%20triples|Pythagorean triples]]
| Task
|-
| 62
| [[Sorting%20algorithms%2FStooge%20sort|Sorting algorithms/Stooge sort]]
| Task
|-
|
| [[Vigen%C3%A8re%20cipher|Vigenère cipher]]
| Task
|-
| 61
| [[Animation|Animation]]
| Task
|-
Line 3,188 ⟶ 3,184:
|-
| 61
| [[
| Task
|-
| 61
| [[Hello%20world%2FNewbie|Hello world/Newbie]]
| Task
|-
| 61
| [[Long%20multiplication|Long multiplication]]
| Task
|-
| 61
| [[
| Task
|-
| 61
| [[
| Task
|-
|
| [[Trabb%20Pardo%E2%80%93Knuth%20algorithm|Trabb Pardo–Knuth algorithm]]
| Task
|-
Line 3,216 ⟶ 3,212:
|-
| 60
| [[Numerical%20integration|Numerical integration]]
| Task
|-
| 60
| [[Operator%20precedence|Operator precedence]]
| Task
|-
Line 3,228 ⟶ 3,224:
|-
| 60
| [[Singly-linked%20list%2FElement%20insertion|Singly-linked list/Element insertion]]
| Task
|-
| 60
| [[Sort%20stability|Sort stability]]
| Task
|-
|
| [[Strip%20control%20codes%20and%20extended%20characters%20from%20a%20string|Strip control codes and extended characters from a string]]
| Task
|-
| 59
| [[Fork|Fork]]
| Task
|-
| 59
| [[Four%20bit%20adder|Four bit adder]]
| Task
|-
Line 3,252 ⟶ 3,248:
|-
| 59
| [[Named%20parameters|Named parameters]]
| Task
|-
| 59
| [[Runtime%20evaluation|Runtime evaluation]]
| Task
|-
| 59
| [[Undefined%20values|Undefined values]]
| Task
|-
| 59
|data-sort-value="write language name in 0B3d ascii"| [[Write%20language%20name%20in%203D%20ASCII|Write language name in 3D ASCII]]
| Task
|-
Line 3,268:
|-
| 58
| [[
| Task
|-
| 58
| [[
| Task
|-
| 58
| [[
| Task
|-
| 58
| [[Roots%20of%20a%20quadratic%20function|Roots of a quadratic function]]
| Task
|-
| 58
| [[Text%20processing%2FMax%20licenses%20in%20use|Text processing/Max licenses in use]]
| Task
|-
| 58
| [[Variable%20size%2FGet|Variable size/Get]]
| Task
|-
| 57
| [[Arithmetic%2FRational|Arithmetic/Rational]]
| Task
|-
| 57
| [[Closest-pair%20problem|Closest-pair problem]]
| Task
|-
| 57
| [[Combinations%20with%20repetitions|Combinations with repetitions]]
| Task
|-
| 57
| [[
| Task
|-
| 57
| [[IBAN|IBAN]]
| Task
|-
| 57
| [[Optional%20parameters|Optional parameters]]
| Task
|-
| 57
| [[Phrase%20reversals|Phrase reversals]]
| Task
|-
Line 3,324:
|-
| 57
| [[Priority%20queue|Priority queue]]
| Task
|- style="background-color: #ffc"
Line 3,332:
|-
| 57
| [[Quaternion%20type|Quaternion type]]
| Task
|-
| 57
| [[Rock-paper-scissors|Rock-paper-scissors]]
| Task
|-
| 57
| [[Roots%20of%20a%20function|Roots of a function]]
| Task
|-
| 57
| [[Runge-Kutta%20method|Runge-Kutta method]]
| Task
|-
| 56
| [[
| Task
|-
Line 3,356:
|-
| 56
| [[HTTPS|HTTPS]]
| Task
|-
| 56
|data-sort-value="hofstadter-conway $0C10,0D000 sequence"| [[Hofstadter-Conway%20%2410%2C000%20sequence|Hofstadter-Conway $10,000 sequence]]
| Task
|-
Line 3,372:
|-
| 56
| [[Magic%20squares%20of%20odd%20order|Magic squares of odd order]]
| Task
|-
| 56
| [[Memory%20allocation|Memory allocation]]
| Task
|-
| 56
|data-sort-value="sha-0B1"| [[SHA-1|SHA-1]]
| Task
|-
Line 3,395 ⟶ 3,391:
| Task
|-
|
| [[Zeckendorf%20number%20representation|Zeckendorf number representation]]
| Task
|-
| 55
| [[AKS%20test%20for%20primes|AKS test for primes]]
| Task
|-
| 55
|data-sort-value="crc-0C32"| [[CRC-32|CRC-32]]
| Task
|-
| 55
| [[Cholesky%20decomposition|Cholesky decomposition]]
| Task
|-
| 55
| [[Currying|Currying]]
| Task
|-
| 55
| [[Extend%20your%20language|Extend your language]]
| Task
|-
| 55
| [[Fast%20Fourier%20transform|Fast Fourier transform]]
| Task
|-
| 55
| [[Knapsack%20problem%2FUnbounded|Knapsack problem/Unbounded]]
| Task
|-
| 55
| [[
| Task
|-
| 55
| [[Narcissistic%20decimal%20number|Narcissistic decimal number]]
| Task
|-
Line 3,440 ⟶ 3,436:
|-
| 55
| [[Sorting%20algorithms%2FSleep%20sort|Sorting algorithms/Sleep sort]]
| Task
|-
| 55
| [[Special%20variables|Special variables]]
| Task
|-
|
| [[
| Task
|-
Line 3,456 ⟶ 3,452:
|-
| 54
| [[Documentation|Documentation]]
| Task
|-
Line 3,468 ⟶ 3,464:
|-
| 54
| [[Non-decimal%20radices%2FInput|Non-decimal radices/Input]]
| Task
|-
| 54
| [[Partial%20function%20application|Partial function application]]
| Task
|-
|
|data-sort-value="sha-0D256"| [[SHA-256|SHA-256]]
| Task
|-
| 53
| [[Animate%20a%20pendulum|Animate a pendulum]]
| Task
|-
| 53
| [[Binary%20strings|Binary strings]]
| Task
|-
| 53
| [[Calendar|Calendar]]
| Task
|-
| 53
| [[Factors%20of%20a%20Mersenne%20number|Factors of a Mersenne number]]
| Task
|-
| 53
| [[Globally%20replace%20text%20in%20several%20files|Globally replace text in several files]]
| Task
|-
Line 3,504 ⟶ 3,500:
|-
| 53
| [[Inheritance%2FMultiple|Inheritance/Multiple]]
| Task
|-
| 53
| [[Old%20lady%20swallowed%20a%20fly|Old lady swallowed a fly]]
| Task
|-
| 53
| [[Pernicious%20numbers|Pernicious numbers]]
| Task
|-
| 53
| [[Reduced%20row%20echelon%20form|Reduced row echelon form]]
| Task
|-
| 53
| [[Stem-and-leaf%20plot|Stem-and-leaf plot]]
| Task
|-
| 53
| [[Test%20a%20function|Test a function]]
| Task
|-
|
| [[
| Task
|-
Line 3,540 ⟶ 3,536:
|-
| 52
| [[Fibonacci%20word|Fibonacci word]]
| Task
|-
Line 3,548 ⟶ 3,544:
|-
| 52
| [[Scope%20modifiers|Scope modifiers]]
| Task
|-
| 52
| [[Sorting%20algorithms%2FBead%20sort|Sorting algorithms/Bead sort]]
| Task
|-
| 52
| [[Synchronous%20concurrency|Synchronous concurrency]]
| Task
|-
Line 3,563 ⟶ 3,559:
| Task
|-
|
| [[XML%2FXPath|XML/XPath]]
| Task
|-
| 51
| [[Arithmetic%20evaluation|Arithmetic evaluation]]
| Task
|-
| 51
| [[Dinesman%27s%20multiple-dwelling%20problem|Dinesman's multiple-dwelling problem]]
| Task
|-
| 51
| [[Hash%20join|Hash join]]
| Task
|-
| 51
| [[Knapsack%20problem%2FContinuous|Knapsack problem/Continuous]]
| Task
|-
| 51
| [[Rep-string|Rep-string]]
| Task
|- style="background-color: #ffc"
| 51
| [[Repeat|Repeat]]
| Draft
|-
| 51
| [[Rosetta%20Code%2FCount%20examples|Rosetta Code/Count examples]]
| Task
|-
| 51
| [[Sequence%20of%20primes%20by%20trial%20division|Sequence of primes by trial division]]
| Task
|-
Line 3,600:
|-
| 50
| [[Add%20a%20variable%20to%20a%20class%20instance%20at%20runtime|Add a variable to a class instance at runtime]]
| Task
|-
| 50
| [[Brownian%20tree|Brownian tree]]
| Task
|-
Line 3,612:
|-
| 50
| [[Continued%20fraction|Continued fraction]]
| Task
|-
| 50
| [[
| Task
|-
| 50
| [[Miller%E2%80%93Rabin%20primality%20test|Miller–Rabin primality test]]
| Task
|-
| 50
| [[Runtime%20evaluation%2FIn%20an%20environment|Runtime evaluation/In an environment]]
| Task
|-
| 50
| [[Semiprime|Semiprime]]
| Task
|-
| 50
| [[Sorting%20algorithms%2FPermutation%20sort|Sorting algorithms/Permutation sort]]
| Task
|-
| 50
| [[Stack%20traces|Stack traces]]
| Task
|-
| 50
| [[Truncate%20a%20file|Truncate a file]]
| Task
|-
| 50
| [[Unbias%20a%20random%20generator|Unbias a random generator]]
| Task
|-
| 50
| [[
| Task
|-
| 49
| [[Averages%2FMean%20time%20of%20day|Averages/Mean time of day]]
| Task
|-
| 49
| [[Deal%20cards%20for%20FreeCell|Deal cards for FreeCell]]
| Task
|-
| 49
| [[Euler%27s%20sum%20of%20powers%20conjecture|Euler's sum of powers conjecture]]
| Task
|-
| 49
| [[Knight%27s%20tour|Knight's tour]]
| Task
|-
| 49
| [[LZW%20compression|LZW compression]]
| Task
|-
| 49
| [[Morse%20code|Morse code]]
| Task
|-
| 49
| [[Plot%20coordinate%20pairs|Plot coordinate pairs]]
| Task
|-
| 49
| [[
| Task
|-
Line 3,688:
|-
| 48
| [[Circles%20of%20given%20radius%20through%20two%20points|Circles of given radius through two points]]
| Task
|-
| 48
| [[Generator%2FExponential|Generator/Exponential]]
| Task
|-
Line 3,712 ⟶ 3,708:
|-
| 48
| [[Pointers%20and%20references|Pointers and references]]
| Task
|-
| 48
| [[Terminal%20control%2FDisplay%20an%20extended%20character|Terminal control/Display an extended character]]
| Task
|-
| 48
| [[Unicode%20strings|Unicode strings]]
| Task
|-
Line 3,724:
|-
| 47
| [[Doubly-linked%20list%2FElement%20definition|Doubly-linked list/Element definition]]
| Task
|-
| 47
| [[Dutch%20national%20flag%20problem|Dutch national flag problem]]
| Task
|-
| 47
| [[Integer%20overflow|Integer overflow]]
| Task
|-
| 47
| [[Left%20factorials|Left factorials]]
| Task
|-
| 47
| [[Mouse%20position|Mouse position]]
| Task
|-
| 47
| [[Multisplit|Multisplit]]
| Task
|-
| 47
| [[Non-continuous%20subsequences|Non-continuous subsequences]]
| Task
|-
| 47
| [[Rosetta%20Code%2FRank%20languages%20by%20popularity|Rosetta Code/Rank languages by popularity]]
| Task
|-
| 47
| [[Send%20email|Send email]]
| Task
|-
| 47
| [[Split%20a%20character%20string%20based%20on%20change%20of%20character|Split a character string based on change of character]]
| Task
|-
| 47
| [[Statistics%2FBasic|Statistics/Basic]]
| Task
|-
| 47
| [[Wireworld|Wireworld]]
| Task
|-
Line 3,776:
|-
| 46
| [[Nested%20function|Nested function]]
| Task
|-
| 46
|data-sort-value="text processing/
| Task
|-
| 46
|data-sort-value="text processing/0B2"| [[Text%20processing%2F2|Text processing/2]]
| Task
|-
| 46
| [[Truncatable%20primes|Truncatable primes]]
| Task
|-
| 46
| [[User%20input%2FGraphical|User input/Graphical]]
| Task
|-
| 45
| [[Define%20a%20primitive%20data%20type|Define a primitive data type]]
| Task
|-
| 45
| [[Draw%20a%20cuboid|Draw a cuboid]]
| Task
|-
| 45
| [[First-class%20functions%2FUse%20numbers%20analogously|First-class functions/Use numbers analogously]]
| Task
|-
| 45
| [[
| Task
|-
| 45
| [[JortSort|JortSort]]
| Task
|-
| 45
| [[Ludic%20numbers|Ludic numbers]]
| Task
|-
Line 3,824:
|-
| 45
| [[Munchausen%20numbers|Munchausen numbers]]
| Task
|-
| 45
| [[Random%20number%20generator%20%28device%29|Random number generator (device)]]
| Task
|-
| 45
| [[Respond%20to%20an%20unknown%20method%20call|Respond to an unknown method call]]
| Task
|-
| 45
| [[Seven-sided%20dice%20from%20five-sided%20dice|Seven-sided dice from five-sided dice]]
| Task
|-
| 45
| [[Stable%20marriage%20problem|Stable marriage problem]]
| Task
|-
| 45
| [[Thue-Morse|Thue-Morse]]
| Task
|-
| 45
| [[XML%2FDOM%20serialization|XML/DOM serialization]]
| Task
|-
Line 3,856:
|-
| 44
| [[Delegates|Delegates]]
| Task
|-
| 44
| [[General%20FizzBuzz|General FizzBuzz]]
| Task
|-
| 44
| [[Heronian%20triangles|Heronian triangles]]
| Task
|-
| 44
| [[Matrix-exponentiation%20operator|Matrix-exponentiation operator]]
| Task
|-
Line 3,876:
|-
| 44
| [[Sierpinski%20triangle%2FGraphical|Sierpinski triangle/Graphical]]
| Task
|-
| 44
| [[Table%20creation%2FPostal%20addresses|Table creation/Postal addresses]]
| Task
|-
| 44
| [[
| Task
|-
| 43
| [[Bernoulli%20numbers|Bernoulli numbers]]
| Task
|-
| 43
| [[Call%20a%20function%20in%20a%20shared%20library|Call a function in a shared library]]
| Task
|-
| 43
| [[Discordian%20date|Discordian date]]
| Task
|-
| 43
| [[Keyboard%20input%2FKeypress%20check|Keyboard input/Keypress check]]
| Task
|-
| 43
| [[Longest%20increasing%20subsequence|Longest increasing subsequence]]
| Task
|-
Line 3,920:
|-
| 42
|data-sort-value="0C15 puzzle game"| [[15%20Puzzle%20Game|15 Puzzle Game]]
| Task
|-
| 42
|data-sort-value="0B9 billion names of god the integer"| [[9%20billion%20names%20of%20God%20the%20integer|9 billion names of God the integer]]
| Task
|-
| 42
| [[Emirp%20primes|Emirp primes]]
| Task
|-
| 42
| [[Mad%20Libs|Mad Libs]]
| Task
|-
Line 3,940:
|-
| 42
| [[Send%20an%20unknown%20method%20call|Send an unknown method call]]
| Task
|-
| 41
| [[Color%20of%20a%20screen%20pixel|Color of a screen pixel]]
| Task
|-
Line 3,952:
|-
| 41
| [[Convert%20decimal%20number%20to%20rational|Convert decimal number to rational]]
| Task
|-
| 41
| [[Dining%20philosophers|Dining philosophers]]
| Task
|-
| 41
| [[Doubly-linked%20list%2FElement%20insertion|Doubly-linked list/Element insertion]]
| Task
|-
| 41
| [[Execute%20a%20Markov%20algorithm|Execute a Markov algorithm]]
|
|-
| 41
| [[Exponentiation%20order|Exponentiation order]]
| Task
|-
| 41
| [[Hofstadter%20Figure-Figure%20sequences|Hofstadter Figure-Figure sequences]]
| Task
|-
| 41
| [[Holidays%20related%20to%20Easter|Holidays related to Easter]]
| Task
|-
| 41
| [[
| Task
|-
| 41
| [[Iterated%20digits%20squaring|Iterated digits squaring]]
| Task
|-
| 41
| [[Longest%20string%20challenge|Longest string challenge]]
| Task
|-
Line 3,996:
|-
| 41
| [[Rate%20counter|Rate counter]]
| Task
|-
| 41
| [[Strip%20block%20comments|Strip block comments]]
| Task
|- style="background-color: #ffc"
| 41
| [[Two%20Sum|Two Sum]]
| Draft
|-
| 41
| [[Universal%20Turing%20machine|Universal Turing machine]]
| Task
|-
|
| [[Doubly-linked%20list%2FTraversal|Doubly-linked list/Traversal]]
| Task
|-
Line 4,020 ⟶ 4,024:
|-
| 40
| [[Move-to-front%20algorithm|Move-to-front algorithm]]
| Task
|-
Line 4,031 ⟶ 4,035:
| Task
|-
|
| [[Archimedean%20spiral|Archimedean spiral]]
| Task
|-
| 39
| [[Barnsley%20fern|Barnsley fern]]
| Task
|-
| 39
| [[Bitmap%2FFlood%20fill|Bitmap/Flood fill]]
| Task
|-
| 39
| [[Bitmap%2FRead%20a%20PPM%20file|Bitmap/Read a PPM file]]
| Task
|- style="background-color: #ffc"
| 39
| [[Extract%20file%20extension|Extract file extension]]
| Draft
|-
| 39
| [[GUI%20component%20interaction|GUI component interaction]]
| Task
|-
| 39
| [[Get%20system%20command%20output|Get system command output]]
| Task
|-
| 39
| [[Greyscale%20bars%2FDisplay|Greyscale bars/Display]]
| Task
|-
| 39
| [[Polynomial%20regression|Polynomial regression]]
| Task
|-
| 39
| [[Search%20a%20list%20of%20records|Search a list of records]]
| Task
|-
| 39
| [[Zebra%20puzzle|Zebra puzzle]]
| Task
|-
|
| [[Atomic%20updates|Atomic updates]]
| Task
|-
| 38
| [[DNS%20query|DNS query]]
| Task
|-
| 38
| [[Determine%20if%20only%20one%20instance%20is%20running|Determine if only one instance is running]]
| Task
|-
Line 4,096 ⟶ 4,100:
|-
| 38
| [[History%20variables|History variables]]
| Task
|-
| 38
| [[OpenGL|OpenGL]]
| Task
|-
| 38
| [[Polynomial%20long%20division|Polynomial long division]]
| Task
|-
Line 4,116 ⟶ 4,120:
|-
| 38
| [[Set%20consolidation|Set consolidation]]
| Task
|-
| 38
| [[Sorting%20algorithms%2FStrand%20sort|Sorting algorithms/Strand sort]]
| Task
|-
| 38
| [[Sparkline%20in%20unicode|Sparkline in unicode]]
| Task
|-
Line 4,136:
|-
| 37
| [[Image%20noise|Image noise]]
| Task
|-
| 37
| [[Parametric%20polymorphism|Parametric polymorphism]]
| Task
|-
| 37
| [[Perfect%20shuffle|Perfect shuffle]]
| Task
|-
| 37
| [[Pig%20the%20dice%20game|Pig the dice game]]
| Task
|-
| 37
| [[Subtractive%20generator|Subtractive generator]]
| Task
|-
| 37
| [[Terminal%20control%2FInverse%20video|Terminal control/Inverse video]]
| Task
|-
| 37
| [[Variable%20size%2FSet|Variable size/Set]]
| Task
|-
| 36
| [[Active%20object|Active object]]
| Task
|-
| 36
| [[Department%20Numbers|Department Numbers]]
| Task
|- style="background-color: #ffc"
| 36
| [[Dijkstra%27s%20algorithm|Dijkstra's algorithm]]
|
|-
| 36
| [[Doubly-linked%20list%2FDefinition|Doubly-linked list/Definition]]
| Task
|-
| 36
|data-sort-value="generate chess0D960 starting position"| [[Generate%20Chess960%20starting%20position|Generate Chess960 starting position]]
| Task
|-
| 36
| [[Inverted%20index|Inverted index]]
| Task
|-
| 36
|data-sort-value="md0B5/implementation"| [[MD5%2FImplementation|MD5/Implementation]]
| Task
|-
| 36
| [[Metaprogramming|Metaprogramming]]
| Task
|-
| 36
| [[Narcissist|Narcissist]]
| Task
|-
| 36
| [[Pascal%20matrix%20generation|Pascal matrix generation]]
| Task
|-
Line 4,213 ⟶ 4,209:
| 36
| [[Stern-Brocot%20sequence|Stern-Brocot sequence]]
| Task
|-
| 36
| [[Terminal%20control%2FColoured%20text|Terminal control/Coloured text]]
| Task
|-
Line 4,224:
|-
| 35
| [[Append%20a%20record%20to%20the%20end%20of%20a%20text%20file|Append a record to the end of a text file]]
| Task
|- style="background-color: #ffc"
| 35
|data-sort-value="base0C64 encode data"| [[Base64%20encode%20data|Base64 encode data]]
| Draft
|-
| 35
| [[Bitmap%2FMidpoint%20circle%20algorithm|Bitmap/Midpoint circle algorithm]]
| Task
|-
| 35
| [[Bulls%20and%20cows%2FPlayer|Bulls and cows/Player]]
| Task
|-
| 35
| [[Farey%20sequence|Farey sequence]]
| Task
|-
Line 4,244 ⟶ 4,248:
|-
| 35
| [[Kronecker%20product|Kronecker product]]
| Task
|-
| 35
| [[
| Task
|-
| 35
| [[Matrix%20arithmetic|Matrix arithmetic]]
| Task
|-
| 35
| [[Percentage%20difference%20between%20images|Percentage difference between images]]
| Task
|-
| 35
| [[Permutations%2FDerangements|Permutations/Derangements]]
| Task
|-
| 35
| [[Ray-casting%20algorithm|Ray-casting algorithm]]
| Task
|-
| 35
| [[Smith%20numbers|Smith numbers]]
| Task
|-
| 35
| [[Subleq|Subleq]]
| Task
|-
| 35
|data-sort-value="sum to 0D100"| [[Sum%20to%20100|Sum to 100]]
| Task
|-
| 35
| [[Validate%20International%20Securities%20Identification%20Number|Validate International Securities Identification Number]]
| Task
|-
Line 4,292:
|-
| 35
| [[Visualize%20a%20tree|Visualize a tree]]
| Task
|-
Line 4,298:
| [[Average%20loop%20length|Average loop length]]
| Task
|-
| 34
| [[Balanced%20ternary|Balanced ternary]]
| Task
|-
| 34
| [[Calendar%20-%20for%20%22REAL%22%20programmers|Calendar - for "REAL" programmers]]
| Task
|-
| 34
| [[Chaos%20game|Chaos game]]
| Task
|-
| 34
| [[Element-wise%20operations|Element-wise operations]]
| Task
|-
| 34
| [[GUI%20enabling%2Fdisabling%20of%20controls|GUI enabling/disabling of controls]]
| Task
|-
| 34
| [[Hickerson%20series%20of%20almost%20integers|Hickerson series of almost integers]]
| Task
|-
| 34
| [[Jaro%20distance|Jaro distance]]
| Task
|-
| 34
| [[Keyboard%20input%2FFlush%20the%20keyboard%20buffer|Keyboard input/Flush the keyboard buffer]]
| Task
|- style="background-color: #ffc"
| 34
| [[Longest%20common%20prefix|Longest common prefix]]
| Draft
|-
| 34
| [[Parallel%20calculations|Parallel calculations]]
| Task
|-
| 34
| [[Self-referential%20sequence|Self-referential sequence]]
| Task
|-
| 34
| [[Statistics%2FNormal%20distribution|Statistics/Normal distribution]]
| Task
|-
| 34
| [[Tokenize%20a%20string%20with%20escaping|Tokenize a string with escaping]]
| Task
|-
| 33
| [[Amb|Amb]]
| Task
|-
| 33
|data-sort-value="carmichael 0B3 strong pseudoprimes"| [[Carmichael%203%20strong%20pseudoprimes|Carmichael 3 strong pseudoprimes]]
| Task
|-
| 33
| [[Combinations%20and%20permutations|Combinations and permutations]]
| Task
|-
| 33
| [[Constrained%20genericity|Constrained genericity]]
| Task
|-
| 33
| [[Gaussian%20elimination|Gaussian elimination]]
| Task
|-
| 33
| [[Naming%20conventions|Naming conventions]]
| Task
|-
| 33
| [[Parsing%2FRPN%20to%20infix%20conversion|Parsing/RPN to infix conversion]]
| Task
|-
| 33
| [[Password%20generator|Password generator]]
| Task
|-
| 33
| [[Sorting%20algorithms%2FRadix%20sort|Sorting algorithms/Radix sort]]
| Task
|-
| 33
| [[Start%20from%20a%20main%20routine|Start from a main routine]]
| Task
|-
| 33
| [[Topswops|Topswops]]
| Task
|-
| 33
| [[Ulam%20spiral%20%28for%20primes%29|Ulam spiral (for primes)]]
| Task
|-
| 32
|data-sort-value="0E2048"| [[2048|2048]]
| Task
|-
| 32
|data-sort-value="0B4-rings or 0B4-squares puzzle"| [[4-rings%20or%204-squares%20puzzle|4-rings or 4-squares puzzle]]
| Task
|-
| 32
| [[Aliquot%20sequence%20classifications|Aliquot sequence classifications]]
| Task
|-
| 32
| [[Knuth%27s%20algorithm%20S|Knuth's algorithm S]]
| Task
|- style="background-color: #ffc"
| 32
| [[Multiline%20shebang|Multiline shebang]]
| Draft
|-
| 32
| [[Order%20disjoint%20list%20items|Order disjoint list items]]
| Task
|-
| 32
| [[
| Task
|-
| 32
| [[S-Expressions|S-Expressions]]
| Task
|-
| 32
| [[Sort%20three%20variables|Sort three variables]]
| Task
|-
Line 4,440:
|-
| 32
| [[Vampire%20number|Vampire number]]
| Task
|-
| 31
| [[Break%20OO%20privacy|Break OO privacy]]
| Task
|-
| 31
| [[CUSIP|CUSIP]]
| Task
|-
| 31
| [[Deepcopy|Deepcopy]]
| Task
|-
| 31
| [[
| Task
|-
| 31
| [[Extensible%20prime%20generator|Extensible prime generator]]
| Task
|-
| 31
|data-sort-value="md0B4"| [[MD4|MD4]]
| Task
|-
| 31
| [[Metered%20concurrency|Metered concurrency]]
| Task
|-
| 31
| [[Permutation%20test|Permutation test]]
| Task
|-
| 31
| [[Taxicab%20numbers|Taxicab numbers]]
| Task
|- style="background-color: #ffc"
| 31
| [[Vector|Vector]]
| Draft
|-
| 31
Line 4,488:
|-
| 30
| [[Bitmap%2FB%C3%A9zier%20curves%2FCubic|Bitmap/Bézier curves/Cubic]]
| Task
|-
| 30
| [[Cartesian%20product%20of%20two%20or%20more%20lists|Cartesian product of two or more lists]]
| Task
|-
| 30
| [[Casting%20out%20nines|Casting out nines]]
| Task
|-
| 30
| [[Fibonacci%20word%2Ffractal|Fibonacci word/fractal]]
| Task
|-
| 30
| [[
| Task
|-
| 30
| [[GUI%2FMaximum%20window%20dimensions|GUI/Maximum window dimensions]]
| Task
|-
| 30
| [[LU%20decomposition|LU decomposition]]
| Task
|-
| 30
| [[Numerical%20integration%2FGauss-Legendre%20Quadrature|Numerical integration/Gauss-Legendre Quadrature]]
| Task
|-
| 30
| [[Ordered%20Partitions|Ordered Partitions]]
| Task
|- style="background-color: #ffc"
Line 4,528:
|-
| 30
| [[Scope%2FFunction%20names%20and%20labels|Scope/Function names and labels]]
| Task
|-
| 30
| [[Speech%20synthesis|Speech synthesis]]
| Task
|-
| 29
| [[Bitmap%2FHistogram|Bitmap/Histogram]]
| Task
|-
Line 4,546 ⟶ 4,542:
| [[Conjugate%20transpose|Conjugate transpose]]
| Task
|- style="background-color: #ffc"
| 29
| [[Input%2FOutput%20for%20Pairs%20of%20Numbers|Input/Output for Pairs of Numbers]]
| Draft
|-
| 29
| [[Julia%20set|Julia set]]
| Task
|-
Line 4,560:
|-
| 28
| [[Bitmap%2FB%C3%A9zier%20curves%2FQuadratic|Bitmap/Bézier curves/Quadratic]]
| Task
|-
| 28
| [[Bitwise%20IO|Bitwise IO]]
| Task
|-
| 28
| [[Elementary%20cellular%20automaton|Elementary cellular automaton]]
| Task
|-
| 28
| [[Executable%20library|Executable library]]
| Task
|-
| 28
| [[Find%20the%20intersection%20of%20two%20lines|Find the intersection of two lines]]
| Task
|-
| 28
| [[Flipping%20bits%20game|Flipping bits game]]
| Task
|-
| 28
| [[Minesweeper%20game|Minesweeper game]]
| Task
|-
| 28
| [[Object%20serialization|Object serialization]]
| Task
|- style="background-color: #ffc"
| 28
| [[Parse%20command-line%20arguments|Parse command-line arguments]]
| Draft
|-
| 28
| [[Primorial%20numbers|Primorial numbers]]
| Task
|-
| 28
| [[Simple%20database|Simple database]]
| Task
|-
| 28
| [[Sutherland-Hodgman%20polygon%20clipping|Sutherland-Hodgman polygon clipping]]
| Task
|-
| 28
| [[Terminal%20control%2FUnicode%20output|Terminal control/Unicode output]]
| Task
|-
| 28
| [[Topic%20variable|Topic variable]]
| Task
|-
| 28
| [[Water%20collected%20between%20towers|Water collected between towers]]
| Task
|-
| 27
| [[Bitcoin%2Faddress%20validation|Bitcoin/address validation]]
| Task
|-
| 27
| [[Colour%20pinstripe%2FDisplay|Colour pinstripe/Display]]
| Task
|- style="background-color: #ffc"
| 27
| [[File%20extension%20is%20in%20extensions%20list|File extension is in extensions list]]
| Draft
|- style="background-color: #ffc"
Line 4,640 ⟶ 4,636:
|-
| 27
| [[Multiple%20regression|Multiple regression]]
| Task
|-
| 27
| [[Penney%27s%20game|Penney's game]]
| Task
|-
Line 4,650 ⟶ 4,646:
| [[Pinstripe%2FDisplay|Pinstripe/Display]]
| Task
|- style="background-color: #ffc"
| 27
| [[Sattolo%20cycle|Sattolo cycle]]
| Draft
|-
| 26
| [[Memory%20layout%20of%20a%20data%20structure|Memory layout of a data structure]]
| Task
|-
| 26
| [[Numeric%20error%20propagation|Numeric error propagation]]
| Task
|-
| 26
| [[Pathological%20floating%20point%20problems|Pathological floating point problems]]
| Task
|-
| 26
| [[RSA%20code|RSA code]]
| Task
|-
| 26
| [[Ranking%20methods|Ranking methods]]
| Task
|-
| 26
| [[Sailors%2C%20coconuts%20and%20a%20monkey%20problem|Sailors, coconuts and a monkey problem]]
| Task
|-
| 26
| [[Set%20puzzle|Set puzzle]]
| Task
|- style="background-color: #ffc"
| 26
| [[Sorting%20Algorithms%2FCircle%20Sort|Sorting Algorithms/Circle Sort]]
| Draft
|-
| 26
| [[Zhang-Suen%20thinning%20algorithm|Zhang-Suen thinning algorithm]]
| Task
|-
| 25
| [[Arena%20storage%20pool|Arena storage pool]]
| Task
|- style="background-color: #ffc"
| 25
| [[Check%20output%20device%20is%20a%20terminal|Check output device is a terminal]]
| Draft
|-
| 25
| [[Continued%20fraction%2FArithmetic%2FConstruct%20from%20rational%20number|Continued fraction/Arithmetic/Construct from rational number]]
| Task
|-
| 25
| [[Entropy%2FNarcissist|Entropy/Narcissist]]
| Task
|-
| 25
| [[Execute%20SNUSP|Execute SNUSP]]
| Task
|-
| 25
| [[First%20class%20environments|First class environments]]
| Task
|-
| 25
| [[Floyd-Warshall%20algorithm|Floyd-Warshall algorithm]]
|
|-
| 25
| [[Formal%20power%20series|Formal power series]]
| Task
|- style="background-color: #ffc"
| 25
| [[Longest%20Common%20Substring|Longest Common Substring]]
| Draft
|-
| 25
| [[Magic%20squares%20of%20doubly%20even%20order|Magic squares of doubly even order]]
| Task
|-
| 25
| [[Multiplicative%20order|Multiplicative order]]
| Task
|-
Line 4,732 ⟶ 4,736:
|-
| 25
| [[QR%20decomposition|QR decomposition]]
| Task
|-
| 25
|data-sort-value="ripemd-0D160"| [[RIPEMD-160|RIPEMD-160]]
| Task
|- style="background-color: #ffc"
| 25
|data-sort-value="read a file character by character/utf0B8"| [[Read%20a%20file%20character%20by%20character%2FUTF8|Read a file character by character/UTF8]]
|
|-
| 25
| [[Same%20Fringe|Same Fringe]]
| Task
|-
Line 4,756:
|-
| 25
| [[State%20name%20puzzle|State name puzzle]]
| Task
|-
| 25
| [[Straddling%20checkerboard|Straddling checkerboard]]
| Task
|- style="background-color: #ffc"
| 25
| [[Subset%20sum%20problem|Subset sum problem]]
| Draft
|-
| 25
| [[Textonyms|Textonyms]]
| Task
|-
| 25
| [[Update%20a%20configuration%20file|Update a configuration file]]
| Task
|-
Line 4,778:
| [[Use%20another%20language%20to%20call%20a%20function|Use another language to call a function]]
| Task
|-
| 25
| [[Xiaolin%20Wu%27s%20line%20algorithm|Xiaolin Wu's line algorithm]]
|
|-
| 24
Line 4,788:
|-
| 24
| [[
| Task
|-
| 24
Line 4,804 ⟶ 4,800:
|-
| 24
| [[Egyptian%20division|Egyptian division]]
| Task
|-
| 24
| [[Find%20palindromic%20numbers%20in%20both%20binary%20and%20ternary%20bases|Find palindromic numbers in both binary and ternary bases]]
| Task
|-
| 24
| [[
| Task
|-
| 24
| [[Metronome|Metronome]]
| Task
|- style="background-color: #ffc"
| 24
| [[Musical%20scale|Musical scale]]
| Draft
|-
| 24
| [[Pragmatic%20directives|Pragmatic directives]]
| Task
|-
| 24
| [[
| Task
|-
Line 4,836 ⟶ 4,832:
|-
| 24
| [[Rosetta%20Code%2FFix%20code%20tags|Rosetta Code/Fix code tags]]
| Task
|- style="background-color: #ffc"
|
| [[Sorting%20algorithms%2FCycle%20sort|Sorting algorithms/Cycle sort]]
| Draft
|-
| 23
| [[Arithmetic-geometric%20mean%2FCalculate%20Pi|Arithmetic-geometric mean/Calculate Pi]]
| Task
|-
Line 4,852 ⟶ 4,848:
|-
| 23
| [[Death%20Star|Death Star]]
| Task
|- style="background-color: #ffc"
| 23
| [[Find%20first%20and%20last%20set%20bit%20of%20a%20long%20integer|Find first and last set bit of a long integer]]
| Draft
|-
| 23
| [[Lychrel%20numbers|Lychrel numbers]]
| Task
|-
| 23
| [[Natural%20sorting|Natural sorting]]
| Task
|-
| 23
| [[
| Task
|-
| 23
| [[Pattern%20matching|Pattern matching]]
| Task
|-
Line 4,876:
|-
| 23
| [[Solve%20the%20no%20connection%20puzzle|Solve the no connection puzzle]]
| Task
|-
| 23
| [[Sort%20a%20list%20of%20object%20identifiers|Sort a list of object identifiers]]
| Task
|- style="background-color: #ffc"
| 23
| [[Sorting%20algorithms%2FPatience%20sort|Sorting algorithms/Patience sort]]
| Draft
|-
| 23
Line 4,888 ⟶ 4,892:
|-
| 23
|data-sort-value="window creation/x0C11"| [[Window%20creation%2FX11|Window creation/X11]]
| Task
|-
| 22
| [[Active%20Directory%2FConnect|Active Directory/Connect]]
| Task
|-
| 22
| [[Angle%20difference%20between%20two%20bearings|Angle difference between two bearings]]
| Task
|-
| 22
| [[Check%20Machin-like%20formulas|Check Machin-like formulas]]
| Task
|-
Line 4,904 ⟶ 4,912:
|-
| 22
| [[
| Task
|-
| 22
| [[Galton%20box%20animation|Galton box animation]]
| Task
|-
| 22
| [[Go%20Fish|Go Fish]]
| Task
|- style="background-color: #ffc"
| 22
| [[
| Draft
|-
Line 4,920 ⟶ 4,932:
|-
| 22
| [[Terminal%20control%2FCursor%20movement|Terminal control/Cursor movement]]
| Task
|- style="background-color: #ffc"
Line 4,928 ⟶ 4,940:
|- style="background-color: #ffc"
| 22
| [[
| Draft
|-
| 22
| [[Write%20to%20Windows%20event%20log|Write to Windows event log]]
| Task
|- style="background-color: #ffc"
| 21
| [[Check%20input%20device%20is%20a%20terminal|Check input device is a terminal]]
|
|-
| 21
| [[Checkpoint%20synchronization|Checkpoint synchronization]]
| Task
|- style="background-color: #ffc"
| 21
| [[Currency|Currency]]
| Draft
|-
Line 4,964:
|-
| 21
| [[Honeycombs|Honeycombs]]
| Task
|- style="background-color: #ffc"
| 21
| [[Implicit%20type%20conversion|Implicit type conversion]]
| Draft
|-
| 21
Line 4,973 ⟶ 4,977:
| 21
| [[Sum%20and%20Product%20Puzzle|Sum and Product Puzzle]]
| Task
|- style="background-color: #ffc"
| 21
| [[Table%20creation|Table creation]]
| Draft
|-
| 21
| [[Terminal%20control%2FPreserve%20screen|Terminal control/Preserve screen]]
|
|-
| 21
| [[The%20ISAAC%20Cipher|The ISAAC Cipher]]
| Task
|-
Line 4,994:
| [[URL%20parser|URL parser]]
| Task
|-
| 21
|data-sort-value="utf-0B8 encode and decode"| [[UTF-8%20encode%20and%20decode|UTF-8 encode and decode]]
|
|-
| 21
| [[Verify%20distribution%20uniformity%2FChi-squared%20test|Verify distribution uniformity/Chi-squared test]]
| Task
|- style="background-color: #ffc"
| 21
| [[
| Draft
|- style="background-color: #ffc"
| 20
| [[Birthday%20problem|Birthday problem]]
|
|-
| 20
| [[Chat%20server|Chat server]]
| Task
|- style="background-color: #ffc"
| 20
| [[Cycle%20detection|Cycle detection]]
| Draft
|- style="background-color: #ffc"
| 20
| [[Decimal%20floating%20point%20number%20to%20binary|Decimal floating point number to binary]]
| Draft
|-
| 20
| [[Function%20frequency|Function frequency]]
| Task
|-
| 20
| [[Image%20convolution|Image convolution]]
| Task
|-
| 20
| [[MAC%20Vendor%20Lookup|MAC Vendor Lookup]]
| Task
|- style="background-color: #ffc"
| 20
| [[Multi-dimensional%20array|Multi-dimensional array]]
| Draft
|-
| 20
| [[Partition%20an%20integer%20X%20into%20N%20primes|Partition an integer X into N primes]]
| Task
|-
| 20
| [[Pentagram|Pentagram]]
| Task
|-
| 20
| [[Percolation%2FMean%20run%20density|Percolation/Mean run density]]
|
|-
| 20
| [[Permutations%2FRank%20of%20a%20permutation|Permutations/Rank of a permutation]]
| Task
|-
| 20
| [[Play%20recorded%20sounds|Play recorded sounds]]
| Task
|-
| 20
| [[
| Task
|- style="background-color: #ffc"
| 20
| [[Ramsey%27s%20theorem|Ramsey's theorem]]
| Draft
|-
| 20
| [[Safe%20addition|Safe addition]]
| Task
|-
| 20
| [[Set%20of%20real%20numbers|Set of real numbers]]
| Task
|-
| 20
| [[Shoelace%20formula%20for%20polygonal%20area|Shoelace formula for polygonal area]]
| Task
|-
| 20
| [[Simulate%20input%2FKeyboard|Simulate input/Keyboard]]
| Task
|-
| 20
| [[Solve%20a%20Holy%20Knight%27s%20tour|Solve a Holy Knight's tour]]
| Task
|- style="background-color: #ffc"
| 20
| [[Substitution%20Cipher|Substitution Cipher]]
| Draft
|-
| 19
| [[Cut%20a%20rectangle|Cut a rectangle]]
| Task
|- style="background-color: #ffc"
| 19
| [[Damm%20algorithm|Damm algorithm]]
| Draft
|- style="background-color: #ffc"
| 19
| [[Decision%20tables|Decision tables]]
| Draft
|- style="background-color: #ffc"
Line 5,114 ⟶ 5,106:
| [[Elliptic%20curve%20arithmetic|Elliptic curve arithmetic]]
| Draft
|-
| 19
| [[HTTPS%2FAuthenticated|HTTPS/Authenticated]]
| Task
|- style="background-color: #ffc"
| 19
| [[Idiomatically%20determine%20all%20the%20lowercase%20and%20uppercase%20letters|Idiomatically determine all the lowercase and uppercase letters]]
| Draft
|-
| 19
|data-sort-value="main step of gost 0F28147-0C89"| [[Main%20step%20of%20GOST%2028147-89|Main step of GOST 28147-89]]
| Task
|- style="background-color: #ffc"
| 19
| [[Old%20Russian%20measure%20of%20length|Old Russian measure of length]]
| Draft
|-
| 19
| [[Record%20sound|Record sound]]
| Task
|-
Line 5,128 ⟶ 5,132:
|-
| 19
| [[Thiele%27s%20interpolation%20formula|Thiele's interpolation formula]]
| Task
|-
| 19
| [[Total%20circles%20area|Total circles area]]
| Task
|-
Line 5,140 ⟶ 5,144:
|-
| 19
| [[Yahoo%21%20search%20interface|Yahoo! search interface]]
| Task
|-
| 18
Line 5,152:
|-
| 18
| [[Create%20an%20object%20at%20a%20given%20address|Create an object at a given address]]
| Task
|- style="background-color: #ffc"
| 18
| [[Dice%20game%20probabilities|Dice game probabilities]]
|
|-
| 18
Line 5,164:
|-
| 18
| [[Hough%20transform|Hough transform]]
| Task
|-
| 18
| [[K-means%2B%2B%20clustering|K-means++ clustering]]
| Task
|- style="background-color: #ffc"
| 18
| [[Make%20a%20backup%20file|Make a backup file]]
| Draft
|-
Line 5,178:
| [[Parse%20an%20IP%20Address|Parse an IP Address]]
| Task
|-
| 18
| [[Poker%20hand%20analyser|Poker hand analyser]]
|
|- style="background-color: #ffc"
| 18
| [[Reflection%2FList%20methods|Reflection/List methods]]
| Draft
|-
| 18
| [[Stream%20Merge|Stream Merge]]
| Task
|- style="background-color: #ffc"
Line 5,196:
|-
| 17
| [[Draw%20a%20rotating%20cube|Draw a rotating cube]]
| Task
|- style="background-color: #ffc"
| 17
| [[
| Draft
|- style="background-color: #ffc"
| 17
| [[Modular%20arithmetic|Modular arithmetic]]
| Draft
|-
| 17
| [[Parallel%20Brute%20Force|Parallel Brute Force]]
| Task
|-
| 17
| [[Pig%20the%20dice%20game%2FPlayer|Pig the dice game/Player]]
| Task
|-
| 17
| [[Plasma%20effect|Plasma effect]]
| Task
|- style="background-color: #ffc"
| 17
| [[Playfair%20cipher|Playfair cipher]]
| Draft
|-
| 17
| [[Polyspiral|Polyspiral]]
| Task
|-
| 17
| [[Reflection%2FList%20properties|Reflection/List properties]]
|
|-
| 17
| [[SOAP|SOAP]]
|
|- style="background-color: #ffc"
| 17
| [[Sequence%20of%20primorial%20primes|Sequence of primorial primes]]
| Draft
|-
| 17
| [[Sokoban|Sokoban]]
| Task
|- style="background-color: #ffc"
| 16
| [[Elementary%20cellular%20automaton%2FRandom%20Number%20Generator|Elementary cellular automaton/Random Number Generator]]
| Draft
|- style="background-color: #ffc"
| 16
| [[Idiomatically%20determine%20all%20the%20characters%20that%20can%20be%20used%20for%20symbols|Idiomatically determine all the characters that can be used for symbols]]
| Draft
|- style="background-color: #ffc"
| 16
Line 5,250 ⟶ 5,258:
| [[Kronecker%20product%20based%20fractals|Kronecker product based fractals]]
| Task
|- style="background-color: #ffc"
| 16
| [[Linux%20CPU%20utilization|Linux CPU utilization]]
| Draft
|-
| 16
| [[Median%20filter|Median filter]]
| Task
|- style="background-color: #ffc"
| 16
| [[Perlin%20noise|Perlin noise]]
|
|-
| 16
| [[Pythagorean%20quadruples|Pythagorean quadruples]]
| Task
|-
| 16
| [[Simulate%20input%2FMouse|Simulate input/Mouse]]
| Task
|-
Line 5,288 ⟶ 5,284:
|- style="background-color: #ffc"
| 15
| [[Bacon%20cipher|Bacon cipher]]
| Draft
|- style="background-color: #ffc"
| 15
| [[Card%20shuffles|Card shuffles]]
|
|-
| 15
Line 5,300 ⟶ 5,296:
|- style="background-color: #ffc"
| 15
| [[Levenshtein%20distance%2FAlignment|Levenshtein distance/Alignment]]
| Draft
|-
| 15
| [[
|
|-
|
| [[Solve%20a%20Numbrix%20puzzle|Solve a Numbrix puzzle]]
| Task
|- style="background-color: #ffc"
| 14
| [[Assertions%20in%20design%20by%20contract|Assertions in design by contract]]
| Draft
|- style="background-color: #ffc"
| 14
| [[AudioAlarm|AudioAlarm]]
| Draft
|- style="background-color: #ffc"
| 14
| [[Chebyshev%20coefficients|Chebyshev coefficients]]
| Draft
|- style="background-color: #ffc"
Line 5,322:
| [[Deming%27s%20Funnel|Deming's Funnel]]
| Draft
|- style="background-color: #ffc"
| 14
| [[Elementary%20cellular%20automaton%2FInfinite%20length|Elementary cellular automaton/Infinite length]]
|
|- style="background-color: #ffc"
| 14
| [[Faulhaber%27s%20formula|Faulhaber's formula]]
| Draft
|- style="background-color: #ffc"
| 14
| [[
| Draft
|-
| 14
| [[K-d%20tree|K-d tree]]
| Task
|-
| 14
| [[Magic%20squares%20of%20singly%20even%20order|Magic squares of singly even order]]
| Task
|- style="background-color: #ffc"
| 14
| [[Names%20to%20numbers|Names to numbers]]
| Draft
|- style="background-color: #ffc"
| 14
| [[Native%20shebang|Native shebang]]
| Draft
|-
| 14
| [[Negative%20base%20numbers|Negative base numbers]]
| Task
|- style="background-color: #ffc"
| 14
| [[Reverse%20the%20gender%20of%20a%20string|Reverse the gender of a string]]
| Draft
|- style="background-color: #ffc"
Line 5,358 ⟶ 5,362:
| [[Selective%20File%20Copy|Selective File Copy]]
| Draft
|-
| 14
| [[Solve%20a%20Hopido%20puzzle|Solve a Hopido puzzle]]
|
|- style="background-color: #ffc"
| 14
| [[Tonelli-Shanks%20algorithm|Tonelli-Shanks algorithm]]
| Draft
|-
| 14
| [[Vigen%C3%A8re%20cipher%2FCryptanalysis|Vigenère cipher/Cryptanalysis]]
| Task
|-
| 14
| [[World%20Cup%20group%20stage|World Cup group stage]]
| Task
|- style="background-color: #ffc"
|
| [[A%2A%20search%20algorithm|A* search algorithm]]
| Draft
|-
| 13
| [[Apply%20a%20digital%20filter%20%28direct%20form%20II%20transposed%29|Apply a digital filter (direct form II transposed)]]
| Task
|-
Line 5,388 ⟶ 5,392:
|- style="background-color: #ffc"
| 13
| [[Cipolla%27s%20algorithm|Cipolla's algorithm]]
| Draft
|-
| 13
| [[Color%20quantization|Color quantization]]
| Task
|- style="background-color: #ffc"
| 13
| [[Create%20an%20object%2FNative%20demonstration|Create an object/Native demonstration]]
| Draft
|- style="background-color: #ffc"
| 13
| [[Fivenum|Fivenum]]
| Draft
|-
Line 5,416 ⟶ 5,412:
|-
| 13
| [[Percolation%2FSite%20percolation|Percolation/Site percolation]]
| Task
|-
| 13
| [[Rendezvous|Rendezvous]]
| Task
|-
| 13
| [[SQL-based%20authentication|SQL-based authentication]]
| Task
|-
| 13
| [[Sierpinski%20pentagon|Sierpinski pentagon]]
| Task
|- style="background-color: #ffc"
Line 5,430:
| [[Superpermutation%20minimisation|Superpermutation minimisation]]
| Draft
|-
| 13
| [[Terminal%20control%2FPositional%20read|Terminal control/Positional read]]
|
|- style="background-color: #ffc"
| 13
| [[Type%20detection|Type detection]]
| Draft
|-
| 13
| [[Video%20display%20modes|Video display modes]]
| Task
|-
| 12
| [[Bitmap%2FRead%20an%20image%20through%20a%20pipe|Bitmap/Read an image through a pipe]]
| Task
|- style="background-color: #ffc"
| 12
| [[Convex%20hull|Convex hull]]
| Draft
|- style="background-color: #ffc"
| 12
| [[Diversity%20prediction%20theorem|Diversity prediction theorem]]
| Draft
|- style="background-color: #ffc"
| 12
| [[I.Q.%20Puzzle|I.Q. Puzzle]]
| Draft
|-
| 12
| [[Joystick%20position|Joystick position]]
| Task
|-
Line 5,462 ⟶ 5,470:
| [[Most%20frequent%20k%20chars%20distance|Most frequent k chars distance]]
| Draft
|-
| 12
| [[Percolation%2FBond%20percolation|Percolation/Bond percolation]]
|
|-
| 12
Line 5,474 ⟶ 5,482:
| [[Reflection%2FGet%20source|Reflection/Get source]]
| Task
|-
| 12
| [[Retrieve%20and%20search%20chat%20history|Retrieve and search chat history]]
| Task
|- style="background-color: #ffc"
| 12
| [[Untrusted%20environment|Untrusted environment]]
| Draft
|- style="background-color: #ffc"
| 12
| [[Word%20break%20problem|Word break problem]]
| Draft
|- style="background-color: #ffc"
| 11
| [[Arithmetic%20coding%2FAs%20a%20generalized%20change%20of%20radix|Arithmetic coding/As a generalized change of radix]]
| Draft
|- style="background-color: #ffc"
| 11
| [[Bilinear%20interpolation|Bilinear interpolation]]
| Draft
|-
| 11
| [[Compare%20sorting%20algorithms%27%20performance|Compare sorting algorithms' performance]]
| Task
|- style="background-color: #ffc"
| 11
| [[
| Draft
|- style="background-color: #ffc"
| 11
| [[Find%20URI%20in%20text|Find URI in text]]
| Draft
|-
| 11
| [[Find%20the%20intersection%20of%20a%20line%20with%20a%20plane|Find the intersection of a line with a plane]]
| Task
|- style="background-color: #ffc"
| 11
| [[Knuth%27s%20power%20tree|Knuth's power tree]]
| Draft
|- style="background-color: #ffc"
| 11
| [[List%20rooted%20trees|List rooted trees]]
| Draft
|- style="background-color: #ffc"
Line 5,524 ⟶ 5,532:
|- style="background-color: #ffc"
| 11
| [[N-body%20problem|N-body problem]]
| Draft
|- style="background-color: #ffc"
| 11
| [[NYSIIS|NYSIIS]]
|
|- style="background-color: #ffc"
| 11
| [[Polynomial%20synthetic%20division|Polynomial synthetic division]]
| Draft
|- style="background-color: #ffc"
| 11
| [[Proof|Proof]]
| Draft
|-
| 11
| [[Ramer-Douglas-Peucker%20line%20simplification|Ramer-Douglas-Peucker line simplification]]
| Task
|- style="background-color: #ffc"
| 11
| [[Separate%20the%20house%20number%20from%20the%20street%20name|Separate the house number from the street name]]
| Draft
|- style="background-color: #ffc"
| 11
| [[Shortest%20common%20supersequence|Shortest common supersequence]]
| Draft
|-
| 11
| [[Vogel%27s%20approximation%20method|Vogel's approximation method]]
| Task
|- style="background-color: #ffc"
| 10
| [[Aspect%20Oriented%20Programming|Aspect Oriented Programming]]
| Draft
|-
|
| [[Commatizing%20numbers|Commatizing numbers]]
| Task
|-
| 10
| [[Compiler%2Fcode%20generator|Compiler/code generator]]
| Task
|-
| 10
| [[Compiler%2Fvirtual%20machine%20interpreter|Compiler/virtual machine interpreter]]
| Task
|- style="background-color: #ffc"
|
| [[Determine%20if%20two%20triangles%20overlap|Determine if two triangles overlap]]
| Draft
|- style="background-color: #ffc"
| 10
| [[Find%20duplicate%20files|Find duplicate files]]
| Draft
|- style="background-color: #ffc"
Line 5,576 ⟶ 5,592:
|-
| 10
| [[HTTPS%2FClient-authenticated|HTTPS/Client-authenticated]]
| Task
|- style="background-color: #ffc"
| 10
| [[Markov%20chain%20text%20generator|Markov chain text generator]]
| Draft
|- style="background-color: #ffc"
| 10
Line 5,588 ⟶ 5,608:
|-
| 10
| [[Nonogram%20solver|Nonogram solver]]
| Task
|- style="background-color: #ffc"
| 10
| [[P-value%20correction|P-value correction]]
| Draft
|-
| 10
| [[Primes%20-%20allocate%20descendants%20to%20their%20ancestors|Primes - allocate descendants to their ancestors]]
| Task
|- style="background-color: #ffc"
| 10
Line 5,614 ⟶ 5,626:
| [[Snake|Snake]]
| Draft
|- style="background-color: #ffc"
| 10
Line 5,635 ⟶ 5,631:
| Draft
|-
|
| [[Zeckendorf%20arithmetic|Zeckendorf arithmetic]]
| Task
|- style="background-color: #ffc"
| 9
| [[Abbreviations%2C%20automatic|Abbreviations, automatic]]
| Draft
|- style="background-color: #ffc"
Line 5,652 ⟶ 5,644:
|-
| 9
| [[Bitmap%2FPPM%20conversion%20through%20a%20pipe|Bitmap/PPM conversion through a pipe]]
| Task
|- style="background-color: #ffc"
| 9
| [[Code%20segment%20unload|Code segment unload]]
| Draft
|- style="background-color: #ffc"
| 9
| [[Color%20wheel|Color wheel]]
| Draft
|- style="background-color: #ffc"
| 9
| [[Continued%20fraction%2FArithmetic%2FG%28matrix%20NG%2C%20Contined%20Fraction%20N%29|Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)]]
| Draft
|-
| 9
| [[
| Task
|- style="background-color: #ffc"
| 9
| [[File%20size%20distribution|File size distribution]]
| Draft
|- style="background-color: #ffc"
| 9
| [[Four%20is%20magic|Four is magic]]
| Draft
|- style="background-color: #ffc"
| 9
| [[Free%20polyominoes%20enumeration|Free polyominoes enumeration]]
| Draft
|- style="background-color: #ffc"
| 9
| [[
| Draft
|- style="background-color: #ffc"
| 9
| [[Transportation%20problem|Transportation problem]]
| Draft
|- style="background-color: #ffc"
| 9
| [[VList|VList]]
| Draft
|-
| 9
| [[Word%20search|Word search]]
| Task
|- style="background-color: #ffc"
| 9
| [[XML%20Validation|XML Validation]]
| Draft
|-
Line 5,698:
| [[Compiler%2FAST%20interpreter|Compiler/AST interpreter]]
| Task
|-
| 8
| [[Compiler%2Fsyntax%20analyzer|Compiler/syntax analyzer]]
|
|- style="background-color: #ffc"
| 8
| [[Finite%20state%20machine|Finite state machine]]
| Draft
|-
Line 5,712:
|- style="background-color: #ffc"
| 8
| [[Kosaraju|Kosaraju]]
| Draft
|- style="background-color: #ffc"
| 8
| [[Largest%20number%20divisible%20by%20its%20digits|Largest number divisible by its digits]]
| Draft
|- style="background-color: #ffc"
| 8
| [[Loops%2FIncrement%20loop%20index%20within%20loop%20body|Loops/Increment loop index within loop body]]
| Draft
|- style="background-color: #ffc"
| 8
| [[Montgomery%20reduction|Montgomery reduction]]
| Draft
|- style="background-color: #ffc"
| 8
| [[Perceptron|Perceptron]]
|
|- style="background-color: #ffc"
| 8
| [[Self-hosting%20compiler|Self-hosting compiler]]
| Draft
|- style="background-color: #ffc"
| 7
| [[Abbreviations%2C%20easy|Abbreviations, easy]]
| Draft
|-
| 7
| [[Canny%20edge%20detector|Canny edge detector]]
| Task
|-
| 7
|data-sort-value="deconvolution/0B2d+"| [[Deconvolution%2F2D%2B|Deconvolution/2D+]]
| Task
|- style="background-color: #ffc"
| 7
| [[Generalised%20floating%20point%20addition|Generalised floating point addition]]
| Draft
|- style="background-color: #ffc"
| 7
| [[IPC%20via%20named%20pipe|IPC via named pipe]]
| Draft
|- style="background-color: #ffc"
| 7
| [[Mastermind|Mastermind]]
| Draft
|- style="background-color: #ffc"
| 7
| [[Monads%2FWriter%20monad|Monads/Writer monad]]
|
|- style="background-color: #ffc"
| 7
| [[Orbital%20elements|Orbital elements]]
| Draft
|- style="background-color: #ffc"
| 7
| [[Particle%20Swarm%20Optimization|Particle Swarm Optimization]]
| Draft
|- style="background-color: #ffc"
| 7
| [[Run%20as%20a%20daemon%20or%20service|Run as a daemon or service]]
|
|- style="background-color: #ffc"
| 7
| [[Singly-linked%20list%2FElement%20removal|Singly-linked list/Element removal]]
| Draft
|-
| 7
| [[
| Task
|- style="background-color: #ffc"
| 7
| [[Time-based%20One-time%20Password%20Algorithm|Time-based One-time Password Algorithm]]
| Draft
|- style="background-color: #ffc"
Line 5,783 ⟶ 5,791:
| Draft
|- style="background-color: #ffc"
|
| [[Addition%20chains|Addition chains]]
| Draft
|- style="background-color: #ffc"
| 6
| [[Banker%27s%20algorithm|Banker's algorithm]]
| Draft
|-
Line 5,804 ⟶ 5,808:
|- style="background-color: #ffc"
| 6
| [[Just%20in%20time%20processing%20on%20a%20character%20stream|Just in time processing on a character stream]]
| Draft
|- style="background-color: #ffc"
Line 5,816:
|- style="background-color: #ffc"
| 6
| [[Parse%20EBNF|Parse EBNF]]
| Draft
|- style="background-color: #ffc"
| 5
| [[ASCII%20art%20diagram%20converter|ASCII art diagram converter]]
| Draft
|- style="background-color: #ffc"
| 5
| [[Abbreviations%2C%20simple|Abbreviations, simple]]
| Draft
|- style="background-color: #ffc"
| 5
| [[Audio%20frequency%20generator|Audio frequency generator]]
| Draft
|- style="background-color: #ffc"
| 5
| [[Combinations%20with%20repetitions%2FSquare%20Digit%20Chain|Combinations with repetitions/Square Digit Chain]]
| Draft
|- style="background-color: #ffc"
Line 5,844 ⟶ 5,840:
|- style="background-color: #ffc"
| 5
| [[OpenGL%20Pixel%20Shader|OpenGL Pixel Shader]]
| Draft
|-
Line 5,852 ⟶ 5,848:
|- style="background-color: #ffc"
| 5
| [[Sorting%20algorithms%2FTree%20sort%20on%20a%20linked%20list|Sorting algorithms/Tree sort on a linked list]]
| Draft
|- style="background-color: #ffc"
| 5
| [[Spelling%20of%20ordinal%20numbers|Spelling of ordinal numbers]]
| Draft
|- style="background-color: #ffc"
|
| [[Starting%20a%20web%20browser|Starting a web browser]]
| Draft
|-
Line 5,868 ⟶ 5,864:
|- style="background-color: #ffc"
| 4
| [[Addition-chain%20exponentiation|Addition-chain exponentiation]]
| Draft
|-
| 4
| [[Colour%20pinstripe%2FPrinter|Colour pinstripe/Printer]]
| Task
|- style="background-color: #ffc"
| 4
|data-sort-value="continued fraction/arithmetic/g(matrix ng, contined fraction n0B1, contined fraction n0B2)"| [[Continued%20fraction%2FArithmetic%2FG%28matrix%20NG%2C%20Contined%20Fraction%20N1%2C%20Contined%20Fraction%20N2%29|Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Data%20Encryption%20Standard|Data Encryption Standard]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Fibonacci%20heap|Fibonacci heap]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Four%20is%20the%20number%20of%20letters%20in%20the%20...|Four is the number of letters in the ...]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Functional%20coverage%20tree|Functional coverage tree]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Gauss-Jordan%20matrix%20inversion|Gauss-Jordan matrix inversion]]
| Draft
|- style="background-color: #ffc"
| 4
| [[
| Draft
|- style="background-color: #ffc"
| 4
| [[Greed|Greed]]
| Draft
|- style="background-color: #ffc"
| 4
| [[One-time%20pad|One-time pad]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Pentomino%20tiling|Pentomino tiling]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Railway%20circuit|Railway circuit]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Remote%20agent%2FAgent%20interface|Remote agent/Agent interface]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Remote%20agent%2FAgent%20logic|Remote agent/Agent logic]]
| Draft
|- style="background-color: #ffc"
Line 5,926:
| [[Remote%20agent%2FSimulation|Remote agent/Simulation]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Rosetta%20Code%2FRun%20examples|Rosetta Code/Run examples]]
|
|- style="background-color: #ffc"
| 4
| [[Snake%20And%20Ladder|Snake And Ladder]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Tarjan|Tarjan]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Tetris|Tetris]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Using%20a%20Speech%20engine%20to%20highlight%20words|Using a Speech engine to highlight words]]
| Draft
|- style="background-color: #ffc"
| 4
| [[Using%20the%20Meetup.com%20API|Using the Meetup.com API]]
| Draft
|- style="background-color: #ffc"
| 3
| [[
| Draft
|- style="background-color: #ffc"
| 3
| [[Hexapawn|Hexapawn]]
| Draft
|- style="background-color: #ffc"
| 3
| [[OpenGL%2FUtah%20Teapot|OpenGL/Utah Teapot]]
| Draft
|- style="background-color: #ffc"
Line 5,968:
|- style="background-color: #ffc"
| 3
| [[Rosetta%20Code%2FRank%20languages%20by%20number%20of%20users|Rosetta Code/Rank languages by number of users]]
| Draft
|- style="background-color: #ffc"
Line 5,983 ⟶ 5,979:
| Draft
|- style="background-color: #ffc"
|
| [[Text%20to%20HTML|Text to HTML]]
| Draft
|- style="background-color: #ffc"
| 2
| [[Audio%20Overlap%20Loop|Audio Overlap Loop]]
| Draft
|- style="background-color: #ffc"
| 2
| [[Chess%20player|Chess player]]
| Draft
|- style="background-color: #ffc"
Line 6,008 ⟶ 6,000:
|- style="background-color: #ffc"
| 2
| [[OpenWebNet%20Password|OpenWebNet Password]]
| Draft
|- style="background-color: #ffc"
| 2
| [[
| Draft
|- style="background-color: #ffc"
| 2
| [[Recursive%20descent%20parser%20generator|Recursive descent parser generator]]
| Draft
|- style="background-color: #ffc"
|
| [[Solve%20a%20Rubik%27s%20Cube|Solve a Rubik's Cube]]
| Draft
|- style="background-color: #ffc"
| 2
| [[Tamagotchi%20emulator|Tamagotchi emulator]]
| Draft
|- style="background-color: #ffc"
| 1
| [[Black%20Box|Black Box]]
| Draft
|- style="background-color: #ffc"
Line 6,032 ⟶ 6,028:
|- style="background-color: #ffc"
| 1
| [[IRC%20gateway|IRC gateway]]
| Draft
|- style="background-color: #ffc"
| 1
| [[Multidimensional%20Newton-Raphson%20metod|Multidimensional Newton-Raphson metod]]
| Draft
|- style="background-color: #ffc"
| 1
| [[Process%20SMIL%20directives%20in%20XML%20data|Process SMIL directives in XML data]]
| Draft
|- style="background-color: #ffc"
Line 6,048 ⟶ 6,044:
|- style="background-color: #ffc"
| 1
| [[Solving%20coin%20problems|Solving coin problems]]
| Draft
|- style="background-color: #ffc"
| 1
| [[Terminal%20control%2FRestricted%20width%20positional%20input%2FNo%20wrapping|Terminal control/Restricted width positional input/No wrapping]]
| Draft
|- style="background-color: #ffc"
| 1
| [[Terminal%20control%2FRestricted%20width%20positional%20input%2FWith%20wrapping|Terminal control/Restricted width positional input/With wrapping]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Blackjack%20strategy|Blackjack strategy]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Chess%20player%2FMove%20generation|Chess player/Move generation]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Chess%20player%2FProgram%20options%20and%20user%20interface|Chess player/Program options and user interface]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Chess%20player%2FSearch%20and%20evaluation|Chess player/Search and evaluation]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Rosetta%20Code%2FTasks%20sorted%20by%20average%20lines%20of%20code|Rosetta Code/Tasks sorted by average lines of code]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Ukkonen%E2%80%99s%20Suffix%20Tree%20Construction|Ukkonen’s Suffix Tree Construction]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Unicode%20polynomial%20equation|Unicode polynomial equation]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Waveform%20analysis%2FDoh%20ray%20me|Waveform analysis/Doh ray me]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Waveform%20analysis%2FTop%20and%20tail|Waveform analysis/Top and tail]]
| Draft
|- style="background-color: #ffc"
| 0
| [[Weather%20Routing|Weather Routing]]
| Draft
|}
|
Revision as of 14:29, 30 March 2018
You are encouraged to solve this task according to the task description, using any language you may know.
Find the total number of programming examples for each task and the total for all tasks.
Essentially, count the number of occurrences of =={{header| on each task page.
Output:
100 doors: 20 examples. 99 Bottles of Beer: 29 examples. Abstract type: 10 examples. Total: X examples.
You'll need to use the Media Wiki API, which you can find out about locally, here, or in Media Wiki's API documentation at, API:Query
Ada
Parsing XML file with XMLAda from AdaCore <lang Ada>with Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url; with Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs; with Input_Sources.Strings, Unicode, Unicode.Ces.Utf8; with Ada.Strings.Unbounded, Ada.Strings.Fixed, Ada.Text_IO, Ada.Command_Line; with Ada.Containers.Vectors;
use Aws.Client, Aws.Messages, Aws.Response, Aws.Resources, Aws.Url; use Dom.Readers, Dom.Core, Dom.Core.Documents, Dom.Core.Nodes, Dom.Core.Attrs; use Aws, Ada.Strings.Unbounded, Ada.Strings.Fixed, Input_Sources.Strings; use Ada.Text_IO, Ada.Command_Line;
procedure Count_Examples is
package Members_Vectors is new Ada.Containers.Vectors ( Index_Type => Positive, Element_Type => Unbounded_String); use Members_Vectors;
Exemples : Vector; Nbr_Lg, Total : Natural := 0;
procedure Get_Vector (Category : in String; Mbr_Vector : in out Vector) is Reader : Tree_Reader; Doc : Document; List : Node_List; N : Node; A : Attr; Page : Aws.Response.Data; Uri_Xml : constant String := "http://rosettacode.org/mw/api.php?action=query&list=categorymembers" & "&format=xml&cmlimit=500&cmtitle=Category:"; begin Page := Client.Get (Uri_Xml & Category); if Response.Status_Code (Page) not in Messages.Success then raise Client.Connection_Error; end if; declare Xml : constant String := Message_Body (Page); Source : String_Input; begin Open (Xml'Unrestricted_Access, Unicode.Ces.Utf8.Utf8_Encoding, Source); Parse (Reader, Source); Close (Source); end; Doc := Get_Tree (Reader); List := Get_Elements_By_Tag_Name (Doc, "cm"); for Index in 1 .. Length (List) loop N := Item (List, Index - 1); A := Get_Named_Item (Attributes (N), "title"); Append (Mbr_Vector, To_Unbounded_String (Value (A))); end loop; Free (List); Free (Reader); end Get_Vector;
function Scan_Page (Title : String) return Natural is Page : Aws.Response.Data; File : Aws.Resources.File_Type; Buffer : String (1 .. 1024); Languages, Position, Last : Natural := 0; begin Page := Client.Get ("http://rosettacode.org/mw/index.php?title=" & Aws.Url.Encode (Title) & "&action=raw"); Response.Message_Body (Page, File); while not End_Of_File (File) loop Resources.Get_Line (File, Buffer, Last); Position := Index (Source => Buffer (Buffer'First .. Last), Pattern => "=={{header|"); if Position > 0 then Languages := Languages + 1; end if; end loop; Close (File); return Languages; end Scan_Page;
begin
Get_Vector ("Programming_Tasks", Exemples);
for I in First_Index (Exemples) .. Last_Index (Exemples) loop declare Title : constant String := To_String (Members_Vectors.Element (Exemples, I)); begin Nbr_Lg := Scan_Page (Title); Total := Total + Nbr_Lg; Put_Line (Title & " :" & Integer'Image (Nbr_Lg) & " exemples."); end; end loop;
Put_Line ("Total :" & Integer'Image (Total) & " exemples.");
end Count_Examples; </lang> Output :
100 doors : 107 exemples. 24 game : 30 exemples. .... Yahoo! search interface : 10 exemples. Zig-zag matrix : 49 exemples. Total : 17238 exemples.
AutoHotkey
<lang AutoHotkey>UrlDownloadToFile
, http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml , tasks.xml
FileRead, tasks, tasks.xml pos = 0 quote = " ; " regtitle := "<cm.*?title=" . quote . "(.*?)" . quote While, pos := RegExMatch(tasks, regtitle, title, pos + 1) {
UrlDownloadToFile , % "http://www.rosettacode.org/w/index.php?title=" . title1 . "&action=raw" , task.xml FileRead, task, task.xml RegExReplace(task, "\{\{header\|", "", count) current := title1 . ": " . count . " examples.`n" output .= current TrayTip, current, % current
} MsgBox % output Return</lang>
BBC BASIC
<lang bbcbasic> VDU 23,22,640;512;8,16,16,128+8 : REM Enable UTF-8 support
SYS "LoadLibrary", "URLMON.DLL" TO urlmon% SYS "GetProcAddress", urlmon%, "URLDownloadToFileA" TO UDTF special$ = "+()'" url$ = "http://www.rosettacode.org/w/api.php?action=query" + \ \ "&list=categorymembers&cmtitle=Category:Programming_Tasks" + \ \ "&cmlimit=500&format=xml" file$ = @tmp$ + "tasks.xml" SYS UDTF, 0, url$, file$, 0, 0 TO fail% IF fail% ERROR 100, "File download failed (tasks)" Total% = 0 file% = OPENIN(file$) WHILE NOT EOF#file% a$ = GET$#file% i% = 0 REPEAT i% = INSTR(a$, "title=", i%+1) IF i% THEN j% = INSTR(a$, ">", i%) title$ = MID$(a$, i%+7, j%-i%-10) REM Replace HTML codes: REPEAT k% = INSTR(title$, "&") IF k% THEN l% = INSTR(title$, ";", k%) title$ = LEFT$(title$,k%-1) + \ \ FNhtml(MID$(title$,k%,l%-k%+1)) + MID$(title$,l%+1) ENDIF UNTIL k% = 0 t$ = title$ REM Substitute characters not allowed in a URL: FOR s% = 1 TO LEN(special$) REPEAT s$ = MID$(special$, s%, 1) k% = INSTR(t$, s$) IF k% t$ = LEFT$(t$,k%-1) + "%" + STR$~ASCs$ + MID$(t$,k%+1) UNTIL k% = 0 NEXT url$ = "http://www.rosettacode.org/w/index.php?title=" + t$ + \ \ "&action=raw" file$ = @tmp$ + "title.htm" SYS UDTF, 0, url$, file$, 0, 0 TO fail% IF fail% ERROR 100, "File download failed " + t$ examples% = 0 task% = OPENIN(file$) WHILE NOT EOF#task% IF INSTR(GET$#task%, "=={{header|") examples% += 1 ENDWHILE CLOSE #task% Total% += examples% PRINT title$ ": " ; examples% " examples." ENDIF UNTIL i% = 0 i% = INSTR(a$, "cmcontinue=") IF i% THEN CLOSE #file% j% = INSTR(a$, """", i%+1) k% = INSTR(a$, """", j%+1) url$ = "http://www.rosettacode.org/w/api.php?action=query" + \ \ "&list=categorymembers&cmtitle=Category:Programming_Tasks" + \ \ "&cmlimit=500&format=xml&cmcontinue=" + MID$(a$,j%+1,k%-j%) REPEAT i% = INSTR(url$, "|") IF i% url$ = LEFT$(url$,i%-1) + "%7C" + MID$(url$,i%+1) UNTIL i% = 0 file$ = @tmp$ + "tasks.xml" SYS UDTF, 0, url$, file$, 0, 0 TO fail% IF fail% ERROR 100, "File download failed (continue)" file% = OPENIN(file$) ENDIF ENDWHILE CLOSE #file% PRINT ' "Total: " ; Total% " examples." END DEF FNhtml(h$) IF LEFT$(h$,2) = "&#" THEN = CHR$(VALMID$(h$,3)) CASE h$ OF WHEN """: = """" ENDCASE = h$</lang>
Sample output:
100 doors: 154 examples. 24 game: 53 examples. 24 game/Solve: 30 examples. 99 Bottles of Beer: 181 examples. A+B: 124 examples. Abstract type: 49 examples. Accumulator factory: 65 examples. Ackermann function: 126 examples. Active Directory/Connect: 12 examples. Active Directory/Search for a user: 13 examples. ...... XML/DOM serialization: 33 examples. XML/Input: 50 examples. XML/Output: 41 examples. XML/XPath: 33 examples. Y combinator: 51 examples. Yahoo! search interface: 13 examples. Yin and yang: 36 examples. Zebra puzzle: 11 examples. Zeckendorf number representation: 14 examples. Zig-zag matrix: 64 examples. Total: 27004 examples.
Bracmat
<lang bracmat>( ( get-page
= . sys$(str$("wget -q -O wget.out \"" !arg \")) & get$("wget.out",HT ML) )
& get-page$"http://rosettacode.org/wiki/Category:Programming_Tasks"
: ? (table.?) ?tasklist (.table.) ?
& 0:?list & whl
' ( !tasklist : ? ( a . (href.@(?:"/wiki/" ?href)) (title.?title) & get-page$(str$("http://rosettacode.org/wiki/" !href)) : ?task & 0:?cnt & whl ' ( !task : ? ( (span.(class.mw-headline) (id.?)) ?span (.span.) ?task & !span : ? ( a . (href.@(?:"/wiki/Category:" ?)) (title.@(?:"Category:" ?)) ) @ (.a.) ? ) & 1+!cnt:?cnt ) & (!cnt.!title)+!list:?list ) ?tasklist )
& lst$(list,taskfreq,NEW)
)</lang>
Output (in file tasqfreq
):
list= (2."OLE Automation") + (3."Canny edge detector") + ( 3 . "Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N1, Contined Fraction N2)" ) + (4."Colour pinstripe/Printer") + (4."Vogel's approximation method") + (5."Catmull–Clark subdivision surface") + (5."Percolation/Bond percolation") + (5.Pinstripe/Printer) + (5."Zeckendorf arithmetic") + (6."Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N)") + (6."Percolation/Mean cluster density") + (7."Bitmap/PPM conversion through a pipe") + (7."Deconvolution/2D+") + (7."K-d tree") .... + (125."Greatest element of a list") + (127."Averages/Arithmetic mean") + (131.Arrays) + (131."Increment a numerical string") + (132."Greatest common divisor") + (133.Loops/While) + (134."Conditional structures") + (136.Arithmetic/Integer) + (137.Loops/For) + (145.Loops/Infinite) + (147."Ackermann function") + (148."Reverse a string") + (152."A+B") + (152."Function definition") + (160."Empty program") + (163."Fibonacci sequence") + (164.Factorial) + (182.FizzBuzz) + (187."100 doors") + (188.Comments) + (216."99 Bottles of Beer") + (269."Hello world/Text");
C#
Object-oriented solution.
<lang csharp>using System; using System.Collections.Generic; using System.Linq; using System.Text.RegularExpressions; using System.Net;
class Task {
private string _task; private int _examples;
public Task(string task, int examples) { _task = task; _examples = examples; }
public string Name { get { return _task; } }
public int Examples { get { return _examples; } }
public override string ToString() { return String.Format("{0}: {1} examples.", this._task, this._examples); }
}
class Program {
static List<string> GetTitlesFromCategory(string category, WebClient wc) { string content = wc.DownloadString( String.Format("http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:{0}&cmlimit=500&format=json", category) );
return new Regex("\"title\":\"(.+?)\"").Matches(content).Cast<Match>().Select(x => x.Groups[1].Value.Replace("\\/", "/")).ToList(); }
static string GetSourceCodeFromPage(string page, WebClient wc) { return wc.DownloadString( String.Format("http://www.rosettacode.org/w/index.php?title={0}&action=raw", page) ); }
static void Main(string[] args) { WebClient wc = new WebClient(); List<Task> tasks = new List<Task>(); List<string> tasknames = GetTitlesFromCategory("Programming_Tasks", wc);
foreach (string task in tasknames) { string content = GetSourceCodeFromPage(task, wc); int count = new Regex("=={{header", RegexOptions.IgnoreCase).Matches(content).Count; Task t = new Task(task, count);
Console.WriteLine(t); tasks.Add(t); }
Console.WriteLine("\nTotal: {0} examples.", tasks.Select(x => x.Examples).Sum()); }
}</lang>
Clojure
<lang clojure>(ns count-examples
(:import [java.net URLEncoder]) (:use [clojure.contrib.http.agent :only (http-agent string)] [clojure.contrib.json :only (read-json)] [clojure.contrib.string :only (join)]))
(defn url-encode [v] (URLEncoder/encode (str v) "utf-8"))
(defn rosettacode-get [path params]
(let [param-string (join "&" (for [[n v] params] (str (name n) "=" (url-encode v))))] (string (http-agent (format "http://www.rosettacode.org/w/%s?%s" path param-string)))))
(defn rosettacode-query [params]
(read-json (rosettacode-get "api.php" (merge {:action "query" :format "json"} params))))
(defn list-cm
([params] (list-cm params nil)) ([params continue] (let [cm-params (merge {:list "categorymembers"} params (or continue {})) result (rosettacode-query cm-params)] (concat (-> result (:query) (:categorymembers)) (if-let [cmcontinue (-> result (:query-continue) (:categorymembers))] (list-cm params cmcontinue))))))
(defn programming-tasks []
(let [result (list-cm {:cmtitle "Category:Programming_Tasks" :cmlimit 50})] (map #(:title %) result)))
(defn task-count [task]
[task (count (re-seq #"==\{\{header" (rosettacode-get "index.php" {:action "raw" :title task})))])
(defn print-result []
(let [task-counts (map task-count (programming-tasks))] (doseq [[task count] task-counts] (println (str task ":") count) (flush)) (println "Total: " (reduce #(+ %1 (second %2)) 0 task-counts))))
</lang> <lang clojure>count-examples> (print-result) 100 doors: 73 24 game: 18 24 game/Solve: 14 99 Bottles of Beer: 89 Abstract type: 27 Accumulator factory: 23 Ackermann function: 73 Active Directory/Connect: 4 Active Directory/Search for a user: 3 Active object: 14 Add a variable to a class instance at runtime: 21 Address of a variable: 20 ... Total: 11216 nil </lang>
D
<lang D> import tango.io.Stdout; import tango.net.http.HttpClient; import tango.net.http.HttpHeaders; import tango.text.xml.Document; import tango.text.Util;
alias HttpHeader.ContentLength CL;
auto url = "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"; void main() {
auto client = new HttpClient (HttpClient.Get, url); client.open(); char[] mainData, tmp; int total, i;
void cat(void[] content) { tmp ~= cast(char[]) content; }
if (client.isResponseOK) { client.read(&cat, client.getResponseHeaders.getInt(CL)); mainData = tmp; tmp = null;
auto doc = new Document!(char); doc.parse(mainData); foreach (n; doc.query.descendant("cm").attribute("title")) { auto subClient = new HttpClient(HttpClient.Get, "http://www.rosettacode.org/w/index.php?title=" ~ replace(n.value.dup, ' ', '_') ~ "&action=raw"); subClient.open(); if (! subClient.isResponseOK) { Stderr (client.getResponse); break; } subClient.read(&cat, subClient.getResponseHeaders.getInt(CL)); foreach (segment; patterns(cast(char[])tmp, "=={{header|")) i++; --i; if (i) --i; Stdout.formatln ("{0,-40} - {}", n.value, i); total += i; tmp = null; i = 0; } Stdout("total examples: ", total).newline; } else { Stderr (client.getResponse); }
} </lang>
EGL
A graphical implementation with a grid showing the number of implementations for each Rosetta Code task as well as total task and implementation counts. Uses MediaWiki API service call to fetch tasks/categories in a JSON format and meets API data limit and continuation requirements to consume 100% of the items.
User Interface: RosettaCodeHandler.egl <lang EGL>package com.eglexamples.client;
import org.eclipse.edt.rui.widgets.*;
handler RosettaCodeHandler type RUIhandler{initialUI =[ui], title = "Rosetta Code Tasks and Counts"}
ui GridLayout{columns = 3, rows = 4, cellPadding = 4, children = [ b1, dg1, l1, l2, l3, l4 ]}; b1 Button{ layoutData = new GridLayoutData{ row = 1, column = 1 }, text = "Go!", onClick ::= b1_onClick }; l1 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 2 }, text = "Total Tasks:" }; l2 TextLabel{ layoutData = new GridLayoutData{ row = 1, column = 3 }, text = "0" };
l3 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 2 }, text = "Total Implementations:" }; l4 TextLabel{ layoutData = new GridLayoutData{ row = 2, column = 3 }, text = "0" }; dg1 DataGrid{ layoutData = new GridLayoutData{ row = 3, column = 1, horizontalSpan = 3 }, pageSize = 10, showScrollbar = true,
columns = [ new DataGridColumn{name = "title", displayName = "Task", width=220}, new DataGridColumn{name = "count", displayName = "Count", width=100} ] };
cmcontinue string?; title string?; allTasks Task[];
restBindingTasks IHttp? = new HttpRest{ restType = eglx.rest.ServiceType.TrueRest, request.uri = "http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=1&format=json"};
restBindingPageDetail IHttp? = new HttpRest{ restType = eglx.rest.ServiceType.TrueRest, request.uri = "http://rosettacode.org/mw/index.php"};
function b1_onClick(event Event in)
call ProxyFunctions.listTasks("") using restBindingTasks
returning to listTasksCallBack onException exceptionHandler; end function listTasksCallBack(retResult RosettaCodeJSON in)
title = retResult.query.categorymembers[1].title; cmcontinue = retResult.queryContinue.categorymembers.cmcontinue;
call ProxyFunctions.fetchPageDetail(title) using restBindingPageDetail
returning to pageDetailCallBack onException exceptionHandler; end
function pageDetailCallBack(pageResults string in) count int = countSubstring("=={{header", pageResults); allTasks.appendElement(new Task { title = title, count = count });
l2.text = l2.text as int + 1; l4.text = l4.text as int + count;
if(cmcontinue != null)
call ProxyFunctions.listTasks(cmcontinue) using restBindingTasks returning to listTasksCallBack onException exceptionHandler; else dg1.data = allTasks as any[]; end
end function countSubstring(substr string in, str string in) returns(int)
if(str.length() > 0 and substr.length() > 0) return (str.length() - str.replaceStr(subStr, "").length()) / subStr.length(); else return 0; end
end
function exceptionHandler(exp AnyException in) end
end
record Task title string; count int; end</lang>
Service Interface: ProxyFunctions.egl <lang EGL>package com.eglexamples.client;
library ProxyFunctions
function listTasks(continueLocation String in) returns (RosettaCodeJSON) {
@Rest{method = _GET, uriTemplate = "&cmcontinue={continueLocation}", requestFormat = None, responseFormat = JSON}
} end
function fetchPageDetail(title String in) returns (String) {
@Rest{method = _GET, uriTemplate = "?title={title}&action=raw", requestFormat = None, responseFormat = None}
} end
end
record RosettaCodeJSON
query Query; queryContinue QueryContinue{JSONName = "query-continue"};
end
record Query
categorymembers Categorymembers[];
end
record Categorymembers
cmcontinue string?; pageid int?; ns int?; title string?;
end
record QueryContinue
categorymembers Categorymembers;
end</lang>
Erlang
<lang erlang> -module(rosseta_examples). -include_lib("xmerl/include/xmerl.hrl").
-export([main/0]).
main() ->
application:start(inets), Titles = read_titles(empty), Result = lists:foldl(fun(Title,Acc) -> Acc + calculate_one(Title) end, 0, Titles), io:format("Total: ~p examples.\n",[Result]), application:stop(inets).
read_titles(CurrentContinue) ->
URL0 = "http://rosettacode.org/mw/api.php?" ++ "action=query&list=categorymembers&cmtitle=Category:Programming_Tasks" ++ "&cmlimit=500&format=xml", URL = case CurrentContinue of empty -> URL0; _ -> URL0 ++ "&cmcontinue=" ++ CurrentContinue end, {ok,Answer} = httpc:request(URL), {Document,_} = xmerl_scan:string(lists:last(tuple_to_list(Answer))), Continue = [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string("//@cmcontinue", Document)], Titles = [Value || #xmlAttribute{value = Value} <- xmerl_xpath:string("//@title", Document)], case Continue of []-> Titles; [ContValue | _] -> Titles ++ read_titles(ContValue) end.
calculate_one(Title0) ->
Title = replace_chars(Title0), URL = "http://www.rosettacode.org/w/index.php?title=" ++ Title ++ "&action=raw", case httpc:request(URL) of {ok,Result} -> {match,Found} = re:run(lists:last(tuple_to_list(Result)), "\n=={{header(|)", [global]), io:format("~ts: ~p examples.\n",[Title0,length(Found)]), length(Found); {error,socket_closed_remotely} -> io:format("Socket closed remotely. Retry.\n"), calculate_one(Title0) end.
replace_chars(String) ->
replace_chars(String,[]).
replace_chars([$ | T],Acc) ->
replace_chars(T, [$_| Acc]);
replace_chars([$+| T],Acc) ->
replace_chars(T, lists:reverse("%2B") ++ Acc);
replace_chars([8211| T],Acc) ->
replace_chars(T, lists:reverse("%E2%80%93") ++ Acc);
replace_chars([Other| T],Acc) ->
replace_chars(T, [Other| Acc]);
replace_chars([],Acc) ->
lists:reverse(Acc).
</lang>
Outputs:
> rosseta_examples:main(). 100 doors: 165 examples. 24 game: 56 examples. 24 game/Solve: 33 examples. ... Zebra puzzle: 12 examples. Zeckendorf number representation: 18 examples. Zig-zag matrix: 65 examples. Total: 28629 examples.
F#
Using asynchronous workflows to perform downloads concurrently:
<lang fsharp>#r "System.Xml.Linq.dll"
let uri1 = "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml" let uri2 task = sprintf "http://www.rosettacode.org/w/index.php?title=%s&action=raw" task
[|for xml in (System.Xml.Linq.XDocument.Load uri1).Root.Descendants() do
for attrib in xml.Attributes() do if attrib.Name.LocalName = "title" then yield async { let uri = uri2 (attrib.Value.Replace(" ", "_") |> System.Web.HttpUtility.UrlEncode) use client = new System.Net.WebClient() let! html = client.AsyncDownloadString(System.Uri uri) let sols' = html.Split([|"{{header|"|], System.StringSplitOptions.None).Length - 1 lock stdout (fun () -> printfn "%s: %d examples" attrib.Value sols') return sols' }|]
|> Async.Parallel |> Async.RunSynchronously |> fun xs -> printfn "Total: %d examples" (Seq.sum xs)</lang>
This is 21× faster than the python thanks to the concurrency.
Factor
Runs in about a minute. The number of threads is limited to 10 avoid cloudfare's protection mechanism.
<lang factor>USING: arrays assocs concurrency.combinators concurrency.semaphores formatting hashtables http.client io json.reader kernel math math.parser sequences splitting urls.encoding ; IN: rosetta-code.count-examples
CONSTANT: list-url "http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&cmprop=title&format=json"
- titles ( query -- titles )
"query" of "categorymembers" of [ "title" of ] map ;
- continued-url ( query -- url/f )
"query-continue" of "categorymembers" of [ assoc>query list-url swap "&" glue ] [ f ] if* ;
- (all-programming-titles) ( titles url -- titles' url' )
http-get nip json> [ titles append ] [ continued-url ] bi [ (all-programming-titles) ] [ f ] if* ;
- all-programming-titles ( -- titles ) { } list-url (all-programming-titles) drop ;
CONSTANT: content-base-url "http://rosettacode.org/mw/index.php?title=&action=raw"
- content-url ( title -- url )
" " "_" replace "title" associate assoc>query content-base-url swap "&" glue ;
- occurences ( seq subseq -- n ) split-subseq length 1 - ;
- count-examples ( title -- n )
content-url http-get nip "=={{header|" occurences ;
- print-task ( title n -- ) "%s: %d examples.\n" printf ;
- print-total ( assoc -- ) values sum "Total: %d examples.\n" printf ;
- fetch-counts ( titles -- assoc )
10 <semaphore> [ [ dup count-examples 2array ] with-semaphore ] curry parallel-map ;
- print-counts ( titles -- )
[ [ print-task ] assoc-each nl ] [ print-total ] bi ;
- rosetta-examples ( -- )
all-programming-titles fetch-counts print-counts ;
MAIN: rosetta-examples</lang> Outputs:
100 doors: 169 examples. 24 game: 58 examples. ... Zeckendorf number representation: 22 examples. Zig-zag matrix: 66 examples. Total: 30745 examples.
Go
<lang go>package main
import (
"bytes" "encoding/xml" "fmt" "io" "io/ioutil" "net/http" "net/url" "strings"
)
func req(u string, foundCm func(string)) string {
resp, err := http.Get(u) if err != nil { fmt.Println(err) // connection or request fail return "" } defer resp.Body.Close() for p := xml.NewDecoder(resp.Body); ; { t, err := p.RawToken() switch s, ok := t.(xml.StartElement); { case err == io.EOF: return "" case err != nil: fmt.Println(err) return "" case !ok: continue case s.Name.Local == "cm": for _, a := range s.Attr { if a.Name.Local == "title" { foundCm(a.Value) } } case s.Name.Local == "categorymembers" && len(s.Attr) > 0 && s.Attr[0].Name.Local == "cmcontinue": return url.QueryEscape(s.Attr[0].Value) } } return ""
}
func main() {
taskQuery := "http://rosettacode.org/mw/api.php?action=query" + "&format=xml&list=categorymembers&cmlimit=500" + "&cmtitle=Category:Programming_Tasks" continueAt := req(taskQuery, count) for continueAt > "" { continueAt = req(taskQuery+"&cmcontinue="+continueAt, count) } fmt.Printf("Total: %d examples.\n", total)
}
var marker = []byte("=={{header|") var total int
func count(cm string) {
taskFmt := "http://rosettacode.org/mw/index.php?title=%s&action=raw" taskEsc := url.QueryEscape(strings.Replace(cm, " ", "_", -1)) resp, err := http.Get(fmt.Sprintf(taskFmt, taskEsc)) var page []byte if err == nil { page, err = ioutil.ReadAll(resp.Body) resp.Body.Close() } if err != nil { fmt.Println(err) return } examples := bytes.Count(page, marker) fmt.Printf("%s: %d\n", cm, examples) total += examples
}</lang>
- Output
- (May 25, 2011):
... Y combinator: 40 Yahoo! search interface: 10 Yin and yang: 18 Zig-zag matrix: 50 Total: 18290 examples.
Haskell
from HackageDB
<lang haskell>import Network.Browser import Network.HTTP import Network.URI import Data.List import Data.Maybe import Text.XML.Light import Control.Arrow
justifyR w = foldl ((.return).(++).tail) (replicate w ' ') showFormatted t n = t ++ ": " ++ justifyR 4 (show n)
getRespons url = do
rsp <- Network.Browser.browse $ do setAllowRedirects True setOutHandler $ const (return ()) -- quiet request $ getRequest url return $ rspBody $ snd rsp
getNumbOfExampels p = do
let pg = intercalate "_" $ words p rsp <- getRespons $ "http://www.rosettacode.org/w/index.php?title=" ++ pg ++ "&action=raw" let taskPage = rsp countEx = length $ filter (=="=={{header|") $ takeWhile(not.null) $ unfoldr (Just. (take 11 &&& drop 1)) taskPage return countEx
progTaskExamples = do
rsp <- getRespons "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"
let xmls = onlyElems $ parseXML $ rsp tasks = concatMap (map (fromJust.findAttr (unqual "title")). filterElementsName (== unqual "cm")) xmls
taskxx <- mapM getNumbOfExampels tasks let ns = taskxx tot = sum ns
mapM_ putStrLn $ zipWith showFormatted tasks ns putStrLn $ ("Total: " ++) $ show tot</lang>
some output: <lang haskell>*Main> progTaskExamples 100 doors: 56 24 game: 11 24 game Player: 9 99 Bottles of Beer: 73 Abstract type: 23 Ackermann Function: 61 Active object: 9 ... Total: 9156</lang>
Icon and Unicon
The following code uses features exclusive to Unicon. This version handles all tasks, not just the first 500.
<lang Unicon>$define RCINDEX "http://rosettacode.org/mw/api.php?format=xml&action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500" $define RCTASK "http://rosettacode.org/mw/index.php?action=raw&title=" $define RCUA "User-Agent: Unicon Rosetta 0.1" $define RCXUA "X-Unicon: http://unicon.org/" $define TASKTOT "* Total Tasks *" $define TOTTOT "* Total Headers*"
link strings link hexcvt
procedure main(A) # simple single threaded read all at once implementation
Tasks := table(0) every task := taskNames() do { Tasks[TASKTOT] +:= 1 # count tasks every lang := languages(task) do { # count languages Tasks[task] +:= 1 Tasks[TOTTOT] +:= 1 } } every insert(O := set(),key(Tasks)) # extract & sort keys O := put(sort(O--set(TOTTOT,TASKTOT)),TASKTOT,TOTTOT) # move totals to end every write(k := !O, " : ", Tasks[k]," examples.") # report
end
- Generate task names
procedure taskNames()
continue := "" while \(txt := ReadURL(RCINDEX||continue)) do { txt ? { while tab(find("<cm ") & find(s :="title=\"")+*s) do suspend tab(find("\""))\1 if tab(find("cmcontinue=")) then { continue := "&"||tab(upto(' \t')) } else break } }
end
- Generate language headers in a task
procedure languages(task)
static WS initial WS := ' \t' page := ReadURL(RCTASK||CleanURI(task)) page ? while (tab(find("\n==")),tab(many(WS))|"",tab(find("{{"))) do { header := tab(find("==")) header ? { while tab(find("{{header|")) do { suspend 2(="",tab(find("")))\1 } } }
end
procedure CleanURI(u) #: clean up a URI
static tr,dxml # xml & http translation initial { tr := table() every c := !string(~(&digits++&letters++'-_.!~*()/\'`')) do tr[c] := "%"||hexstring(ord(c),2) every /tr[c := !string(&cset)] := c tr[" "] := "_" # wiki convention every push(dxml := [],"&#"||right(ord(c := !"&<>'\""),3,"0")||";",c) } dxml[1] := u # insert URI as 1st arg u := replacem!dxml # de-xml it every (c := "") ||:= tr[!u] # reencode everything c := replace(c,"%3E","'") # Hack to put single quotes back in c := replace(c,"%26quot%3B","\"") # Hack to put double quotes back in return c
end
procedure ReadURL(url) #: read URL into string
page := open(url,"m",RCUA,RCXUA) | stop("Unable to open ",url) text := "" if page["Status-Code"] < 300 then while text ||:= reads(page,-1) else write(&errout,image(url),": ", page["Status-Code"]," ",page["Reason-Phrase"]) close(page) return text
end</lang>
strings provides replacem hexcvt provides hexstring
Sample Output for July 6, 2013 (abridged):
100 doors : 171 examples. 24 game : 60 examples. 24 game/Solve : 37 examples. 9 billion names of God the integer : 12 examples. 99 Bottles of Beer : 199 examples. A+B : 137 examples. Abstract type : 54 examples. Accumulator factory : 67 examples. Ackermann function : 137 examples. ... Y combinator : 56 examples. Yahoo! search interface : 18 examples. Yin and yang : 39 examples. Zebra puzzle : 12 examples. Zeckendorf arithmetic : 3 examples. Zeckendorf number representation : 21 examples. Zig-zag matrix : 67 examples. * Total Tasks * : 676 examples. * Total Headers* : 31146 examples.
J
Solution:
Using getCategoryMembers
from Find unimplemented tasks.
<lang j>require 'web/gethttp'
getAllTaskSolnCounts=: monad define
tasks=. getCategoryMembers 'Programming_Tasks' counts=. getTaskSolnCounts &> tasks tasks;counts
)
getTaskSolnCounts=: monad define
makeuri=. 'http://www.rosettacode.org/w/index.php?title=' , ,&'&action=raw' wikidata=. gethttp makeuri urlencode y ([: +/ '{{header|'&E.) wikidata
)
formatSolnCounts=: monad define
'tasks counts'=. y tasks=. tasks , &.>':' res=. ;:^:_1 tasks ,. (8!:0 counts) ,. <'examples.' res , 'Total examples: ' , ": +/counts
)</lang>
Example Usage: <lang j> formatSolnCounts getAllTaskSolnCounts 100 doors: 61 examples. 24 game: 15 examples. 24 game Player: 11 examples. 99 Bottles of Beer: 76 examples. ...</lang>
Java
<lang java5> import java.util.ArrayList; import ScreenScrape;
public class CountProgramExamples {
private static final String baseURL = "http://rosettacode.org/wiki/"; private static final String rootURL = "http://www.rosettacode.org/w/" + "api.php?action=query&list=categorymembers" + "&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"; private static final String taskBegin = "title=\""; private static final String taskEnd = "\""; private static final String exmplBegin = ""; private static final String exmplEnd = ""; private static final String editBegin = "";
/** * @param args */ public static void main(String[] args) { int exTotal = 0; try { // Get root query results ArrayList<String> tasks = new ArrayList<String>(); ScreenScrape ss = new ScreenScrape(); String rootPage = ss.read(rootURL); while (rootPage.contains(taskBegin)) { rootPage = rootPage.substring(rootPage.indexOf(taskBegin) + taskBegin.length()); String title = rootPage.substring(0, rootPage.indexOf(taskEnd)); if (!title.contains("Category:")) { tasks.add(title); } rootPage = rootPage.substring(rootPage.indexOf(taskEnd)); } // Loop through each task and print count for (String task : tasks) { String title = task.replaceAll("'", "'"); String taskPage = ss.read(baseURL + title.replaceAll(" ", "_")); int exSubTot; if (taskPage.contains(exmplBegin)) { int startPos = taskPage.lastIndexOf(exmplBegin) + exmplBegin.length(); String countStr = taskPage.substring(startPos, taskPage.indexOf(exmplEnd, startPos)); exSubTot = Integer .parseInt(countStr.contains(".") ? countStr .substring(0, countStr.indexOf(".")) : countStr); } else { exSubTot = 0; while (taskPage.contains(editBegin)) { taskPage = taskPage.substring(taskPage .indexOf(editBegin) + editBegin.length()); exSubTot++; } } exTotal += exSubTot; System.out.println(title + ": " + exSubTot + " examples."); } // Print total System.out.println("\nTotal: " + exTotal + " examples."); } catch (Exception e) { System.out.println(title); System.out.println(startPos + ":" + taskPage.indexOf(exmplEnd, startPos)); System.out.println(taskPage); e.printStackTrace(System.out); } }
} </lang> ScreenScrape class
jq
jq does not duplicate the functionality of `curl` but works seamlessly with it, as illustrated by the following bash script. Note in particular the use of jq's `@uri` filter in the bash function `titles`.
<lang bash>#!/bin/bash
- Produce lines of the form: URI TITLE
function titles {
local uri="http://www.rosettacode.org/mw/api.php?action=query&list=categorymembers" uri+="&cmtitle=Category:Programming_Tasks&cmlimit=5000&format=json" curl -Ss "$uri" | jq -r '.query.categorymembers[] | .title | "\(@uri) \(.)"'
}
- Syntax: count URI
function count {
local uri="$1" curl -Ss "http://rosettacode.org/mw/index.php?title=${uri}&action=raw" | jq -R -n 'reduce (inputs|select(test("=={{header\\|"))) as $x(0; .+1)'
}
local n=0 i while read uri title do
i=$(count "$uri") echo "$title: $i examples." n=$((n + i))
done < <(titles) echo Total: $n examples.</lang>
- Output:
100 doors: 252 examples. 15 Puzzle Game: 36 examples. 2048: 24 examples. ... Order two numerical lists: 65 examples. Ordered Partitions: 28 examples. Ordered words: 85 examples. Palindrome detection: 136 examples. Total: 32416 examples.
Lasso
<lang Lasso>local(root = json_deserialize(curl('http://rosettacode.org/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=10&format=json')->result)) local(tasks = array, title = string, urltitle = string, thiscount = 0, totalex = 0) with i in #root->find('query')->find('categorymembers') do => {^ #thiscount = 0 #title = #i->find('title') #urltitle = #i->find('title') #urltitle->replace(' ','_')
#title+': ' local(src = curl('http://rosettacode.org/mw/index.php?title='+#urltitle->asBytes->encodeurl+'&action=raw')->result->asString) #thiscount = (#src->split('==[[:Category:{PercentEncode Xr}
else
{Append &%|{PercentEncode Xr}
else
{Append &%]] [[Category:{PercentEncode Xr}
else
{Append &%]] Property "Implemented in language" (as page type) with input value "{PercentEncode Xr}</br> else</br> {Append &%" contains invalid characters or is incomplete and therefore can cause unexpected results during a query or annotation process.
end
end
end
fun {ToHex2 X}
[{ToHex1 X div 16} {ToHex1 X mod 16}]
end
fun {ToHex1 X}
if X >= 0 andthen X =< 9 then &0 + X
elseif X >= 10 andthen X =< 15 then &A + X - 10
end
end
in
{Main}</lang>
Example output:
100 doors: 86 examples. 24 game: 22 examples. 24 game/Solve: 15 examples. 99 Bottles of Beer: 108 examples. A+B: 59 examples. ... Xiaolin Wu's line algorithm: 5 examples. Y combinator: 29 examples. Yahoo! Search: 10 examples. Zig-zag matrix: 43 examples. Total: 14099 examples.
Perl
<lang Perl>use LWP::Simple;
my $site = "http://rosettacode.org"; my $list_url = "/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml";
for (get("$site$list_url") =~ /cm.*?title="(.*?)"/g) {
(my $slug = $_) =~ tr/ /_/; my $count = () = get("$site/wiki/$slug") =~ /toclevel-1/g; print "$_: $count examples\n";
}</lang>
<lang Perl>use v5.10; use Mojo::UserAgent;
my $site = "http://rosettacode.org"; my $list_url = "/mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml";
my $ua = Mojo::UserAgent->new; $ua->get("$site$list_url")->res->dom->find('cm')->each(sub {
(my $slug = $_->{title}) =~ tr/ /_/; my $count = $ua->get("$site/wiki/$slug")->res->dom->find("#toc .toclevel-1")->size; say "$_->{title}: $count examples";
});</lang>
Perl 6
Retrieves counts for both Tasks and Draft Tasks. Save / Display results as a sortable wikitable rather than a static list. Click on a column header to sort on that column. To do a secondary sort, hold down the shift key and click on a second column header. Tasks have a gray (default) background, Draft Tasks have a yellow background. <lang perl6>use HTTP::UserAgent; use URI::Escape; use JSON::Fast;
class Progress-Bar {
has $.width = 40; has $.count is rw = 0; has @!bar = < ▏ ▎ ▍ ▌ ▋ ▊ ▉ █ >;
method inc { ($.count += 1) mod= $.width * 8; self.clear ~ @!bar.tail x $.count div 8 ~ @!bar[ $.count % 8 ] ~ ' ' x $.width - 1 - ($.count / 8).floor }
method clear { "\r" ~ ' ' x $.width ~ "\r" }
}
- Friendlier descriptions for task categories
my %cat = (
'Programming_Tasks' => 'Task', 'Draft_Programming_Tasks' => 'Draft'
);
my $client = HTTP::UserAgent.new;
my $url = 'http://rosettacode.org/mw';
my $hashfile = './RC_Task_count.json'; my $tablefile = './RC_Task_count.txt';
my %tasks;
- =begin update
note 'Retrieving task information...';
my $progress = Progress-Bar.new(width => 79);
for %cat.keys -> $cat {
mediawiki-query( $url, 'pages', :generator<categorymembers>, :gcmtitle("Category:$cat"), :gcmlimit<350>, :rawcontinue(), :prop<title> ).map({ my $page = mediawiki-query( $url, 'pages', :titles(.<title>), :prop<revisions>, :rvprop<content>, ); my $count = +$page.comb(/'=={{header|'/); %tasks{.<title>} = {'cat' => %cat{$cat}, :$count}; print $progress.inc; })
}
print $progress.clear;
note "\nTask information saved to local file: {$hashfile.IO.absolute}"; $hashfile.IO.spurt(%tasks.&to-json);
- =end update
- Load information from local file
%tasks = $hashfile.IO.e ?? $hashfile.IO.slurp.&from-json !! ( );
- Convert saved task / author info to a table
note "\nBuilding table..."; my $count = +%tasks; my $taskcnt = +%tasks.grep: *.value.<cat> eq %cat<Programming_Tasks>; my $draftcnt = $count - $taskcnt; my $total = sum %tasks{*}»<count>;
- Dump table to a file
my $out = open($tablefile, :w) or die "$!\n";
- Add table boilerplate and caption
$out.say:
'
'{|class="wikitable sortable"', "\n", "|+ As of { Date.today } :: Tasks: { $taskcnt } :: Draft Tasks: ", "{ $draftcnt } :: Total Tasks: { $count } :: Total Examples: { $total }\n", "! Count !! Task !! Category"
- Sort tasks by count then add row
for %tasks.sort: { [-.value<count>, .key] } -> $task {
$out.say: ( $task.value<cat> eq 'Draft' ?? "|- style=\"background-color: #ffc\"\n" !! "|-\n" ), "| { $task.value<count> }\n", ( $task.key ~~ /\d/ ?? "|data-sort-value=\"{ $task.key.&naturally }\"| [[{uri-escape $task.key}|{$task.key}]]\n" !! "| [[{uri-escape $task.key}|{$task.key}]]\n" ), "| { $task.value<cat> }"
}
$out.say( "|}\n", '' );
$out.close;
note "Table file saved as: {$tablefile.IO.absolute}";
sub mediawiki-query ($site, $type, *%query) {
my $url = "$site/api.php?" ~ uri-query-string( :action<query>, :format<json>, :formatversion<2>, |%query); my $continue = ;
gather loop { my $response = $client.get("$url&$continue"); my $data = from-json($response.content); take $_ for $data.<query>.{$type}.values; $continue = uri-query-string |($data.<query-continue>{*}».hash.hash or last); }
}
sub uri-query-string (*%fields) { %fields.map({ "{.key}={uri-escape .value}" }).join("&") }
sub naturally ($a) { $a.lc.subst(/(\d+)/, ->$/ {0~(65+$0.chars).chr~$0},:g) } </lang>
- Output:
PicoLisp
<lang PicoLisp>(load "@lib/http.l")
(client "rosettacode.org" 80
"mw/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml"
(while (from " title=\"")
(let Task (till "\"")
(client "rosettacode.org" 80 (pack "wiki/" (replace Task " " "_"))
(let Cnt 0
(while (from "")
(unless (sub? "." (till "<" T))
(inc 'Cnt) ) )
(out NIL (prinl (ht:Pack Task) ": " Cnt)) ) ) ) ) )</lang>
Output (05may10):
100 doors: 79 24 game: 21 24 game/Solve: 15 99 Bottles of Beer: 95 A+B: 37 Abstract type: 29 ...
PureBasic
<lang PureBasic>Procedure handleError(value, msg.s)
If value = 0 MessageRequester("Error", msg) End EndIf
EndProcedure
handleError(InitNetwork(), "Unable to initialize network functions.") If OpenConsole()
Define url$, x1$, y1$, title$, unescapedTitle$, encodedURL$ Define x2, i, j, totalExamples, totalTasks url$ = "http://www.rosettacode.org/mw/api.php?action=query" + "&list=categorymembers&cmtitle=Category:Programming_Tasks" + "&cmlimit=500&format=xml" Repeat handleError(ReceiveHTTPFile(url$, "tasks.xml"), "Unable to access tasks URL.") handleError(ReadFile(0, "tasks.xml"), "Unable to read 'task.xml' file.") x1$ = ReadString(0) CloseFile(0) Repeat x2 = FindString(x1$, "title=", x2 + 1) If x2 title$ = Mid(x1$, x2 + 7, 99) title$ = Left(title$, FindString(title$, ">", 1) - 4) unescapedTitle$ = UnescapeString(ReplaceString(title$, "'", "'"), #PB_String_EscapeXML) encodedURL$ = URLEncoder("http://www.rosettacode.org/mw/index.php?title=" + unescapedTitle$ + "&action=raw") If ReceiveHTTPFile(encodedURL$, "task.xml") ReadFile(0, "task.xml") While Not Eof(0) y1$ = ReadString(0) If FindString(y1$, "=={{header|", 1, #PB_String_NoCase) totalExamples + 1 EndIf Wend CloseFile(0) PrintN(unescapedTitle$ +": " + Str(totalExamples) + " examples") totalTasks + totalExamples totalExamples = 0 EndIf EndIf Until x2 = 0 ;check for additional pages of tasks x2 = FindString(x1$, "cmcontinue=") If x2 i = FindString(x1$, #DQUOTE$, x2 + 1) j = FindString(x1$, #DQUOTE$, i + 1) url$ = URLEncoder("http://www.rosettacode.org/mw/api.php?action=query" + "&list=categorymembers&cmtitle=Category:Programming_Tasks" + "&cmlimit=500&format=xml&cmcontinue=" + Mid(x1$, i + 1, j - i)) Else Break ;all done EndIf ForEver PrintN("Total: " + Str(totalTasks) + " examples") Input() CloseConsole()
EndIf</lang> Sample output:
100 doors: 224 examples 24 game: 78 examples 24 game/Solve: 46 examples 9 billion names of God the integer: 33 examples 99 Bottles of Beer: 253 examples A+B: 187 examples ...... Zeckendorf arithmetic: 6 examples Zeckendorf number representation: 37 examples Zero to the zero power: 71 examples Zhang-Suen thinning algorithm: 18 examples Zig-zag matrix: 83 examples Total: 44140 examples
Python
<lang python>import urllib, xml.dom.minidom
x = urllib.urlopen("http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml")
tasks = [] for i in xml.dom.minidom.parseString(x.read()).getElementsByTagName("cm"):
t = i.getAttribute('title').replace(" ", "_") y = urllib.urlopen("http://www.rosettacode.org/w/index.php?title=%s&action=raw" % t.encode('utf-8')) tasks.append( y.read().lower().count("{{header|") ) print t.replace("_", " ") + ": %d examples." % tasks[-1]
print "\nTotal: %d examples." % sum(tasks)</lang>
R
<lang R> library(XML) library(RCurl) doc <- xmlInternalTreeParse("http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml") nodes <- getNodeSet(doc,"//cm") titles = as.character( sapply(nodes, xmlGetAttr, "title") ) headers <- list() counts <- list() for (i in 1:length(titles)){ headersi <- getURL( paste("http://rosettacode.org/mw/index.php?title=", gsub(" ", "_", titles[i]), "&action=raw", sep="") ) countsi <- strsplit(headersi,split=" ")1 countsi <- grep("\\{\\{header", countsi) cat(titles[i], ":", length(countsi), "examples\n") } cat("Total: ", length(unlist(counts)), "examples\n") </lang>
Racket
<lang racket>
- lang racket
(require net/url net/uri-codec json (only-in racket/dict [dict-ref ref]))
(define (RC-get verb params)
((compose1 get-pure-port string->url format) "http://rosettacode.org/mw/~a.php?~a" verb (alist->form-urlencoded params)))
(define (get-category catname)
(let loop ([c #f]) (define t ((compose1 read-json RC-get) 'api `([action . "query"] [format . "json"] [list . "categorymembers"] [cmtitle . ,(format "Category:~a" catname)] [cmcontinue . ,(and c (ref c 'cmcontinue))] [cmlimit . "500"]))) (define (c-m key) (ref (ref t key '()) 'categorymembers #f)) (append (for/list ([page (c-m 'query)]) (ref page 'title)) (cond [(c-m 'query-continue) => loop] [else '()]))))
(printf "Total: ~a\n"
(for/sum ([task (get-category 'Programming_Tasks)]) (define s ((compose1 length regexp-match-positions*) #rx"=={{" (RC-get 'index `([action . "raw"] [title . ,task])))) (printf "~a: ~a\n" task s) s))
</lang>
Ruby
First, a RosettaCode module, saved as rosettacode.rb: <lang ruby>require 'open-uri' require 'rexml/document'
module RosettaCode
URL_ROOT = "http://rosettacode.org/mw"
def self.get_url(page, query) begin # Ruby 1.9.2 pstr = URI.encode_www_form_component(page) qstr = URI.encode_www_form(query) rescue NoMethodError require 'cgi' pstr = CGI.escape(page) qstr = query.map {|k,v| "%s=%s" % [CGI.escape(k.to_s), CGI.escape(v.to_s)]}.join("&") end url = "#{URL_ROOT}/#{pstr}?#{qstr}" p url if $DEBUG url end
def self.get_api_url(query) get_url "api.php", query end
def self.category_members(category) query = { "action" => "query", "list" => "categorymembers", "cmtitle" => "Category:#{category}", "format" => "xml", "cmlimit" => 500, } while true url = get_api_url query doc = REXML::Document.new open(url)
REXML::XPath.each(doc, "//cm") do |task| yield task.attribute("title").value end
continue = REXML::XPath.first(doc, "//query-continue") break if continue.nil? cm = REXML::XPath.first(continue, "categorymembers") query["cmcontinue"] = cm.attribute("cmcontinue").value end end
end</lang>
Then, we implement the task with: <lang ruby>require 'rosettacode'
total_examples = 0
RosettaCode.category_members("Programming_Tasks") do |task|
url = RosettaCode.get_url("index.php", {"action" => "raw", "title" => task}) examples = open(url).read.scan("=={{header").length puts "#{task}: #{examples}" total_examples += examples
end
puts puts "Total: #{total_examples}"</lang>
Rust
<lang rust>extern crate reqwest; extern crate url; extern crate rustc_serialize;
use std::io::Read; use self::url::Url; use rustc_serialize::json::{self, Json};
pub struct Task {
page_id: u64, pub title: String,
}
- [derive(Debug)]
enum ParseError {
/// Something went wrong with the HTTP request to the API. Http(reqwest::Error),
/// There was a problem parsing the API response into JSON. Json(json::ParserError),
/// Unexpected JSON format from response UnexpectedFormat,
} impl From<json::ParserError> for ParseError {
fn from(error: json::ParserError) -> Self { ParseError::Json(error) }
}
impl From<reqwest::Error> for ParseError {
fn from(error: reqwest::Error) -> Self { ParseError::Http(error) }
}
fn construct_query_category(category: &str) -> Url {
let mut base_url = Url::parse("http://rosettacode.org/mw/api.php").unwrap(); let cat = format!("Category:{}", category); let query_pairs = vec![("action", "query"), ("format", "json"), ("list", "categorymembers"), ("cmlimit", "500"), ("cmtitle", &cat), ("continue", "")]; base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter()); base_url
}
fn construct_query_task_content(task_id: &str) -> Url {
let mut base_url = Url::parse("http://rosettacode.org/mw/api.php").unwrap(); let mut query_pairs = vec![("action", "query"), ("format", "json"), ("prop", "revisions"), ("rvprop", "content")]; query_pairs.push(("pageids", task_id)); base_url.query_pairs_mut().extend_pairs(query_pairs.into_iter()); base_url
}
fn query_api(url: Url) -> Result<Json, ParseError> {
let mut response = try!(reqwest::get(url.as_str())); // Build JSON let mut body = String::new(); response.read_to_string(&mut body).unwrap();
Ok(try!(Json::from_str(&body)))
}
fn parse_all_tasks(reply: &Json) -> Result<Vec<Task>, ParseError> {
let json_to_task = |json: &Json| -> Result<Task, ParseError> { let page_id: u64 = try!(json.find("pageid") .and_then(|id| id.as_u64()) .ok_or(ParseError::UnexpectedFormat)); let title: &str = try!(json.find("title") .and_then(|title| title.as_string()) .ok_or(ParseError::UnexpectedFormat));
Ok(Task { page_id: page_id, title: title.to_owned(), }) }; let tasks_json = try!(reply.find_path(&["query", "categorymembers"]) .and_then(|tasks| tasks.as_array()) .ok_or(ParseError::UnexpectedFormat));
// Convert into own type tasks_json.iter().map(json_to_task).collect()
} fn count_number_examples(task: &Json, task_id: u64) -> Result<u32, ParseError> {
let revisions = try!(task.find_path(&["query", "pages", task_id.to_string().as_str(), "revisions"]) .and_then(|content| content.as_array()) .ok_or(ParseError::UnexpectedFormat)); let content = try!(revisions[0] .find("*") .and_then(|content| content.as_string()) .ok_or(ParseError::UnexpectedFormat)); Ok(content.split("=={{header").count() as u32)
}
pub fn query_all_tasks() -> Vec<Task> {
let query = construct_query_category("Programming_Tasks"); let json: Json = query_api(query).unwrap(); parse_all_tasks(&json).unwrap()
}
pub fn query_a_task(task: &Task) -> u32 {
let query = construct_query_task_content(&task.page_id.to_string()); let json: Json = query_api(query).unwrap(); count_number_examples(&json, task.page_id).unwrap()
}</lang>
The function is then run using the following: <lang rust> extern crate count_examples; fn main() {
let all_tasks = count_examples::query_all_tasks(); for task in &all_tasks { let count = count_examples::query_a_task(task); println!("Task: {} has {} examples", task.title, count); }
}</lang>
Run BASIC
<lang runbasic>html "
"a$ = httpGet$("http://rosettacode.org/wiki/Category:Programming_Tasks")
a$ = word$(a$,1,"Num | Task | Examples |
")
i = instr(a$,"<a href=""/wiki/") i = instr(a$,"<a href=""/wiki/",i+1) while i > 0
count = count + 1 i = instr(a$,"<a href=""/wiki/",i+1) j = instr(a$,">",i+5) a1$ = mid$(a$,i+15,j-i) taskId$ = word$(a1$,1,"""") task$ = word$(a1$,3,"""") url$ = "http://rosettacode.org/wiki/";taskId$ a2$ = httpGet$(url$) ii = instr(a2$,"") jj = 0 while ii > 0 jj = ii ii = instr(a2$,"",ii+10) wend if jj = 0 then examp = 0 else kk = instr(a2$,"<",jj+24) examp = int(val(mid$(a2$,jj+24,kk-jj-24))) end if
html "";count;"";task$;"";examp;""
totExamp = totExamp + examp
wend
html "**** Total **";totExamp;""
end</lang>
Num | Task | Examples |
1 | 100 doors | 165 |
2 | 24 game | 56 |
3 | 24 game/Solve | 34 |
4 | 99 Bottles of Beer | 192 |
5 | A+B | 129 |
6 | Abstract type | 51 |
7 | Accumulator factory | 65 |
8 | Ackermann function | 132 |
9 | Active Directory/Connect | 13 |
10 | Active Directory/Search for a user | 13 |
11 | Active object | 22 |
12 | Add a variable to a class instance at runtime | 37 |
... | ... | ... |
655 | Y combinator | 53 |
656 | Yahoo! search interface | 16 |
657 | Yin and yang | 38 |
658 | Zebra puzzle | 12 |
659 | Zeckendorf number representation | 18 |
660 | Zig-zag matrix | 65 |
** | ** Total ** | 28611 |
Scala
<lang Scala>import scala.language.postfixOps
object TaskCount extends App {
import java.net.{ URL, URLEncoder } import scala.io.Source.fromURL
System.setProperty("http.agent", "*") val allTasksURL = "http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml" val allTasks = xml.parsing.XhtmlParser(fromURL(new URL(allTasksURL)))
val regexExpr = "(?i)==\\{\\{header\\|".r
def oneTaskURL(title: String) = { println(s"Check $title") "http://www.rosettacode.org/w/index.php?title=%s&action=raw" format URLEncoder.encode(title.replace(' ', '_'), "UTF-8") }
def count(title: String) = regexExpr findAllIn fromURL(new URL(oneTaskURL(title)))(io.Codec.UTF8).mkString length
val counts = for (task <- allTasks \\ "cm" \\ "@title" map (_.text)) yield scala.actors.Futures.future((task, count(task)))
counts map (_.apply) map Function.tupled("%s: %d examples." format (_, _)) foreach println println("\nTotal: %d examples." format (counts map (_.apply._2) sum))
}</lang>
Sidef
<lang ruby>var lwp = require('LWP::UserAgent').new(agent => 'Mozilla/5.0');
var site = 'http://rosettacode.org'; var list_url = '/mw/api.php?action=query&list=categorymembers&'+
'cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml';
var content = lwp.get(site + list_url).decoded_content;
while (var m = content.match(/cm.*?title="(.*?)"/g)) {
(var slug = m[0]).gsub!(' ', '_'); var count = lwp.get("#{site}/wiki/#{slug}").decoded_content.count(/toclevel-1/g); say "#{m[0]}: #{count} examples";
}</lang>
- Output:
100 doors: 2180 examples 24 game: 760 examples 24 game/Solve: 450 examples 9 billion names of God the integer: 320 examples 99 Bottles of Beer: 2330 examples A+B: 1800 examples ABC Problem: 720 examples Abstract type: 680 examples ...
Tcl
<lang tcl>package require Tcl 8.5 package require http package require json
fconfigure stdout -buffering none
proc get_tasks {category} {
set start [clock milliseconds] puts -nonewline "getting $category members..." set base_url http://www.rosettacode.org/w/api.php set query {action query list categorymembers cmtitle Category:%s format json cmlimit 500} set this_query [dict create {*}[split [format $query $category]]] set tasks [list]
while {1} { set url [join [list $base_url [http::formatQuery {*}$this_query]] ?] set response [http::geturl $url] if {[set s [http::status $response]] ne "ok" || [http::ncode $response] != 200} { error "Oops: url=$url\nstatus=$s\nhttp code=[http::code $response]" } set data [json::json2dict [http::data $response]] http::cleanup $response # add tasks to list foreach task [dict get $data query categorymembers] { lappend tasks [dict get [dict create {*}$task] title] } if {[catch {dict get $data query-continue categorymembers cmcontinue} continue_task] != 0} { # no more continuations, we're done break } dict set this_query cmcontinue $continue_task } puts " found [llength $tasks] tasks in [expr {[clock milliseconds] - $start}] milliseconds" return $tasks
}
- This proc can be replaced by a single regexp command:
- set count [regexp -all "***=$needle" $haystack]
- However this proc is more efficient -- we're dealing with plain strings only.
proc count_substrings {needle haystack} {
set count 0 set idx 0 while {[set idx [string first $needle $haystack $idx]] != -1} { incr count incr idx } return $count
}
set total 0 foreach task [get_tasks Programming_Tasks] {
set url [format "http://www.rosettacode.org/w/index.php?title=%s&action=raw" [string map {{ } _} $task]] set response [http::geturl $url] if {[set s [http::status $response]] ne "ok" || [http::ncode $response] != 200} { error "Oops: url=$url\nstatus=$s\nhttp code=[http::code $response]" } set count [count_substrings "\{\{header|" [http::data $response]] puts [format "%3d examples in %s" $count $task] http::cleanup $response incr total $count
}
puts "\nTotal: $total examples"</lang>
TUSCRIPT
<lang tuscript>$$ MODE TUSCRIPT url="http://www.rosettacode.org/w/api.php?action=query&list=categorymembers&cmtitle=Category:Programming_Tasks&cmlimit=500&format=xml" data=REQUEST (url)
BUILD S_TABLE beg=* DATA :title=": BUILD S_TABLE end=* DATA :":
titles=EXTRACT (data,beg|,end,1,0,"~~") titles=SPLIT (titles,":~~:") sz_titles=SIZE (titles)
BUILD R_TABLE header=":==\{\{header|:" all=*
ERROR/STOP CREATE ("tasks",seq-e,-std-)
COMPILE LOOP title=titles ask=* ask =SET_VALUE(ask,"title",title) ask =SET_VALUE(ask,"action","raw") ask =ENCODE (ask,cgi) http ="http://www.rosettacode.org/mw/index.php" url =CONCAT (http,"?",ask) data =REQUEST (url) header =FILTER_INDEX (data,header,-) sz_header=SIZE(header) line =CONCAT (title,"=",sz_header," members") FILE "tasks" = line all =APPEND(all,sz_header) ENDLOOP
ENDCOMPILE all =JOIN(all),sum=SUM(all),time=time() line=CONCAT (time,": ", sz_titles, " Programing Tasks: ", sum, " solutions")
FILE "tasks" = line </lang> Output in file "tasks":
100 doors=104 members 24 game=27 members 24 game/Solve=21 members 99 Bottles of Beer=124 members A+B=76 members Abstract type=35 members Accumulator factory=44 members ... XML/Input=39 members XML/Output=32 members XML/XPath=24 members Xiaolin Wu's line algorithm=0 members Y combinator=33 members Yahoo! search interface=10 members Zig-zag matrix=46 members 2011-01-15 03:41:30: 455 Programing Tasks: 16009 solutions
zkl
Uses shared libraries YAJL and cURL and handles "continue" responses. <lang zkl>var [const] YAJL=Import("zklYAJL")[0], CURL=Import("zklCurl");
fcn getTasks(language){
continueValue,tasks:="",Data(0,String); // "nm\0nm\0...." do{ page:=CURL().get(("http://rosettacode.org/mw/api.php?" "action=query&cmlimit=500"
"&format=json" "&list=categorymembers" "&cmtitle=Category:%s" "&cmcontinue=%s").fmt(language,continueValue));
page=page[0].del(0,page[1]); // get rid of HTML header json:=YAJL().write(page).close(); json["query"]["categorymembers"].pump(tasks,T("get","title")); continueValue=json.find("continue") //continue:-||,cmcontinue:page|954|19) .toList().apply("concat","=").concat("&"); }while(continueValue); tasks
} re:=RegExp(0'!\s+==\s*{{\s*header\s*|!); // == {{ header | zkl foreach task in (getTasks("Programming_Tasks")){
page:=CURL().get( "http://www.rosettacode.org/mw/index.php?title=%s&action=raw" .fmt(CURL.urlEncode(task))); page=page[0].del(0,page[1]); // get rid of HTML header cnt,n:=0,0; while(re.search(page,True,n)){ cnt+=1; n=re.matched[0].sum(0); } "%4d: %s".fmt(cnt,task).println();
}</lang>
- Output:
229: 100 doors 15: 15 Puzzle Game ... 257: 99 Bottles of Beer 199: A+B ... 28: Calendar - for "REAL" programmers ... 9: Stream Merge ... 78: Zero to the zero power 19: Zhang-Suen thinning algorithm 83: Zig-zag matrix
- Programming Tasks
- Rosetta Code related
- Ada
- AWS
- AutoHotkey
- BBC BASIC
- Bracmat
- C sharp
- Clojure
- D
- EGL
- Erlang
- Xmerl
- F Sharp
- Factor
- Go
- Haskell
- HTTP XML
- Unicon
- ",tab(find("
- Icon Programming Library
- J
- Java
- Jq
- Lasso
- Perl
- Mojolicious
- Perl 6
- PicoLisp
- PureBasic
- Python
- R
- XML (R)
- RCurl
- Racket
- Ruby
- REXML
- Rust
- Run BASIC
- Scala
- Sidef
- Tcl
- Tcllib
- TUSCRIPT
- Zkl
- Batch File/Omit
- Brainf***/Omit
- Brlcad/Omit
- GUISS/Omit
- Lilypond/Omit
- Maxima/Omit
- Openscad/Omit
- PostScript/Omit
- TI-83 BASIC/Omit
- TI-89 BASIC/Omit
- Yorick/Omit
- ZX Spectrum Basic/Omit