The match function in join

Specific to the attachment and unique match functions powerful. The match function modified on the fly if your attachment support wildcard modifiers. My text processor can match just most of the characters, solves he spell function..

The text model associater a file name with each instance. So start multiple searches, just specify the file name an load a tne triple, the same text attachment appends to another file. Set a wildcard, nd wun with the Null graph, we get pass through, like reading the file.

One attachment is a console. Fetch is scanf, Append is printf. When it scans for user input, the triple is put on pause, other instances can run. The console is a left side and result side, both at the same time.

We can just drag a random file of a word list on out widget screens, and underneath will compute the intersection of the huge files.  All extremely fast, all simple interfaces, all successively refining the text.

Across the internet

Simple get and put onto the internet should. be easy. The instance fetching or getting over the net issues the pause while waiting, and its sub graph can work on past data collected.

Chaining attachments is unobservable, just gethe triple onto the cursor list. The internet attachment is like the console, two methods, responds with pause and Null.  Generally works with the match all modifier because it is pass through. The internet attachment is always attached, just request a cursor pointer from it.