|
Jabor posted:actually, proportional fonts are good no. monospaced fonts are much easier for reading code. Its the same reason we use tabs instead of spaces and all man style instead of some hosed up bullshit
|
# ? Jul 5, 2016 17:38 |
|
|
# ? May 25, 2024 13:22 |
|
Luigi Thirty posted:my normals! you were never normal
|
# ? Jul 5, 2016 17:42 |
|
Jabor posted:actually, proportional fonts are good look at how wrong this post is
|
# ? Jul 5, 2016 17:46 |
|
gods favorite language Chinese is monospaced it's the best
|
# ? Jul 5, 2016 17:48 |
|
Shaggar posted:no. monospaced fonts are much easier for reading code. Its the same reason we use tabs instead of spaces and all man style instead of some hosed up bullshit actually, rob pike says monospaced fonts are bad because
|
# ? Jul 5, 2016 18:24 |
|
idk who that is but hes probably an idiot.
|
# ? Jul 5, 2016 18:25 |
|
FamDav posted:gods favorite language Chinese is monospaced now I want to see a Chinese programming language
|
# ? Jul 5, 2016 18:27 |
|
i really don't care about fonts but if you don't use monospace does that mean your codea might not align even if they have the same number of characters because 'i' doesn't have the same width as 't'?
|
# ? Jul 5, 2016 18:27 |
|
yes. monospace means each character has the same width.
|
# ? Jul 5, 2016 18:28 |
|
Soricidus posted:now I want to see a Chinese programming language https://en.wikipedia.org/wiki/APL_(programming_language)
|
# ? Jul 5, 2016 18:29 |
|
Shaggar posted:no. monospaced fonts are much easier for reading code. Its the same reason we use tabs instead of spaces and all man style instead of some hosed up bullshit the entire reason proportional fonts are used in everyday writing is for readability. having different letter widths makes it easier and quicker to scan text and understand what has been written. yes, it's hard to break with in-grained traditions, especially ones that you've been using since the first time you started coding. i personally only started using a proportional font as a joke, a bit of a laugh. but then i just kept using it after realizing that there's actually no real benefits to using a monospace ide font. (i still use a monospace font in my terminal, because lots of programs do two-dimensional layout of stuff which all breaks with a proportional font. if i could solve that bit of historical inertia i'd start using a real font there as well.)
|
# ? Jul 5, 2016 18:33 |
|
MALE SHOEGAZE posted:actually, rob pike says monospaced fonts are bad because The entire plan9 expats using Acme are like that (of course it comes from rob pike): it does not use monospace by default, has no syntax highlighting, and its biggest feature is probably mouse chording more than anything. It also explains why Go has a bunch of standalone tools (like go fmt) instead of bigass IDEs so the features could be lifted by users of acme without doing anything special.
|
# ? Jul 5, 2016 18:42 |
|
turn off syntax highlighting. make font 14pt dark green comic sans. make background color light green. e: HoboMan fucked around with this message at 19:41 on Jul 5, 2016 |
# ? Jul 5, 2016 18:52 |
|
quote:To snarf (ie., copy)
|
# ? Jul 5, 2016 18:53 |
|
MononcQc posted:The entire plan9 expats using Acme are like that (of course it comes from rob pike): idk if this is terrible because of the unreadable non-monospace font, or the bad Linux font rendering.
|
# ? Jul 5, 2016 18:57 |
|
Jabor posted:the entire reason proportional fonts are used in everyday writing is for readability. having different letter widths makes it easier and quicker to scan text and understand what has been written. programming languages aren't read like normal human languages so monospacing helps make it easier to read. proportional fonts are useful because it makes individual words easier to read whereas monospaced fonts make blocks of code easier to read.
|
# ? Jul 5, 2016 18:59 |
|
yeah that sounds great until the first time you look at a commented struct and there's just barf everywhere or have to distinguish between 0 and O, or l and I. proportional fonts for programming, loving lol hipster childs just have to find as many ways as possible to be special
|
# ? Jul 5, 2016 19:35 |
|
rob pike is an absolute imbecile and anything he thinks is good is ipso facto bad
|
# ? Jul 5, 2016 19:47 |
|
ok, how the gently caress does TransactionScope work? i am obviously missing something.
|
# ? Jul 5, 2016 19:51 |
|
Shaggar posted:idk if this is terrible because of the unreadable non-monospace font, or the bad Linux font rendering. It's both
|
# ? Jul 5, 2016 19:52 |
|
haskell is really neat, you guys
|
# ? Jul 5, 2016 20:14 |
|
HoboMan posted:ok, how the gently caress does TransactionScope work? i am obviously missing something. hahaha, ofc the default settings for TransactionScope don't play nice with SQL Server it's two things both made by Microsoft after all
|
# ? Jul 5, 2016 20:15 |
|
quiggy posted:haskell is really neat, you guys just bear in mind that the quicksort example that always gets trotted out is not quicksort and as much as it's neat it's mostly just a demo
|
# ? Jul 5, 2016 20:25 |
|
gonadic io posted:just bear in mind that the quicksort example that always gets trotted out is not quicksort and as much as it's neat it's mostly just a demo you mean code:
because that's literally the definition of quicksort if im not mistaken
|
# ? Jul 5, 2016 20:32 |
|
are there any fancy data structures in haskell or do i need to roll my own if i am going to do a thing in it?
|
# ? Jul 5, 2016 20:35 |
|
HoboMan posted:are there any fancy data structures in haskell or do i need to roll my own if i am going to do a thing in it? state is haraam, comrade
|
# ? Jul 5, 2016 20:35 |
|
MononcQc posted:The entire plan9 expats using Acme are like that (of course it comes from rob pike): i'm the oops
|
# ? Jul 5, 2016 20:45 |
|
HoboMan posted:are there any fancy data structures in haskell or do i need to roll my own if i am going to do a thing in it? i think the average haskellers has four terabytes of fancy data structure hd porn on his hdd
|
# ? Jul 5, 2016 20:45 |
|
quiggy posted:state is haraam, comrade oh right, i keep forgetting how functional programming works
|
# ? Jul 5, 2016 21:24 |
|
state doesn't really have much to do with data structures. haskell has plenty of exotic ones. you will learn to love the zipper.
|
# ? Jul 5, 2016 21:28 |
|
the thing i want to do needs an efficient way to represent and traverse undirected graphs and n-ary trees. since it's a toy thing i figured i may as well do it in a language i don't know, just trying to figure out how much i would be committing myself to.
|
# ? Jul 5, 2016 21:38 |
|
HoboMan posted:the thing i want to do needs an efficient way to represent and traverse undirected graphs and n-ary trees. keep in mind im still very new to haskell, n-ary trees are probably not that bad but i have no idea how you'd do an undirected graph (or a directed graph for that matter)
|
# ? Jul 5, 2016 21:39 |
|
an undirected graph can simply be represented as a list of all the edges if i remember correctly so this is probably fairly manageable
|
# ? Jul 5, 2016 21:43 |
NihilCredo posted:i think the average haskellers has four terabytes of fancy data structure hd porn on his hdd
|
|
# ? Jul 5, 2016 21:45 |
quiggy posted:you mean The problem is that that quicksort doesn't sort in place, which messes up some of the asymptotics IIRC. There are various ways around it using mutable vectors and the like, and the code isn't that much uglier, but it does make for a less exciting demo. quiggy posted:keep in mind im still very new to haskell, n-ary trees are probably not that bad but i have no idea how you'd do an undirected graph (or a directed graph for that matter) Not sure how well this scales, but I've represented small graphs in Haskell as association lists before and it seemed to work well enough. I think it was basically a wrapper around a Map Node [Node].
|
|
# ? Jul 5, 2016 22:05 |
|
HoboMan posted:hahaha, ofc the default settings for TransactionScope don't play nice with SQL Server it's two things both made by Microsoft after all yeah it does.
|
# ? Jul 5, 2016 22:05 |
|
HoboMan posted:ok, how the gently caress does TransactionScope work? i am obviously missing something. you wrap ur transactional code in a using w/ the transaction scope. if a transaction doesn't exist it is created, if it does exist, it is joined (depending on options).
|
# ? Jul 5, 2016 22:13 |
|
sorry to break it to you shaggar, but microsoft makes bad decisions sometimes.
|
# ? Jul 5, 2016 22:18 |
|
VikingofRock posted:The problem is that that quicksort doesn't sort in place, which messes up some of the asymptotics IIRC. There are various ways around it using mutable vectors and the like, and the code isn't that much uglier, but it does make for a less exciting demo. according to ~wikipedia~ quicksort can be in-place but doesn't have to be. besides can haskell even perform algorithms in-place whatsoever? like i have no idea how i'd implement a strictly in-place algorithm like fisher-yates shuffle in haskell
|
# ? Jul 5, 2016 22:19 |
|
|
# ? May 25, 2024 13:22 |
|
quiggy posted:according to ~wikipedia~ quicksort can be in-place but doesn't have to be. besides can haskell even perform algorithms in-place whatsoever? like i have no idea how i'd implement a strictly in-place algorithm like fisher-yates shuffle in haskell use a mutable array. the idea that no mutation exists in haskell is completely wrong (and one that most beginners come to it with), it just is explicit and constrained.
|
# ? Jul 5, 2016 22:28 |