lourenco/mgmt
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

docs: Misc fixes

Browse Source
This commit is contained in:
James Shubin
2023-09-25 18:28:02 -04:00
parent 9a890c7625
commit 53f9f35233
2 changed files with 5 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
docs/faq.md
View File

@@ -242,7 +242,7 @@ Similar logic applies for situations when you only specify the `mode` parameter.
This all turns out to be more safe and "correct", in that it would error and This all turns out to be more safe and "correct", in that it would error and
prevent masking an error for a situation when you expected a file to already be prevent masking an error for a situation when you expected a file to already be
at that location. It also turns out to simplify the internals significantly, and at that location. It also turns out to simplify the internals significantly, and
remove an ambiguous scenario with the reversable file resource. remove an ambiguous scenario with the reversible file resource.
### Why do function names inside of templates include underscores? ### Why do function names inside of templates include underscores?

9
docs/language-guide.md
View File

@@ -563,11 +563,11 @@ would like to propose a more logical or performant variant.
#### Function graph generation #### Function graph generation
At this point we have a fully type AST. The AST must now be transformed into a At this point we have a fully typed AST. The AST must now be transformed into a
directed, acyclic graph (DAG) data structure that represents the flow of data as directed, acyclic graph (DAG) data structure that represents the flow of data as
necessary for everything to be reactive. Note that this graph is *different* necessary for everything to be reactive. Note that this graph is *different*
from the resource graph which is produced and sent to the engine. It is just a from the resource graph which is produced and sent to the engine. It is just a
coincidence that both happen to be DAG's. (You don't freak out when you see a coincidence that both happen to be DAG's. (You aren't surprised when you see a
list data structure show up in more than one place, do you?) list data structure show up in more than one place, do you?)
To produce this graph, each node has a `Graph` method which it can call. This To produce this graph, each node has a `Graph` method which it can call. This
@@ -575,9 +575,8 @@ starts at the top most node, and is called down through the AST. The edges in
the graphs must represent the individual expression values which are passed the graphs must represent the individual expression values which are passed
from node to node. The names of the edges must match the function type argument from node to node. The names of the edges must match the function type argument
names which are used in the definition of the corresponding function. These names which are used in the definition of the corresponding function. These
corresponding functions must exist for each expression node and are produced by corresponding functions must exist for each expression node and are produced as
calling that expression's `Func` method. These are usually called by the the vertices of this returned graph. This is built for the function engine.
function engine during function creation and validation.
#### Function engine creation and validation #### Function engine creation and validation