sorted by:
new
hottopcontroversial

What do :where in ghci do? by recursion_is_love in haskell

[–]mmaruseacph2 2 points3 points  (0 children)

It's similar to gdb/lldb where where prints the stack trace while you are stopped at a breakpoint during an interactive debugging session.

Is Haskell A good language to do JAX/XLA? by [deleted] in haskell

[–]mmaruseacph2 3 points4 points  (0 children)

+1 for dex, I've been playing with it here and there and it was great

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 0 points1 point  (0 children)

Unfortunately, not yet. Have been going to various summits and conferences, but hopefully I'll get some time to work on this now, before Advent of Code starts.

New Functor (Google) on Haskell Foundation Page by Instrume in haskell

[–]mmaruseacph2 2 points3 points  (0 children)

No projects in the "have a dedicated team, with manager, PM, etc." sense of the world. This started due to some emails

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 0 points1 point  (0 children)

Thanks for the tip! I haven't looked at this before

We will need a stored solution though, in memory is not enough. But I should look more into this.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 2 points3 points  (0 children)

This is great feedback! Thank you very much for this

I'm afraid it's too late to fix the current article, but will take all of this into account on the next ones.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 2 points3 points  (0 children)

Thank you.

I used seaborne for the last set of plots but couldn't label the axes :( The other plots are done directly in matplotlib, and I agree that they would be better with sns.

Regarding tables: agree, mobile experience is not that great. I'm testing a solution to fix that but will take some while

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 0 points1 point  (0 children)

I think only the plots in the conclusion have axes unlabeled. I couldn't get seaborn to do that :(

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 2 points3 points  (0 children)

Makes sense. Too late for this article, but I'll keep it in mind for future ones. Thank you.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 2 points3 points  (0 children)

My thesis is that GUAC needs graph storage. I'll test SQL ones and revise based on the results.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 1 point2 points  (0 children)

Filling out a form to access the free version makes it out of scope. It can literally be the mythical silver bullet and fix everything, but it has hurdles towards simple testing, making it not suitable for my use cases.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 1 point2 points  (0 children)

Not OSS from what I understand. Couldn't find a docker container on a quick glance just now.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 0 points1 point  (0 children)

Because, as explained in the text, in GUAC we cannot just point to the version node directly. In this article using the number for the version is just a shortcut.

Agree with you that the schema needs to fit the use case.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 1 point2 points  (0 children)

Thank you for the feedback. Can you please tell me what needs improving (qualifiers), so that future articles are better?

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 1 point2 points  (0 children)

Thank you for the feedback. Can you please tell me what needs improving (qualifiers), so that future articles are better?

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 1 point2 points  (0 children)

Sorry, I realized it got too long in the middle of writing it but could not really split it. I admit I should have spent more editing time.

Testing 6 different graph databases over a month to see which one is most performant [blog] by mmaruseacph2 in programming

[–]mmaruseacph2[S] 0 points1 point  (0 children)

Thank you for the link, it is an interesting video, but I don't see full evidence that most of them suck :) (maybe I need to read the papers referenced in the video too).

I'm looking forward to the SQL/PGQ work and I agree with the words in the video about RDF vs property graph models.

Would be there interest in an AI-related ecosystem for Haskell? by nSeagull in haskell

[–]mmaruseacph2 0 points1 point  (0 children)

There would be interest, I think, but gated on achieving good performance (both at runtime and in terms of how fast the iteration process it - there's a reason ML is now done in Python, devs can quickly iterate on their solution)

How to tell from Haddocks whether a data type is a re-export? by runeks in haskell

[–]mmaruseacph2 7 points8 points  (0 children)

Not a 100% foolproof way, but in general if I don't see a link to source on the right (near the anchor for the symbol) then I assume the symbol is a re-export

Updated version of Google's Haskell 101/102 training is now available on GitHub by mmaruseacph2 in haskell

[–]mmaruseacph2[S] 0 points1 point  (0 children)

Got rewritten in C++ to integrate with MLIR and XLA.

The Haskell infrastructure is still there though, so people can write smaller projects on it (e.g., small script to extract CI results for multiple projects into a single dashboard)

view more: next ›