Typical Computer science vs typical computer engineering
this post was submitted on 11 Jun 2024
10 points (100.0% liked)
Programmer Humor
19154 readers
2012 users here now
Welcome to Programmer Humor!
This is a place where you can post jokes, memes, humor, etc. related to programming!
For sharing awful code theres also Programming Horror.
Rules
- Keep content in english
- No advertisements
- Posts must be related to programming or programmer topics
founded 1 year ago
MODERATORS
Inside me are two wolves I guess…
I have to say, I'm getting more and more frustrated by the bad code I have to write due to bad business circumstances.
I want clean, readable code with proper documentation and at least a bit of internal consistency and not the shoehorned mess of hacks, todos and weird corner cases.
todos
I found a simple trick against this: just remove them. Accept it ain’t gonna happen man.
A MONAD IS A MONOID IN THE CATEGORY OF ENDOFUNCTORS
Instead of
if let Some(a_) = a{
()
} else if let Some(b_)=b{
()
} else {
dostuff
}
you could just use
if a.isNone()&&b.isNone(){
dostuff
}
Also if you don't use the value in a match just use _
Also you can use enums insteas of string literals
I'm not sure how I would go about this in an elegant way since I'm matching the string I get from a message…
If the message used enums for actions/procedures like SPAM_MEMES, then using enums would be more performant
That's a good point, thanks. Maybe I'll go without the if entirely, the (janky) code is still very much in flux ;)
Rust mentioned!
I don't nearly know enough to understand this but is anyone willing to help me get the thing on the top :>
To first give you some context, the thing on the top is from The "Representable Functors" chapter of Category Theory for Programmers. So technically, you only need to read 230 Pages of a maths textbook to get it ;)
But this isn't exactly what you asked for, so I'll try to help you get it as best I can with my limited understanding of the subject. First of all it would be helpful to know what your prior knowledge in Maths, especially Set theory, is?
Doesn't that construction only work in categories that also contain their own morphisms as objects since a profunctor maps (Cᵒᵖ × C) → Set and not the same like (Cᵒᵖ × C) → C? Since the category of Haskell types special, containing its own morphisms, so the profunctor could be like (haskᵒᵖ × hask) -> hask? or I just don't understand it.