Talk:Rosetta Code/Count examples/Full list/Tier 4: Difference between revisions

From Rosetta Code
Content added Content deleted
m (and by the way,)
No edit summary
Line 4: Line 4:


: Is it ideal? No, it's not. But the algorithm is pretty darn accurate as long as the task header markup is correct. Am I particularly inclined to modify the parsing logic to find unsupported markup? No, not really. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 15:55, 31 January 2022 (UTC)
: Is it ideal? No, it's not. But the algorithm is pretty darn accurate as long as the task header markup is correct. Am I particularly inclined to modify the parsing logic to find unsupported markup? No, not really. --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 15:55, 31 January 2022 (UTC)

:: So it is rosettacode that is supporting unsupported markup when it generates http://www.rosettacode.org/wiki/Category:F_Sharp. Where is supported markup defined? --[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 16:08, 31 January 2022 (UTC)


:(And by the way, that 123 is the number of languages that it recognizes as having an entry for that task, not not an entry number.) --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 16:02, 31 January 2022 (UTC)
:(And by the way, that 123 is the number of languages that it recognizes as having an entry for that task, not not an entry number.) --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 16:02, 31 January 2022 (UTC)

Revision as of 16:09, 31 January 2022

Entry 123 claims that F# does not implement Matrix Multiplication. http://www.rosettacode.org/wiki/Category:F_Sharp has Matrix Multiplication under Pages in category "F Sharp".--Nigel Galloway (talk) 15:10, 31 January 2022 (UTC)

The report generating logic doesn't use any heuristics to try to determine if a particular piece of code is written in any particular language. It only looks at the presence (or absence) of the Rosettacode supported language header to tell if that language has an example or not. The supported header for F Sharp is =={{header|F_Sharp|F#}}==; the Matrix Multiplication F Sharp entry header is =={{header|F#}}==, so it is not recognized as belonging to F_Sharp (the languages name on Rosettacode).
Is it ideal? No, it's not. But the algorithm is pretty darn accurate as long as the task header markup is correct. Am I particularly inclined to modify the parsing logic to find unsupported markup? No, not really. --Thundergnat (talk) 15:55, 31 January 2022 (UTC)
So it is rosettacode that is supporting unsupported markup when it generates http://www.rosettacode.org/wiki/Category:F_Sharp. Where is supported markup defined? --Nigel Galloway (talk) 16:08, 31 January 2022 (UTC)
(And by the way, that 123 is the number of languages that it recognizes as having an entry for that task, not not an entry number.) --Thundergnat (talk) 16:02, 31 January 2022 (UTC)