[Boards: 3 / a / aco / adv / an / asp / b / bant / biz / c / can / cgl / ck / cm / co / cock / d / diy / e / fa / fap / fit / fitlit / g / gd / gif / h / hc / his / hm / hr / i / ic / int / jp / k / lgbt / lit / m / mlp / mlpol / mo / mtv / mu / n / news / o / out / outsoc / p / po / pol / qa / qst / r / r9k / s / s4s / sci / soc / sp / spa / t / tg / toy / trash / trv / tv / u / v / vg / vint / vip / vp / vr / w / wg / wsg / wsr / x / y ] [Search | Free Show | Home]

/dpt/ - Daily Programming Thread

This is a blue board which means that it's for everybody (Safe For Work content only). If you see any adult content, please report it.

Thread replies: 363
Thread images: 42

File: dpt_flat.png (102KB, 1000x1071px) Image search: [Google]
dpt_flat.png
102KB, 1000x1071px
Old thread: >>60268718

What are you working on, /g/?
>>
How the hell does this work? REE, I have been failing to do SICP exercises 3.23 for hours because of stupid shit like this. The concept behind the question is easy (double sided queues).

(define x (cons 1 2))
(define r (cons 1 0))
(set-car! r x)
(set-cdr! r x)
r = ((1 . 2) 1 . 2)
(set! x 0)
r = ((1 . 2) 1 . 2)

I would have expected r = (0 0)

And also

(define x (cons 1 2))
(define r (cons 1 0))
(set-car! r x)
(set-cdr! r (car r))
r = ((1 . 2) 1 . 2)
(set! x 0)
r = ((1 . 2) 1 . 2)
(set-car! r 0)
r = (0 1 . 2)

I would have expected r = (0 0) when x changed to 0. And eve after that, I would have expected r = (0 0).
>>
Guy trying to learn how to sort here. I implemented pretty much exactly what was said in the other thread and still no bingo. Can anyone see anything wrong with this?

for i in range(0, len(list_to_sort) - 1):
for j in range(0, len(list_to_sort) - 1 - i):
if list_to_sort[j] == 0:
list_to_sort[j], list_to_sort[j+1] = list_to_sort[j+1], list_to_sort[j]
elif list_to_sort[j] > list_to_sort[j+1]:
list_to_sort[j], list_to_sort[j+1] = list_to_sort[j+1], list_to_sort[j]
return list_to_sort
>>
>>60275225
Actually, you need to make sure that the argument being compared to in the elif bit isn't zero.
elif list_to_sort[j+1] != 0 and list_to_sort[j] > list_to_sort[j+1]:
>>
>>60275249
Not him but if if list_to_sort == 0 then the elif statement isn't executed.
>>
>>60275320
The first if deals with the "left" argument (j). That check deals with the "right" argument (j+1), so that when some other value is being compared against zero, it won't get swapped.
>>
>>60275333

Guy sorting here, makes sense, cheers mate.

Does figuring out things like that come easier the more you program?
>>
>>60275333
I just tested this and it doesn't work. It just sorts in complete ascending order in Python3.
>>
>>60274559
>(set! x 0)
The variable is a mutable cell in itself. You are making x point to 0, you aren't magically transforming the cons cell into an integer. That never happens in Scheme. Scrap your whole code off and try again.
>>
>>60275389
list_to_sort = [20, 7, 9 ,15, 0, 2, 0, 16, 5]

for i in range(0, len(list_to_sort) - 1):
for j in range(0, len(list_to_sort) - 1 - i):
if list_to_sort[j] == 0:
list_to_sort[j], list_to_sort[j+1] = list_to_sort[j+1], list_to_sort[j]
elif list_to_sort[j+1] != 0 and list_to_sort[j] > list_to_sort[j+1]:
list_to_sort[j], list_to_sort[j+1] = list_to_sort[j+1], list_to_sort[j]

print(list_to_sort)

[2, 5, 7, 9, 15, 16, 20, 0, 0]

werks for me.
>>
File: 1452403462150.png (79KB, 307x400px) Image search: [Google]
1452403462150.png
79KB, 307x400px
>>60275035
Is Rust a dialect of C?
>>
reposting from last thread

I'm trying to cut out the individual panels of a comic strip, I've already detected the panels themselves using openCV but how do i go about cutting them out?
>>
>>60275450
No
>>
>>60275450
Rust is the arrogant and naive grand-son.
>>
>>60275404
Yeah a list of integers works for me too. My bad.

Strange though, I just opened a program that had a list of dictionaries that I sort by value of a specific key and it doesn't push the zeros to the back on that list.
>>
>>60275463
ImageMagick
>>
>>60275450
Rust is the son of C that wants to be a girl.
>>
>>60275531
More like the daughter that identifies as black gay man.
>>
>>60275480
def sort(dict_list): #Bubble sort
for i in range(0, len(dict_list) - 1):
for j in range(0, len(dict_list) - 1 - i):
if dict_list[j]['happy_ratio'] == 0:
dict_list[j]['happy_ratio'], dict_list[j+1]['happy_ratio'] = dict_list[j+1]['happy_ratio'], dict_list[j]['happy_ratio']
elif dict_list[j+1]['happy_ratio'] != 0 and dict_list[j]['happy_ratio'] > dict_list[j+1]['happy_ratio']:
dict_list[j]['happy_ratio'], dict_list[j+1]['happy_ratio'] = dict_list[j+1]['happy_ratio'], dict_list[j]['happy_ratio']
return dict_list

[{'route_number': '12', 'happy_ratio': '4'}, {'route_number': '235', 'happy_ratio': '0'}, {'route_number': '123', 'happy_ratio': '7'}, {'route_number': '567', 'happy_ratio': '3'}, {'route_number': '459', 'happy_ratio': '1'}, {'route_number': '555', 'happy_ratio': '6'}, {'route_number': '666', 'happy_ratio': '0'}, {'route_number': '354', 'happy_ratio': '5'}]


 
[{'route_number': '12', 'happy_ratio': '0'}, {'route_number': '235', 'happy_ratio': '0'}, {'route_number': '123', 'happy_ratio': '1'}, {'route_number': '567', 'happy_ratio': '3'}, {'route_number': '459', 'happy_ratio': '4'}, {'route_number': '555', 'happy_ratio': '5'}, {'route_number': '666', 'happy_ratio': '6'}, {'route_number': '354', 'happy_ratio': '7'}]

For reference if anyone else wants to run it.
>>
Why do all these literally who languages have toolchains to create pc and android GUI applications?
>ec with ecere sdk
>pascal with lazarus
>d with DlangUI

