mudderjs
Lexicographically-subdivide the “space” between strings, by defining an alternate non-base-ten number system using a pre-defined dictionary of symbol↔︎number mappings. Handy for ordering NoSQL keys. (by fasiha)
Awesome Nested Set
An awesome replacement for acts_as_nested_set and better_nested_set. (by collectiveidea)
Our great sponsors
mudderjs | Awesome Nested Set | |
---|---|---|
1 | 2 | |
111 | 2,375 | |
- | 0.1% | |
0.0 | 5.5 | |
over 1 year ago | about 1 month ago | |
JavaScript | Ruby | |
The Unlicense | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
mudderjs
Posts with mentions or reviews of mudderjs.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-01-15.
-
The surprisingly difficult problem of user-defined order in SQL
I have solved this problem for my own purposes — no claims of grand scalability or high efficiency — by storing indices or "ranks" of items as strings (Postgres TEXT) using a library called mudderjs[0] and a thin wrapper around it[1]. Sorted lexicographically (in dictionary order) arbitrary-length strings have arbitrary precision. You can always find a string between any two strings; for instance, between "a" and "b" is "am" and between "a" and "ab" is "aam". You do have to have the entire ordered collection in scope to generate a new rank for an item, but reordering an item only requires updating one row and isn't subject to floating point precision.
[0] https://github.com/fasiha/mudderjs
[1] https://github.com/pubpub/pubpub/blob/master/utils/rank.ts
Awesome Nested Set
Posts with mentions or reviews of Awesome Nested Set.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-04-01.
-
Active record: how to recursively load children of children of children in one query?
Another option is to use something like AwesomeNestedSet which does basically the same thing as the previous suggestion but with a whole lot more flexibility (and likely more reliably performant).
-
The surprisingly difficult problem of user-defined order in SQL
Ex https://github.com/collectiveidea/awesome_nested_set