fdir
delaunator
Our great sponsors
| fdir | delaunator | |
|---|---|---|
| 3 | 4 | |
| 1,254 | 2,195 | |
| - | 1.8% | |
| 7.3 | 4.9 | |
| 5 months ago | 3 months ago | |
| TypeScript | JavaScript | |
| MIT License | ISC License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
fdir
-
Bfs 3.0: The Fastest Find Yet
Would love to see how bfs compares to fdir[0] for directory traversal. Even though fdir is using Node.js underneath, the comparisons I have done with fd & find are pretty close. Of course, bfs would probably be quite a bit faster...but how much faster exactly?
Disclaimer: I am the developer of fdir.
[0] https://github.com/thecodrr/fdir
-
Organize porn collection
To update the code to behave differently might be a small change: https://github.com/thecodrr/fdir/blob/master/documentation.md#withsymlinks
- Fdir 5.1.0
delaunator
-
Using Voronoi polygons for simplified continent generation
Well, the easiest option would probably be to use a different Delaunay/Voronoi library. Delaunator (C# bindings here) should be a pretty good option: it's fast, and there's a good explanation of how to use the data structures it generates. There is some weirdness with how points at the edge of the domain work that you may have to work around, but that will probably be easier than trying to modify another algorithm or write your own. I know I've struggled to implement the algorithms for calculating Voronoi diagrams/Delaunay triangulations, even though I feel like I have a decent high-level understanding of how Fortune's algorithm is supposed to work.
- Question about ints used for enums (cast as enum) (4.0.2)
-
Visualizing Delaunay Triangulation
Great article!
How does this algorithm compare to others, e.g. sweep algorithms like the one used by delaunator[0]?
An obvious difference is sweep algorithms sort the points in some way before adding them, is that a key to efficiency gains?
0: https://github.com/mapbox/delaunator/blob/main/README.md#pap...
- Diamonds
What are some alternatives?
mediaChips - Manage your videos, add any metadata to them and play them.
earcut - The fastest and smallest JavaScript polygon triangulation library for your WebGL apps
SAGEMCOM-FAST-5370e-TELIA - This is my personal wiki for hacking the router firmware used by (Sagemcom)F@ast Version 3.43.2 delivered from Sagemcom
blog - Life is a moment :notebook_with_decorative_cover:
folderslint - 📁 Directory structure linter for Front-End projects
turf - A modular geospatial engine written in JavaScript and TypeScript
validate-access - Parse a & Validate a given directory with multiple entries
javascript-algorithms - 📝 Algorithms and data structures implemented in JavaScript with explanations and links to further readings
glob - Pure Nim library for matching file paths against Unix style glob patterns.
spine-runtimes - 2D skeletal animation runtimes for Spine.
bfs - A breadth-first version of the UNIX find command
delaunator-sharp - Fast Delaunay triangulation of 2D points implemented in C#.