config: rectangles topics: replace lifetimes with algorithm#309
config: rectangles topics: replace lifetimes with algorithm#309petertseng merged 1 commit intoexercism:masterfrom petertseng:rect
Conversation
This has been a long time coming. Ever since #167 (comment) lifetimes should not have been a topic for rectangles. The reasons were discussed there already: * The "Putting it All Together" problems do not emphasise Rust language features in general. * The specific feature "lifetimes" is not implied by this problem. A sampling of ten submitted solutions shows two solutions with lifetimes. I used the exercism/problem-specifications#834 command to inspect other tracks' topics to see if we can glean any insight here. C#/F#: parsing, transforming Lua: strings, performance, control-flow (if/else, loops), algorithms Based on these, my recommendation: A possible topic is string parsing, because we are reading in a string and trying to make sense of it. However this is not parsing in the usual sense that one would use a parser for, which usually deals with text. If we were to declare "string parsing" a topic of rectangles, we would probably use it for ocr-numbers too (but we do not; the topics for ocr-numbers are lines, slices, chunks). "algorithm" is chosen because significant work will likely go into devising an algorithm for determining the rectangles, since that is not immediately obvious from the problem description. Solutions will likely display a diverse set of approaches. One might surmise that the alphametics exercise could have this topic as well, but this commit deals with rectangles only.
ijanos
left a comment
There was a problem hiding this comment.
I think "algorithm" is a bit too general but I yet to come up with a better name.
|
It is a difficult one for me, which is why I had not come up with one before this point either. Diverse approaches means it's hard to come up with something, I spupose? I suppose one can have combinatorics, if one takes the approach of checking every pair of corners, but not all take this approach. I'll think more about it before merging. Topics are not used, so no rush. |
|
Is there a record for most discussion over a one-line change? |
|
failed to find a better topic. further thought about it would cause the time spent to exceed the value of the change (the value of the change is almost zero because topics are not used). so it has to be merged. |
This has been a long time coming.
Ever since #167 (comment) lifetimes
should not have been a topic for rectangles.
The reasons were discussed there already:
features in general.
sampling of ten submitted solutions shows two solutions with
lifetimes.
I used the exercism/problem-specifications#834 command to
inspect other tracks' topics to see if we can glean any insight here.
C#/F#: parsing, transforming
Lua: strings, performance, control-flow (if/else, loops), algorithms
Based on these, my recommendation:
A possible topic is string parsing, because we are reading in a string
and trying to make sense of it. However this is not parsing in the usual
sense that one would use a parser for, which usually deals with text.
If we were to declare "string parsing" a topic of rectangles, we would
probably use it for ocr-numbers too (but we do not; the topics for
ocr-numbers are lines, slices, chunks).
"algorithm" is chosen because significant work will likely go into
devising an algorithm for determining the rectangles, since that is not
immediately obvious from the problem description. Solutions will likely
display a diverse set of approaches.
One might surmise that the alphametics exercise could have this topic as
well, but this commit deals with rectangles only.