jstrecker's picture

Jaymie (@jstrecker)


  • Vuo Founder
  • Team Vuo
jstrecker's picture
jstrecker's picture

Here's a composition that splits text into words and joins it back together into lines of less than or equal to 60 characters. The idea is to loop through the words and keep appending them into an accumulated text, until you find that appending one more would pass the character limit, or you reach the end of the list.

jstrecker's picture
@jstrecker commented on @bLackburst's Question, “Push rendering optimisation

@Bodysoulspirit, I changed your comment to an answer.

jstrecker's picture
@jstrecker commented on @Kewl's Discussion, “CPU efficiency in Calculate node

Probably the first option since it has fewer operations. But since your CPU can do billions of floating-point operations per second, you'd have to be dividing a lot of numbers for it to make a perceptible difference. Also, it takes way more CPU operations than just that little math expression to execute the node, copy the outputs to the connected inputs, etc. It's nice that CPUs are really really fast :)

jstrecker's picture
@jstrecker commented on @Bodysoulspirit's Bug Report, “Too long Tree Port Popover

Confirmed: the port popover can be really wide if the text contains tabs. Thanks for discovering this bug, @Bodysoulspirit!

jstrecker's picture

@Chris, one of your XPath expressions contains smartquotes, which our parser (currently) doesn't recognize as quotes.

In (Loyalist )BackgroundGraphic.vuo, replace