String Shenanigans

Question

Challenge

In this challenge, you are to code in any language a program or function that will take a string and replace certain characters within it with different characters.

Input

The input is the same for both functions and full programs:

[string] [char1] [char2]

• string will be an indefinite line of characters surrounded by quotation mars, such as "Hello, World!" or "1 plus 2 = 3".

• char1 will be a single character within string.

• char2 will be a single character not necessarily in string.

Output

[modified string]

Your output will take string and replace all instances of char1 with char2, then output the result as modified string. Case should be ignored, so the input "yolO" o u should output yulu.

Examples

Input

"Hello, World!" l r

Output

Herro, Worrd!

---

Input

"Slithery snakes slurp Smoothies through Silly Straws" s z

Output

zlithery znakez zlurp zmoothiez through zilly ztrawz

---

Input

"Grant Bowtie: Only the best future bass artist ever" : -

Output

Grant Bowtie- Only the best future bass artist ever

---

Input

"019 + 532 * 281 / ? = waht/?" / !

Output

019 + 532 * 281 ! ? = waht!?

Other details

This is code golf, so the shortest answer (in bytes) at the end of the week (the 14th of September) wins. Also, anything not specified in this challenge is fair game, meaning that stuff I don't explain is up to you.

Answer 1

Vim, 18 keystrokes

$bD:s/<C-R>"<Left><BS>/<Right>/i<CR>x$x

Assuming the cursor is on the first column of the first line, and the open file contains this:

"yolO" o u

The file will end up containing:

"yulu" 

Answer 2

JavaScript ES6, 28 bytes

(s,a,b)=>s.replace(a,b,'gi')

Firefox only as it uses a mozilla-specific feature.

Answer 3

Pyth, 10 bytes

XQr*2w4*2w

Try in online: Demonstration or Test Suite

Explanation:

 Q             read a line and evaluates (reads a string with quotes)
     w         reads a char: a (actually reads a line)
   *2          make it twice as long: aa (repeat the char)
  r   4        capitalize this string: Aa
       *2w     read another char and repeat it: bb
X              replace the letters Aa by bb in Q

Answer 4

Retina, 29 bytes

i`(.)(?=.*\1 (.)$)|"|....$
$2

For scoring purposes each line goes in a separate file, but for convenience you can run the above from a single file with the -s flag.

As this is just a single regex replacement, you can test it here.

The regex consists of three parts, one to do the substitution and two to clean up the rest of the input. This is the substitution part:

(.)       # Match a character and capture it in group 1.
(?=       # Lookahead to ensure that this is the character we're searching for.
  .*      # Consume arbitrary characters to move to the end of the string.
  \1 (.)$ # Ensure we can match the captured character, then a space, then
          # another character and then the end of input. That other character
          # is captured in group 2.
)

This match is replaced by $2, i.e. the character to be substituted in.

The other two possibilities are either to match a ", or to match the last four characters of the input. In either case group two is empty, so the replacement string $2 evaluates to an empty string and the match is simply removed from the input. This cleans up the quotes and the characters at the end.

i` simply activates case insensitive matching.

Answer 5

gawk - 48