and the good languages like Common Lisp and Ocaml at best have bindings to gtk+ and maybe unmaintained bindings to QT?
>>
File: 1465255856671.jpg (54KB, 240x430px) Image search: [Google]
1465255856671.jpg
54KB, 240x430px
>>60275599
>good languages like Common Lisp and Ocaml
>>
>>60275599
What about Clojure?
>>
>>60275649
Yeah, what about it?
It's not even lisp.
>>
>>60275665
>It's not even lisp.
delet this
>>
>>60275584
Convert them to floats and it works.
>>
>>60275584
why do you have two if statements that do exactly the same thing?

why are you even handling zero specially?
>>
>>60275665
You can build a GUI and use lots of parentheses.
>>
>>60275696
>use lots of parentheses.
No you can't because clojure forces you to use [] and {} everywhere.
>>
>>60275665
>It's not even lisp.
Which is a good thing. Sadly it's too much like Lisp so it's still fucking trash.
>>
>>60275706
How can a language "force" you to do something?
>>
>>60275720
Try to write function definition in clojure without using [].
>>
>>60275706
I guess you can always use a macro to fix that.
>>
>>60275740
How does this answer my question? Me trying to do it on my own already implies it wasn't forced.
>>
>>60275746
You literally can't though because lol clojure
>>
>>60275752
Can't do what? Write macros?
>>
>>60275750
Well I think it's fair assumption that if you program you are going to write function definitions.
Having to use certain characters in that defition kind of forces you to use them.
Off course you could write a fucking transpiler like every hipster is doing it with javascript or program without functions but that's the kind of retardation that you would do, not me.

>>60275764
The lambda definitions uses them also and at that bind it becomes pretty impossible.
>>
>>60275779
>Having to use certain characters in that defition kind of forces you to use them.
Nope. You are free to not use that piece of trash.
>>
How would I go about implementing a function where whenever you right-clicked a tile on a grid it would change colour & not allow you to left-click it until you right-click it again in Java through using Swing

BTW here's the code for marking that tile.

