|
Luigi Thirty posted:so far i've gotten one interview from a recruiter, one the next day from a craigslist posting, and a phone interview from another posting, none of which actually resulted in flat "we don't like your skills, sorry" rejections but weaselly "oh we've rescinded the position due to budget constraints" rejections up your activity level finding a job is a full time job. you should be putting in 40 a week minimum on your job search. talk to three recruiters a day, not three a week Luigi Thirty posted:my friend tried to get me an interview with a web company in texas but i looked them up on glassdoor and they're a cult so don't be so picky your first job might very well suck, but you will learn more than you thought possible, and have a resume to set you up anywhere else join the cult, whatever it takes to land that first gig
|
# ? Nov 15, 2014 07:02 |
|
|
# ? May 13, 2024 09:26 |
|
also: take every in person interview Even if the job is obviously poo poo, it is practice interviewing and an opportunity to accumulate industry knowledge (i.e. Things to bullshit about in casual shop talk)
|
# ? Nov 15, 2014 07:04 |
|
ive got a really weird assignment just now in my "introduction to haskell" class - "create a program which will analyse Fortran-90 code which has been annotated with OpenACC pragmas, and generate code for GPU acceleration using the OpenCL API" haskell is like as if someone was having fun using regex's one day and decided they could make a whole language based around them Valeyard fucked around with this message at 17:54 on Nov 15, 2014 |
# ? Nov 15, 2014 17:46 |
|
pattern matching is the best thing and i miss it in every language that doesn't have it
|
# ? Nov 15, 2014 18:25 |
|
AlsoD posted:pattern matching is the best thing and i miss it in every language that doesn't have it it literally pains me to write any kind of parsing in languages that aren't erlang, clojure, haskell or rust
|
# ? Nov 15, 2014 19:18 |
|
learn prolog
|
# ? Nov 15, 2014 19:34 |
|
pattern matching in javascript is fine
|
# ? Nov 15, 2014 19:36 |
|
tef posted:learn prolog i, in theory, know prolog. i just don't ever get opportunity to use it
|
# ? Nov 15, 2014 19:38 |
|
can I teach prolog to install Gentoo
|
# ? Nov 15, 2014 19:42 |
|
Protip for interviewing: if you send us a 4.5-page resume, we're going to expect you to be able to look at one of the pages on our site and tell us what sort of database structures you would use to produce it. Not not listen to us repeatedly, then complain that the interview was "unfair" after we tell you no.
|
# ? Nov 15, 2014 20:43 |
|
so I have a list of lists (strings) in haskell and I want to go through everything and make it lowercase. I tried:code:
|
# ? Nov 15, 2014 21:21 |
|
using list comprehensions, if you make the steps explicit things will make much more sensecode:
|
# ? Nov 15, 2014 21:27 |
|
Valeyard posted:so I have a list of lists (strings) in haskell and I want to go through everything and make it lowercase. I tried: map (map toLower) <$> (lines . readFile src_name) Malcolm XML fucked around with this message at 21:35 on Nov 15, 2014 |
# ? Nov 15, 2014 21:32 |
|
however in this case, I wouldn't use list comprehensions at all since [f x | x <- xs] is sugar for map f xs which I prefer since it's shorter and easier to read. The example then becomescode:
code:
|
# ? Nov 15, 2014 21:32 |
|
AlsoD posted:however in this case, I wouldn't use list comprehensions at all since [f x | x <- xs] is sugar for map f xs which I prefer since it's shorter and easier to read. The example then becomes and the second is just the definition of fmap soo
|
# ? Nov 15, 2014 21:36 |
|
oh whoops you also need to use unlines to turn your list of strings into a single string with newlines
|
# ? Nov 15, 2014 21:37 |
|
Malcolm XML posted:and the second is just the definition of fmap soo it is the moral imperative of every haskell program to use the fewest characters possible
|
# ? Nov 15, 2014 21:38 |
|
AlsoD posted:oh whoops you also need to use unlines to turn your list of strings into a single string with newlines of course u might as well run toLower first or fuse them!!!!
|
# ? Nov 15, 2014 21:39 |
|
Malcolm XML posted:it is the moral imperative of every haskell program to use the fewest characters possible fmap (unlines . map (map toLower) . lines) . readFile e: pretty sure you get fusion for free here
|
# ? Nov 15, 2014 21:39 |
|
Notorious b.s.d. posted:i can only speak for myself, but this doesn't bother me i was referring to salaried contract, not hourly
|
# ? Nov 15, 2014 21:39 |
|
also, when you're more comfortable with haskell and want to make your program faster at the expense of a little bit of convenience, use the library Data.Text instead of the default String type.
|
# ? Nov 15, 2014 21:43 |
|
AlsoD posted:fmap (unlines . map (map toLower) . lines) . readFile why even bother with unlines and lines they cancel each other out
|
# ? Nov 15, 2014 21:48 |
|
Malcolm XML posted:why even bother with unlines and lines they cancel each other out fmap toLower . readFile BITCH
|
# ? Nov 15, 2014 21:49 |
|
sir, the question was 'is this your handwriting?'
|
# ? Nov 15, 2014 21:51 |
|
Malcolm XML posted:BITCH thats really no way to talk to a lady
|
# ? Nov 15, 2014 21:51 |
|
VLADIMIR GLUTEN posted:i was referring to salaried contract, not hourly that might sound like a bad thing if you've been brainwashed by life in a hypercapitalist dystopia such as the usa, but here in socialist europe it works out that I never have to do more than 40 hours in a week and it's pretty sweet all round. in short, lol if u have to get into work before 11 (or stay past 2, if you're a morning person)
|
# ? Nov 15, 2014 21:53 |
|
rotor posted:buttbot is the only worthwhile software ever written
|
# ? Nov 15, 2014 22:01 |
|
AlsoD posted:using list comprehensions, if you make the steps explicit things will make much more sense thanks for this. ive been shying away from seperating steps out, as I feel like it is not In The Spirit of functional programming. but that is a lot better chugging along trying to use parsec now to parse fortan90 variable declarations
|
# ? Nov 16, 2014 01:49 |
|
Valeyard posted:thanks for this. ive been shying away from seperating steps out, as I feel like it is not In The Spirit of functional programming. but that is a lot better some people want concise conCISE CONCISE because it makes them feel clever and yeah haskell lets you do that really easily but it also makes for write-only code. definitely do separate stuff out if it makes it easier to understand, in any language if you want to try to make stuff as compact as possible as a challenge then sure golf your heart out but if youre writing code that anyone else (including future you) well ever have to look at please leave the long version
|
# ? Nov 16, 2014 02:35 |
|
for real though, use map instead of simple list comprehensions like that. sure when you end up filtering and with local let expressions then they're fine, but usually map is way more idiomatic, useful, and common.
|
# ? Nov 16, 2014 02:49 |
|
any language that doesnt have lines/unlines in the std lib better have "as performant as c and c++" as a goal.
|
# ? Nov 16, 2014 04:34 |
|
is it enough to just have split/join instead?Ruby code:
(join is one of the few cases where I feel like ruby got the syntax right compared to python)
|
# ? Nov 16, 2014 05:00 |
|
AlsoD posted:for real though, use map instead of simple list comprehensions like that. sure when you end up filtering and with local let expressions then they're fine, but usually map is way more idiomatic, useful, and common. i'm pretty sure list comprehensions in general are discouraged in style guides now?
|
# ? Nov 16, 2014 05:42 |
|
Arcsech posted:some people want concise conCISE CONCISE because it makes them feel clever I loving hate this poo poo. Be as long winded as you want, the compiler doesn't give a poo poo and maintainers will thank you for it.
|
# ? Nov 16, 2014 05:49 |
|
if your object is a left handed recursive descent decarbonator, I want the class named LeftHandedRecursiveDescentDecarbonator, not a LHRecDesDec
|
# ? Nov 16, 2014 05:52 |
|
rotor posted:I loving hate this poo poo. Be as long winded as you want, the compiler doesn't give a poo poo and maintainers will thank you for it. is that true in jit languages? j/w
|
# ? Nov 16, 2014 05:53 |
|
i wrote a recursive worker that enqueues the next worker if it's not done with the task now we get honey baadger reports that are extremely long. i feel bad about it. but i'm not sure that honey badger reports matter.
|
# ? Nov 16, 2014 05:54 |
|
fart simpson posted:i'm pretty sure list comprehensions in general are discouraged in style guides now? it's kinda funny that python stole comprehensions from haskell and it's generally agreed and encouraged to use them instead of stuff like filter and map.
|
# ? Nov 16, 2014 06:01 |
|
MALE SHOEGAZE posted:i wrote a recursive worker that enqueues the next worker if it's not done with the task nothing named "honey badger" matters
|
# ? Nov 16, 2014 06:04 |
|
|
# ? May 13, 2024 09:26 |
|
rotor posted:nothing named "honey badger" matters i think it wins out because people were like 'it's called honey badger so e shouldnt use it' and other people were like 'yah, but that's a bad argument'
|
# ? Nov 16, 2014 06:06 |