IGNORECASE=gsub(/"/,_),gsub($(NF-1),$NF)+(NF-=2)

That IGNORECASE hurts...

How to use

In bash enter: awk 'IGNORECASE=gsub(/"/,_),gsub($(NF-1),$NF)+(NF-=2)'

Then enter a string in quotes and the two characters. In front of some characters ("[" and "(" I know of) you have to enter a backslash, because awk would try to interpret them as regular expression instead.

Answer 6

Octave, 28

An anonymous function using built in functions.

@(W,T,F)strrep(lower(W),T,F)

Assuming it is stored in f we can call it as follows:

f('Slithery snakes slurp Smoothies through Silly Straws','s','z')

Answer 7

R, 28

function(s,c,r)gsub(c,r,s,T)

Had the order of the arguments been (c,r,s), I thought of doing

functional::Curry(gsub,i=T)

functional is a 3rd-party package whose Curry functional allows redefining function arguments: here, returns a function like gsub but with the modified ignore.case = TRUE.

Answer 8

CJam, 18 17 bytes

Kind of awkward handling the quotes and upper vs. lower case. But I believe it works for all cases:

l'"%~S%(eu_el+\er

Try it online

Thanks to @Dennis for golfing 1 byte.

Note that this is a full program that takes the input exactly as specified in the question. I can make this shorter if the input requirements are interpreted more flexibly.

Explanation:

l     Get input.
'"%   Split at quotes. This separates the string from the remaining arguments,
      and gets rid of the quotes.
~     Unwrap the list. We now have two strings on the stack, the input text
      and a string containing the two letters.
S%    Split the string containing the two letters.
(     Pop off the first ("source") letter.
eu    Convert it to upper case.
_el   Copy and convert to lower case.
+     Concatenate the two, giving us a string with upper and lower case.
\     Swap the second ("target") letter to top.
er    Transliterate.

Answer 9

Scala, 59 bytes

(s:String,a:Char,b:Char)=>(s"(?i)$a"r).replaceAllIn(s,""+b)

An anonymous function that uses s"" alongwith ""r to dynamically build a case-insensitive regex.

Answer 10

Ruby, 17 bytes

f=->s,*r{s.tr *r}

For example:

> f["Hello there!", ?e, ?a]
=> Hallo thara!

Answer 11

PowerShell, 33 30 Bytes

param($a,$b,$c)$a-replace$b,$c

Expects input via command-line argument. PowerShell has many built-in case-insensitive operators that just tack on an i in front of the usual operator -- here as -ireplace instead of -replace -- so the case-insensitive matching was actually pretty easy.

PS C:\Tools\Scripts\golfing> .\string-shenanigans.ps1 "Hello, World!" l r
Herro, Worrd!

PS C:\Tools\Scripts\golfing> .\string-shenanigans.ps1 "Slithery snakes slurp Smoothies through Silly Straws" s z
zlithery znakez zlurp zmoothiez through zilly ztrawz

PS C:\Tools\Scripts\golfing> .\string-shenanigans.ps1 "019 + 532 * 281 / ? = waht/?" / !
019 + 532 * 281 ! ? = waht!?

Saved 3 bytes thanks to briantist

Answer 12

Pyth, 7 19? / 15 bytes

jwcjrz1cwrz0rz1

Example Input

(My second Pyth program, ever). Any tips on golfing are welcome. A lot of the bytes are going to the repeated rz1/rz0. I could chop some of these I could be guaranteed the case.

---

If quotes are required, a slightly larger 19-byte program handles that:

jwcjrz1c:w1_1rz0rz1

---

Explanation:

This basically. Takes a string:

Slithery snaKEs

Then, chops all lowercase instances of the the character to replace.

['Slithery ','naKE','']

Then joins with the uppercase instance:

Slithery SnaKES

Then chops on the uppercase instance:

['','lithery ','naKE']

Then joins with the new character:

qlithery qnaKEq

Answer 13

Pyth - 11 bytes

A simple regexp solution with case insensitive. Will try to translate to Retina if I get it to compile.

:Q+"(?i)"ww

Test Suite.

Answer 14

mSL, 68 bytes

$replace($gettok($1-,-3-1,32),$gettok($1-,-2,32),$gettok($1-,-1,32))

Answer 15

Bash 4.0+, 21 bytes

Command-line arguments.

tr ${2^}${2,} $3<<<$1

Answer 16

C#, 93 120 124 123 bytes

class A{static void Main(string[]a){System.Console.Write(a[0].Replace(a[1].ToLower(),a[2]).Replace(a[1].ToUpper(),a[2]));}}

Not sure if I can golf this much better than this, but surprisingly low byte count for C# =D

EDIT: Thanks, Reto Koradi for pointing out the case sensitivity.

EDIT 2: More stuff I missed out on. Maybe doing this during a break in work isn't the best time.

Answer 17

Shell 15 bytes:

sed s/$1/$2/gi

Save as submission.sh and run as:

$ echo "Hello, World" | ./submission.sh h e
eello, World

Explanation:

sed (stream editor) has a substitute command, which parses standard input and substitutes string $1 for string $2. The g modifier substitutes globally in the input string, and i modifier produces a case-insensitive match.

Old Solution:

Shell, 14 bytes submission_1.sh

tr $2 $3<<<$1

Call with

$ ./submission_1.sh 'hello there!lgge lfewf lger3%#@ %@#T @EG' l r
herro there!rgge rfewf rger3%#@ %@#T @EG

Alternate, Shell 9 bytes: submission_2.sh (May be too rule-bendy)

tr $1 $2

Call with

$ ./submission_2.sh l r <<<'hello there!lgge lfewf lger3%#@ %@#T @EG'
herro there!rgge rfewf rger3%#@ %@#T @EG

Explanation

tr by default (without any flags) replaces all chars in the first set with the chars in the second set, completing the operation with the data on standard input.

I'm using this to my advantage by calling TR with the arguments in the correct order, and (in the alternate submission) taking advantage of the handling of standard input by Bourne Shell (sh) to pass standard input to tr without any additional code.

Answer 18

Sed, 43 Chars

:;s/(.)(.*\1 (.))$/\3\2/I;t;s/(. .$|")//g

Invoked with the -r flag for extended regex.

Answer 19

C++ 11, Stand-alone: 213 202 198 bytes

Since I haven't seen a solution on C++ yet, I decided to try something myself. This is my first version and I will try to optimize it later.

Source code running:

Live Version: 213 202 198 bytes

#include <algorithm>
#include <iostream>
using namespace std;int main(){string a;getline(cin,a);char b,c;cin.get(b);cin.get(c);replace_if(begin(a),end(a),[b](char d){return!((d-b)%32);},c);cout<<a;}

.

Only the replace function: 121 110 107 bytes

getline(cin,a);cin.get(b);cin.get(c);replace_if(begin(a),end(a),[b](char d){return!((d-b)%32);},c);cout<<a;

.

Feedback is welcome.

Answer 20

Python, 58 bytes

Uses case-insensitive regex for substitution.

from re import*
lambda s,t,u:compile(escape(t),I).sub(u,s)

Answer 21

Javascript ES6, 54 chars

f=s=>s.replace(/(.)(?=.* \1 (.)$)/ig,"$2").slice(1,-5)

Answer 22

PHP, 44 Bytes

<?=str_ireplace($argv[2],$argv[3],$argv[1]);

Called from the command line via php golf.php "Grant Bowtie: Only the best future bass artist ever" : -

Answer 23

Python 2.7, 117 bytes

def r(s): print ''.join([list(s)[-1]  if x.lower() == list(s)[-3] else x if x != '\"' else '' for x in list(s)][:-4])

Python certainly won't compare to other golfing languages for this challenge, but nothing beats it for list (in)comprehensions.

If you want it to be a 'standalone' program it increases the size to about 120

import sys
if __name__ == "__main__":
  l, y, z = sys.argv[1:]
  print ''.join([z  if x.lower() == y else x for x in l])

Answer 24

Shell, 34 27 35 bytes

#!/bin/sh
echo $1|sed "s/$2/$3/gi"

Answer 25

Lua, 36 bytes

a=arg[1]:gsub(arg[2],arg[3])print(a)

Answer 26

Gema, 40 characters

"*" ? ?=@subst{\\C@quote{?}=@quote{?};*}

Sample run:

bash-4.3$ gema '"*" ? ?=@subst{\\C@quote{?}=@quote{?};*}' <<< '"Hello, World!" l r'
Herro, Worrd!

Answer 27

O, 31 bytes

i`' /l3-{' \++}d`'"-"(?i)"@+@%p

Answer 28

Perl, 33 chars (without !#) 48 (including !#)

#!/usr/bin/perl
($_,$b,$c)=@ARGV;
s/$b/$c/i;
print;

My first golf, one of my first perl programs. Probably could be golfed a little more