warp VS dep-tree

I tried warp [0] and I am unimpressed so far. Pretty complex, limited documentation, buggy. The builder paradigm they used feels pretty constrained and, in my opinion, achieve the opposite of the simplicity it is supposed to bring. I was surprised it is so popular.

Maybe I need more time or a favorable comparison to another framework to appreciate it.

[0] https://github.com/seanmonstar/warp

Have you gone through the (examples)[https://github.com/seanmonstar/warp/blob/master/examples/]? There's actually a lot of explicit instructions here on how to use Warp, and all of them are very straightforward to read (e.g., (this example with route parameters and a POST'ed body)[https://github.com/seanmonstar/warp/blob/master/examples/body.rs])

There are numerous guides how to do custom error messages using the routes .recover() method (including the official one ), but it seems quite inflexible since I can't (seem to?) pass the actual error messages back to user.

What I see on the examples for the warp crate is that the examples do this:

You might want to consider using Alacritty instead of Warp. Warp is VC-funded, macOS only, closed source, and it phones home. They also kinda stole the name of a web framework.

warp server,

Hello, I'd need some help with warp routes since I'm not familiar with the framework. If somebody knows how to do this I'd appreciate very much.

If one were to undertake a project of developing something like this, which is the best web framework for it. I did some cursory research and discovered these back-end frameworks - actix, axum, poem, salvo, warp, gotham and rocket.

We've added support for the warp, salvo & thruster frameworks

Hi HN!

I want to share a project for which Golang support was just added:

https://github.com/gabotechs/dep-tree

This is a tool that allows users to visualize the complexity of a code base using a 3D force-directed graph:

It will take a Golang codebase entrypoint, typically `main.go`, it will parse the file and gather other files in which this file depends on (by resolving function names, types, etc...)

It will recursively perform this operation with all the dependant files, until the full graph with all the source files is formed.

It will render the graph using a force-directed layout, and all the source files will be placed in a three-dimensional space simulating some attraction/repulsion forces based on the dependencies between them.

Clean and loosely coupled codebases will tend to form clusters of nodes in the 3d space separated from each other, while tightly coupled and messy codebases will be rendered with all the nodes grouped together without clear sense of separation.

Here are some examples of rendering this graph for some well known projects:

- Docker compose: https://dep-tree-explorer.vercel.app/api?repo=https%3A%2F%2F...

The portion of the code in charge of rendering lives inside the `internal/entropy` (https://github.com/gabotechs/dep-tree/tree/main/internal/ent...).

Force-directed is an algorithm for displaying graphs in a 2d or 3d space, which simulates attraction/repulsion based on the dependencies between the nodes, the wikipedia page explains it really well https://en.wikipedia.org/wiki/Force-directed_graph_drawing

> Love it, I think dependency trees are super underused data for static analysis.

Definitely, specially for evaluating "the big picture" of a codebase

If you like Dep Tree, feel free to stop by the GitHub repository and give it a star. Check out the README and you will find out that Dep Tree is far more than just a cool visualization tool; it can actually help you enforce your code base decoupling!

I am working on dep-tree, a CLI tool for rendering and linting source code file dependency trees, https://github.com/gabotechs/dep-tree, and I recently added support for the Rust language (previously, only TypeScript and JavaScript where supported).