If you can build something portable, charge money for it IMO. I currently pay $50/year for this:
Show HN: Sunflower Editor – like adding console.log to every line of your code
21–27 of 27 posts
Re: Show HN: Sunflower Editor – like adding console.log to every line of your code
#22This reminds me of a very similar product, QuokkaJs [0] which works across many popular editors, VSCode, Atom, Sublime, Jetbrains suite. [0] https://quokkajs.com/
https://runjs.app/ is also another player in this area, though is its own editor.
Re: Show HN: Sunflower Editor – like adding console.log to every line of your code
#23This is really similar to Quokka, which is a fantastic tool and worth every penny. If you can build something portable, charge money for it IMO. I currently pay $50/year for this: https://quokkajs.com/
The other route I am considering is integrating backend, hosting, and a market — so the site becomes a vertically integrated code creation place.
Re: Show HN: Sunflower Editor – like adding console.log to every line of your code
#24Yeah, debugging experience is hard for me. I wish your solution works for JetBrains IDEs. I do javascript playground ( https://PlayCode.io ) too, and this feature will be shining
Re: Show HN: Sunflower Editor – like adding console.log to every line of your code
#25Creator here, thanks for checking out the editor! Here are some more examples: React: https://editor.sunflower.industries/?loadExample=reactExampl... . A 1500-line React app (in one file) will work just fine. Hot Swapping: https://editor.sunflower.industries/?loadExample=replExample Our goal is to make it easier to see what's happening in programs, and in doing so make coding faster. Eventually we want to build in th…
Re: Show HN: Sunflower Editor – like adding console.log to every line of your code
#26Earlier quoted context omitted.
Very cool. One note: the browser (at least Firefox and Chrome) becomes unresponsive for a while if the code takes too long to run. For example: for (i = 0; i
Another fun example: function fib(n) { if(n == 0 || n == 1) return 1; else return fib(n-1) + fib(n-2); } fib(100);