divmod in python is divrem in Julia. Best, Jake
On Thursday, April 3, 2014 6:45:37 PM UTC-4, [email protected] wrote: > > Hi Julia users, > > Maybe you want to support me with my wish list. > Here it is: > > - end statement: remove it (ala python) and use indentation, the code will > be shorter and cleaner > > - case/switch: include it (missing in python) > > - array indexing: introduce with negative number -1,-2,... (instead of or > additionally to end, end-1) > e.g.: a[-3:-1] vs a[end-2:end] > (again shorter and cleaner). Note -1 could index the last element (not > previous last element as in python) > This would be inline with the Julia one-based indexing. (Maybe an idea > is to use braces for zero based indexing, e.g. a{0}=3.14) > > - dictionary: mydict = ["one": 1, "two": 2, "three": 3] > (i.e. colons ala pythons instead of ["one"=> 1, "two"=> 2, "three"=> 3], > shorter and cleaner) > well, it is ambiguous: [1:3] > > - provide a divmod function ala python > > - if 5: should work (ala python and c, and not the redundant "if 5>0") > > - provide an enum function (enumerate ala python) > > > - [1 2 3] .< 2 remove the dot in those scalar operations > > - elseif => elif > > - length => len > > > Ok. That's it for now. > Julia devs, you did a great job! There are many things that I like more than > in python. > > Cheers > Friedrich > > > > >