public void mark(int row, int column) {
this.minefield[row][column].toggleMarked();
>>
>>60275779
>The lambda definitions uses them also and at that bind it becomes pretty impossible.
Ok, so no Clojure. It's your best bet for proper library support.
>>
>>60275531
Sold.
>>
>>60275686
is
if dict_list[j]['happy_ratio'] == 0 or dict_list[j+1]['happy_ratio'] != 0 and dict_list[j]['happy_ratio'] > dict_list[j+1]['happy_ratio']:


Better?

My friend is studying CS and I want to learn programming so I get him to send me his assignments and I teach myself. They have to handle 0 in the assignment.
>>
>>60275811
whats wrong with the obvious solution, making it so the left mouse click event handler does nothing if the tile is already marked?
>>
Why does Lisp REPL highlight the letter d ?
>>
File: 31a1dcae1757.gif (7KB, 508x197px) Image search: [Google]
31a1dcae1757.gif
7KB, 508x197px
i'm getting fkn pissed off over the lack of documentation and general reference material

how do i take sinc(t), or any function, and plot the frequency response, in
>mathematica
>>
>>60276010
>mathematica
Use maxima or gnu octavia you tool
>>
File: 1491971542223.jpg (175KB, 657x800px) Image search: [Google]
1491971542223.jpg
175KB, 657x800px
>>60275976
What Lisp? Sure you havent accidentally done a text search for "d" in your terminal emulator?

....

Do you want my D, anon-sama?
>>
I am trying to learn how to make tetris but i stuck at rotation part. Why my code doesn't work can somebody help me please ;_;

here is the code:

https://pastebin.com/Y7CzrqQ9

>inb4 fuck off gamedev
I am new and programing simple games really good for learning.
>>
>>60276038
ok then how do i take sinc(t), or any function, and plot the frequency response, in
>maxima
or
>gnu octavia
>>
>>60276052
common lisp
it actually happens in sublime / sublimeREPL
>>
>>60276059
idk try this

    public void rotateLeft(){
for(int i=0; i<4; ++i){
int x = x(i);
int y = y(i);

this.setX(i,-y);
this.setY(i, x);
}
}
>>
>>60276077
actually its not the letter d, it's atoms called d
>>
100% sincere question, i'm a complete noob who knows nothing 'bout programming.
Whats a smart start?
I'm a pretty fast learner so just rec me a language that's useful for making games.
t. /3/ fag who's starting to lwarn code
>>
>>60276099
>I'm a pretty fast learner so just rec me a language that's useful for making games.
C# over Unity for a noob I guess

You're still gonna struggle if making games is your immediate goal
>>
>>60276099
C++ and i'm dead ass serious don't listen to the neckbeards telling you to learn lisp or haskell or C or python or what the shit
>>
>>60276117
>noob
>C++
>probably never gonna study CS, just tutorials on the net
will crash and burn in less than three months

t. CS Student trying to make something on Ogre3D on the side and struggling
>>
File: flstudio.jpg (284KB, 1920x1080px) Image search: [Google]
flstudio.jpg
284KB, 1920x1080px
in python tkinter, how do i make the main window fill the entire screensize minus the taskbar?
basically as large as a fullscreen but with the taskbar still visible plus the possibility for other application to appear over mine, like in fl studio

i know it's still a window mode, but i don't know how to tell tkinter "look, the taskbar has this height and you must take it in consideration when creating the root window"
>>
>>60276115
Well my goal is vidya but what are some other worth while things to make, for practice that is
>>
>>60276143
you just don't get it do you

go build a house with brick and mortar
start with little dog sheds then you'll soon be able to build the new World Trade Center
>>
>>60276143
start with some simple opengl scenes like start with a triangle and then a rotating cube etc
>>
>>60276167
Unity will handle that
>>
>>60276178
you'd learn next to nothing
>>
>>60276143
try making a program print hello world before vidya
>>
>>60276162
Why are you so defensive?
If there's something wrong enlighten me on it. I actually want to learn this shit so give me all the advice you got
>>
>>60276206
there's nothing wrong with it they're just newfag brainlets who think game engine and graphics programming is some gargantuan impossible task (for them)
>>
File: sonic.jpg (20KB, 450x252px) Image search: [Google]
sonic.jpg
20KB, 450x252px
>>60276089
Wow thank you anon :3 So what exactly my mistake? I need to work on this topic more.
>>
>>60276206
>I actually want to learn this shit
you don't know that
you want to make games, it's different

>so give me all the advice you got
not gonna spoonfeed you, brainlet babby, the advice was : Unity engine + C#

now take an intro to programming with C# course, once you master the language and programming basics, learn Unity

fuck off now
>>
>>60276219
>newfag brainlets who think game engine and graphics programming is some gargantuan impossible task (for them)
post github faggot
>>
>>60276234
you were setting y to the latest value of x after you had already set x to -y when you wanted the old value of x instead
>>
>>60276239
the unity engine isn't some magic bullet, there is almost no one in >>>/vg/agdg who has a passable finished game and some of them have been at it for years
>>
>>60276297
still better than Ogre or LibGDX for a beginner

I could advise him RPGMaker or GameMaker but he'd sperg out
>HURR I WANT TO LEARN THIS SHIT I CAN MAKE THE NEXT DARK SOULS x SKYRIM x DOOM5 x FF15 AAAA+ GAYME
>>
>>60275035
Implementing solutions for differential equations of 1-4th order, currently of 1st. Im doing it with some weird mix of c++ and c... Is there c++ equivalent of fprintf and popen??
>>
>>60276404
>Is there c++ equivalent of fprintf and popen
lol, wait till you find out what you can do with c++

use c functions
>>
>>60276330
>HURR
>>>/v/
>>
Recursively define a function for x% compound interest on a principle investment of $y after z years
>>
>>60276584
Not programming.
>>
>>60276584

def compound(x, y, z) as double
if(z == 0) then
return (1 + x) * y
end if

return (1 + x) * compound(x, y, z -1)
end
>>
>>60276608
see >>60276595
>>
>>60276613
I don't understand
>>
>>60276584
>Recursively define a function
Don't you mean "define a function that uses recursion"?
>>
>>60276635
That shitlang isn't programming.
>>60276638
No. A recursively defined function can be implemented as a loop.
>>
>>60276638
That's true
>>
>>60275035
Currently doing the exercises in this book for school. I hate this book.
>>
>>60276644
What shitlang is it?
>>
>>60276658
A shitlang which uses "def" and the ugly "==" for equality comparison.
>>
How can I get good at algorithms?
I'm a fucking beginner but my homeworks are hard as fuck. I'm not even on undergrad CS course.

Pls help me with easy books
>>
>>60276810
>How can I get good at algorithms?
At which algorithms? Your post makes no sense using the standard definition of "algorithm".
>>
>>60276827
For python or any other language. How to solve problems more efficiently.
I'm just a dumb engineer, I use matlab too if it helps.
>>
>>60276810
this book is pretty good
>>
>>60276810

Just write some fucking algorithms.
>>
>>60276847
>For python
You should be asking in some other thread. Python isn't related to programming.
>How to solve problems more efficiently.
This is too vague of a question. What problems do you want to solve?
>>
>>60276869
Numerical analysis
>>
>>60276885
Jesus fucking christ.
We can't learn for you. You have to do that shit yourself.
If you want help you need to provide a concrete problem a like of (pseudo)code you don't understand or a program that doesn't produce the desired result etc.
>>
>>60276885
Then you should have said so right away. Hopefully someone here is familiar with it and can help you.
>>
>>60276869

Kys yourself
>>
Having to learn Java for second year of CompSci are there any good meme books that are /g/ approved?
>>
>>60276945
>Kys
>>>/b/

>>60276947
>meme
>>>/v/
>>
File: java.jpg (35KB, 408x500px) Image search: [Google]
java.jpg
35KB, 408x500px
>>60276947
for java get this book. It has everything you need.
>>
>>60277008
Thanks man
>>
>>60276947
>Java
>computational mathematics
What did he mean by this?
>>
>>60276885
>>60276911
lol that shit is too obscure you have to read math papers n shit no one is going to spoonfeed you anything non-trivial
>>
I am doing SICP exercise 3.23 which tries to make deques. For some reason my deques turn in to some sort of infinite looping messes as soon as I add more than one element. A deque element is represented like new-pair, where a is the element, the next part points to the previous element in the deque, and the latter to the next element in the deque.

(define (make-deque) (cons '() '()))
(define (empty-deque? deque) (null? (front-deque deque)))


(define (front-deque deque) (car deque))
(define (rear-deque deque) (cdr deque))


(define (front-insert-deque! deque a)
(let ((new-pair (cons a (cons '() '()))))
(cond ((empty-deque? deque)
(set-car! deque new-pair)
(set-cdr! deque (car deque)))
(else
(set-cdr! (cdr new-pair) (front-deque deque))
(set-car! (cdr (front-deque deque)) new-pair)
(set-car! deque new-pair)
(print-deque deque)))))
>>
File: 1376037237161.jpg (70KB, 810x780px) Image search: [Google]
1376037237161.jpg
70KB, 810x780px
>>60277278
>For some reason my deques turn in to some sort of infinite looping messes
Should have used a better language which prevents this.
>>
does sh have any tools for renaming .torrent files to their respective hash value?
>>
>>60277448
I have a story to tell:

two normal programmers, and a /g/dpt/ frequenter are all on a plane. all of the sudden the plane starts to go into a nose dive. the two normal people look at each and say 'what is a meaningful solution to this problem that we are currently in with no recourse from?' the /g/dpt/ frequenter looks up and says 'ive already solved the problems you idiots its simple. you shouldnt have gotten on the plane!' both normal people spend their last moments alive relishing in mutilating the /g/dpt/frequenter and feasting on his entrails
>>
>>60277503
Shit story. Not applicable here.
>>
>>60277503
>it's not my fault i ignored your advice
>>
>>60277519
your advice is trash if youre already on the plane you mongoloid
>>
How to make this DRY? Generate new value. If it's the same as old value, generate new again.

var newValue = Math.floor(Math.random() * 6) + 1;

while (newValue == oldValue)
newValue = Math.floor(Math.random() * 6) + 1;
}
>>
>>60277526
Unpredictable termination is a solved problem. You not following the advice by getting on the plane implies you're a retard.
>>
>>60277545
just make this into a function that returns the number and call it when needed

Math.floor(Math.random() * 6) + 1;
>>
>>60277556
I mean "non-termination".
>>
>>60277526
>>60277519
>>
>>60277545
do while loop
>>
>>60277545
while ((newValue = Math.floor(Math.random() * 6) + 1) != oldValue);
>>
>>60277556
you can read right? they are already on the plane when the advice is offered.

also im not the guy trying to deque in lisp, just responding to the utterly useless answers hes getting
>>
>>60277606
fug, != instead of == obviously
>>
>>60277612
>they are already on the plane when the advice is offered.
In your retarded example, yes. But the situations aren't equivalent so this reply is irrelevant and stupid.
He can leave at any moment without negative consequences, which is not the case with the plane.
>>
>>60277645
he is already on the plane in that he already has a problem he is trying to solve with a particular language. so yes, this is a situation in which the advice is worthless because the scenario is already in effect. What I dont understand is the seeming impetus to defend the worthless advice? the /g/dpt frequenter goes down with the plane laughing and feeling proud of himself? lol
>>
>>60277676
>he is already on the plane in that he already has a problem he is trying to solve with a particular language.
No, being on the plane implies the inability to leave without getting yourself killed. It's safe to assume he isn't being forced to use Scheme under gunpoint. If that's the case, your example is not applicable and you trying to use it here just demonstrates your retardation.
>so yes, this is a situation in which the advice is worthless because the scenario is already in effect.
The scenario and anything it has caused are easily reversible at will.

