Rust cannot get HKTs soon enough IMO. Mon(oi|a)ds for life!
|
|
# ? Oct 16, 2015 07:31 |
|
|
# ? Jun 5, 2024 12:44 |
BTW if someone figures out which language is strict Python, they should let me know.
|
|
# ? Oct 16, 2015 07:33 |
|
you dont need hkts for monoids though. i'm pretty sure you could define that trait right nowcode:
|
# ? Oct 16, 2015 07:42 |
|
fart simpson posted:i dont use c# but from reading yosposts i think map is called select in linq and reduce/fold is called aggregate select/aggregate makes a million times more sense then map/reduce. god drat math majors are retards
|
# ? Oct 16, 2015 14:37 |
|
i dont think i have ever used aggregate
|
# ? Oct 16, 2015 14:56 |
|
mostly I've just used it for combining strings and things
|
# ? Oct 16, 2015 14:57 |
|
Shaggar posted:select/aggregate makes a million times more sense then map/reduce. god drat math majors are retards
|
# ? Oct 16, 2015 15:29 |
|
gonadic io posted:select sounds like it should be a find operation
|
# ? Oct 16, 2015 15:32 |
|
apply/aggregate maybe?
|
# ? Oct 16, 2015 15:51 |
|
gonadic io posted:select sounds like it should be a find operation where is the find operation. select is just selecting from the set.
|
# ? Oct 16, 2015 15:57 |
|
select is just sql
|
# ? Oct 16, 2015 16:01 |
|
ya sql is really good
|
# ? Oct 16, 2015 16:12 |
|
gonadic io posted:select sounds like it should be a find operation
|
# ? Oct 16, 2015 16:18 |
|
Bloody posted:i dont think i have ever used aggregate if you've ever used sum on an array of numbers then you've basically used a version of it with the + operator hardcoded in as the aggregator function. if you really wanted to you could implement most of the other things with just that.
|
# ? Oct 16, 2015 16:20 |
|
Shaggar posted:where is the find operation. select is just selecting from the set. actually i think where is a filter operation? anyway it sounds like they'd go together, like select the items where x > 5 or something. and what do you mean by selecting from the set? select is applying a function to each item of the set, isnt it?
|
# ? Oct 16, 2015 16:23 |
|
yes its a function, but the function can be just selecting the value of the item or a property of the item
|
# ? Oct 16, 2015 16:36 |
|
the set in this case is whatever IEnumerable you're working on or the result of a previous linq operation
|
# ? Oct 16, 2015 16:40 |
|
Bloody posted:how are map and reduce spelled in linq Map = Reduce = Aggregate Filter = Where these only exist from LINQ 3.5 and above. the obvious caveat here is that this will run in memory and wont be distributed. even without the scaling that google can provide, it’s still useful to think of problems in a map/reduce mindset.
|
# ? Oct 16, 2015 17:11 |
|
that ray tracer written in linq was pretty cool ed: http://blogs.msdn.com/b/lukeh/archive/2007/10/01/taking-linq-to-objects-to-extremes-a-fully-linqified-raytracer.aspx
|
# ? Oct 16, 2015 17:43 |
|
gonadic io posted:select sounds like it should be a find operation in mumps select is a ghetto switch statement: s result = $s(post'="":"shitpost", post="":"doubleshitpost",1:"tripleshitpost"). since there's no such thing as a proper switch statement, usually you see the result strings as code to execute and the next line is an x or d @ statement on the result variable.
|
# ? Oct 16, 2015 18:05 |
|
there's a cobol cgi-bin compiler out there don't forget
|
# ? Oct 16, 2015 18:15 |
|
eschaton posted:that ray tracer written in linq was pretty cool holy moly.
|
# ? Oct 16, 2015 18:17 |
|
eschaton posted:that ray tracer written in linq was pretty cool i understand approximately 0% of this.
|
# ? Oct 16, 2015 18:27 |
|
jony neuemonic posted:holy moly.
|
# ? Oct 16, 2015 18:37 |
|
LeftistMuslimObama posted:i understand approximately 0% of this. C# let expressions aren't recursive, and in linq everything is declared with let so they use a lambda-theory trick to implement recursion themselves. That's all you need to know (the rest is just standard linear algebra of lines and points and planes etc)
|
# ? Oct 16, 2015 18:41 |
|
fart simpson posted:if you've ever used sum on an array of numbers then you've basically used a version of it with the + operator hardcoded in as the aggregator function. if you really wanted to you could implement most of the other things with just that. yeah i know what it's for it just somehow hasn't seemed to come up in anything i do which is itself kind of odd
|
# ? Oct 16, 2015 18:46 |
|
Also all/any on lists of bools is another common use in the standard library
|
# ? Oct 16, 2015 18:51 |
|
we started using confluence, its pretty cool! except its apparently a lot of work for the confluence janitor to setup new spaces, so our whole division is using one space, and we have to suffix a project serial number to every page we create so page titles don't conflict. and we don't have permission to delete pages, so we have a "Garbage Page" that you move pages to, and once a week the confluence janitor comes by and empties the garbage can.
|
# ? Oct 16, 2015 18:53 |
|
Barnyard Protein posted:we started using confluence, its pretty cool! except its apparently a lot of work for the confluence janitor to setup new spaces, so our whole division is using one space, and we have to suffix a project serial number to every page we create so page titles don't conflict. and we don't have permission to delete pages, so we have a "Garbage Page" that you move pages to, and once a week the confluence janitor comes by and empties the garbage can. lmao
|
# ? Oct 16, 2015 18:54 |
|
i have a git question i have two git repositories, firmware and software. the software runs on a pc and interacts with the firmware which runs on an embedded platform. i want to merge these into one common repository and i would like to do so in a manner that preserves their histories and branches is this a doable thing
|
# ? Oct 16, 2015 18:58 |
|
gonadic io posted:C# let expressions aren't recursive, and in linq everything is declared with let so they use a lambda-theory trick to implement recursion themselves. I don't know anything about graphics (or linear algebra), so it's total magick to me. The most advanced math class I've taken was Calc I like 9 years ago in college. We're allowed to spend some of our time each week on learning though. Any good tutorials or books I could read to catch myself up on this stuff? Or should I not feel bad that I don't know anything about this topic?
|
# ? Oct 16, 2015 18:59 |
|
Bloody posted:i have a git question check everything out. delete the git stuff. combine them into a single folder. commit them to a subversion repo
|
# ? Oct 16, 2015 18:59 |
|
Bloody posted:i have a git question Alternatively, you could make one a submodule of the other, but this is pretty pointless if you don't have multiple other repositories using it and want to keep developing it independently as well.
|
# ? Oct 16, 2015 19:03 |
|
LeftistMuslimObama posted:I don't know anything about graphics (or linear algebra), so it's total magick to me. The most advanced math class I've taken was Calc I like 9 years ago in college. Well you shouldn't feel bad, as it's pretty niche and if you're not working with some kind of 3D space (whether in a game or in real life) I can't imagine it coming up really. I'm on my phone so can't fetch it, but coffeetable has a standard list of linear algebra book recommendations that he's posted a few times if you are interested.
|
# ? Oct 16, 2015 19:04 |
|
Shaggar posted:check everything out. delete the git stuff. combine them into a single folder. commit them to a subversion repo Lol never change
|
# ? Oct 16, 2015 19:06 |
|
engineering mathematics by stroud
|
# ? Oct 16, 2015 19:07 |
|
Im on train back to Glasgow. I regret not getting lunch with the London crew but i loving hated it there
|
# ? Oct 16, 2015 19:12 |
|
Bloody posted:engineering mathematics by stroud dang it's like fifty earth dollars
|
# ? Oct 16, 2015 19:13 |
|
what do you call a parrot that says "squawk! pieces of nine! pieces of nine!"? aparrot-ey error. as for a translated, tl;dr: of that linq article: linq is very dependent on lambdas. say you have a category with unlimited children with each child also having unlimited children. if you wanted to retrieve all of the children of the root node, there is no easy way to do that efficiently or intuitively. linq does not support the recursion needed to select all family nodes from a root node. however, if you use the "let" and "y combinator" fixed-point combinators, you can do it in a non-efficient manner. the article is using a cheating way to implement a recursive lambda.
|
# ? Oct 16, 2015 19:14 |
|
|
# ? Jun 5, 2024 12:44 |
|
gonadic io posted:C# let expressions aren't recursive, and in linq everything is declared with let so they use a lambda-theory trick to implement recursion themselves. didn't read the code but... this doesn't sound nice at all
|
# ? Oct 16, 2015 19:19 |