[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: 313
Thread images: 63

File: pussy-magnet.jpg (47KB, 425x407px) Image search: [Google]
pussy-magnet.jpg
47KB, 425x407px
"Plenty of pussy, plenty of cash" Edition

prev >>59878904
>>
>>
>>59881914
Where did you find this image of me?
>>
File: 1492025193058.png (281KB, 700x857px) Image search: [Google]
1492025193058.png
281KB, 700x857px
Friendly reminder that:
>math is not programming
>a program is not a mathematical proof
>haskell is "programming" in much the same way as SQL statements are "programming".
>monads are a haskell hack that attempts to reinvent object oriented programming but in an obtuse way

Friendly reminder to sage all math autists.
>>
>>59881914
http://ideone.com/c697Lt

Connect four written in 1600 lines of C.

This is the power of the mechanical engineer.
>>
>>59881914
Friendly reminder that Haskell is trash.
>>
File: 1451750721293.png (593KB, 950x1335px) Image search: [Google]
1451750721293.png
593KB, 950x1335px
>>59881914
I see you've uploaded the wrong image, anon. Don't worry: I have a correct one!
>>
>>59881935
>sage

>>>/r/ibbit
>>
>>59881945
i hope his approach was getting a bunch of GPU's to run unsupervised learning on a giant data set
>>
File: 1488068523582.png (48KB, 336x280px) Image search: [Google]
1488068523582.png
48KB, 336x280px
>>59881935
Who are you quoting?
>>
>>59881953
Yes, we know what website you hail from. However, advertising is forbidden, as you would know if you had read the rules.
>>
File: ..png (122KB, 1448x793px) Image search: [Google]
..png
122KB, 1448x793px
So, android studio forced me to update shit and now the emulator won't work. It gets stuck at pic related. Anyone knows what's up?
>>
>>59881973
have you tried turning it off and back on again
>>
>>59881971
Sorry I'm just trying to fit in here.
>>
File: 1485127028587.png (145KB, 615x603px) Image search: [Google]
1485127028587.png
145KB, 615x603px
>>59881935
>math is not programming
Programming is a subset of math and math is a subset of programming.
>a program is not a mathematical proof
Retardedly wrong.

The rest is correct.
>>
Is a BS in CompSci better than a BA degree in an employers eyes?
>>
>>59881971
Few people even read the sticky.
>>
>>59882006
BA is the easy version of BS
>>
>>59882003
A is a subset of B and B is a subset of A
>being this stupid
>>
>>59881980
of course
>>
>>59881967

Obviously, he is not quoting anyone. Why would you ask such a silly question?
>>
>>59882016
Both will qualify for the same job correct?
>>
File: 1483533362891.jpg (141KB, 668x717px) Image search: [Google]
1483533362891.jpg
141KB, 668x717px
>>59882023
Yes? Your point being?
>>
>>59882037
If that is the case then B = A
>>
{
WCHAR* to = TO;
WCHAR const* FORM = (WCHAR const*)_FORM;

while( (*(to++) = *(FORM++)) )
;

return (int)(to - TO - 1);
}
>>
>>59882036
literally NEVER seen a posting that says "BA in Computer Science required"
>>
>>59882046
Not that guy, but I think he's making fun of you.
>>
File: 1459052763149.png (284KB, 586x634px) Image search: [Google]
1459052763149.png
284KB, 586x634px
>>59882046
Indeed. Your point being?
>>
>>59882067
>>59882037
>>59882003
fuck OFF back to sci, this is why i hate people who even link to sci, because people go over there and lead them back here
>>
File: 1437712294543.gif (248KB, 493x281px) Image search: [Google]
1437712294543.gif
248KB, 493x281px
Why is everyone in this thread so mad all the time?

It doesn't seem to be directed at anything specific, you just seem mad all the time about everything in general.
>>
>>59882067
So substituting A for "math" and B for "programming" then your first statement is the equivalent of "math and programming are exactly the same thing" which they are not.
>>
>>59882063
Are you implying that it's harder to find a development job with a BA?
>>
>>59882102
Because software development is a stressful creative activity
>>
File: 1486586375259.jpg (351KB, 1698x1922px) Image search: [Google]
1486586375259.jpg
351KB, 1698x1922px
>>59882081
I don't even go there. What's the point of your retarded and objectively wrong posts?

>>59882109
>your first statement is the equivalent of "math and programming are exactly the same thing"
True.
>which they are not.
They are. I have discovered something which shows that they are absolutely and beyond any doubt the same thing.
>>
>>59882109
Congratulations, you are now familiar with the analytic-synthetic distinction, and the paradox of analysis. For further reading, look up Two Doctrines of Empiricism by Quine, or research post-analytical philosophy and related works of Richard Rorty.
>>
>>59882121
why would you even get a BA in computer science? that's like getting a BS in painting
>>
>>59882102
Three reasons
>Newfags
>Shitposting for (you)s
>Trying to fit in
It's gotten worse too.
>>
>>59882152
>They are. I have discovered something which shows that they are absolutely and beyond any doubt the same thing.
Post it, then.
>>
>>59882023
>>59882173
Who is this quotation originally from?
>>
>>59882179
>Who is this quotation originally from?
G. W. F. Hegel.
>>
>>59882178
I wouldn't want to share it with the mouthbreathers that seem to have co-opted this thread.
If you could somehow prove that you weren't one of them, then I guess we could discuss it further.
>>
>>59882102
because mathfags from sci are raiding our board, saying mathematical equations can magically do what assembly can

HINT you fucking idiot: being able to implement an algorithm in the form of a proof ISN'T THE SAME as being able to actually move bits on a computer. you're SHITPOSTING
>>
>>59882196
Fuckin' told.
>>
>>59882188
>saying mathematical equations can magically do what assembly can
Who said this?
>>
For 59882208
What are you even trying to say by this?
>>
>>59882208
the anime posting 14 year old with cystic acne said this
>>
>>59882201
Sounds like aids.
>>
>>59882228
Where? I've searched the whole thread and I can't seem to find "mathematical equations can magically do what assembly can".
>>
>>59882167
The BA to where I'm transferring is the same as the BS just without honors math classes. Otherwise they are pretty Identical
>>
>the anime posting
Oh, so it's a plebbitor. I see now.
>>
>>59882228
>>59882234
Little stupid ass bitch got fuckin' told.
>>
>>59882215
>Who said this?
Steve Jobs
>>
first the go programming langauge
>>
File: python.gif (443KB, 400x480px) Image search: [Google]
python.gif
443KB, 400x480px
dude math xD everyone post anime pictures with literally every post you make and talk about math and how it's the same thing as programming
>>
>>59882274
more like the slow programming language amirite
>>
File: inorder.png (116KB, 830x620px) Image search: [Google]
inorder.png
116KB, 830x620px
CS fags, was there a time or moment where algorithmic complexity analysis 'clicked' for you? I know mathematicians and smart cookies can look at this and grok it within a few minutes, but I'm still struggling with basic proofs such as this one. It should be easy to understand. I sort of get it, but not really. Where did (c+d)n + c come from? I also don't understand how the substitution works in the second part of the inequality.
>>
>>59882292
just write a program. proofs and programs are literally the same thing
>>
inline int    XY0Z_strlen( char const*const TXT )
{
u8 const*eof = (u8 const*)TXT;
while(*(eof++))
;
return (int)( eof - (u8*)TXT - 1 );
}

 error C2144: syntax error : 'int' should be preceded by ';'

Why?
>>
>>59882305
You shouldn't be using C in 2017, it's an unsafe, ancient language that's been superseded by Rust.
>>
>>59882302
yeah if that programming language happens to be Coq.
>>
@59882322
(You)
>>
File: 1453105388024.gif (3MB, 320x240px) Image search: [Google]
1453105388024.gif
3MB, 320x240px
Binary is math, therefore all programming languages are math.
>>
>>59882322
I'm just editing some 2010 code.
>>
File: 1483236367663.jpg (765KB, 900x1260px) Image search: [Google]
1483236367663.jpg
765KB, 900x1260px
Since this anime hater hates math so much, let's see what the rest of /dpt/ thinks...

http://www.strawpoll.me/12742687
>>
File: wayne-brady.jpg (6KB, 199x253px) Image search: [Google]
wayne-brady.jpg
6KB, 199x253px
>>59882305
>inlining and int
>trying to make an inline function in C
>>
>>59882337
>false flagging
>>
>>59882345
"inline" has been in C for 18 years.
>>
>>59882337
idk are they? I'm just a lowly software engineer. If a CS professional or grad student or mathematician tells me they are, then I'll believe them.
>>
>>59882302
No. They are equivalent. "The same thing" would be equality.
>>59882324
Any programming language actually.
>>59882337
Are you E*ropean or something? Only their kind could possibly think that truth (especially something already established to be true) can somehow be changed by a vote.
>>
>>59882355
They are. /g/ is just full of autistic man children mad about "muh thread culture" and turning this board into an echo chamber full of lies.
>>
Man, Rust strike force people never sleep don't they
>>
>>59882355
>idk are they?
They are. It has been proven.
>If a CS professional or grad student or mathematician tells me they are, then I'll believe them
You would have to be a retard to really think that.
>>
>>59882355
they are, i wrote a proof on a piece of paper and it was able to execute with my x86 intel processor. i also wrote a C program instead of a mathematical proof for an exam and he couldn't take points off b/c they're equivalent
>>
>>59882337
>took infosec for 2 years
>associates in applied math and CS
>BS in CompSci
>undergrad in CompSci and Applied Math

I've gotta choose either math or CS to do a masters in; still not sure which to chose.

>>59882353
okay my point still stands
>>
>>59882382
Who is saying what you're quoting?
>>
>>59882381
>moving the goalposts
>>
>>59882382
>okay my point still stands
How? You were completely fucking wrong.
>>
>>59882399
no he isn't
>>
File: 1476581374798.png (274KB, 366x443px) Image search: [Google]
1476581374798.png
274KB, 366x443px
>>59882381
>i wrote a proof on a piece of paper
Let's not tell lies.
>>
File: 1453306116180.png (58KB, 313x196px) Image search: [Google]
1453306116180.png
58KB, 313x196px
>>59882412
>C doesn't have inline
>Yes it does
>Well, my point still stands
>>
>>59882415
i took theory of automata and linguistics and it was all proofs. oddly enough none of them could be executed on a computer, it's like they're not programs
>>
File: jake-from-statefarm.jpg (5KB, 288x175px) Image search: [Google]
jake-from-statefarm.jpg
5KB, 288x175px
>>59882399
In what way? I said inlining an int function in C is no good; prove me wrong dickhead

>protip: you can't

>>59882389
me it was in regards to the poll and since this is DPT I figured someone would have some ideas on whether I should continue just going full blown CS (with the Associates in Math) or go for a masters in math (with a bachelors in CS.)
>>
>>59882381
Technically, whatever you wrote the proof on is the medium that it was executed on. So saying it executed on some other disconnected system is retarded and doesn't refute anything.
>>
>>59882376
I'd be inclined to believe them, seeing as how my math education halted after I finished differential equations, and I've never taken a programming language theory class.
>>
>>59882428
never said C doesn't have inlines I said it was bad practice retard

read a book or something get off the chans
>>
File: Untitled.png (14KB, 686x351px) Image search: [Google]
Untitled.png
14KB, 686x351px
>>
>>59882434
>i took theory of automata and linguistics and it was all proofs
I don't think someone who denies things which have been proven could have done that.

>>59882444
>I'd be inclined to believe them
Why? Anyway, I don't think a single one of them would deny this.
>>
>>59882435
>I said inlining an int function in C is no good
What the fuck? What the hell does the return type have to do with anything?
What do you even think an inline function is?

>>59882446
>I said it was bad practice
No you fucking didn't.
>>
>>59882446
The only occurance of the word "practice" in this thread is in the post you just made.
>>
>>59882457
What is the point of this poll?
>>
>>59882465
i don't think you understand that for something to be a program, it needs to be able to compile and be run as a process on a computer. after you make a compiler for proofs, you can come talk about how you're a programmer. till then go back to sci
>>
File: 1405796490683.jpg (254KB, 714x644px) Image search: [Google]
1405796490683.jpg
254KB, 714x644px
Seriously, ya'll are fuckin' trollin' if you don't think programs are proofs.

There's no fucking way anyone here is that retarded, even unironically. I refuse to believe this no matter how autistic you are.
>>
>>59882487
>it needs to be able to compile and be run as a process on a computer
This is blatantly wrong. There are computers which simply don't have processes.
>after you make a compiler for proofs
Any compiler for any programming language is a compiler for proofs written in that programming language.
>>
File: 1459633347150.jpg (51KB, 1024x574px) Image search: [Google]
1459633347150.jpg
51KB, 1024x574px
>>59882513
>There's no fucking way anyone here is that retarded
You're a retard for believing this.
>>
>>59882513
alright faggot write me a proof that can edit text

proofs don't do shit, math doesn't do shit
you could make the argument that a program is applied math, but the turbospergs on /sci/ will throw a fit if you do.
>>
>>59882540
I believe the text editor "Vim" (as evident by it being a text editor) can edit text.
>>
File: 1471112914956.gif (3MB, 445x247px) Image search: [Google]
1471112914956.gif
3MB, 445x247px
>>59882540
STOP.

I can't laugh at you any harder or I'll die. Please. You fucking madman. You're killing me.
>>
>>59882547
vim isn't a proof
>>
>>59882523
>Any compiler for any programming language is a compiler for proofs written in that programming language.
what does a program that prints hello world prove?
>>
>>59882587
Binary number theory.
>>
>>59882559
Vim is a program.
And as we know by the Curry-Howard-Lambek correspondence, proofs are equivalent to programs.

>>59882587
Are you claiming that all "hello world" programs are somehow the same?
>>
>>59882540
>>59882547
>>59882558
"Editing text" implies change, which implies time, which does not exist in pure mathematics.
>>
>>59882591
woah this sentence proves english too! amazing

binary number theory isn't something that needs to be proved you idiot. you're not proving anything, you're running the program purely for the side effect of printing hello world to the terminal of the machine it's running on
>>
>>59882597
physics isn't math?
>>
Hello friends, I want to learn angular, how do I start?
I already know javascript and was using just jquery for my projects.
>>
>>59882597
I see, so a function which takes some text and returns edited text can't exist in pure mathematics?
>>59882602
You not using the program as a proof doesn't change the nature of it being equivalent to a proof. It might be a garbage proof derived from a contradiction, but that doesn't somehow disprove something we know to be true.
>>
>>59882620
>I see, so a function which takes some text and returns edited text can't exist in pure mathematics?

this is why monads exist
because a pure functional language with no side effects can produce no useful work
>>
File: 1437109754243.gif (3MB, 420x357px) Image search: [Google]
1437109754243.gif
3MB, 420x357px
>>59882602
>theories don't need proofs
>>
>>59882594
your gay theoretical proof may prove that programs are proofs in its theoretical ignorance of reality, but even C can't do everything that you can do in assembly. so given that even turing complete programming languages can't do things other turing complete languages can do (assembly), proofs CANNOT be equivalent to any programming language in REALITY (which is where we here on /dpt/ live). e.g. there are certain IO ports on machine that cannot be utilized by C, only by assembly. take your theory back to /sci/, where people care about something being theoretically true and practically false
>>
How can you all enjoy shitposting and being mad all the time? I'm a bitter fuck, but even I have my limits.
>>
Who here /tensorflow/?
>>
>>59882612
Not pure math.

>>59882620
>I see, so a function which takes some text and returns edited text can't exist in pure mathematics?
It can, but the original text remains unchanged.
>>
>>59882615
>webdev
we are not your friend, pal
>>
File: AAAAAAA.png (576KB, 531x720px) Image search: [Google]
AAAAAAA.png
576KB, 531x720px
With stateless functional programming, the CPU heats up but nothing happens!
>>
>>59882630
>but even C can't do everything that you can do in assembly
In terms of computability, yes it can. All of the extra special instructions only assembly has (because they are far too importable and/or niche for a programming language to output) don't affect what can actually be computed; it's mainly just to deal with hardware and other messy "reality" stuff.
>>
>>59881914
Having trouble with SICP again...

(define (product term a next b)
(if (> a b) 1
(* (term a) (product term (next a) next b))))
(define (factorial n)
(define (self x) x)
(product self 2 inc n))

(define (inc x) (+ x 1))

(define (pi-approx n)
(define (inc x) (+ x 1))

(define (square x) (* x x))

(define (num-prod ind) (* (* 2 ind) (* 2 (+ ind 1)))) ; calculates the product in the numerator for a certain term
(define (denom-prod ind) (square (+ (* ind 2 ) 1))) ;Denominator product at index ind

;;When I comment these two lines out, and replace num in the "return statement" the code runs fine
(define num (product num-prod 1 inc n))
(define denom (product denom-prod 1 inc n))

(* 4 (/ num denom))) ;;Resulting value

(pi-approx 10)


This code leads to the following error in DrRacket:

 num-prod: undefined;
cannot use before initialization


What the fuck do I do?
>>
>>59882626
>this is why monads exist
This has to be a troll.

>>59882630
>theoretical
You don't seem to understand what this word even means.
>ignorance of reality
You're the only one currently engaging in that. You're as idiotic as someone trying to deny any given physical law.
>but even C can't do everything that you can do in assembly
Both of them are Turing complete, meaning they can simulate each other, meaning this is blatantly false.
>so given that even turing complete programming languages can't do things other turing complete languages can do
This is impossible by definition.
>proofs CANNOT be equivalent to any programming language in REALITY
Do you have a formal proof of this? Are you saying you have discovered something new?
>there are certain IO ports on machine that cannot be utilized by C
The language itself can do everything assembly can since they are equivalent.
>theoretically true and practically false
There exists no such thing as either "theoretically true" or "practically true"
>>
File: Untitled.png (13KB, 679x348px) Image search: [Google]
Untitled.png
13KB, 679x348px
>>
>>59882675
you're trying to downplay the fact you just got blown the fuck out.
>it's mainly just to deal with hardware and other messy "reality" stuff.
yeah the reality of anime not being real and your theories no doing anything really is messy isn't it?
>>
File: 14574896753820.jpg (83KB, 1280x720px) Image search: [Google]
14574896753820.jpg
83KB, 1280x720px
@59882630
>so given that even turing complete programming languages can't do things other turing complete languages can do
>>
>>59882690
>you're trying to downplay the fact you just got blown the fuck out.
Actually, this is the first post in this conversation I've replied to.
I was just pointing out that you are blatantly false, and don't seem to understand what computability is.
>>
>>59882681
>>theoretically true and practically false
>There exists no such thing as either "theoretically true" or "practically true"
theoretically, integers can be infinitely large. this is not practically true in any programming language. go back to sci.
>>
>>59882687
That's not surprising.
>>
>not knowing the difference between I/O and computation
>>
File: fucking lettuce.gif (2MB, 270x188px) Image search: [Google]
fucking lettuce.gif
2MB, 270x188px
Fuck recursion.
>>
>>59882700
are you in denial, or realizing turing completeness doesn't carry over to reality? i just said that assembly can utilize hardware unusable by C
>>
>>59882690
>real
>not real

This arbitrary distinction needs to die along with descartes dualism. Everything that can be referenced exists in some form.

This is why programs = proofs.
>>
Recursion is just poorly written iteration.
>>
>>59882676
The code works for me as is. So it's not the code.
>>
>>59882723
yeah and english is proofs too! so go raid /lit/ instead
>>
>>59882724
Some people would disagree very strongly with you
>>
File: 1491009506251.jpg (24KB, 324x278px) Image search: [Google]
1491009506251.jpg
24KB, 324x278px
>>59882718
>>59882724
>I'm too stupid to understand recursion
>>
>>59882729
Fuuuuuuuuuck
>>
>>59882708
>integers can be infinitely large
No. The set of integers is infinite.
>this is not practically true in any programming language
Any programming language can implement integers as defined in set theory. You not having enough memory to store certain integers doesn't somehow make this not true.

>>59882720
>realizing turing completeness doesn't carry over to reality
How can a true statement about reality not carry over into reality? Are you clinically retarded or something?
>i just said that assembly can utilize hardware unusable by C
Which is incorrect, both of them are equivalent languages. Our conventions of using hardware doesn't change that.

>>59882723
>This is why programs = proofs.
Blatantly false.
programs <=> proofs.
>>
>>59882724
That's basically the gist that I'm getting from it. I'm going through a recursion lesson and it's like, why the fuck can't I just use iteration? Recursion isn't making any sense to me. I spent like hours last night trying to wrap my head around recursion. It's just not clicking for me
>>
>>59882756
>It's just not clicking for me
How does it feel being a double-digit? Does it hurt?
>>
>>59882737
You need to leave, not them.
>>
>>59882746
your compiler rewrites your recursive garbage as a loop anyway.
defective compilers won't catch this and will allow you to overflow the stack, meaning that YES, it literally is malformed iteration
>>
>>59882753
>Which is incorrect, both of them are equivalent languages. Our conventions of using hardware doesn't change that.
yeah, it actually does. now you're the one thinking illogically. you're all butt triggered over the fact that math is computer science separated from reality. genuinely not even being rude, you'd be more at home on /sci/
>>
>>59882752
The only difference is that I'm using
#lang racket
.
>>
>>59882762
you're outnumbered 8 to 4 bud
>>
>>59881935
>haskell is "programming" in much the same way as SQL statements are "programming".
Yes?
>>
File: 1452403462016.png (79KB, 307x400px) Image search: [Google]
1452403462016.png
79KB, 307x400px
>>59882765
>your compiler rewrites your recursive garbage as a loop anyway.
Only the trivial cases.
I'll rephrase my maymay arrow:
>I'm too stupid to understand how to use recursion
>>
>>59882770
>yeah, it actually does.
No. The languages are equivalent, one can be used to simulate the other. You're literally saying that something which is by definition true is somehow not true.
>you're all butt triggered over the fact that math is computer science separated from reality
There is no such thing as "separated from reality".
>you'd be more at home on /sci/
I don't go there. And I'm certainly going to post about it even more since there seems to be a lot of straight up retards here.
>>
File: 1406010011688.jpg (49KB, 683x623px) Image search: [Google]
1406010011688.jpg
49KB, 683x623px
>>59882770
>computer science isn't science

Here in /dkg/ it isn't, that's for sure.
>>
>>59882784
>No. The languages are equivalent, one can be used to simulate the other.
simulate ASM getting IO from a port inaccessible by C with C
>>
>>59882782
>maymay arrow
Fuck off.
>>
>>59882788
Are you seriously trying to imply that doing that is hard?
Do you really think that hardware emulators of any kind don't exist?
>>
>>59882788
Why would I need to do that? I just need to prove that both of them are Turing complete, which has already been done.
It being hard to do because of the conventions we have established doesn't mean it's impossible.
>>
I feel like this place has made me a better programmer in a fairly short amount of time.

Thanks DPT
I think I'm getting a good job because of you guys.
>>
>>59882789
How new are you you?
>>
>>59882796
how is a hardware emulator (written in C) going to help you in that situation?
>>
>>59882807
Less new than I'd like to admit. Definitely not as new as you, though.
>>
File: 1434693874254.jpg (150KB, 470x588px) Image search: [Google]
1434693874254.jpg
150KB, 470x588px
>>59882776
>truth isn't objective, it's a consensus of subjective opinions

We get it, you're a dumb old hat with no real understanding of computer science. Doesn't change the fact that you're wrong and you need to step aside and let us adults discuss things a idiot like you don't comprehend.
>>
>>59882806
Don't believe anything you read here.
>>
File: 1491985508324.png (673KB, 1280x720px) Image search: [Google]
1491985508324.png
673KB, 1280x720px
>>59882773
It works!

Will everything in SICP work with
 #lang racket?
>>
>>59882801
you don't even understand my post. there's >literally< things that are impossible to do in C that you can do in assembly, in the real world. i'm not talking about some abstract proof, i'm talking about you can't do it because the language can't utilize the hardware. i'm sorry but turing completeness doesn't mean shit
>>
>>59882825
https://docs.racket-lang.org/sicp-manual/index.html
Apparently not. But this works for now I guess.
>>
>>59882820
you adults should have your discussion on /sci/
>>
>>59882821
I hardly pay attention to the arguments, I just ask for coding advice to be more efficient and post code for review here.

that /dpt/ roller works wonders.
>>
>>59882835
>there's >literally< things that are impossible to do in C that you can do in assembly
C HAS INLINE ASSEMBLY YOU NIGGER
>>
>>59882814
>>59882835
Lets step back from your strawman argument for a bit, and get back to the point.
How the fuck does having access to I/O ports increase computability? Computability is a very abstract, but real concept, and you don't seem to understand what it actually is.
>>
>>59882006

Don't worry, anon, McDonland's don't need you to science their burgers or make them pretty either.
>>
>>59882843
You kids should have your discussion on reddit.
>>
>>59882850
*oh shit i'm starting to realize math isn't programming*
let's step back from you blowing me the fuck out and talk about theories
>>
>>59882835
Fact 1 - Assembly is Turing complete.
Fact 2 - C is Turing complete.
Therefore, anything C can do, Assembly can do and vice versa. It's simply not possible for this to be false.
>i'm talking about you can't do it because the language can't utilize the hardware.
The language can actually. Certain hardware making it harder doesn't mean something true is now false.
>>
>>59882869
yeah you don't get that turing completeness isn't the same thing as practical equivalence
>The language can actually.
no, it really can't
>Certain hardware making it harder
not harder, impossible
>>
>>59882292
Sometimes it's fairly easy to see what is happening. For this example, given a tree of n nodes, when you call Inorder(), how many times do you 'touch' a node? For this algorithm, you obviously 'touch' each node a constant number of times (either once for a print, or twice for print and back up the recursion tree). Thus you can think of it as approximated n * constant work per node == O(n). For the proof, which parts do you not understand? The c is from definition of asymptotic notation (if we assume our algorithm is O(n), we must find a constant, c* n, s.t. our algorithm is bounded above by it, i.e. T(n) <= c * n).
>>
Algorithms exist as a fundamental part of nature. The fact that humans can build machines to instantiate them provides a proof of them.

Hence, programs are proofs.
>>
>>59882877
Two languages being Turing complete means they are equivalent.
Something being a lot harder to do doesn't negate this.
You're probably the most stupid person I have ever talked to, and that's saying a lot.
>not harder, impossible
Do you even realize your own stupidity when you say this? I really hope you're just trying to save face at this point since you've said so many things which are just blatantly false.
>>
>>59882869
>>59882877
Don't bring hardware into this. It's irrelevant.
A turing machine is only defined by it's ability to take inputs on the tape, and how it gives outputs by leaving it on the tape.
There is nothing there about the actual machine itself, because it's just a theoretical idea.
When talking about computability, there is no difference in power between C and assembly. You take your input, and you give your output.

There is a good reason that programming languages choose not to support some of the more obscure instructions that an assembly language may have: they're stupidly unportable, not useful at all (except for kernels) and have nothing to gain in the sorts of things they can compute.
Also, you keep talking about assembly, but which assembly are you even talking about? You keep talking about it like it's one thing.
>>
File: 1393276426601.jpg (182KB, 1894x1209px) Image search: [Google]
1393276426601.jpg
182KB, 1894x1209px
>>59882926
This.

Checkmate, nerds.
>>
>>59882839
Fuck. Why can't they update SICP. On the one hand, I get it that it's like over thirty years old, but I feel like *some* attempt should be made at re-implementing it in a more supported language like racket (which is almost exactly like lisp from what I can tell)
>>
>>59882926
>Hence
No. You saying two true things and concluding another true thing from it doesn't somehow imply causation.
>>
File: 1492122634933.jpg (16KB, 725x406px) Image search: [Google]
1492122634933.jpg
16KB, 725x406px
>>59881935
Dr. Leslie Lamport would like a word with you.
>>
File: 1459634747249.png (292KB, 475x528px) Image search: [Google]
1459634747249.png
292KB, 475x528px
>>59882345
>>59882353

This >>59882305 was actually a problem with an include (wrong file path), I just realized the path had "/" instead of "\", now it doesn't show that error anymore.
>>
>>59882815

PROTIP: When loosing an argument, fighter harder; When you've lost an argument stop fighting.
>>
>>59882937
www.composingprograms.com/
>>
File: 1480546014371.png (316KB, 463x475px) Image search: [Google]
1480546014371.png
316KB, 463x475px
>>59882948
Because there is no causation involved. It's deduction.

Math is made up of proofs. Proofs are algorithms. Programs are algorithms. Therefore, programs are proofs.

Q.E.D.
>>
>>59883002
...But if I do this, how can I brag to my friends that I'm programming in LISP?

That, and I really like the feel of having the physical SICP book. Just imagine if Abelson and friends made a new version of SICP man... Just freaking imagine
>>
whats a good book about good programming habits
>>
>>59882993

Nah it's just the first-year students playing text-book ping pong. Just instead of the normal "I read X which trumps Y" its "I don't understand Y so it's trumped by X" in nature. Wait till they have to learn higher level design patterns or how to re-use their code, I bet they say ^c^p code is fine cause they ^c good code, therefore ^p good code. AM I RITE!?
>>
File: 1490226694518.png (754KB, 736x715px) Image search: [Google]
1490226694518.png
754KB, 736x715px
>>59883003
Well, shit, have an anime picture as a sign of my gratitude.
>>
>>59883003
#include <stdio.h>
int main(void) {
puts("The person this post is quoting is a fag");
return 0;
}
>>
>>59883024
You could try Common Lisp. Here's a kind of direct translation of your code:
(defun product (term a next b)
(if (> a b)
1
(* (funcall term a) (product term (funcall next a) next b))))

(defun inc (x) (1+ x))

(defun factorial (n)
(flet ((self (x) x))
(product #'self 2 #'inc n)))

(defun pi-approx (n)
(labels ((inc (x) (1+ x))
(square (x) (* x x))
(num-prod (ind) (* (* 2 ind) (* 2 (1+ ind))))
(denom-prod (ind) (square (+ (* ind 2) 1))))
(let ((num (product #'num-prod 1 #'inc n))
(denom (product #'denom-prod 1 #'inc n)))
(* 4 (/ num denom)))))
>>
>>59883034

Programming at high level in OO;

https://en.wikipedia.org/wiki/Design_Patterns

If you mean coding convention I remember this one fondly;

https://en.wikipedia.org/wiki/The_Art_of_Unix_Programming

YMMV, good luck :)
>>
wait...how is dynamic programming different than divide and conquer?
>>
File: vomit.jpg (90KB, 650x650px) Image search: [Google]
vomit.jpg
90KB, 650x650px
>>59883102
>https://en.wikipedia.org/wiki/Design_Patterns
>>
>>59883102
>Design Patterns
my god have mercy on your soul for mentioning that on /dpt/
>>
>>59883150
>>59883162
>>
#########################################################################
# FizzBuzz #
# Copyright (C) 2017 anon42 #
# #
# This program is free software: you can redistribute it and/or modify #
# it under the terms of the GNU General Public License as published by #
# the Free Software Foundation, either version 3 of the License, or #
# (at your option) any later version. #
# #
# This program is distributed in the hope that it will be useful, #
# but WITHOUT ANY WARRANTY; without even the implied warranty of #
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #
# GNU General Public License for more details. #
# #
# You should have received a copy of the GNU General Public License #
# along with this program. If not, see <http://www.gnu.org/licenses/>. #
#########################################################################
n = 0
for i in range(100):
n+=1
if n % 3 == 0:
print("fizz")
elif n % 5 == 0:
print("buzz")
else:
print(n)
>>
>>59883143
Dynamic programming is for when an algorithm can be worked out using previous solutions to the problem, and allows you to stop recomputing the same shit over and over
Divide and conquer is about breaking the problem down into a smaller, more manageable one than can be solved directly.
>>
>>59883188
#.(loop for i from 1 to 100 do
(format t "~:[~:[~a~;Buzz~]~;Fizz~:[~;Buzz~]~]~%~@*" (zerop (mod i 3)) (zerop (mod i 5)) i))
>>
This thread is pretty fucking retarded.
>>
>>59883195
ugly
>>
>>59883204
More like the most beautiful fizzbuzz you ever laid your eyes on.
>>
>>59883195
>>59883209
Why does it have so many little penises in it?
>>
>>59883162

There is but one true god, friend, and his name is Martin Fowler. And I'm pretty sure he gives me a spiritual high-five every time I mention the Design Patterns book :P
>>
>>59883197
So it's like every thread ever
>>
>>59883222
~ in format is like % in C's printf
>>
>>59883229
No, this one is especially retarded.
>>
>>59883238
You're especially retarded for thinking that.
>>
What's a free email service that lets me send plain text emails?
>>
>>59883250
>>59883238

And to think... Some people didn't understand recursion earlier in the thread :P
>>
>>59883264
How is that programming related?
>>
#########################################################################
# Pi #
# Copyright (C) 2017 anon42 #
# #
# This program is free software: you can redistribute it and/or modify #
# it under the terms of the GNU General Public License as published by #
# the Free Software Foundation, either version 3 of the License, or #
# (at your option) any later version. #
# #
# This program is distributed in the hope that it will be useful, #
# but WITHOUT ANY WARRANTY; without even the implied warranty of #
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the #
# GNU General Public License for more details. #
# #
# You should have received a copy of the GNU General Public License #
# along with this program. If not, see <http://www.gnu.org/licenses/>. #
#########################################################################
import std.stdio: writefln;
import std.conv: toInt;
import std.string: format;

string pi_digits(int digits) {
const int SCALE = 10000;
const int ARRINIT = 2000;
string result;

int carry;
auto arr = new int[digits + 1];
arr[] = ARRINIT;
for (int i = digits; i > 0; i-= 14) {
int sum = 0;
for (int j = i; j > 0; --j) {
sum = sum * j + SCALE * arr[j];
arr[j] = sum % (j * 2 - 1);
sum /= j * 2 - 1;
}
result ~= format("%04d", carry + sum / SCALE);
carry = sum % SCALE;
}
return result;
}

void main(string[] args) {
int n = args.length == 2 ? toInt(args[1]) : 100;
writefln(pi_digits(n));
}
>>
File: 1379272606191.jpg (18KB, 512x384px) Image search: [Google]
1379272606191.jpg
18KB, 512x384px
>>59883279
>Necrophilia
>>
File: 1480831478233.jpg (83KB, 540x540px) Image search: [Google]
1480831478233.jpg
83KB, 540x540px
>>59883274
This is the only place on /g/ with people who might know about this.
>>
>>59881930

I prefer 4 nibbles, fnar fnar
>>
>>59883250
No. This thread is filled with utter retards.
>>
File: 1423928686714.gif (1MB, 320x240px) Image search: [Google]
1423928686714.gif
1MB, 320x240px
>>59883273
I stand corrected.

>>59883315
No, just you for not getting it.
>>
I feel like I've chosen the wrong major and I haven't even started any programming courses yet.
>>
>>59883323

Keep that recursion going bro, show dem noobs how it do ;D
>>
File: 1405114747576.jpg (66KB, 399x382px) Image search: [Google]
1405114747576.jpg
66KB, 399x382px
Thread Sum(IQ) As Integer
If IQ == 1 Then
Set Sum = 1
Else
Set Sum = Sum(IQ-1) + IQ
End If
End Thread
>>
>>59883323
Not getting what?
>>
>>59883408
Thread?
>>
File: 1427583151044.jpg (65KB, 604x453px) Image search: [Google]
1427583151044.jpg
65KB, 604x453px
>>59883440
>>
>>59883465
????
>>
File: 1405796447186.jpg (175KB, 588x588px) Image search: [Google]
1405796447186.jpg
175KB, 588x588px
>>
Encryption is turning out slightly harder than I thought, i know what I want to do but not entirely sure how I'd get it done.

How do I get char to start over from A after i increment it past z? lets say I do a + 28 how do I ensure I get b as a result instead of some random character?
>>
>>59883481
ohhh, do I just divide the 28 by 26 and let the remainder do the increment?
>>
>>59883465
How do I get this bitch away from me?
>>
>>59883300
>le D is ded meme
>>
Interfacing to Ada packages from C. SMALL EXAMPLES.

Simple Build File
project Build is
for Languages use ("C", "Ada");
for Main use ("our_c.c");
end Build;


The Files
//our_c.c
#include <stdio.h>
#include <stdlib.h>

//Need these
extern void adainit (void);
extern void adafinal (void);

//Our new functions
extern int mult(int x, int y);
extern void modify_add(int *x, uint size);
extern void sort(int *x, uint size);
extern int b_var;

int main(int argc, char const *argv[])
{
adainit();

int local[10];
for(int i = 0; i < 10; i++){
local[i] = rand();
}
modify_add(local, 10);
sort(local, 10);

for (int i = 0; i < 10; ++i)
{
printf("%d\n", local[i]);
}
printf("%d\n", b_var);
printf("%d\n", mult(b_var, 2));

adafinal();
return 0;
}

--this_ada.ads
with Interfaces.C; use Interfaces.C;
with Ada.Containers.Generic_Array_Sort;

package This_Ada is

type Int_Array is array (Unsigned range <>) of Int with Convention=>C;

procedure Sort_Array (X : in out Int_Array; Size : in Unsigned) with
Export,
Convention=>C,
Link_Name=>"sort";

B : Int := 345 with
Export,
Convention=>C,
Link_Name=>"b_var";

--Cute one-liner
function Mult (X, Y : in Int) return Int is (X*Y) with
Export,
Convention=>C,
Link_Name=>"mult";

procedure Add (X : in out Int_Array; Size : in Unsigned) with
Export,
Convention=>C,
Link_Name=>"modify_add";

private
procedure Sort is new Ada.Containers.Generic_Array_Sort(
Unsigned,
Int,
Int_Array);
end This_Ada;

--this_ada.adb
package body This_Ada is
procedure Add (X : in out Int_Array; Size : in Unsigned) is
begin
for I in Unsigned'First .. Size-1 loop
X(I) := X(I) + 2;
end loop;
end Add;

procedure Sort_Array (X : in out Int_Array; Size : in Unsigned) is
begin
Sort(X(Unsigned'First .. Size-1));
end Sort_Array;
end This_Ada;


simply run
 gprbuild 
(it's in your repo right now)
>>
>>59883300
exdi epic trole, bro :D
>>
>>59883605
>>59883619
>"D is dead" is a meme
No, D itself is the meme.
>>
>>59883300
>a programming language can be "alive"
>>>/r/ibbit
>>59883605
>le
>meme
>>>/r/abbit
>>59883683
>a programming language can be a """meme"""
>>>/r/abbit
>>
>>59883711
>le rabbit meme
>>
>>59883721
>le
>"""meme"""
>>>/r/abbit
>>
File: funny result.png (11KB, 654x354px) Image search: [Google]
funny result.png
11KB, 654x354px
https://pastebin.com/ubjmJKM2

Thats my code

picrelated is the result

The decryption combo I used was from an encryption I did earlier. I'm sharing this because the result made me burst out laughing.
>>
>>59883711
This post fucking reeks of new.
>>
>>59883741
How high is your autism?
>>
>>59883750
none present that I know of?
I just found the result of my mistake funny. what did I do wrong?
>>
File: 1470284474790.jpg (186KB, 743x743px) Image search: [Google]
1470284474790.jpg
186KB, 743x743px
>>59883741
>rolling your own crypto
>>
>>59883748
Everything in your post reeks of reddit.
Seriously: piss off. Your kind is not welcome here.
>>
>>59883769
>rolling your own crypto
This is the first time this sentence has appeared in this thread.
>>
>>59883727
see
>>59883721
>>
anyone ever made an app for android that was impossible or very hard to uninstall?

im just kind of fucking around right now and i wanted to try to make something that was as impossible to get rid of as i could without the phone being rooted.

right now i have it running a background thread which just brings the app back up whenever the user exits the app, but if they're fast enough (my thread checks the active process every 1 second) they can still force quit and uninstall it
>>
>>59883769
>>59883780
Alright, teach me, what do I do?
I thought the best way to randomize was to use a rng.
>>
>>59883771
Literally 173% of the redditry in /dpt/ emanates from your posts.
>>
>>59883796
see >>59883727

>>59883807
That would be impossible. You have a contradiction somewhere in your retarded assumptions.
>>
>>59883780
not so

https://warosu.org/g/?task=search&ghost=&search_text=rolling+your+own+crypto
>>
>>59883851
'this' implies this particular instance of the thread.
Your response would be valid if I said 'the[se] thread[s]', not 'this thread'.
>>
>>59883907
/dpt/ is one continuous thread
>>
>>59883915
That would mean there is no /dpt/ without an anime image in the OP which is clearly not the case.
>>
>>59883614
What compiler?
>>
>>59884021
MHC
>>
>>59884021
on debian systems
sudo apt install gnat
sudo apt install gprbuild
>>
>>59884087
Neither of those is a compiler name.
I think you mean "gnat" and "gprbuild".
>>
>>59884096
You figured it out, so obviously it has the name.
>>
File: 1491556420796.png (67KB, 385x367px) Image search: [Google]
1491556420796.png
67KB, 385x367px
>>59883614
What should I learn Ada for?
Does it have O*P?
>>
>>59884120
it's a comfy embedded systems language
>>
File: hablar example.png (17KB, 841x577px) Image search: [Google]
hablar example.png
17KB, 841x577px
holy shit g i'm having a fucking panic attack right now. does this make any sense? can i make this evaluate in C#?
>>
>>59884236
stop thinking and do it


>captcha is "success"
>>
>>59884213
>comfy
In what way?
>>
>>59884262
A nice tasking system and a type system that isn't a complete joke are nice.
>>
>>59884336
>a type system that isn't a complete joke
So it can do bounds checks at compile time?
>>
>>59884433
There's a tool for verification if you genuinely need to care about that.
>>
File: error.png (13KB, 460x317px) Image search: [Google]
error.png
13KB, 460x317px
Why is this #error causing the syntax to get messed up? the highlighting returns normal if I exclude "//" that line.
>>
>>59884447
I mean encoding bounds checking into types.
>>
>>59882003
>Programming is a subset of math and math is a subset of programming.
What the fuck are you smoking
>>
>>59884475
Arrays know their size if that's what you mean. Give an example if that's not because I don't follow.
>>
>>59884509
>Arrays know their size
So the array type has 2 arguments? The size of the array and the type of things stored in that array.
Something like "Array 5 Int".
>>
>>59884504
What seems to be the problem?
>>
>>59882037
>>59882067
>>59882152
>>59882196

????????????????????????????????
>>
@59881935
>monads are a haskell hack
H*skell didn't invent monads, you retard.
>>
>>59884577
Yes? What's your question?
>>
Does anyone know if compilers merge loops like these? I haven't thought about it before and I don't see why not but I can't test.
>>
>>59884581
>@
>*
Please stop using these reddit memes, they aren't very funny
>>
>>59884542
Alright, there are two ways to declare an array. with an unknown range and a known range.

type Generic_Array is array (Index_Range range <>) of Element_Type; 
--or
type Known_Array is array (X .. Y) of Element_Type; --X and Y can be variables or constants

The Known_Array can be a subtype of the Generic_Array (and should be, most of the time)

Declare an array is either
Dynamic : Generic_Array(1 .. 5); --must specify range (and therefor size)
Static : Known_Array; --predefined size at package elaboration. Cannot specify a different size.

These can be sent as is to the functions. The functions >>59883614 send size because C does not know array sizes and therefor neither does Ada. Gnat gives the warning to make sure the size is being sent in the function call.
>>
>>59884607
I'm not aware of either of them being a reddit meme.
@ is literally "at".
* is a common way of censoring "bad" words.
>>
>>59884625
I didn't mean they were from reddit, I meant that they may as well be from reddit
>>
File: solve (2).jpg (233KB, 1280x720px) Image search: [Google]
solve (2).jpg
233KB, 1280x720px
>>59881935
t. pajeet
>>
>>59884605
Not in your case, the second loop depends on `u` and `u` depends on the first loop, there is no correct way to fuse the loops.
Also, you can test these things in https://gcc.godbolt.org/ .
>>
>>59884640
According to this logic literally any English convention may as well be from reddit. I don't believe that's the case.
>>
>>59884618
I'm assuming trying to index an array incorrectly will be a compile time error?
>>
>>59884660
Ah yes I see.
But it does merge loops sometimes then. Thanks.
>>
>>59884665
that doesn't follow at all
>>
>>59884682
Very much so. It's rare to even have that error since it's good practice to index using a unique type.
>>
>>59884659
I believe even their kind isn't that stupid. Which makes me wonder who the fuck "he" even is.
>>
>>59884465
#error stops compilation and prints the error message.
I don't know why your editor would mess up here. To my knowledge there's no 'block' for error it's just the one line. So I don't get why it would mess up the subsequent lines at all.
Maybe the editor doesn't specifically look for #endif specifically to close the #ifndef block?
>>
>>59884770
There were no quotes kek. Now looks good.
>>
ok, we all have some beef with M$...
but if you are building for the mobile market, why would you use anything other than VS+Xamarin?
https://www.youtube.com/watch?v=ra3Pd8KoVOw
>>
>>59883833
>I'm retarded
We know.
>>
Is Codeblocks a good program to code in?
>>
File: mobile_market.jpg.jpg (297KB, 1372x1016px) Image search: [Google]
mobile_market.jpg.jpg
297KB, 1372x1016px
>>59884877
>mobile market
Thanks, but I don't hate myself.
>>
if( xyz > bufLen_tmp )
xyz = bufLen_tmp;

u8 buffer[2048];


warning C4018: '>' : signed/unsigned mismatch

How comes?
>>
How would /dpt/ sort only certain elements in an array, while leaving the rest in place? This was a programming challenge I was working on earlier. The challenge was to sort the odd numbers in ascending order while leaving the even numbers in place.

For example,
sortArray([5, 3, 2, 8, 1, 4]) == [1, 3, 2, 8, 5, 4]


Here's what I (lazily) came up with:
std::vector<int> sortArray(std::vector<int> array)
{
if (array.empty()) return array;
std::vector<int> odd_arr;
for (const int n : array) {
if (n % 2 == 1) {
odd_arr.push_back(n);
}
}
std::sort(odd_arr.begin(), odd_arr.end());
auto ret = array;
auto odd_arr_it = odd_arr.begin();
for (int &n : ret) {
if (n % 2 == 1) {
n = *odd_arr_it;
odd_arr_it++;
}
}
return ret;
}
>>
>>59884912
>assuming i meant games
FFS!
>>
>>59884701
Nice. What's the best resource for learning it?
>>
>>59884955
the wikibook is nice, but not fully up to date https://en.wikibooks.org/wiki/Ada_Programming

"Programming in Ada 2012" for more advanced topics can be found at libraries or on libgen.io
>>
>>59884939
I guess you can write your own quicksort which ignores some values and moves the rest, it should be somewhat more efficient than your version.
>>
>>59884877
please stop advertising
>>
>more than half of /dpt/ is confirmed for being brain-dead
Can't say I'm surprised.
>>
>>59885011
>advertising
riiiiiight
>>
>>59885044
kys
>>
>>59885168
The common bottom of the barrel of society.
>>
File: 1490495605081.png (435KB, 720x720px) Image search: [Google]
1490495605081.png
435KB, 720x720px
>>59885168
Your post is ugly and outright puke inducing. Kill your own self immediately.
>>
>>59885011
>>59885044
>>59885092
>>59885168
>>59885246
>>59885400
I love substantive /dpt/ discussions with actual arguments
>>
File: ruby-concurrency-33-638.jpg (38KB, 638x479px) Image search: [Google]
ruby-concurrency-33-638.jpg
38KB, 638x479px
CSP VS Actor model?

(Go/Clojure VS Erlang/F#)

Which should I learn?
>>
>>59885524
Clojure has actors too, doesn't it? It also has STM, so just learn Clojure, really.
>>
File: 1481787657165.jpg (60KB, 640x625px) Image search: [Google]
1481787657165.jpg
60KB, 640x625px
>>59885455
Literally don't care about anything you said.
>>
>>59885553
It's an integral part of FizzBuzz though.
>>
does anyone know of a program that can convert Java code to C# code?
>>
File: Coding-Joke.jpg (105KB, 584x551px) Image search: [Google]
Coding-Joke.jpg
105KB, 584x551px
just thought you all might appreciate this
>>
>>59885686
some countries don't call this car a "bug"
realize this is a world wide web page
>>
>>59885702
right, but this board is mainly in english, and most english folks DO know the "bug" as a reference to the volkswagon beetle
>>
how can i become a 7331 haxor?
what language should i learn?
what books should i read?

pic related: wake up, f*ckers!
>>
>>59885766
i'm not a hacker [ yet ;) ], but i'd assume focus on security and go with C or C++?
>>
>>59885524
https://clojure.org/about/state#actors
>>
new thread
>>59885669
>>59885669
>>59885669
>>
Real new thread
>>59885827
Thread posts: 313
Thread images: 63


[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.