>What I dont understand is the seeming impetus to defend the worthless advice?
The advice isn't worthless at all. Using a non-shit language which prevents his problem is the only sane choice. Not using this advice is pretty stupid.
>the /g/dpt frequenter goes down with the plane laughing and feeling proud of himself?
I don't use shit languages, which means I'm not on the plane. Which yet again shows how retarded your example is.
>>
File: background_86.jpg (96KB, 1440x900px) Image search: [Google]
background_86.jpg
96KB, 1440x900px
>>60277775
You know what, bad on me for thinking you'd be able to understand an analogy.

Next time one of your coworkers (although i doubt you are employed) is having a major issue just tell them to stop using a shit language and Im sure you will be thanked for coming to the rescue.

Im sure your egg plant simulator written in haskell is just the bees knees
>>
File: 1416700453616.jpg (54KB, 370x299px) Image search: [Google]
1416700453616.jpg
54KB, 370x299px
>>60277840
>You know what, bad on me for thinking you'd be able to understand an analogy.
The word analogy itself implies being related to something. If your example isn't related to the situation it isn't an analogy. That's pretty simple, even a retard like you should be able to understand.
>Next time one of your coworkers (although i doubt you are employed) is having a major issue just tell them to stop using a shit language
My coworkers don't use shit languages. And even if they did, a problem isn't necessarily caused by the language itself.

>written in haskell
I find it pretty hard to believe that a language which hasn't caught up with the 70s can be non-shit.
>>
>>60275035
Still implementing an entity component system architecture in C++. It's impossible to do this in a somewhat clean, usable and performant fashion.
>>
We can implement each of the stack operations with just a few lines of code:
STACK -EMPTY(S)
1 if S:top == 0
2 return TRUE
3 else return FALSE

what did introduction to algorithms mean by this
>>
Is production support a bad meme?
>>
>>60278219
>meme
Ask on >>>/v/
>>
>>60278216
The function implements an "is the stack S empty?" function. What's not to get?
>>
>>60278273
return S:top == 0;
>>
>>60278219
>Studies have found that the maintenance cost of software is more than 90% of the total cost.[citation needed]
>We also know that software spends much more time in production than development because it needs to verify the properties[citation needed].
yes
>>
File: Capture.png (26KB, 788x211px) Image search: [Google]
Capture.png
26KB, 788x211px
pooooooooo
>>
>Quit my restaurant job about 3 and a half years ago, zero experience in CS (not even a programming class during college). Self studied for 9 months, got a regular SWE job making $70k. Stayed for 2.5 years while getting raises that put me up to $110k. Recently got an SWE offer to work at Google making about $170k total comp.

How legit is this?
>>
>>60278471
sounds about average for the bay area
>>
>>60278471
Source? Nobody posted this.
>>
>>60278471
such is life in America
>>
>>60276675
oh hey ECMATypeSumatraCoffeeScripter Artisan, you prefer === ?
>>
>>60278560
===D ( )
>>
>>60278329
perhaps the language can't use predicates as values
>>
>>60278534
The source is a website which I dare not say its name.
>>
>>60278560
>===
Why would that disgusting piece of shit somehow be better than "=="?
>>
>>60278628
It's a type coercing equality operator.
>>
>>60278676
Such a thing shouldn't exist.
>>
>>60278691
>using a system that doesn't have heterogeneous equality types
>>
>>60278691
This is the same language that allows positive or negative zero.
>>
>>60275121
(define x (cons 1 2))
(define r (cons 1 0))
(set-car! r x)
(set-cdr! r x)
r = ((1 . 2) 1 . 2)
(set! x 0)
r = ((1 . 2) 1 . 2)

This is similar to this in C, does this help?
int *x = (int []){1, 2};
int *r[] = {0, 0};
r[0] = x;
r[1] = x;
x = 0;

Only the pointer x changed in that example, r[0] and r[1] still point to the data.
>>
>>60278705
>what is IEEE 754
>>
>>60278700
There is only one equality type.
>>
>>60278748
One equality type constructor, but many applications
>>
>>60278748
equality is a spectrum
>>
>>60275599
Because they want to meme newfag normies into pajetism.

That being said, Scheme is better than CL and OCaml sucks camel dick.
>>
>>60278777
Scheme better than OCaml. Please stop that.
>>
>>60278735
A piece of trash.
>>
>>60278798
Every single ML-based language that I know of is better than OCaml.
>>
File: 120.jpg (36KB, 600x600px) Image search: [Google]
120.jpg
36KB, 600x600px
>>60278809
>>
>>60278876
It's actually a fact. Nobody except neural network and game nerd loosers like IEEE 754.
>>
>>60278777
>>60278798
>>60278819
I don't understand these posts!
>>
>>60278777
>meme
>>>/v/
>"normie" instead of "normalfag"
>>>/r/abbit
>>
>>60278612
is he selling something? if so, don't believe it. if he's posted it anonymously and has nothing to gain sure believe him, no one would lie on the internet
>>
File: 1476842757318.jpg (1MB, 1556x1101px) Image search: [Google]
1476842757318.jpg
1MB, 1556x1101px
>>60278963
Read this! https://mitpress.mit.edu/sicp/
>>
https://www.reddit.com/r/learnprogramming/comments/69uru7/from_zero_to_google_my_journey_from_no_experience/
>>
File: 1414389660053.png (612KB, 650x875px) Image search: [Google]
1414389660053.png
612KB, 650x875px
>>60275035
What is the most anime-like programming language in existence (with or without a compiler)?
>>
@60279017
I don't want reddit stink nearby. Fuck off.
>>>/r/abbit/
>>
>>60279024
http://fuuzetsu.co.uk/images/language-tans/haskell/
>>
>>60279009
funnily mit uses python instead of scheme now
>>60279024
ruby but it's not particularly good
>>
>>60279024
python

