Talk:Long literals, with continuations

From Rosetta Code
Revision as of 10:16, 24 March 2020 by Thundergnat (talk | contribs) (Enforcing imaginary rules - new section)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The point of the task is to show how to code a (as a literal) list of tokens, with (or without) continuation(s), and to verify the list by showing the number of elements, and also by showing the last element name in the list. Opinions such as the above should probably be better voiced in this task's talk page. --Anonymous edit dumped on the main task page unattributed Moved here as suggested. --Thundergnat (talk) 10:13, 24 March 2020 (UTC)

Enforcing imaginary rules

The task states:

Task
  • Write a computer program (by whatever name) to contain a list of the known elements.
  • The program should eventually contain a long literal of words   (the elements).
  • The literal should show how one could create a long list of blank-delineated words.
  • The "final" (stored) list should only have a single blank between elements.
  • Try to use the most idiomatic approach(es) in creating the final list.
  • Use continuation if possible, and/or show alternatives   (possibly using concatenation).
  • Use a program comment to explain what the continuation character is if not obvious.
  • The program should contain a variable that has the date of the last update/revision.
  • The program, when run, should display with verbiage:
  • The last update/revision date   (and should be unambiguous).
  • The number of chemical elements in the list.
  • The name of the highest (last) element name.

Nowhere does it state the list must contain only the element names. Nowhere does it state what the capitalization of the element names must be. Yet the task author flagged the Raku entry as incorrect for not following those imaginary rules. Interestingly the task was not flagged for not having a single blank between elements after it is read into memory. (It doesn't because that is nonsensical, there isn't really really a way to have blanks between elements in memory; but that is a requirement of the task) As the point of the task seems to be "quote a string" and the Raku entry does that, I am not inclined to change it. --Thundergnat (talk) 10:13, 24 March 2020 (UTC)