Wikipedia:Bots/Requests for approval/SmackBot XXIV
- The following discussion is an archived debate. Please do not modify it. To request review of this BRFA, please start a new section at WT:BRFA. The result of the discussion was Request Expired.
Operator: Rich Farmbrough (talk · contribs)
Automatic or Manually assisted: Auto
Programming language(s): AWB/Perl
Source code available: Standard AWB, one offs using PERL API
Function overview: Simple text search and replace.
Links to relevant discussions (where appropriate): This is for non-contentious search and replace tasks.
Edit period(s): Intermittent runs.
Estimated number of pages affected: Probably 100 or less per day.
Exclusion compliant (Y/N): Yes
Already has a bot flag (Y/N): Y
Function details: Search and replace specific relatively low volume non contentious strings. Similar to Wikipedia:Bots/Requests for approval/Xenobot 6
Discussion
[edit]This is to cover simple replacements such as are often made at Wikipedia:Bot_requests. Rich Farmbrough, 04:51, 25 April 2010 (UTC).[reply]
- I'm concerned that this is basically a blank cheque. The precedent you cite, Wikipedia:Bots/Requests for approval/Xenobot 6, was for a specific phrase. Do you have anything specific in mind? Josh Parris 09:39, 4 May 2010 (UTC)[reply]
- Yes at the time it was somethign I forget, recently I was looking at /''' (fl\.? (\d)/''' ([[floruit|fl.]] $1/, right now I'm looking at /(==\n\s*{{\s*[Ee]xpand)\s*\|\s*[Ss](ection\s*[\|}])/$1 s$2/ and /(==\n\s*{{\s*)[Ee]xpand(\s*\|?\s*[Ss]ection\s*}}\s*\n==)/$1Empty$2/. Rich Farmbrough, 01:33, 5 May 2010 (UTC).[reply]
- A user has requested the attention of the operator. Once the operator has seen this message and replied, please deactivate this tag. (user notified) In the future, how will you be determining if a request is non-contentious? Josh Parris 03:10, 5 May 2010 (UTC)[reply]
- IMHO, I feel it would be better to get approval for each type of task as and when they come up (i.e. so should someone request the exact same task again, you won't need further approval). A blanket approval for 'simple' tasks just doesn't sit right with me. - Mobius Clock 21:06, 5 May 2010 (UTC)[reply]
- A user has requested the attention of the operator. Once the operator has seen this message and replied, please deactivate this tag. (user notified) In the future, how will you be determining if a request is non-contentious? Josh Parris 03:10, 5 May 2010 (UTC)[reply]
- Yes at the time it was somethign I forget, recently I was looking at /''' (fl\.? (\d)/''' ([[floruit|fl.]] $1/, right now I'm looking at /(==\n\s*{{\s*[Ee]xpand)\s*\|\s*[Ss](ection\s*[\|}])/$1 s$2/ and /(==\n\s*{{\s*)[Ee]xpand(\s*\|?\s*[Ss]ection\s*}}\s*\n==)/$1Empty$2/. Rich Farmbrough, 01:33, 5 May 2010 (UTC).[reply]
Request Expired. Josh Parris 11:11, 25 May 2010 (UTC)[reply]
- The above discussion is preserved as an archive of the debate. Please do not modify it. To request review of this BRFA, please start a new section at WT:BRFA.