just as retarded and poorly thought out as anime
>>
>>60279047
But Haskell is mentally ill (she's self-contradictory).
>60279051
>ruby but it's not particularly good
What are you trying to say here?
>>60279065
Anime is the fundamental part of imageboard culture and being disgraceful to the anime must be a punishable offence.
>>
>>60279079
stop shitposting
>>
>>60279102
You had 1 (one) chance to show any respect to the local culture.
You didn't. Now fuck off.
>>
File: 1475972971048.jpg (86KB, 728x990px) Image search: [Google]
1475972971048.jpg
86KB, 728x990px
>>60279051
>funnily mit uses python instead of scheme now
The knights of eastern calculus were behind this. They wanted people to become sheep and be controlled.

But you don't seem to understand, which is quite a bit of a shame really when considering that you seemed an honest man.
>>
>>60279110
>muh animuu~~
>>
>>60279110
see >>60279102
>>
>>60279164
>muh
So basically you're admitting that you're a redditor then.
Jump off a bridge already.

>>60279169
see >>60279110
>>
>>60278977
>>60279042
>>60279181
>/dpt/ - Daily Programming Thread
>>
>>60279164
>>>/v/
>>
i'm kind of a newb so please bear with me

i'd like to make an android app, mostly for myself but it's also a college project at the same time. the design i have in mind would include being able to create an account and upload i don't know, either json or xml containing account data

how do i go about it? it'll be in java as i started the basic logic already, but i'm unsure what to look for in terms of account synchronization, basic security and etc. could someone please direct me towards some library or at least what to look for?
>>
>>60279401
>>>/g/wdg
>>
>>60279427
k, thx and sorry.
>>
>>60279436
no need to be sorry just that creating accounts and storing things in a database is not specific to android and it's something a backend web dev would know and not necessarily a programmer
>>
File: ?.png (7KB, 120x120px) Image search: [Google]
?.png
7KB, 120x120px
what securities vulnerabilities would you look for on a website?
>>
>>60279666
Look at OWASP and tools like nikto, nessus, metasploit, nmap, etc
>>
>>60279666
not programming
>>
>>60279780
hurr durr
>>
>>60278216
I don't remember seeing this kind of syntax in CLRS.
>>
>>60278777
Why is Scheme better than CL?
>>
>>60280229
Schemer's say that scheme is simpler than CL which is kind of true, CL is big language.
But scheme implementations basically provide the same stuff as CL, every implementation provides the stuff their own way so they are mostly not portable unlike Common Lisp code which will work on pretty much any CL implementation.
>>
Ahahaha nice joke Linux.
>Taint kernel because I licensed my driver as MIT instead of the vastly inferiour GPL license
>>
>>60280311
I'd say the syntax is less noisy, but I'd say CL is more expressive. You have to jump through less hoops to use macros (arguably one of the most important parts of a Lisp), and the language can be changed fairly easily by modifying the readtable. You can use types and define new types when necessary, which I don't believe Scheme can do. Like you said, implementations are spotty with standard compliance. CL has plenty of data structures built-in. It supports lexical and dynamic scoping. And it has unwind-protect, which I'd rather have over call/cc.
>>
I want to write bindings to some game engine and write game that would run on linux, window and android.
Should I use SML, Ocaml, racket or Common Lisp?
I'm kind of unsure about SML because mlton only supports green threads and there's no documentation about compiling with ndk, though it should run on arm.
Ocaml seems to run on arm but making bindings to C seems to take a lot of code compared to others.
Racket seems kind like the best solution, it supports threads and has simple way of binding and embedding it into C program but you cannot inline C code in racket but maybe that's not necessary.
The Embedded Common Lisp can inline C++ which actually would simplify a lot of the binding writing(no need to first wrap C++ into C and then the C library into other language) but there's like 1 maintainer and last time I used it the debugger wasn't helpful at all and it seemed buggy.

Any other notable language I should consider for my task?
>>
>>60280515
R U S T
U
S
T
>>
>>60280515
Before you go on, which game engine?
>>
>>60280537
Well the godot engine just made GDnative which exports C api to the engine so that what I'm looking to first into.
Otherwise I will propably choose Irrlicht.
>>
>>60280563
wrt your experience with ECL, were you using SLIME at all? It should have some utilities to help profile and debug.
>>
>>60280620
Off course I was using slime but the error messages at least when comparing with ccl/sbcl are just terrible.
>>
Why do funcitonal programming languages refer to changing memory at a location as a "side effect"? How the fuck is that a side effect if it is intentional?
>>
>>60280640
Yeah, stupid question I know. But you'd be surprised. Well, I'm a sucker for CL so I'd just bite the bullet. Haven't used ECL too much so either way, good luck.
>>
>>60280666
because they use the mathematical definition of a function. a function only takes in inputs and returns outputs; it cannot do anything else
>>
File: 1494258951199.png (77KB, 256x251px) Image search: [Google]
1494258951199.png
77KB, 256x251px
I just made the switch to android and want to develop some shit for myself. I have a little experience using android studio (see, one mobile development class), and while I can use it I absolutely fucking hate it. What sort of preferable alternatives are there to android studio floating around out there?
>>
>>60280666
Because side-effects arent pure.
>>
>>60280835
Dumb Kemono poster
>>
>>60280835
Not programming.
>>
>>60280835
There are no alternatives to AS. Google did their best to make Android development a nightmare outside AS.
>>
>>60280835
Just write out your codes by hand, you idiot.
>>
>>60280880
It's an IDE, no?
>>60280881
Well fuck, another reason to hate them I guess.
Thanks for the answer
>>
>>60280905
So? An IDE for web """dev""" still isn't programming. Same with mobile shit.
>>
>>60280925
this. only pointer arithmetic and asm are programing
>>
>>60280925
Do you produce a lot of JS?
>>
>>60280944
No.
>>60280971
None actually. I'm only interested in programming.
>>
File: file.png (164KB, 1360x1188px) Image search: [Google]
file.png
164KB, 1360x1188px
hmmm
>>
>>60281318
Looks like you're creating an infinitively recursive type, or at least exponentially recursive.
>>
Does anybody know the complexity of (==) with lazy ByteStrings in Haskell? Will it evaluate the entire ByteString?
>>
>>60281318
>>60281334
I know this, because i had that happen to me and was the one to file a bug: https://github.com/rust-lang/rust/issues/37311
After which the compiler now limits the depth for recursive types: https://github.com/rust-lang/rust/pull/37789
>>
>>60281318
That's what you get for using Bust.
>>
>>60281318
LOL THAT DEBUGGER
>>
undefined reference to '_impure_ptr' in function 'cv::Mat::getUMat'

Halp
>>
>>60281426
?
>>
>>60281406
>the compiler now limits the depth for recursive types
What a joke.
>>
>>60281470
That's the joy of Turing complete types.
>>
>>60281406
Rust is becoming more of a meme everyday.
>>
>>60281487
Not really. A Turing complete type system doesn't imply the compiler being an absolute joke.
>>
>>60281521
It's either that or crash the computer
>>
>>60281500
>meme
>>>/v/
>>
>>60281529
Or just loop. Why would you need to crash the computer?
>>
>>60281529
Or fix your fucking language.
>>
>>60281529
>crash the computer at the 20th level of recursion depth
really makes you think
>>
>>60281539
Cause it's recursively defined
>>60281541
This is why you don't want this 'feature'
>>
>>60281539
>>60281541
>>60281545
How else would you instantiate a recursive type?
>>
>>60281565
>Cause it's recursively defined
So? You're not making any sense.
>>60281568
By crashing the computer obviously.
>>
>>60281568
How do you "instantiate" a type?
>>
>>60281573
Do you have a solution to generically turn a recursively defined program into an iterative?
>>
>>60281601
Yes, pretty much any recursive program can be translated to a tail-recursive program, which can be translated to iteration.
But how is this relevant?
>>
>>60281607
>Can
True, but that doesn't solve the problem of moving to an iterative version.
>>
>>60281565
What feature?
>>
>>60281631
Are you retarded by any chance? "can" literally means it solves the problem. Or you haven't heard of TCO?
>>
>>60281649
Write a program that will take any recursive algorithm and make it iterative.
>>
>>60281663
Pretty much any functional compiler of any non-shit language is such a program.
>>
>>60281699
I'm still waiting
>>
>>60281710
Did you not read my post?
>>
>>60281722
I read a baseless claim
>>
>>60281733
Any compiler which does TCO is by definition a program which translates recursive programs into iterative ones.
>>
You know how those sites that display a popup saying "register" or some shit like that if you are not signed in also disable scrollbar? I can easily avoid the popup by inspecting the element and deleting it but how do i enable scrollbar in inspect element?
>>
>>60281751
Not programming.
Ask on >>>/g/wdg/
>>
>>60281743
*If it's written a certain way
>>
>>60281407
Rust or Bust!
>>
>>60281772
What is written in a certain way? I'm starting to think you have serious trouble reading.
>>
File: 16427455.jpg (62KB, 960x864px) Image search: [Google]
16427455.jpg
62KB, 960x864px
// Interfaces and classes
interface Printable
{
void print(uint level)
// contract is part of the interface
in { assert(level > 0); }
}

// Interface implementation
class Widget : Printable
{
void print(uint level)
in{ }
body{ }
}

// Single inheritance of state
class ExtendedWidget : Widget
{
override void print(uint level)
in { /* weakening precondition is okay */ }
body
{
//... level may be 0 here ...
}
}

// Immutable data shared across threads
immutable string programName = "demo";
// Mutable data is thread-local
int perThread = 42;
// Explicitly shared data
shared int perApp = 5;

// Structs have value semantics
struct BigNum
{
// intercept copying
this(this) { }
// intercept destructor
~this() { }
}

void main()
{
// ...
}
>>
>>60281858
>Interfaces and classes
>>>/g/wdg/
>>
>>60281832
>In Lua, only a call in the format return g(...) is a tail call.
Example from 5 seconds on Google. They rely on the programmer to turn the algorithm into a tail call format, so that the compiler can do it easily. There is no program that I'm aware of that can take any recursive algorithm and make an iterative version.
>>
>>60281869
>>>/trash/
>>
>>60281908
Any recursive function can be transformed to CPS, which is tail-recursive. Any tail recursion can be transformed to iteration.
>>
>>60281908
>There is no program that I'm aware of that can take any recursive algorithm and make an iterative version.
It's better to leave that responsibility to the developer.
>>
>>60281940
We're talking in circles because you can't grasp the enormous complexity of doing that generically.
>>
File: 18194810.png (388KB, 574x544px) Image search: [Google]
18194810.png
388KB, 574x544px
Both C and Python make you equally lazy programmers. You don't know programming unless you finally take the Rust or Ada pill.
>>
>>60281981
Read about CPS, any and all recursive functions can be transformed into it. CPS is by default tail-recursive. Which can be translated to iteration.
You not being able to google doesn't somehow stop any compliant Scheme (or any other language which enforces TCO) compiler from doing this.
>>
File: meme_1.png (843KB, 1300x809px) Image search: [Google]
meme_1.png
843KB, 1300x809px
Im going to make a simple notepad app like in the macOS but for windows10, how would I go about this, what language would I use? what are the best tutorials? I am a web dev so I should be able to learn and grasp whatever u throw my way

I want to make aesthetic too
>>
>>60282063
Use Java
>>
>>60282040
I believe you, you don't have to keep writing it.

>Enforces TCO
*If written in the proper format

Show me a program that can convert ANY recursive program into an iterative one. If you can't do that, don't bother replying again.
>>
>>60282063
>I am a web dev
Did you have to mention this?
see >>60282087
That's a good (by which I mean shit) choice for your kind.
>>
>>60282131
>Show me a program that can convert ANY recursive program into an iterative one. If you can't do that, don't bother replying again.
https://github.com/ocaml/ocaml
Think before answering. Please.
>>
>>60282144
Show me where this is claimed, if you please.
>>
>>60282140
>i am a web dev
yes so u would know that I know how to code, so would give me good advice instead of pointing me to "hello world" tutorials
>>
>>60282140
Do you actually do any programming or spend the whole day 7 days a week gate keeping /dpt/?
>>
File: 1491617187095.png (422KB, 400x486px) Image search: [Google]
1491617187095.png
422KB, 400x486px
>get first job
>don't tell me exactly what I'm doing
>end up its dev test
I'M NEVER GOING TO BE A NORMAL DEVELOPER NOW
I'M A FUCKING CODE MONKEY FOR LIFE JUST FUCKING KILL ME GOD
>>
>>60282131
Are you underage? Perhaps this childlike explanation will help you.
a -> b
b -> c
Therefore
a -> c
'a' here is recursive function. 'b' here is CPS. 'c' here is iteration. '->' here is "can generically be translated to".
>>
>>60282173
Do above average work and maybe Mr. Bossberg will let you up a ladder or two :^)
>>
>>60282173
>straight out of code monkey school
>don't know what you're doing, blame someone else
>fail
>>
>>60282190
No one here is arguing it's not possible, you moron.
>>
>>60282214
>Show me a program that can convert ANY recursive program into an iterative one.
You implied it isn't possible by writing "any" in caps. Any compliant Scheme compiler is such a program.
>>
>>60282278
I implied no such thing since I stated I know it's theoretically possible in the very post you responded to. I'm only claiming it's infeasible, at the moment.
>>
>>60282316
>it's theoretically possible
What does this mean? I and some other anon have shown you programs which exist and can do this.
>I'm only claiming it's infeasible, at the moment.
Try implementing a toy compiler yourself, perhaps then you will realize your own retardation.
Or maybe it's just you trying hard to not admit that you said something wrong. It's okay anon, all of us make mistakes sometimes.
>>
File: 7246282.jpg (207KB, 641x900px) Image search: [Google]
7246282.jpg
207KB, 641x900px
>>60276010
How about you code your own Fourier transforms you fucking brainlet. Mathematica isn't for idiot codemonekys like you.
>>
>>60282155
OCaml compile a recursive language (OCaml) into an iterative language (ASMor machine code).

