We all know that if you google the word "google" it will break the internet.
Your task is to create a function that accepts one string and returns its length, in the fewest possible Unicode characters.
However, if the given string is google (lowercase), it will cause an error.
For example, g('bing') will return 4 but g('google') will cause an error.
Please provide an example of usage, and the error if possible.
->s{b=Hash.new(0);b['google']=nil;b[s]+s.size}
New shortened approach:
->g{(g.to_a-['google'])[0].size}
Reduced 3 bytes with manatwork's suggestion
->g{([g]-['google'])[0].size}
new(0) → new 0; nil → p. Possibly more tips to shorten it: Tips for golfing in Ruby.
\$\endgroup\$
Nov 26, 2015 at 15:44
String#to_a method. But with the shorter [g]-['google'] works.
\$\endgroup\$
Nov 26, 2015 at 16:02
÷GD$"google"={¤+}¦:$
Usage:
./gogh o '÷GD$"google"={¤+}¦:$' "google"
“ Implicit input ”
÷ “ Duplicate the input ”
GD “ Push a range of [1, len(input)] ”
$ “ Rotate input to the TOS ”
"google"= “ Determine equality ”
{¤+}¦: “ Error if equals "google" (empties stack and tries addition) ”
$ “ Leave the length on the stack ”
“ Implicit output ”
Two characters shorter now, thanks to Dennis.
The challenge says ‘[...]in as few amount of Unicode characters as possible’, so I’m going for ≠ and ℕ in my solution.
Anonymous function. Just assign it to a variable:
f->f≠"google"?endof(f):ℕ
In the case of "google" you get the error message:
julia> (f->f≠"google"?endof(f):ℕ)("google")
ERROR: UndefVarError: ℕ not defined
As ordinary function (26 chars):
x(f)=f≠"google"?endof(f):ℕ
ℕ is an unassigned variable, so it produces an error message.
If that doesn’t count or is against the rules, then just using !f (one char longer) instead would produce an error anyway. Boolean not is not defined for strings.
"google".^={e}_!r_;
"google' pushes the string "google" to the stack.
. swaps the active stack.
^ gets input.
= is the rocketship operator, pushes 0 for equality, -1 for less than, and 1 for greater than as x <=> y with x as the top of the active stack, and y as the top of the inactive one.
{ and } denote an if statement, like bf's goto/if thing. Skips the code inside braces if the top of the stack is truthy.
e errors. That's it.
_ pops the stack, this time is just to remove the equality check result and show the input.
! sets the universal register to the top of the stack, or the length of the top of the stack for strings/lists.
r clears the register and pushes it back to the stack.
_ pops again, and
; prints.
So this checks for equality, then does a clumsy cast to int, and than prints the result.
For giggles, as I did not see a very good c++ solution. My TI-89 solution is superior at 34 bytes
[](auto s){return s.size()/(s!="google");}
I did this in TI 89 for fun. There has got to be a more optimized method, but this is the best I could come up with for the moment.
f(x)
getNum(x/"google")&""0+dim(x)
Basically abuses the fact that a string divided by itself becomes 1.
0 is necessary to remove the string from the calculation otherwise you would return ("fun" + 3) which i don't think is compliant to the rules.
|*
a/*
?<
=(a "google")
(lent a)
Uses a wet gate to avoid having to specify a/tape instead of a/*, assert that a doesn't equal "google" or panic, return the length of the tape.
> %. "abc"
|*
a/*
?<
=(a "google")
(lent a)
3
> %. "google"
|*
a/*
?<
=(a "google")
(lent a)
ford: build failed ~[/g/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/use/dojo/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/inn/hand /g/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/use/hood/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/out/dojo/drum/phat/~dirdet-lasmes-digwyc-ribrux--rispyx-bitrus-bidmut-winsud/dojo /d //term/1]
This language is newer than the question, so non-competing I guess.
i?google|d]L^
This program gets input using i, and checks if the input is "google". If it is, it tries dividing "google" by zero (d) well, that doesn't work (duh) so it throws an error.
If the input isn't google, it outputs the length of the selected cell's value (which is the input) using L^.
func f(x){return x=="google"?f(x):length(x)}
Example usages:
awk 'func f(x){return x=="google"?f(x):length(x)}{print f($0)}' <<< "non-google string"
awk 'func f(x){return x=="google"?f(x):length(x)}{print f($0)}' <<< "google"
Print: 17 and Segmentation fault (core dumped) respectively. The second one may cause your computer to run out of memory before it segfaults if you don't have oodles of RAM.
I find Segmentation fault errors to be a bit more broken than divide by zero since they don't even say where the problem is.
Something that looks more interesting would be:
func f(x){if(x=="google"){printf x;return f(x)}return length(x)}`
This would print googlegooglegooglegoogle.... wrapping around the screen until it finally produces the seg. fault, but it's not as 'golfy'
NB. Yeah, I'm a bit late to the party, but nobody had an AWK answer yet. :)
Killed, B) my window manager crashes or C) my computer overheats and switches off. Thus, I am adding a note to your answer that this answer may be harmful on machines which have a big stack.
\$\endgroup\$
param($a)$a.length/($a-cne'google')
This blatantly abuses PowerShell's dynamic casting and uses xnor's trick for dividing by zero. In PowerShell, this is a terminating error and halts execution tossing a most excellently-verbose error (the error, at 242 characters, is over 6.5x the size of the function itself)
Attempted to divide by zero.
At line:1 char:11
+ param($a);$a.length/($a-cne'google')
+ ~~~~~~~~~~~~~~~~~~~~~~~~~~
+ CategoryInfo : NotSpecified: (:) [], RuntimeException
+ FullyQualifiedErrorId : RuntimeException
Saved a byte thanks to ConnorLSW
param($a)$a.length/($a-cne'google') to skip using the the !, saving one byte.
\$\endgroup\$
eval((google==$s=$argv[1])."echo strlen(\$s);");
php -r '<code>' google -->
Parse error: syntax error, unexpected 'echo' (T_ECHO) [...] in eval()'d code on line 1
54 bytes for a function:
function g($s){eval((google==$s).'echo strlen($s);');}
p=>p=='google'?_:p.length
google (lowercase), it will cause an error.” – Will this?
\$\endgroup\$
Nov 29, 2016 at 15:15
g=prompt();if(g!='google')alert(g.length);else throw 0 2. Make it into a function: function(g){if(g!='google')return g.length;else throw 0}
\$\endgroup\$
Nov 29, 2016 at 16:44
_, will do the trick.
\$\endgroup\$
Nov 29, 2016 at 16:44
function google($i){echo strlen($i)/(__FUNCTION__!=$i);}
Yes, it's a bit long, but I feel this is really in the spirit of the question. You really mustn't google google when google is the actual function's name.
The constant __FUNCTION__ holds the name of the function, which in this case is google. The rest of the functiondisplays the length of the input $i divided by 1 if $i is not google, or by 0 if it is. The latter throws an error.
ßL⁼“æ8Ụ»$?
Try it online! (with "google" as input)
Try it online! (with "bing" as input)
ßL⁼“æ8Ụ»$? - Main link. Argument: s (string)
? - if...
⁼ $ - the input is equal to...
“æ8Ụ» - "google"
- then
ß - call the main link (segfault)
- else
L - return the length of the input
rdM"google"J=$L€lp
Took me a while, but I finally got it. Aceto uses a hilbert curve for it's ip, which is really annoying.
r grabs input d duplicates it M pops the top value and stores it in quick memory "google" pushes google on the stack, but with a lot of spaces in between. - splits it on whitespace J concatenates it = pushes a bool on the stack: whether the top two values are equal $ asserts that the top value is truthy, if not it raises an error. Don't ask me why i don't have to negate it L loads the quick memory € explodes the string, putting each char as a separate val on the stack l takes the height of the stack p prints that num
?qz"google"'0lz
My favorite part of this is how I error. I use the ' function which takes a string, but pass 0, which is not a string.
"google"∧∈|l
Since Brachylog simply fails a predicate that tries to divide by 0, the error here comes from trying to unify the output with a list containing an entirely un-instantiated variable instead. If the input can be unified with google, it errors, and otherwise this predicate outputs the length of the input (add one more byte w to the end to make it a full program that prints the length).
d, This is a full program but is technically also a function.
*↔XÑ║╜▄]ÿ
Decompressed:
-Fl'I`nakS/
After string decompression:
google"nakS/
google"n # Does the input *not* equal to "google"?
ak # Find the length of the input
S/ # Divide the length of the input by the above condition
Old answer
#(/(count %)(get{false 1 true 0}(= %"google")))
New Answer
#(/(count %)({false 1 true 0}(= %"google")))
Removed the get function call, because you can call a hashmap with a key to get the value.
func[g][length? any[g ="google"g]]
Try it online! (the code so dense that it crashes the program).
lambda x:len(x)//(x!="google")
Try it online! Python 3 port of xnor's Python 2 answer. The floor division operator is necessary to convert back to an integer instead of leaving it as a float.
g¹“Š¹“Ê÷
Uses the CP-1252 encoding. Try it online!
Explanation:
# Implicit input
g # Take length
¹ # Get first input
“Š¹“Ê # != compressed form of "google"
÷ # Integer division (Zero Division Error if invalid)
f=(x)->throw 0if'google'==x;x.length
(lambda(s)(if(equal s"google")*(length s)))
Throws the error (void-variable *) for any string that equals google.
pr de a
if"google"==`0' f
di length(`0')
end
prints "unrecognized command: f" when input is "google"
sub google{map{eval,-7+length}qq~&{"::$_[0]"}~}
google("google") and google will google("google").
Try it:
perl -e 'sub google{map{eval,-7+length}qq~&{"::$_[0]"}~} print google @ARGV' google
The following is one char shorter, but more fiddly on the command line:
sub google{map{eval,-6+length}qq~&{"'$_[0]"}~}
function"google"->0/0|s->s.Length
When "google" is provided as input, it produces a DevideByZeroException.
Usage:
let g = function"google"->0/0|s->s.Length
g "bing" // 4
g "google" // DivideByZeroException
(s)->s.length()/(s=="google"?0:1)
The lambda takes a String named s, finds the length, and if it isn't "google", divides it by one, otherwise dividing it by zero and causing an Exception.
Note that java.util.function.Function has to be imported.
Function<String, Integer> f = (s)->s.length()/(s=="google"?0:1); //Assign function to variable
//Note that java type inferencing automatically handles the String type
System.out.println(f.apply("elgoog")); //Prints 6
System.out.println(f.apply("google")); //ArithmeticException: Divide by zero
== to .equals unless I'm missing something with java 8
\$\endgroup\$
print(assert(arg[1]~="google")and arg[1]:len())
Throws "assertion failed" if it's "google"
\g(s)?s=="google"e""$~#s$
Sample run:
bash-4.3$ golflua -e '\g(s)?s=="google"e""$~#s$ w(g("google"))'
golflua: (command line):1:
stack traceback:
[C]: in function 'e'
(command line):1: in function 'g'
(command line):1: in main chunk
[C]: in ?
bash-4.3$ golflua -e '\g(s)?s=="google"e""$~#s$ w(g("yahoo"))'
5
