• Nicolas Danet

    More work than i thought at first... :satisfied:

    Capture d’écran 2021-08-30 à 08.20.51.png

    Capture d’écran 2021-08-30 à 08.21.54.png

    posted in news read more
  • Nicolas Danet

    That's a pitty that no mechanism (native) is available to ensure order in those cases.
    I have no idea how it could be done ; but that's a valid request.
    There is a lot of workarounds in that forum to make things (laboriously) that should be done at the core level (simply).
    And more workarounds (= less encapsulation) means a core harder to change compatibilly.
    For now IMHO you should continue with spider's web, and ask the devs :scream: to implement an ordering feature...
    ...with almost no chance to be done before many years! :yum:

    posted in technical issues read more
  • Nicolas Danet

    Yep it is arbitrary, just an implementation detail ; It is collected in a linked-list queue, and it is more efficient to prepend that to append to. I had a look into Pure Data sources, and it appears that it hasn't changed since.

    Anyway it is interesting to understand what's hap, but nothing should rely onto it. It could change (but i doubt it will).

    posted in technical issues read more
  • Nicolas Danet

    IIRC (sorry if i'm wrong).

    Building the DSP chain means doing a topological sort to linearize the graph of the DSP objects.

    For that all the DSP objects of the topmost patch are collected in reverse order of their creations. Then the first node in the collection that has no DSP entry is fetched. The graph is explored depth-first (outlet by outlet) appending the DSP method/operation of the connected objects to the DSP chain. For that all the inlets of the tested node must have been visited. Otherwise the algorithm stop and fetches the next outlet, or the next object in the collection, and restart the exploration from it. That process is recursively done in subpatches discovered.

    Notice that it is not easy to explain (and i don't have it fresh in mind). The stuff in Spaghettis is there. AFAIK it is more or less the same that in Pure Data (linked in previous post).
    I can bring details back in my head, if somebody really cares.

    .
    .
    .

    You can also watch the beginning of that video of Dave Rowland about Tracktion topological process.
    EDIT: The first ten minutes (the rest is not relevant).
    WARNING: the way things are done in that talk is NOT how it is done in Pd.
    It is just an illustration of the problem needed to be solved!

    Introducing Tracktion Graph: A Topological Processing Library for Audio - Dave Rowland - ADC20

    .
    .
    .

    @whale-av said:

    @jameslo I agree. I did report a bug once, but have never dared ask a question on the list.
    The list is the domain of those creating Pd. I often read what they have to say, but I would not dare to show my face.
    David.

    It is really sad to see experienced users intimidated by developers.
    But at the same time i totally understand why (and i still have the same felling). :smile:

    posted in technical issues read more
  • Nicolas Danet

    I wonder if anyone recognizes elements of this project?

    The big white ball is the moon, and i've already seen it very long time ago (before electric light pollution disaster era).

    posted in pixel# read more
  • Nicolas Danet

    so externals that work with tcl/tk won't work, right?

    Yep. And ALL the externals also! :astonished: I rewrote EVERYTHING. :yum: The API is different. The DSP has it own thread. Thus externals must be thread-safe. Moreover Spaghettis aims to allow live-coding. That implies to run DSP at the same time another DSP graph is built! But IMHO the API is not mature. Before to think about externals creation, it would be required to define it more precisely with interested devs. Once done it will not change. Thus it has to be think twice! Also i would like to add much more objects native. But all of that will be able only with stable release (it is still an alpha version < https://en.wiktionary.org/wiki/alpha_version >). There's a lot of work remaining before.

    .
    .
    .

    One more step!

    Screenshot from 2021-06-14 10-11-10.png

    Console.png

    https://forum.juce.com/t/has-anyone-tried-porting-pd-to-juce-other-than-cycling-74/39077/5?u=nicolasdanet

    posted in news read more
  • Nicolas Danet

    That threads could contain few responses:

    https://forum.pdpatchrepo.info/topic/11738/spaghettis-yet-another-fork-of-pure-data
    https://forum.pdpatchrepo.info/topic/12588/the-future-of-spaghettis

    I don't like big blocks of text (it's hard to translate, hard to read for lazy frenches).
    I prefer examples.
    Anyway i'll have to redo all of them again once the JUCEd GUI done.
    Less things is less work! :smile:
    Notice that i'll remove a lot of features in next version < https://github.com/Spaghettis/Spaghettis/issues/25 >.
    I don"t have time for everything.
    Make the DSP foolproof will be the main task.
    I will be more than happy in the future to let users improve the help/turorials.
    IMHO it is a thing in FLOSS that newcomers can do first....
    ...before to jump into the source code and help me to tweak the stuff.
    That's why there's no already built downlable thing (for now).
    I want the users to be motivated to see under the hood.

    And to not hijack that thread, probably a good idea is to continue on those above.

    posted in tutorials read more
  • Nicolas Danet

    @porres

    so how can I see what you did?

    Build Spaghettis! :smile:

    Notice that since i'm currently working on a new version with JUCE the current version can be considered absolutely WIP.

    posted in tutorials read more
  • Nicolas Danet

    The PDDP repository is... pure. A very very pure solution. No content, thus no issues. Awesome! :heart_eyes:
    Is somebody know what is it supposed to be? That: https://puredata.info/downloads/pddp?

    posted in tutorials read more

Internal error.

Oops! Looks like something went wrong!