-
Notifications
You must be signed in to change notification settings - Fork 5
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Transformation sequence #356
Comments
Hi @noahboerger, I reproduced without error. Are you sure you had |
Hi @NicoLaval, No i only had The example by the reference manual (l. 303 f) for the behaviour is
with the additional information "DS_1 and DS_2 are input Data Sets, DS_np is a non persistent result, DS_p is a persistent result" (l. 280) So out of my point of view the example i have tested with is similar to the one provided in the reference manual. The execution order of the statements should then be adjusted by the engine itself as pointed out in the reference manual (l. 298 ff.): "... not necessarily the Transformations are performed in the same order as they are written, because the order of execution depends on their input-output relationships ..." |
Although this could be implemented, I would question the utility of such a "variable commutativity". |
Our current idea is to store multiple VTL rules that will be executed in a single engine run, separated from each other. Additionally, I would not describe the calculation approach defined by the VTL standard as "variable commutativity." Since a result variable should always be final and cannot be overwritten, it should always be clear to the VTL user where a previous result is coming from. "... the VTL follows a functional programming paradigm, which treats computations as the evaluation of mathematical functions, so avoiding changing-state and mutable data in the specification of the calculation algorithm." (User Manual 2.0, l. 1643 ff.) |
Currently, Trevas only supports writing transformations in the sequence in which these are executed. According to the reference manual 2.0 (line 294 ff.) "Not necessarily Transformations need to be written in sequence like a classical software program, in fact they are associated to the Artefacts they calculate, like it happens in the spreadsheets (each spreadsheet’s formula is associated to the cell it calculates)"
Here is an example that is currently working fine in Trevas:
But it should als be running without errors when switching the statements:
Currently it fails with the following exception:
Occured error
Exception
The text was updated successfully, but these errors were encountered: