Old thread: Haskell is the language of choice for young POC. It's lazy. It curries a lot. It's not very productive. It consumes lots of resources so that those bad old CIS processes will just have to learn to share.
What are you working on, Jow Forums?
Other urls found in this thread:
erlang.org
learnyousomeerlang.com
twitter.com
fuck opengl
are you learning it fresh or are you having to adjust to a post-pipeline world?
If you don't like OpenGL then don't try any of the alternatives. Stick to one of those "does it for you" things.
NOOO YOUR FAVOURITE LANGUAGE CAN'T USE LOTS OF MEMORY... THAT'S LIKE MANSPREADING
NOO YOU HAVE TO BE ENERGY EFFICIENT, THINK ABOUT THE ENVIRONMENT
The incremental API updates and platform specific extensions are poorly designed.
you have no reason to give a shit about extensions unless you're an AAA gamedev
Now that I have spent two days tidying up and refactoring my code so that it has a more coherent structure instead of being as rush-to-the-deadline hack job, I can see many clear and obvious ways of improving performance, adding new features, and replacing dirty workarounds with much more elegant code.
It feels like combing tangles apart, an extremely satisfying experience.
Hi, I saw 1a bonus problem on a learning problem set that asked for a way to define a function which creates the power set of a given set, and the professor had written a note that he wasn't sure this was possible, but to give it a go. (there were some constraints)
I figured that if you wrote a function which took (A,B) checked if A is a subset of B
and then defined a set which was the set of things which were a subset of B, this function would do the thing, but there would be no way to see if this ever terminated...
anyways does anyone have a way to write this function in haskell? you can either post the code, or just a list of subfunctions and i can figure out how to write them.
C++ fags, I need help with something that has been bugging me since the first day I started learning C++.
Heap stack segment,by that I mean the infamous dynamic memory allocation.
I have a program that demands to load a text file (let it be an excel file) with a list of people, adresses and other numerical datas per column.
Now if my program has to save each person(from that file) in an array of struct.
How exactly do I program said array to have a variable size.
I'm always imagining something like
Struct[x]
{
...
}
Where X would be determined dynamically by the number rows in the excel file I'm loading.
This is just an exemple, I have never understood how to make a C++ program where the array memory allocation would be dynamic, somehow setting a variable instead of a constant number for the array, makes the program crash.
Why is that?