Talk:Jewels and stones: Difference between revisions
Content added Content deleted
Thundergnat (talk | contribs) (Merge and delete?) |
(Further comment.) |
||
Line 8: | Line 8: | ||
::: Sorry. I was trying to be funny but that doesn't come across very well in text. :-( My point was we already have pretty much exactly this task with a more generic name: [[Count occurrences of a substring]] My vote on this task is to merge and delete. (Perhaps with a redirect.) |
::: Sorry. I was trying to be funny but that doesn't come across very well in text. :-( My point was we already have pretty much exactly this task with a more generic name: [[Count occurrences of a substring]] My vote on this task is to merge and delete. (Perhaps with a redirect.) |
||
::It seems to me that there's a subtle difference between the two. The existing task was counting how many times B (of arbitrary length) was contained in A. The new one is counting how many characters (or if you like sub-strings of length 1) ''within'' B are contained in A. |
|||
::I can't say I'm too bothered either way but I'd be inclined to let it stand. What does Paddy think? --[[User:PureFox|PureFox]] ([[User talk:PureFox|talk]]) 15:36, 25 April 2018 (UTC) |
Revision as of 15:38, 25 April 2018
The task could do with a description on RC. If you don't have permission, please don't just copy another sites description.
Thanks. --Paddy3118 (talk) 12:27, 25 April 2018 (UTC)
- Indeed. Jewels and Stones is not very descriptive of what the task is doing and could be a copyrighted term. A better, more generic name would be something like: Count occurrences of a substring. If only we had such a task... --Thundergnat (talk) 12:53, 25 April 2018 (UTC)
- Sorry. I was trying to be funny but that doesn't come across very well in text. :-( My point was we already have pretty much exactly this task with a more generic name: Count occurrences of a substring My vote on this task is to merge and delete. (Perhaps with a redirect.)
- It seems to me that there's a subtle difference between the two. The existing task was counting how many times B (of arbitrary length) was contained in A. The new one is counting how many characters (or if you like sub-strings of length 1) within B are contained in A.