I asked you to think before answering.
>>
>>60282397
cute anime but rude post

i give you 5 anonpoints / 12
>>
>>60282131
TCO, CPS, whatever. Some programs CANNOT be made to be primitive recursive (see the ackermann function). If by 'iterative' you mean transforming the program from literal recursive calls using implicit stack space to store intermediate results into a looped one with explicit data storage then yes, any recursive program can be made "iterative". But what's the utility in that statement?
>>
>>60282403
Kek

>>60282388
I have yet to see this claimed. The best I got was an oclam GitHub page which didn't address the point, to showed no one had actual evidence to show it is being done and we could continue arguing over a straw man some more. I would like to see a paper discussing the process and how it can be done.
>>
>>60282473
I already gave you everything you need to google this and check how to implement it for yourself. I'm not going to spoonfeed you. I'm pretty sure there are a lot of papers discussing this.
>>
>>60282496
>I'm pretty sure
The burden of proof is on you, so...
>>
>>60282521
Nope, I'm going to use classical logic where I don't have to provide exact proof terms for the true things I have proved.
>>
>>60276951
>>60276437
>>60278231
>>60278977
>>60279427
>>60279780
>>60279042
>>60281533
>>60281761
>>60281869
This is amazing, you have been gate keeping for 7 and a half hours straight.
>>
>>60282554
Its probably just a bot.
Let me try it.
meme,kys,hurr
>>
>>60282541
Are you still straw manning me about the claim about whether it's possible to move all recursion to tail call? Because that was never the argument.
>>
@60282570
>meme
>>>/b/
>kys
>>>/r/abbit
>hurr
>>>/g/wdg
>>
>>60282584
No. Just your own brain from this point if you are genuinely interested in this. A toy compiler is not that hard to implement and there are papers and other material discussing this.
>>
hey bot
me.me
k-ys
h_urr
last shitpost mods, i promise
>>
>>60282593
nice try, but I wouldn't have used "@" merely for this
>>
>>60282606
>'@' is used to denote and elevated level of stress
Who am I quoting?
>>
>>60282628
>Who am I quoting?
Also interested in this
>>
>>60282595
I've made one and that borderline ad hominem has nothing to do with this. The move from any recursive function to tail call is not feasible, until you prove with an actual article or paper explaining how to do it in a realistic amount of time.
>>
>>60275035
I'm doing a naive bayes classifier in go. I'm a bit stuck whether to use mutexes or buffered channels to handle mutation/reads from many goroutines.
>>
>>60282641
Same bot, anon.
>>
File: f4yhyjgu.jpg (876KB, 960x1440px) Image search: [Google]
f4yhyjgu.jpg
876KB, 960x1440px
>>60275035
Cleanup
>>
>>60276099
lua and love2d https://love2d.org/
>>
>>60282644
>The move from any recursive function to tail call is not feasible
Prove this using any consistent logic of your choosing.
Any good language (and even some shit ones) will do this be default. See any Scheme compiler, even a retard such as yourself should be able to understand. Also I am almost certain the book "Lisp in small pieces" actually discusses this.
Also see http://matt.might.net/articles/by-example-continuation-passing-style starting from "Translating the lambda calculus to CPS". It's a simple example for a simple mind.
>>
Does C have boolean yet?
>>
>>60282816
No, only Prop.
>>
>>60282823
>only
lel
>>
>>60282767
Pretty bold claims calling me a retard when the very article you linked says that the move to tail recursion is on the heads of the programmer, not the compiler.
>>
>>60282870
You are either illiterate or delusional. The article literally shows you an algorithm for translating the untyped lambda calculus to CPS.
>>
File: 1491605604846.png (313KB, 568x409px) Image search: [Google]
1491605604846.png
313KB, 568x409px
>>60282858
>>
>>60282918
So the compiler can't take any code I give it and make it tail recursive?
>>
>>60282962
No, most compilers usually won't compile programs which contain syntax errors or type errors.
>>
>>60282992
Nice avoidance, the point is you have to write the algorithms with tail recursion in mind. Which is the entire point.
>>
>>60278770
ew
>>
>>60283027
Indeed, writing an algorithm which converts recursion to tail-recursion would involve keeping tail-recursion in mind. You're progressing.
>>
>>60280229
The scheme language is simpler and smaller. But there are too many implementations.
>>
>>60280515
lua?
>>
>>60283058
>Making straw mans instead of acknowledging that the compiler doesn't actually do recursion -> tail recursion, but tail recursion -> iterative.
>>
>>60282946
>>
>>60283095
Doing CPS conversion implies doing recursion -> tail recursion, since CPS is by definition tail-recursive. At this point it's hard to believe that you aren't extremely delusional.
Also, why are you quoting something I didn't say?
>>
>>60283224
>Why are you quoting
It's been a good talk, moron.
>>
>>60283246
Was that actually supposed to be an argument? I assume not, since you have been shown to be completely wrong on more than one occasion. I hope you're starting to realize it.
>>
>>60283276
No, it was a goodbye since you've devolved into memes and therefore are irrelevant.
>>
>>60283301
I see, so you are starting to realize. Now I know you're just unwilling to admit your mistakes, but that's better than being mentally ill.
>>
>>60283317
>Are starting to realize I'm a troll
Really made me think, senpai.
>>
"Automatic type inference have resulted in many bugs in the past"

Do you agree?
>>
>>60283351
Being unwilling to admit your mistakes doesn't mean you're a troll. You just have issues you need to work on.
>>
>>60283358
I don't know, but it certainly makes the code look uglier so it has to be removed.
>>
>>60283361
>He pretends the thing that was said about them was for the actual poster
Top wit, my dude
>>
>>60283159
But daddy, why do I have to write two times?
Daddy, you are a baka! Why aren't you using haskell instead? You would not need to do that :3
>>
>>60283387
I can barely read this post, what sort of retarded "slang" is this?
>>
>>60283358
No :3

>>60283389
*write T two times
>>
>>60283389
I really would use haskell but it's 7 times slower than Java
>>
>>60283394
Go back to posting anime here
>>
>>60283404
This is adorable.
>>
>>60283403
But anon, a language can't be fast nor slow! A language is just a language after all :3
An implementation of a language however can.
>>
>>60283425
>.
>>
File: 1485412503173.png (56KB, 300x297px) Image search: [Google]
1485412503173.png
56KB, 300x297px
>>60283389
>Why aren't you using haskell instead?
It has a broken and crippled type system.
>>
>>60283427
Well then, GHC produced binaries are very slow
>>
>>60283434
Think about why that makes no sense.
>>
When is Nim coming out? Seriously
>>
>>60283459
>that
>>
>>60283464
Nim is garbage
>>
>>60283468
Doesn't quite look like it.
>>
>>60283477
..collected
>>
>>60283478
>quite
>>
>>60283464
see >>60283477
>>
>>60283477
>another JS dialect
nty
>>
>>60283499
Definitely not.
>>
>>60283504
see >>60283490
>>
>>60283516
>not
>>
>>60283532
Sir, excuse me?
>>
>>60283547
>me
>>
>>60283554
why so mad anon-kun?
>>
>>60283586
>so
>>
>>60283592
Is that so?
>>
File: 1491939456579.jpg (116KB, 469x469px) Image search: [Google]
1491939456579.jpg
116KB, 469x469px
>>60283438
What would you suggest Oneesama?
>>
New thread:

>>60283641
>>60283641
>>60283641
>>
>>60283618
>Is
>>
>>60283625
Agda 2bqh
>>
Using libevent to handle socket io
vs
Looping through every connection and recv() ing any data
>>
File: 1489337271105.png (788KB, 1080x1080px) Image search: [Google]
1489337271105.png
788KB, 1080x1080px
>>60283625
Your own CoC, even a bare-bones one is better than Haskell in almost every way. Or just Idris, which is broken but not crippled.
>>
>>60283687
>Or just Idris, which is broken
?
>>
>>60283745
It's inconsistent.
>>
File: 1474108678270.jpg (292KB, 1009x1427px) Image search: [Google]
1474108678270.jpg
292KB, 1009x1427px
>>60283687
D-Do you have a repo anon? You seem cool and I like you.
Have you made your own CoC? If so, where should I start?
>>
>>60284015
how?
>>
File: 1491420280911.png (68KB, 400x400px) Image search: [Google]
1491420280911.png
68KB, 400x400px
>>60284046
>D-Do you have a repo anon?
No, that would be extremely gay.
>Have you made your own CoC?
Yes, start with "Write You a Haskell", it will give you the basic knowledge for making a simple polymorphic lambda calculus with full type inference. Then just google or search on github for various dependently typed lambda calculus implementations (there are surprisingly many), assuming you already have a basic idea of how dependent types work.

Another anon posted this a while ago and it was the easiest one to implement. The things not covered here (mainly the infrastructure surrounding the core language) are covered pretty well in WYAH.
http://math.andrej.com/2012/11/08/how-to-implement-dependent-type-theory-i/

>>60284099
It has unsafe garbage of type ∀ a b. a -> b in it.
>>
>>60284301
Thanks anon!
>>
File: 1483612379290.gif (662KB, 292x300px) Image search: [Google]
1483612379290.gif
662KB, 292x300px
>>60284342
No problem. Also check this thread - https://warosu.org/g/thread/56529393
It has some links and some related discussion.
>>
File: heapsort.png (4KB, 148x363px) Image search: [Google]
heapsort.png
4KB, 148x363px
Done implementing my own heap type in C.
void FixDownRek(PriorityQueue *queu, int index)
{
int l = 0, r = 0, child;
if(index < queu->broj_elemenata-1)
{
l = 2*index + 1;
r = 2*index + 2;

child = queu->niz[r].priority>queu->niz[l].priority?r:l;

if(r>queu->broj_elemenata-1)
child = l;
if(l>queu->broj_elemenata-1)
return;

if(queu->niz[child].priority > queu->niz[index].priority)
{
SwapElemenets(queu, index, child);
}
else
return;

FixDownRek(queu, child);
}
}

Ugliest fix down recursion ever.
Anyways, any tips how to do neater print that will look like an acutal tree?
>>
File: 1490131593821.png (626KB, 777x1000px) Image search: [Google]
1490131593821.png
626KB, 777x1000px
>>60284374
D-Do you have any email/irc so I can talk to you if I have any question? I ask that because you are probably the most knowledgeable person about functional programming that I have talked to!
>>
File: 1487569459721.jpg (28KB, 241x321px) Image search: [Google]
1487569459721.jpg
28KB, 241x321px
>>60284455
>email
No.
>irc
I haven't used it in a while, but I guess I can.
>I ask that because you are probably the most knowledgeable person about functional programming that I have talked to!
I'm pretty much a beginner / "lower intermediate" myself.
>>
File: 1489291696820.jpg (270KB, 1000x1414px) Image search: [Google]
1489291696820.jpg
270KB, 1000x1414px
>>60284533
S-sorry to be bothering you then! Have a nice day/night anon. I hope to see you again in these threads sometime.
>>
File: 1486676016711.jpg (351KB, 520x800px) Image search: [Google]
1486676016711.jpg
351KB, 520x800px
>>60284565
We could use irc, but I'm not that familiar with it.
>>
>>60284612
It's quite easy! You just need to install something like Hexchat (GUI) or irssi (terminal), select a server, select a nick and then join a channel. Hexchat guides you trough these.
>>
>>60284681
What channel or network?
>>
>>60284726
How about Rizon? The channel is BradCraft.
Thread posts: 363
Thread images: 42


[Boards: 3 / a / aco / adv / an / asp / b / bant / biz / c / can / cgl / ck / cm / co / cock / d / diy / e / fa / fap / fit / fitlit / g / gd / gif / h / hc / his / hm / hr / i / ic / int / jp / k / lgbt / lit / m / mlp / mlpol / mo / mtv / mu / n / news / o / out / outsoc / p / po / pol / qa / qst / r / r9k / s / s4s / sci / soc / sp / spa / t / tg / toy / trash / trv / tv / u / v / vg / vint / vip / vp / vr / w / wg / wsg / wsr / x / y] [Search | Top | Home]

I'm aware that Imgur.com will stop allowing adult images since 15th of May. I'm taking actions to backup as much data as possible.
Read more on this topic here - https://archived.moe/talk/thread/1694/


If you need a post removed click on it's [Report] button and follow the instruction.
DMCA Content Takedown via dmca.com
All images are hosted on imgur.com.
If you like this website please support us by donating with Bitcoins at 16mKtbZiwW52BLkibtCr8jUg2KVUMTxVQ5
All trademarks and copyrights on this page are owned by their respective parties.
Images uploaded are the responsibility of the Poster. Comments are owned by the Poster.
This is a 4chan archive - all of the content originated from that site.
This means that RandomArchive shows their content, archived.
If you need information for a Poster - contact them.