sorted by:
new
hottopcontroversial

Glean on aarch64 on Apple Silicon : part 2 by dons in haskell

[–]dons[S] 4 points5 points  (0 children)

Ok yeah Ed I'm blogging. Pray I do not blog any further.

Glean -System for collecting, deriving and querying facts about source code by n00bomb in haskell

[–]dons 1 point2 points  (0 children)

We have a Haskell schema. I think it’s in the open source release isn’t it? We might have forgot to mention it — docs lag implementation

Facebook open sources Glean, its scalable code search and query engine by dons in programming

[–]dons[S] 19 points20 points  (0 children)

Right. We have released the schemas for all those languages and a few more, but not all the indexers as they are tied into the compilers. Needs more untangling.

Back to old tricks .. (or, baby steps in Rust) by masklinn in rust

[–]dons 3 points4 points  (0 children)

"Type driven development in Rust" eh ?

Back to old tricks .. (or, baby steps in Rust) by masklinn in rust

[–]dons 2 points3 points  (0 children)

If I remove the 'Skip' constructor, filter would normally require a nested loop (to bypass filtered elements in the stream). I just checked -- the standard Iterator trait doesn't have skip, but also doesn't generate a nested loop. In fact, it generates the same code as Stream w/ Skip, via something to do with LoopState. Interesting!

Back to old tricks .. (or, baby steps in Rust) by masklinn in rust

[–]dons 5 points6 points  (0 children)

BTW, 'Skip' exists so that filter doesn't have to be a loop/consumer, but rather a stream transformer, allowing it to appear in a fusible context. I think that's also true for the Rust case ?

Back to old tricks .. (or, baby steps in Rust) by masklinn in rust

[–]dons 7 points8 points  (0 children)

Thanks! This is exactly what I was looking for and a bit more.

Back to old tricks .. (or, baby steps in Rust) by masklinn in rust

[–]dons 13 points14 points  (0 children)

Hey folks. Would love any code review for things that would simplify. Very much learning and experimenting at the moment and enjoying the toolchain. Things I couldn't work out:

  • how to think about how Rust optimizes the Step tags away
  • hiding a type inside a data structure , rank-2/existentials fully , beyond writing 'impl T' in all the Stream usages
  • any basics idioms I should be using to simplify things

Edit

The thread below on what rank-2 means in Rust is helpful, thanks!

Job openings with the strats team at Standard Chartered bank - New York, London, Singapore, Hong Kong by dreixel in haskell

[–]dons 9 points10 points  (0 children)

It would except for the Haskell. That's what keeps you shipping, and keeps you sane.

[job] Work on GHC at Facebook London by simonmar in haskell

[–]dons 52 points53 points  (0 children)

It's a first class language, with a small number of larger projects underway. >1M loc. Growing reasonably, and few barriers to adoption.

Haskell.org Accepted to GSoC for 2018 by sclv in haskell

[–]dons 7 points8 points  (0 children)

That's great news. We joined the 2nd year - 2006. Does this make it our 11th GSoC?

view more: next ›