.
Feature status
- Submitted to vuo.org
- Reviewed by Team Vuo
- Open for community voting
- Chosen to be implemented
- Released
When we (Team Vuo) plan each release, we try to implement as many of the community's top-voted feature requests as we have time for.
If anyone would like to help this happen sooner, we're also accepting open source contributions and commissioned work.
Read more about how Vuo feature requests work.
Votes
8 votes so far!
Who voted?
Comments
On sorting...
On sorting...
It would be fantastic to be able to optionally define a sorting algorithm, à la JS Array sort.
Perhaps with two separate sort nodes, one to deal with basic sorting of Integers, Real Numbers, Text, etc., and one to deal with custom sorts.
Mockup:
Sort Mockup.png
Custom sorting would ideally
Custom sorting would ideally be implemented on top of Ability to pass entire subcompositions into other nodes via cables (function ports / lambdas / closures), but, until then, your mockup might be the best way to support it.
The mockup follows the pattern of
Process ListandBuild List. I wonder if that would be a problem — I mean, since a lot of people get confused aboutProcess ListandBuild List. Maybe not as much of a problem, just because it's a more specific node and wouldn't be as commonly used. In any case, I'm wondering if there are any other possibilities for implementation.Would the comparison result as signed integer be confusing to people without a programming background? I do think it's a better option than having the result as a boolean (as in C++), which has the pitfall of requiring a strict weak ordering.