Gem-graph 0.1.0
A modelling tool based on rewriting of geometric graphs.
|
Non algebraic identity of a rule. More...
#include "../../../../../include/fsm.h"
#include "../../../../../include/widget.h"
#include "../../../../../include/signal.h"
#include <stdio.h>
#include <stdlib.h>
Functions | |
void * | widget_get_selected_rule_identity_btt () |
Hosts a list of character strings that can be combined to provide a "human readable" rule identifier. | |
Non algebraic identity of a rule.
This file is part of Gem-graph. It hosts the functions needed to identify a rule by name.
void * widget_get_selected_rule_identity_btt | ( | ) |
Hosts a list of character strings that can be combined to provide a "human readable" rule identifier.
This list can also contain non-mandatory elements.
Each rule can have a specific "human readable" name chosen by its designer. This name can be used to identify the rule. It is desirable for a unique name to be accepted and shared by as many users as possible.
On the contrary, for the automaton, the identity of each rule is given exclusively by its set of conditions.
Today, this function provides only an arbitrary presentation with no link to the XML model and no verification of compliance with the meta-rules. (see below) TODO
|- - - - - - - - - - - - - - meta-rules - - - - - - - - - - - - - - - >
No item of the list should be repeated. No element describing the function of the rule can contradict another. All the elements required for identification by name must be present. Uniqueness is required (This name must be usable as a key). Non-mandatory elements can be added (comments, etc.).
< - - - - - - - - - - - - - - meta-rules - - - - - - - - - - - - - - -|