[BetaWar]

Par 2

Okay, it is time for another hole here at Javascript code golf! We are doing another “the shorter the better” contest and here is what it must do:

Create a small program which; given a range and a number will tell us if the number given is within the given range. The range that the program should take is a mathematical range, where square brackets are inclusive and parentheses are exclusive. For instance, [9, 10) is any number larger than or equal to 9, but strictly less than 10.

Sample inputs:

[0, 100]:9
(1, 1):10
(1, 3]:2

Remember, the point here is to get the shortest code which outputs the correct answer. As with before we aren’t counting any characters that aren’t required to make the program work and you can output it in any manner you see fit.

[moopet]

I think I missed the first couple of these and if you specified any particular test harness or style I fail. I'm assuming you want everything as a function which returns a boolean as you haven't specified a sample output.
Here's a solution, anyway, that's probably not all that efficient but it'll get the ball rolling...

Spoiler

function foo(s) {
    o = s.split(':');
    x = o[0].split(', ');
    f = parseInt(x[0].substr(1)) - (x[0][0] == '[');
    l = parseInt(x[1]) + (x[1].indexOf(']') > 0);
    return o[1] > f && o[1] < l;
}

[BetaWar]

Yes, I leave the code golf tasks a little open ended. I want you to decide how it would be best to implement and output to the user. That way you aren't restricted to using something long winded such as document.write which take a lot of characters to accomplish a single output statement. Likewise, the datatype of the output is up to you. It can be a bool, a string, an integer, whatever. At long as a user (who has been told what the output is on success/ failure) can read it and understand what the program is outputting it is good.

Also, with the shortest answer (Par 2) holes you don't need to worry about efficiency, you just want to get the code as short as possible and have it work.

[BetaWar]

Here is the solution I came up with. It uses 207 characters and allows for floating point numbers:

Spoiler

function r(s){s=s.split(':');i=parseFloat(s[1]);s=s[0].split(", ");c=parseFloat(s[0].substr(1));d=parseFloat(s[1].substr(0,s[1].length-1));return(s[0][0]=='('?i>=c:i>c)&&(s[1][s[1].length-1]==')'?i<=d:i<d);}

[moopet]

Then I'll revise mine down to 151 characters (minified):

Spoiler

function f(s){o=s.split(':');x=o[0].split(', ');p=parseInt;f=p(x[0].substr(1))-(x[0][0]=='[');l=p(x[1])+(x[1].indexOf(']')>0);return o[1]>f&&o[1]< l;}

I didn't assume anything other than ints for the same reason I didn't assume I had to trim the strings first and so on, just going on the sample inputs.

[BetaWar]

Yeah, that's fine. I understand where you're coming from, it is just nice to have at least someone else participating in these

Next week is going to be a much more involved one (for better or for worse) with a lot more room for interpretation and implementation (though it isn't a mini-code hole).

[Atli]

Here is a regexp version. 149 chars

Spoiler

function f(s){p=parseInt
r=/([\[(])(\d+), (\d+)([\])])\:(/>\d+)/.exec(s)
x=p(r[2])
y=p(r[3])
m=p(r[5])
return(r[1]=='['?m>=x:m>x)&(r[4]==']'?m<=y:m<y)}

By the way, moopet, you redefine the global f inside your f function, so it can only be used once.
Also, having fixed that and removing the two extra white spaces and ; chars (which I assume don't count, as per BetaWar's "not required to make the program work" rule) I only count your code at a 148 chars. (... so close )

[moopet]

Atli, on 26 February 2011 - 08:38 PM, said:

By the way, moopet, you redefine the global f inside your f function, so it can only be used once.

Yeah I probably should have done that properly rather than just delete the spaces in my editor

[gion_13]

maybe not the shortest (154 chars), but I gave it a try :

function f(s){
    return eval(s.replace(/^(\[|\()(\d+),\s?(\d+)(\]|\)):(/>\d+)$/,'$2'+'<'+eval("'$1'=='['?'=':''")+'$5'+'&&'+'$5'+'<'+eval("('$4'=='['?'=':'')")+'$3'))
}

[chinchang]

Here is my soln (147 chars) :

Spoiler

m=i.match(/(\[|\()(\d+),\s*(\d+)(\]|\)):(/>\d+)/);var n=parseInt(m[5]); (n>= (parseInt(m[2]) + (m[1]=='('?1:0))) && (n<=(parseInt(m[3]) + (m[4]==')'?-1:0)));

This post has been edited by chinchang: 14 March 2012 - 04:58 AM