The Name Game: Difference between revisions

{{trans|Python}}

 

V l = [String(‘b’), ‘f’, ‘m’]

V s = n[1..]

 

L(n) [‘Gary’, ‘Earl’, ‘Billy’, ‘Felix’, ‘Mary’]

 

=={{header|Ada}}==

{{works with|Ada|Ada|2012}}

 

with Ada.Strings.Unbounded;

with Ada.Text_IO;

Lyrics(+name);

end loop;

{{out}}

<pre>Gary, Gary, bo-bary

=={{header|ALGOL 68}}==

{{works with|ALGOL 68G}}

main:(

PROC print lyrics = (STRING name) VOID:

OD

)

 

=={{header|AutoHotkey}}==

BFM := false

if (SubStr(x, 1, 1) ~= "i)^[AEIOU]") ; Vowel

result .= output "`n`n"

}

{{out}}

<pre>Gary, Gary, bo-bary

 

=={{header|AWK}}==

# syntax: GAWK -f THE_NAME_GAME.AWK

BEGIN {

printf("%s!\n\n",x)

}

{{out}}

<pre>

=={{header|BASIC256}}==

{{trans|FreeBASIC}}

x = lower(nombre)

x = upper(mid(x,1,1)) + (mid(x,2,length(x)-1))

call TheGameName(listanombres[i])

next i

{{out}}

<pre>

=={{header|C}}==

{{trans|Kotlin}}

#include <string.h>

 

for (i = 0; i < 6; ++i) print_verse(names[i]);

return 0;

 

{{out}}

=={{header|C sharp|C#}}==

{{trans|Java}}

using System.Collections.Generic;

using System.Text;

}

}

{{out}}

<pre>Gary, Gary, bo-bary

=={{header|C++}}==

{{trans|C#}}

#include <iostream>

#include <string>

 

return 0;

{{out}}

<pre>Gary, Gary, bo-bary

Note also the code on lines 30 and 75 to convert the case of the first letter... On some Commodore machines, the default is to render text in ALL CAPS, shifted letters become graphic symbols. This program sets the mode to display mixed case [chr$(14)] and then converts the first letter of the name for the purpose of uniform pattern matching in case the user types the name properly with a capitalized first letter.

 

2 rem rosetta code

5 dim cn$(3),bl$(3,32):gosub 1000

2050 rem quadgraph

2060 data schr,schl

 

{{out}}

 

=={{header|D}}==

import std.array;

import std.conv;

printVerse(name);

}

 

=={{header|Dyalect}}==

 

let x = name[..1].Upper() + name[1..].Lower();

let y = "AEIOU".IndexOf(x[0]) > -1 ? x.Lower() : x[1..]

for x in seq {

printVerse(x)

 

{{out}}

=={{header|F_Sharp|F#}}==

===The function===

// The Name Game. Nigel Galloway: March 28th., 2018

let fN g =

|'m' -> fG ("b"+g.[1..]) ("f"+g.[1..]) (g.[1..])

|_ -> fG ("b"+g.[1..]) ("f"+g.[1..]) ("m"+g.[1..])

===The Task===

fN "Nigel"

{{out}}

<pre>

Nigel!

</pre>

fN "Earl"

{{out}}

<pre>

Earl!

</pre>

fN "Billy"

{{out}}

<pre>

Billy!

</pre>

fN "Fred"

{{out}}

<pre>

Fred!

</pre>

fN "Mum"

{{out}}

<pre>

{{trans|Kotlin}}

{{works with|Factor|0.98}}

pair-rocket qw sequences ;

IN: rosetta-code.name-game

${Name}!I] nl nl ;

 

{{out}}

<pre>

 

=={{header|FreeBASIC}}==

Dim As String x = Lcase(nombre)

x = Ucase(Mid(x,1,1)) + (Mid(x,2,Len(x)-1))

TheGameName(listanombres(i))

Next i

{{out}}

<pre>

=={{header|Go}}==

{{trans|Kotlin}}

 

import (

printVerse(name)

}

 

{{out}}

 

=={{header|Haskell}}==

-- The Name Game, Ethan Riley, 22nd May 2018

import Data.Char

main =

mapM_ (putStrLn . theNameGame) ["Gary", "Earl", "Billy", "Felix", "Mike", "Steve"]

{{out}}

<pre>

=={{header|J}}==

Substitutions must conform to the region they replace. Cannot directly substitute 'Gary' where 'X' occurs in the template. Work instead with boxes, then at the end raze them to recover the verse.

T=:TEMPLATE=: noun define

(X), (X), bo-b(Y)

; XBox

)

<pre>

nameGame&> ;:'Gary Earl Billy Felix Mary'

=={{header|Java}}==

{{trans|Kotlin}}

 

public class NameGame {

Stream.of("Gary", "Earl", "Billy", "Felix", "Mary", "Steve").forEach(NameGame::printVerse);

}

{{out}}

<pre>Gary, Gary, bo-bary

 

=={{header|JavaScript}}==

 

// normalize name

'Gary Earl Billy Felix Mary Christine Brian Yvonne Yannick'.split(' ');

for (let i = 0; i < names.length; i++)

{{out}}<pre>

Gary, Gary, bo-bary

 

=={{header|Julia}}==

 

function printverse(name::AbstractString)

end

 

 

{{out}}

 

=={{header|Kotlin}}==

 

fun printVerse(name: String) {

fun main(args: Array<String>) {

listOf("Gary", "Earl", "Billy", "Felix", "Mary", "Steve").forEach { printVerse(it) }

 

{{out}}

=={{header|Lua}}==

{{trans|C#}}

local sb = string.lower(name)

sb = sb:gsub("^%l", string.upper)

for _,name in pairs(nameList) do

printVerse(name)

{{out}}

<pre>Gary, Gary, bo-bary

song$=format$("\r\n{0}, {0}, bo-{2}{1}\r\nBanana-fana fo-{3}{1}\r\nFee-fi-mo-{4}{1}\r\n{0}!\r\n")

 

Module The.Name.Game {

Flush

}

The.Name.Game

 

{{out}}

 

=={{header|Mathematica}} / {{header|Wolfram Language}}==

NameGame[n_] := Module[{y, b, f, m},

If[StringStartsQ[ToLowerCase[n], "a" | "e" | "i" | "u" | "o"],

NameGame["Felix"]

NameGame["Mary"]

{{out}}

<pre>Gary, Gary, bo-bary

{{works with|min|0.19.3}}

{{trans|Factor}}

 

(

) :name-game

 

{{out}}

<pre>

=={{header|MIPS Assembly}}==

The cartridge header and print routines were omitted so that the reader can focus on the logic.

la $s0,theName

jal PrintString_NameGame

.ascii "?!"

.byte 0

{{out}}

[https://ibb.co/V9GcTFV Screenshot of emulator]

 

=={{header|Modula-2}}==

FROM Strings IMPORT Concat;

FROM ExStrings IMPORT Lowercase;

 

ReadChar;

 

=={{header|Nanoquery}}==

{{trans|Python}}

l = {"b", "f", "m"}

s = n.substring(1)

for n in names

print_verse(n)

 

 

=={{header|Nim}}==

 

const

for name in ["Gary", "Earl", "Billy", "Felix", "Mary"]:

echo name.lyrics()

 

{{out}}

=={{header|Perl}}==

{{trans|Lua}}

$x = ucfirst lc shift;

$x0 = substr $x, 0, 1;

}

 

{{out}}

<pre>Gary, Gary, bo-bary

=={{header|Phix}}==

{{trans|Go}}

<span style="color: #008080;">constant</span> <span style="color: #000000;">fmt</span> <span style="color: #0000FF;">=</span> <span style="color: #008000;">"""

%s, %s, bo-%s

<span style="color: #008080;">constant</span> <span style="color: #000000;">tests</span> <span style="color: #0000FF;">=</span> <span style="color: #0000FF;">{</span><span style="color: #008000;">"gARY"</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"Earl"</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"Billy"</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"Felix"</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"Mary"</span><span style="color: #0000FF;">,</span> <span style="color: #008000;">"SHIRley"</span><span style="color: #0000FF;">}</span>

<span style="color: #008080;">for</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">=</span><span style="color: #000000;">1</span> <span style="color: #008080;">to</span> <span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tests</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">do</span> <span style="color: #000000;">printVerse</span><span style="color: #0000FF;">(</span><span style="color: #000000;">tests</span><span style="color: #0000FF;">[</span><span style="color: #000000;">i</span><span style="color: #0000FF;">])</span> <span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

=={{header|Picat}}==

{{works with|Picat}}

print_name_game(Name), Name = [V|Rest], membchk(V, ['A', 'E', 'I', 'O', 'U']) =>

L = to_lowercase(V),

print_name_game(Name)

end.

{{out}}

<pre>

=={{header|PowerShell}}==

{{trans|Chris}}

## Clear Host from old Ouput

Clear-Host

}

Write-Host "$Name"

 

=={{header|Prolog}}==

map_name1(C, Cs, Fc, [Fc,C|Cs]) :- member(C, ['a','e','i','o','u']).

map_name1(C, Cs, Fc, [Fc|Cs]) :-

 

test :-

{{out}}

<pre>

 

=={{header|Python}}==

l = ['b', 'f', 'm']

s = n[1:]

# Assume that the names are in title-case and they're more than one character long

for n in ['Gary', 'Earl', 'Billy', 'Felix', 'Mary']:

 

=={{header|q}}==

===String search and replace===

V:raze 1 lower\"AEIOUY"; / vowels

tn:lower((Name in V)?1b) _ Name; / truncated Name

s:"$1, $1, bo-b$2\nBanana-fana-fo-f$2\nFee-fimo-m$2\n$1!\n\n";

(ssr/).(s;("$1";"$2";s3 0);(Name;tn;s3 1)) }

===Amend a list of strings===

pfx:Name,", ",Name,", "; / prefix

n:lower Name;

// test

1 "\n"sv raze game_ssr each ("Gary";"Earl";"Felix";"Stephen";"Ryan";"Jo");

{{out}}

<pre>Gary, Gary, bo-bary

Meh. The rules leave out some corner cases (see Steve) but what the heck, technically correct is the best kind of correct.

 

my $fl = $name.lc.substr(0,1);

$fl ~~ /<[aeiou]>/

}

 

{{out}}

<pre>Gary, Gary, bo-bary

Extra code was added to the REXX program to capitalize the name (and lowercase all characters in the name except the 1^st character).

<br>Also, dual names are supported &nbsp;(like Mary Ann).

parse arg $ /*obtain optional argument(s) from C.L.*/

if $='' then $="gAry, eARL, billy, FeLix, MarY" /*Not specified? Then use the default.*/

end /*select*/

say z'!'; say

{{out|output|text= &nbsp; when using the default (internal) names:}}

<pre>

More idiomatic Ruby while not being object-oriented.

Also, like the Commodore Basic version, we handle consonants at the start of the name using a Regular Expression so we can handle appropriately names like Steve or Chris. Byron is an interesting edge-case because has a "y" and also starts with "b".

 

def print_verse(name)

end

 

{{out}}

<pre>Gary, Gary, bo-bary

 

=={{header|Scala}}==

private def printVerse(name: String): Unit = {

val x = name.toLowerCase.capitalize

 

Stream("gAry", "earl", "Billy", "Felix", "Mary", "Steve").foreach(printVerse)

 

See it running in your browser by [https://scastie.scala-lang.org/UilFJ0zFSJu4Qk2xaw2r4A Scastie (JVM)].

This implements the required rules and also attempts to handle names that start with consonant clusters.

 

namegame() {

local name=$1 b=b f=f m=m

namegame "$name"

echo

 

{{Out}}

 

=={{header|VBA}}==

 

Sub Main()

Next

TheGameName = t

{{out}}

<pre>Gary, Gary, bo-bary

=={{header|Visual Basic .NET}}==

{{trans|C#}}

 

Imports System.Text

End Sub

 

{{out}}

<pre>Gary, Gary, bo-bary

 

=={{header|Vlang}}==

list := ['Gary', 'Earl', 'Billy', 'Felix', 'Mary']

for name in list {verse(name)}

println('Fee-fi-mo-$m')

println('$x!\n')

 

{{out}}

{{trans|Kotlin}}

{{libheader|Wren-str}}

 

var printVerse = Fn.new { |name|

}

 

 

{{out}}

=={{header|Z80 Assembly}}==

{{trans|MIPS Assembly}}

read "\SrcCPC\winape_macros.asm"

read "\SrcCPC\MemoryMap.asm"

db "fee-fi-mo-%",13,10

db "?!",13,10,13,10

{{out}}

<pre>gary, gary, bo-bary

=={{header|zkl}}==

{{trans|Kotlin}}

z,x := name[0].toLower(), z.toUpper() + name[1,*].toLower();

y:=( if("aeiou".holds(z)) name.toLower() else x[1,*] );

println("Fee-fi-mo-",m);

println(x,"!\n");

{{out}}

<pre style="height:35ex">