Compare commits
No commits in common. "neox/instance_cubes" and "stable" have entirely different histories.
neox/insta
...
stable
466
(notes)
466
(notes)
|
|
@ -1,466 +0,0 @@
|
||||||
|
|
||||||
|
|
||||||
https://www.man-linux-magique.net/man3/gets.html
|
|
||||||
https://zestedesavoir.com/tutoriels/755/le-langage-c-1/1043_aggregats-memoire-et-fichiers/4911_les-fichiers/
|
|
||||||
|
|
||||||
=================================================
|
|
||||||
|
|
||||||
ttps://developer.gnome.org/hig/principles.html
|
|
||||||
|
|
||||||
// https://docs.gtk.org/gio/class.MenuModel.html
|
|
||||||
// https://www.geany.org/manual/gtk/gobject/index.html
|
|
||||||
// https://developer.gnome.org/hig/patterns/controls/menus.html
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
================================================================================
|
|
||||||
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ nano ~/.gitconfig
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ git commit -as < pour signer
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ git config --global alias.commit commit -
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ git config --global user.signingKey F37FE3F41D1463D56460400CFB3115C340E057E3
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ echo "b00fb7ba53841e7ff49a07f3f63fa45b2c5674f2b7b442eeafef1fa5e7b406fc" | gpg -a --default-key FB3115C340E057E3 --detach-sig
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ gpg --export --armor F37FE3F41D1463D56460400CFB3115C340E057E3
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ gpg --edit-key jean@a-lec.org
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ gpg --list-key jean@a-lec.org
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ git rebase -i HEAD~6
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ git rebase -i a6845e9b2a622b5ec75317de3c3089f6a3fb3ab0
|
|
||||||
jean@Project:~/Gem-Graph/gem-graph-client [env] $ git commit --amend -S
|
|
||||||
pour chercher : grep
|
|
||||||
pour éditer : sed
|
|
||||||
2024-06-29
|
|
||||||
-------------------------------------------------------------------------------
|
|
||||||
contain.c: (136) gtk_box_append (middle_box, GTK_WIDGET (get_GLArea()));
|
|
||||||
|
|
||||||
graphics.h: (177) static inline GLuint create_shader(const int stack_id, int type, const char *src) {...}
|
|
||||||
|
|
||||||
graphics.c: (153) graphics_draw (stack_index[i].stack_id);
|
|
||||||
|
|
||||||
graphics.c: (233) g_signal_connect (adj, "value-changed", G_CALLBACK(on_axis_value_change), (gpointer) label);
|
|
||||||
graphics.c: (289) g_signal_connect(GTK_GL_AREA(gl_area), "render", G_CALLBACK(on_glarea_render), NULL);
|
|
||||||
graphics.c: g_signal_connect(gl_area, "realize", G_CALLBACK(on_glarea_realize), NULL);
|
|
||||||
graphics.c: g_signal_connect(gl_area, "unrealize", G_CALLBACK(on_glarea_unrealize), NULL);
|
|
||||||
|
|
||||||
graph_stack.c: (149) if (!graphics_init_shaders(cur_id)) return -1;
|
|
||||||
graph_stack.c: (153) graphics_init_buffers(cur_id);
|
|
||||||
|
|
||||||
graph_stack.c: (288) draw_space_ridges_vertex (stack_id, stack->buffer_vertex_size, space_X, space_Y, space_Z);
|
|
||||||
graph_stack.c: draw_space_ridges_lines (stack_id);
|
|
||||||
graph_stack.c: draw_grids_on_space_faces_vertex (stack_id, space_X, space_Y, space_Z);
|
|
||||||
graph_stack.c: draw_grids_on_space_faces_lines (stack_id, stack->buffer_lines_size, space_X, space_Y, space_Z);
|
|
||||||
|
|
||||||
graph_stack.c: (316) stack->arrows_nb = set_arrow (stack_id, stack->arrows_nb, space_X, space_Y, space_Z, arrow.load, arrow.site, arrow.x, arrow.y, arrow.z);
|
|
||||||
|
|
||||||
--------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
contain is called (#included) in : callback, display, tree, graph_stack, graphics, init,
|
|
||||||
|
|
||||||
--------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
// https://docs.gtk.org/gtk4/visual_index.html < widgets gallery
|
|
||||||
// https://docs.gtk.org/gtk4/section-text-widget.html
|
|
||||||
// https://docs.gtk.org/gtk4/class.Widget.html#height-for-width-geometry-management
|
|
||||||
// GTK_ORIENTATION_VERTICAL GTK_ORIENTATION_HORIZONTAL
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
https://docs.gtk.org/gtk4/visual_index.html widgets gallery
|
|
||||||
https://forge.a-lec.org/gem-graph/gem-graph-client/src/branch/devel/Makefile
|
|
||||||
https://docs.gtk.org/gtk4/class.Widget.html#height-for-width-geometry-management
|
|
||||||
// GtkSizeRequestMode get_request_mode (GtkWidget* widget);
|
|
||||||
// gtk_window_set_default_size (GTK_WINDOW (a_box), 30, 400); < TO STUDY
|
|
||||||
https://docs.gtk.org/gtk4/section-text-widget.html texts
|
|
||||||
https://docs.gtk.org/gtk4/drag-and-drop.html drag-and-drop
|
|
||||||
https://docs.gtk.org/gtk4/class.GestureZoom.html GtkGestureZoom
|
|
||||||
https://docs.gtk.org/gtk4/class.ListView.html
|
|
||||||
https://blog.gtk.org/2020/09/08/on-list-models/ < TODO
|
|
||||||
https://docs.gtk.org/gio/method.ActionMap.add_action_entries.html
|
|
||||||
--------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
|
|
||||||
GTK_ORIENTATION_VERTICAL GTK_ORIENTATION_HORIZONTAL
|
|
||||||
|
|
||||||
GTK_SIZE_REQUEST_HEIGHT_FOR_WIDTH GTK_SIZE_REQUEST_WIDTH_FOR_HEIGHT GTK_SIZE_REQUEST_CONSTANT_SIZE
|
|
||||||
|
|
||||||
g_signal_connect (button, "clicked", G_CALLBACK (printf("%s\n", text)), text);
|
|
||||||
g_signal_connect_swapped (button, "clicked", G_CALLBACK (gtk_window_destroy), window);
|
|
||||||
|
|
||||||
--------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
GtkBox GtkGrid GtkRevealer GtkStack
|
|
||||||
GtkOverlay GtkPaned GtkExpander GtkFixed
|
|
||||||
|
|
||||||
box = gtk_box_new (GTK_ORIENTATION_VERTICAL, 0);
|
|
||||||
gtk_widget_set_halign (box, GTK_ALIGN_FILL);
|
|
||||||
gtk_widget_set_valign (box, GTK_ALIGN_CENTER); // START CENTER END FILL
|
|
||||||
gtk_window_set_child (GTK_WINDOW (window), box);
|
|
||||||
puis, après déclaration du bouton, gtk_box_append (GTK_BOX (box), button);
|
|
||||||
|
|
||||||
grid = gtk_grid_new ();
|
|
||||||
gtk_window_set_child (GTK_WINDOW (window), grid);
|
|
||||||
button = gtk_button_new_with_label (" I "); n fois
|
|
||||||
gtk_grid_attach (GTK_GRID (grid), button, 0, 0, 1, 1); n fois
|
|
||||||
|
|
||||||
--------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
TODO (or NOT TODO)
|
|
||||||
|
|
||||||
GtkWidget *get_text_view(){ // WTF ?!& @Grr #~!
|
|
||||||
// https://docs.gtk.org/gtk4/section-text-widget.html
|
|
||||||
GtkWidget *my_view = gtk_text_view_new ();
|
|
||||||
GtkTextTagTable *my_table = gtk_text_tag_table_new ();
|
|
||||||
GtkTextBuffer *my_buffer = gtk_text_buffer_new (my_table);
|
|
||||||
|
|
||||||
gtk_text_buffer_set_text (my_buffer, "Hello, this is some text", -1);
|
|
||||||
gtk_text_view_set_buffer (GTK_TEXT_VIEW (my_view), my_buffer);
|
|
||||||
|
|
||||||
/* Now you might put the view in a container and display it on the
|
|
||||||
* screen; when the user edits the text, signals on the buffer
|
|
||||||
* will be emitted, such as "changed", "insert_text", and so on.
|
|
||||||
*/
|
|
||||||
return my_view;
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
// https://docs.gtk.org/gtk4/getting_started.html (m'aura bien servi, quand même !)
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
//typedef anytype = {(int)(*fnct) {printf("typedef {(int)(*fnct) {printf("");}");} GtkModelFnct;
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
https://blog.gtk.org/2020/06/07/scalable-lists-in-gtk-4/
|
|
||||||
https://docs.gtk.org/gtk4/section-list-widget.html
|
|
||||||
|
|
||||||
A GtkListItemFactory creates widgets for the items taken from a GListModel.
|
|
||||||
https://docs.gtk.org/gtk4/class.ListItemFactory.html
|
|
||||||
|
|
||||||
GtkBuilderListItemFactory is a GtkListItemFactory that creates widgets by instantiating GtkBuilder UI templates.
|
|
||||||
The templates must be extending GtkListItem, and typically use GtkExpressions to obtain data from the items in the model.
|
|
||||||
https://docs.gtk.org/gtk4/class.BuilderListItemFactory.html
|
|
||||||
|
|
||||||
GListModel is an interface that represents a mutable list of GObjects. Its main intention is as a model for various widgets in user interfaces, such as list views, but it can also be used as a convenient method of returning lists of data, with support for updates.
|
|
||||||
https://docs.gtk.org/gio/iface.ListModel.html
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
----------------------------------------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
https://docs.gtk.org/gtk4/getting_started.html
|
|
||||||
https://docs.gtk.org/gtk4/overview.html
|
|
||||||
https://flathub.org/apps/details/ar.xjuan.Cambalache
|
|
||||||
https://github.com/Taiko2k/GTK4PythonTutorial
|
|
||||||
https://github.com/ToshioCP/Gtk4-tutorial
|
|
||||||
https://developer.gnome.org/documentation/tutorials/beginners/getting_started.html
|
|
||||||
https://github.com/Taiko2k/GTK4PythonTutorial#readme
|
|
||||||
|
|
||||||
----------------------------------------------------------------------------------------------------------------
|
|
||||||
|
|
||||||
GTK Development Blog
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
/*
|
|
||||||
essai run-stop, speed et step by step dans une seule box controls
|
|
||||||
-----------------------------------------------------------------
|
|
||||||
|
|
||||||
|
|
||||||
#include <stdio.h>
|
|
||||||
#include <gtk-4.0/gtk/gtk.h>
|
|
||||||
#include "cold.h"
|
|
||||||
|
|
||||||
void print_text(GtkWidget *widget, gpointer data) {g_print (data);}
|
|
||||||
|
|
||||||
GtkWidget *get_a_space_test_image(){
|
|
||||||
GtkWidget *image;
|
|
||||||
image = GTK_WIDGET(get_scrolled_gl_area());
|
|
||||||
image = gtk_picture_new_for_filename ("/home/jean/01/Gtk4/images/aXoris.png");
|
|
||||||
image = gtk_picture_new_for_filename ("/home/jean/01/Gtk4/images/gg sketch.png");
|
|
||||||
image = gtk_picture_new_for_filename ("/home/jean/01/Gtk4/images/E coli.png");
|
|
||||||
image = gtk_picture_new_for_filename ("/home/jean/01/Gtk4/images/E coli resized.png");
|
|
||||||
image = gtk_picture_new_for_filename ("/home/jean/01/Gtk4/Getting_Started_with_GTK/E coli by David S. Goodsell (2009).png");
|
|
||||||
return image;
|
|
||||||
}
|
|
||||||
|
|
||||||
GtkWidget *get_scroll_speed(){
|
|
||||||
GtkAdjustment *speed_adjust = gtk_adjustment_new (0, 0, 100, 1, 0, 0);
|
|
||||||
GtkWidget *scroll_speed = gtk_scrollbar_new (GTK_ORIENTATION_VERTICAL, speed_adjust);
|
|
||||||
return scroll_speed;
|
|
||||||
}
|
|
||||||
|
|
||||||
// TODO cliquer sur "RUN" --> affiche "STOP" (et inversement)
|
|
||||||
GtkBox *get_RUN_STOP_box(){
|
|
||||||
GtkBox *RUN_STOP_box = GTK_BOX(gtk_box_new (GTK_ORIENTATION_HORIZONTAL, 2)); // spacing = 2
|
|
||||||
|
|
||||||
GtkWidget *RUN_Label = GTK_WIDGET (gtk_label_new (NULL)); // "RUN"));
|
|
||||||
const char *str = " RUN\n STOP";
|
|
||||||
const char *format = "<span style=\"oblique\">\%s</span>";
|
|
||||||
char *markup;
|
|
||||||
|
|
||||||
markup = g_markup_printf_escaped (format, str);
|
|
||||||
gtk_label_set_markup (GTK_LABEL (RUN_Label), markup); // Sets the labels text and attributes from markup.
|
|
||||||
g_free (markup);
|
|
||||||
|
|
||||||
gtk_label_set_max_width_chars (GTK_LABEL(RUN_Label), 12);
|
|
||||||
gtk_label_set_wrap (GTK_LABEL(RUN_Label), TRUE);
|
|
||||||
gtk_label_set_xalign (GTK_LABEL(RUN_Label), 0.5); // xalign value, between 0 and 1
|
|
||||||
gtk_label_set_yalign (GTK_LABEL(RUN_Label), 0.5);
|
|
||||||
gtk_label_set_selectable (GTK_LABEL(RUN_Label), FALSE); // default = FALSE
|
|
||||||
gtk_label_set_single_line_mode (GTK_LABEL(RUN_Label), TRUE); // default = TRUE
|
|
||||||
//
|
|
||||||
gtk_box_append (RUN_STOP_box, RUN_Label);
|
|
||||||
return RUN_STOP_box;
|
|
||||||
}
|
|
||||||
|
|
||||||
GtkBox *get_STEP_by_STEP_box(){
|
|
||||||
GtkBox *STEP_by_STEP_box = GTK_BOX(gtk_box_new (GTK_ORIENTATION_HORIZONTAL, 0));
|
|
||||||
GtkWidget *STEP_by_STEP_Label = GTK_WIDGET (gtk_label_new ("ONE\nSTEP"));
|
|
||||||
gtk_box_append (STEP_by_STEP_box, STEP_by_STEP_Label);
|
|
||||||
return STEP_by_STEP_box;
|
|
||||||
}
|
|
||||||
|
|
||||||
GtkBox *get_CONTROL_box(){
|
|
||||||
GtkBox *CONTROL_box = GTK_BOX(gtk_box_new (GTK_ORIENTATION_VERTICAL, 0));
|
|
||||||
gtk_box_append (CONTROL_box, GTK_WIDGET (get_RUN_STOP_box()));
|
|
||||||
gtk_box_append (CONTROL_box, GTK_WIDGET (get_scroll_speed()));
|
|
||||||
gtk_box_append (CONTROL_box, GTK_WIDGET (get_STEP_by_STEP_box()));
|
|
||||||
return CONTROL_box;
|
|
||||||
}
|
|
||||||
*/
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
Legacy, again...
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
void fsm_poetic_engine() // 2024-08-31
|
|
||||||
{
|
|
||||||
int milliseconds = 100;
|
|
||||||
struct timespec rem;
|
|
||||||
struct timespec req= {
|
|
||||||
(int)(milliseconds / 1000), /* secs (Must be Non-Negative) */
|
|
||||||
(milliseconds % 1000) * 1000000 /* nano (Must be in range of 0 to 999999999) */
|
|
||||||
};
|
|
||||||
while (true) {
|
|
||||||
printf(" | O . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | DO * |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D=-O * |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D=-- -O * |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | =- - - O * |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | -- O * |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | - O (*) |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O (*) |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O (*) |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O (*) |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O*) |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | (*O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | (*) O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | (*) O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | (*) O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | * O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | * O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | * O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | * O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | * O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O * |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O . .|\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | O . .|\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D . . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D- . . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D =- . . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D = --- . . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D =-- . . |\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D=- . .|\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
printf(" | D- . .|\n\x1b[1F\x1b[2K"); nanosleep(&req , &rem);
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
///////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
My old engine in java...
|
|
||||||
|
|
||||||
///////////////
|
|
||||||
package engine;
|
|
||||||
|
|
||||||
import java.lang.System.out;
|
|
||||||
import measures.MeasuresManager;
|
|
||||||
import resources.P;
|
|
||||||
import rule.FormulasManager;
|
|
||||||
import rule.FormulasManagerAccess;
|
|
||||||
import session.ViewControls;
|
|
||||||
import state.StateManager;
|
|
||||||
import state.StateManagerLocal;
|
|
||||||
import views.MODEL;
|
|
||||||
import views.ViewsManagerAccess;
|
|
||||||
|
|
||||||
/* 2020-11 [prototype 0.0]
|
|
||||||
MonoThread executes a while(true) loop with two instructions:
|
|
||||||
(1) search a place where a transition can be done
|
|
||||||
(2) do the transition
|
|
||||||
|
|
||||||
while (true)
|
|
||||||
if (session.MainView.isStartStopButtonSelected())
|
|
||||||
{
|
|
||||||
state.StateManagerLocal.chooseLocalOrigin(false);
|
|
||||||
new SingleTransition(true);
|
|
||||||
}
|
|
||||||
*/
|
|
||||||
public class SingleTransition {
|
|
||||||
|
|
||||||
protected volatile boolean is_done = false;
|
|
||||||
protected volatile String elapsed;
|
|
||||||
public SingleTransition (boolean mono) {if (mono) perform_a_transition();}
|
|
||||||
|
|
||||||
private synchronized static final void perform_a_transition()
|
|
||||||
{
|
|
||||||
// if (step_by_step) StateManagerLocal.circlePresentState();
|
|
||||||
if(ViewControls.isDoSelected()) SingleTransition.execute_do (SingleTransition.prepare_do (false));
|
|
||||||
else if(ViewControls.isUndoSelected()) SingleTransition.execute_undo(SingleTransition.prepare_undo(false));
|
|
||||||
else if(ViewControls.isRedoSelected()) SingleTransition.execute_redo(SingleTransition.prepare_redo(false));
|
|
||||||
// if (ViewControls.undo_buffer < UNDO_STACK_SIZE) ViewControls.setTimeBufferBar(ViewControls.undo_buffer); MainView.addElapsedTime();
|
|
||||||
}
|
|
||||||
public static final int prepare_do (final boolean step_by_step)
|
|
||||||
{
|
|
||||||
// ThreadsManager.addCycle(); // {nb_cycles ++;} This cycle can be inefficient if no formula can be applied
|
|
||||||
selected_formula = FormulasManager.iterateToFindAFormula();
|
|
||||||
// if(selected_formula > -1) out.println(" prepare_do "+ state.StateManagerLocal.getInfoDebug());
|
|
||||||
return selected_formula;
|
|
||||||
}
|
|
||||||
public static final void execute_do (final int formula_key) { // formula.doActions(); out.print(" execute_do: formula key=" + formula_key +" ");
|
|
||||||
if (formula_key < 0) { if(StateManagerLocal.comment_origins) out.println("execute_do failure: formula key=" + formula_key); return;}
|
|
||||||
|
|
||||||
MeasuresManager.startMeasuringAFormulaEffect(formula_key); // out.println("execute_do formula name = "+ FormulasManager.formula.get(formula_key).name);
|
|
||||||
FormulasManager.getFormula().get (formula_key) .doActions(); // {for (i = 0; i < action.length; i++) action[i].doAction (); StateManagerLocal.endRule(action_swap, action_name);}
|
|
||||||
MeasuresManager.endMeasuringAFormulaEffect(formula_key);
|
|
||||||
writePresentState (formula_key);
|
|
||||||
present ++; if (present == UNDO_STACK_SIZE) present = 0; // MainView.setStartStopButtonSelected(false);// if (present == 1); {MainView.setStartStopButtonSelected(false); } //out.println("MonoThread.execute_do > stop ! (present == 1)");
|
|
||||||
ViewControls .execDo();
|
|
||||||
doRepaint();
|
|
||||||
if (DO_UNDO_REDO_comment) comment_do(formula_key); // if (MonoThreadTest.present == 12) MainView.setStartStopButtonSelected(false);
|
|
||||||
}
|
|
||||||
public static final int prepare_undo (final boolean step_by_step) { // MonoThreadTest.present --; return MonoThreadTest. f [MonoThreadTest.present];
|
|
||||||
if (ViewControls.isUndoBufferEmpty()) {out.println("prepare_undo stop !");} // undo_buffer is always >= 0
|
|
||||||
else {present --; if (present == -1) present = UNDO_STACK_SIZE -1; ViewControls.execUndo();}
|
|
||||||
final int formula_key = readPresentState(step_by_step);
|
|
||||||
// if (step_by_step) StateManagerLocal.circlePresentState();
|
|
||||||
return formula_key;
|
|
||||||
}
|
|
||||||
public static final void execute_undo (final int formula_key) { // formula.unDoActions(); {for (i = 0; i < action.length; i++) ...}
|
|
||||||
FormulasManager.getFormula().get (formula_key) .unDoActions(); // {for (i = 0; i < action.length; i++) action[i].doAction (); StateManagerLocal.endRule(action_swap, action_name);}
|
|
||||||
ViewControls.setRedoSelected();
|
|
||||||
// StateManagerLocal.circlePresentState();
|
|
||||||
// ThreadsManager.removeEfficientCycle(); // {nb_effective_cycles --;}
|
|
||||||
doRepaint();
|
|
||||||
if (DO_UNDO_REDO_comment) comment_undo();
|
|
||||||
}
|
|
||||||
public static final int prepare_redo (final boolean step_by_step) { // return MonoThreadTest. f [MonoThreadTest.present];
|
|
||||||
final int formula_key = readPresentState(step_by_step);
|
|
||||||
// ThreadsManager.addEfficientCycle(); // {nb_effective_cycles ++;}
|
|
||||||
// if (step_by_step) StateManagerLocal.circlePresentState();
|
|
||||||
return formula_key;
|
|
||||||
}
|
|
||||||
public static final void execute_redo (final int formula_key) { // formula.doActions(); {for (i = 0; i < action.length; i++) ...}
|
|
||||||
// the redo_buffer is always >= 0 (if the re_do buffer is empty, the re_do button is deactivated)
|
|
||||||
if (! ViewControls.isRedoBufferEmpty()) {
|
|
||||||
FormulasManager.getFormula().get (formula_key).doActions(); // {for (i = 0; i < action.length; i++) action[i].doAction (); StateManagerLocal.endRule(action_swap, action_name);}
|
|
||||||
present ++; if (present == UNDO_STACK_SIZE) present = 0;
|
|
||||||
ViewControls.execRedo();
|
|
||||||
}
|
|
||||||
ViewControls.setUndoSelected();
|
|
||||||
doRepaint();
|
|
||||||
if (DO_UNDO_REDO_comment) comment_redo();
|
|
||||||
}
|
|
||||||
public final static void writePresentState (final int formula_key) { // x [present] = StateManagerLocal.local_space_origin_X; ...
|
|
||||||
|
|
||||||
formula [present] = (short) formula_key;
|
|
||||||
o [present] = (byte) StateManagerLocal.getReferenceOrientation_1();
|
|
||||||
switch(StateManager.space_dimension) {
|
|
||||||
case THREE: z [present] = (byte) StateManagerLocal.local_space_origin_Z; // no break;
|
|
||||||
case TWO: y [present] = (byte) StateManagerLocal.local_space_origin_Y; // no break;
|
|
||||||
case ONE: x [present] = (byte) StateManagerLocal.local_space_origin_X; // no break;
|
|
||||||
default:;}
|
|
||||||
}
|
|
||||||
private final static int readPresentState (final boolean step_by_step) { // StateManagerLocal.local_space_origin_X = x [present]; ...
|
|
||||||
|
|
||||||
switch(StateManager.space_dimension) {
|
|
||||||
case THREE : StateManagerLocal.local_space_origin_Z = z [present]; // no break
|
|
||||||
case TWO : StateManagerLocal.local_space_origin_Y = y [present]; // no break
|
|
||||||
case ONE : StateManagerLocal.local_space_origin_X = x [present]; // no break;
|
|
||||||
default:;}
|
|
||||||
StateManagerLocal.setReferenceOrientation_1 (o [present]);
|
|
||||||
return formula[present];
|
|
||||||
}
|
|
||||||
private final static void doRepaint() {ViewsManagerAccess.getView(MODEL.SPACE, "MonoThread.execute_do_undo_redo()").repaint(); }
|
|
||||||
public static int selected_formula;
|
|
||||||
public static int present = 0;
|
|
||||||
public final static int UNDO_STACK_SIZE = 3000; // resources.Parameters.UNDO_STACK_SIZE; // This parameter is also used by ViewControls to display the BufferProgressBarValue
|
|
||||||
protected final static short[] formula = new short [UNDO_STACK_SIZE];
|
|
||||||
protected final static byte[] x = new byte [UNDO_STACK_SIZE];
|
|
||||||
protected final static byte[] y = new byte [UNDO_STACK_SIZE];
|
|
||||||
protected final static byte[] z = new byte [UNDO_STACK_SIZE];
|
|
||||||
protected final static byte[] o = new byte [UNDO_STACK_SIZE];
|
|
||||||
private final static byte s6 = 6, s2 = 2;
|
|
||||||
public final static boolean DO_UNDO_REDO_comment = false; // true false
|
|
||||||
protected final static void comment_do (int rank)
|
|
||||||
{
|
|
||||||
if (present == 0) present = UNDO_STACK_SIZE;
|
|
||||||
out.println(" do -----> "+
|
|
||||||
P.aa(present,s6) + " ("+ P.aa(ViewControls.undo_buffer - 1,s2) +"+1="+ P.aa(ViewControls.undo_buffer,s2) +" /"+
|
|
||||||
P.aa(ViewControls.redo_buffer,s2) +" -"+ P.aa(ViewControls.redo_buffer,s2) +") "+
|
|
||||||
P.aa("xyzo ("+ P.aa(x[present - 1],2) +","+ P.aa(y[present - 1],2) +","+ P.aa(z[present - 1],2) +")",12) +" "+ o[present - 1] +" " +
|
|
||||||
// "from:"+ P.aa(from[present - 1],4) +" to:"+ P.aa(to[present - 1],4) +
|
|
||||||
" f="+ formula[present - 1] +
|
|
||||||
"");
|
|
||||||
if (present == UNDO_STACK_SIZE) present = 0;
|
|
||||||
}
|
|
||||||
protected final static void comment_undo () {
|
|
||||||
// present ++; if (present == stack_size) present = 0; // This comment is triggered after present was decreased of one unit
|
|
||||||
out.println(" undo <--| "+
|
|
||||||
P.aa(present,s6) + " ("+ P.aa(ViewControls.undo_buffer + 1,s2) +"-1="+ P.aa(ViewControls.undo_buffer,s2) +" /"+
|
|
||||||
P.aa(ViewControls.redo_buffer - 1,s2) +"+1="+ P.aa(ViewControls.redo_buffer,s2) +") "+
|
|
||||||
P.aa("xyzo ("+ P.aa(x[present],2) +","+ P.aa(y[present],2) +","+ P.aa(z[present],2) +")",12) +" "+ o[present] +" " +
|
|
||||||
// "from:"+ P.aa(from[present],4) +" to:"+ P.aa(to[present],4) +
|
|
||||||
" f="+ formula[present] +
|
|
||||||
"");
|
|
||||||
}
|
|
||||||
protected final static void comment_redo () {
|
|
||||||
if (present == 0) present = UNDO_STACK_SIZE;
|
|
||||||
out.println(" redo |--> "+
|
|
||||||
P.aa(present,s6) + " ("+P.aa(ViewControls.undo_buffer - 1,s2) +"+1="+ P.aa(ViewControls.undo_buffer,s2) + " /"+
|
|
||||||
P.aa(ViewControls.redo_buffer + 1,s2) +"-1="+ P.aa(ViewControls.redo_buffer,s2) +") "+
|
|
||||||
P.aa("xyzo ("+ P.aa(x[present - 1],2) +","+ P.aa(y[present - 1],2) +","+ P.aa(z[present - 1],2) +")",12) +" "+ o[present - 1] +" " +
|
|
||||||
// "from:"+ P.aa(from[present - 1],4) +" to:"+ P.aa(to[present - 1],4) +
|
|
||||||
" f="+ formula[present - 1] +
|
|
||||||
"");
|
|
||||||
if (present == UNDO_STACK_SIZE) present = 0;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////
|
|
||||||
|
|
||||||
|
|
@ -1,96 +0,0 @@
|
||||||
https://discourse.gnome.org/t/when-do-we-really-have-to-use-gtk-popover-present-to-show-a-popover-at-a-given-widget/17566/5
|
|
||||||
https://stackoverflow.com/questions/69135934/creating-a-simple-menubar-menu-and-menu-item-in-c-using-gtk4
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
|
|
||||||
#include <gtk/gtk.h>
|
|
||||||
|
|
||||||
static void action_clbk ( GSimpleAction *simple_action, G_GNUC_UNUSED GVariant *parameter, G_GNUC_UNUSED gpointer *data )
|
|
||||||
{
|
|
||||||
g_print ( "The action %s was clicked.\n", g_action_get_name ( G_ACTION ( simple_action ) ) );
|
|
||||||
}
|
|
||||||
|
|
||||||
static void activate ( GApplication *app, G_GNUC_UNUSED gpointer *data )
|
|
||||||
{
|
|
||||||
GtkWidget *win;
|
|
||||||
GSimpleAction *act_connect;
|
|
||||||
GSimpleAction *act_disconnect;
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
GMenu *menu_bar;
|
|
||||||
GMenu *network_menu;
|
|
||||||
GMenu *server_menu;
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
GMenuItem *menu_item_connect;
|
|
||||||
GMenuItem *menu_item_disconnect;
|
|
||||||
|
|
||||||
/// *** Menu Bar
|
|
||||||
menu_bar = g_menu_new();
|
|
||||||
|
|
||||||
/// *** Network_Menu
|
|
||||||
network_menu = g_menu_new();
|
|
||||||
g_menu_append_submenu ( menu_bar, "Network", G_MENU_MODEL ( network_menu ) );
|
|
||||||
|
|
||||||
/// *** Server_Menu
|
|
||||||
server_menu = g_menu_new();
|
|
||||||
g_menu_append_submenu ( network_menu, "Server", G_MENU_MODEL ( server_menu ) );
|
|
||||||
/// ***
|
|
||||||
win = gtk_application_window_new ( GTK_APPLICATION ( app ) );
|
|
||||||
gtk_window_set_title ( GTK_WINDOW ( win ), "IRC Client" );
|
|
||||||
gtk_window_set_default_size ( GTK_WINDOW ( win ), 400, 400 );
|
|
||||||
|
|
||||||
/// *** Create Connect and Disconnect Actions
|
|
||||||
act_connect = g_simple_action_new ( "connect", NULL );
|
|
||||||
act_disconnect = g_simple_action_new ( "disconnect", NULL );
|
|
||||||
|
|
||||||
/// *** Add them to the ActionMap
|
|
||||||
g_action_map_add_action ( G_ACTION_MAP ( app ), G_ACTION ( act_connect ) );
|
|
||||||
g_action_map_add_action ( G_ACTION_MAP ( app ), G_ACTION ( act_disconnect ) );
|
|
||||||
|
|
||||||
/// *** Connect them to the activate Signal
|
|
||||||
g_signal_connect ( act_connect, "activate", G_CALLBACK ( action_clbk ), NULL );
|
|
||||||
g_signal_connect ( act_disconnect, "activate", G_CALLBACK ( action_clbk ), NULL );
|
|
||||||
|
|
||||||
/// *** Create the Connect Item
|
|
||||||
menu_item_connect = g_menu_item_new ( "Connect", "app.connect" );
|
|
||||||
g_menu_append_item ( server_menu, menu_item_connect );
|
|
||||||
|
|
||||||
/// *** Create the Disconnect Item
|
|
||||||
menu_item_disconnect = g_menu_item_new ( "Disconnect", "app.disconnect" );
|
|
||||||
g_menu_append_item ( server_menu, menu_item_disconnect );
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
gtk_application_set_menubar ( GTK_APPLICATION ( app ), G_MENU_MODEL ( menu_bar ) );
|
|
||||||
gtk_application_window_set_show_menubar ( GTK_APPLICATION_WINDOW ( win ), TRUE );
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
gtk_window_present ( GTK_WINDOW ( win ) );
|
|
||||||
|
|
||||||
/// *** Clean
|
|
||||||
g_object_unref ( act_connect );
|
|
||||||
g_object_unref ( act_disconnect );
|
|
||||||
g_object_unref ( menu_item_connect );
|
|
||||||
g_object_unref ( menu_item_disconnect );
|
|
||||||
g_object_unref ( server_menu );
|
|
||||||
g_object_unref ( network_menu );
|
|
||||||
g_object_unref ( menu_bar );
|
|
||||||
}
|
|
||||||
|
|
||||||
int main ( int argc, char **argv )
|
|
||||||
{
|
|
||||||
GtkApplication *app;
|
|
||||||
int stat;
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
app = gtk_application_new ( "com.ircclient", G_APPLICATION_FLAGS_NONE );
|
|
||||||
g_signal_connect ( app, "activate", G_CALLBACK ( activate ), NULL );
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
stat = g_application_run ( G_APPLICATION ( app ), argc, argv );
|
|
||||||
g_object_unref ( app );
|
|
||||||
|
|
||||||
/// ***
|
|
||||||
return stat;
|
|
||||||
}
|
|
||||||
|
|
@ -1,2 +0,0 @@
|
||||||
bin/*
|
|
||||||
build/*
|
|
||||||
675
COPYING
675
COPYING
|
|
@ -1,675 +0,0 @@
|
||||||
GNU GENERAL PUBLIC LICENSE
|
|
||||||
Version 3, 29 June 2007
|
|
||||||
|
|
||||||
Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
|
|
||||||
Everyone is permitted to copy and distribute verbatim copies
|
|
||||||
of this license document, but changing it is not allowed.
|
|
||||||
|
|
||||||
Preamble
|
|
||||||
|
|
||||||
The GNU General Public License is a free, copyleft license for
|
|
||||||
software and other kinds of works.
|
|
||||||
|
|
||||||
The licenses for most software and other practical works are designed
|
|
||||||
to take away your freedom to share and change the works. By contrast,
|
|
||||||
the GNU General Public License is intended to guarantee your freedom to
|
|
||||||
share and change all versions of a program--to make sure it remains free
|
|
||||||
software for all its users. We, the Free Software Foundation, use the
|
|
||||||
GNU General Public License for most of our software; it applies also to
|
|
||||||
any other work released this way by its authors. You can apply it to
|
|
||||||
your programs, too.
|
|
||||||
|
|
||||||
When we speak of free software, we are referring to freedom, not
|
|
||||||
price. Our General Public Licenses are designed to make sure that you
|
|
||||||
have the freedom to distribute copies of free software (and charge for
|
|
||||||
them if you wish), that you receive source code or can get it if you
|
|
||||||
want it, that you can change the software or use pieces of it in new
|
|
||||||
free programs, and that you know you can do these things.
|
|
||||||
|
|
||||||
To protect your rights, we need to prevent others from denying you
|
|
||||||
these rights or asking you to surrender the rights. Therefore, you have
|
|
||||||
certain responsibilities if you distribute copies of the software, or if
|
|
||||||
you modify it: responsibilities to respect the freedom of others.
|
|
||||||
|
|
||||||
For example, if you distribute copies of such a program, whether
|
|
||||||
gratis or for a fee, you must pass on to the recipients the same
|
|
||||||
freedoms that you received. You must make sure that they, too, receive
|
|
||||||
or can get the source code. And you must show them these terms so they
|
|
||||||
know their rights.
|
|
||||||
|
|
||||||
Developers that use the GNU GPL protect your rights with two steps:
|
|
||||||
(1) assert copyright on the software, and (2) offer you this License
|
|
||||||
giving you legal permission to copy, distribute and/or modify it.
|
|
||||||
|
|
||||||
For the developers' and authors' protection, the GPL clearly explains
|
|
||||||
that there is no warranty for this free software. For both users' and
|
|
||||||
authors' sake, the GPL requires that modified versions be marked as
|
|
||||||
changed, so that their problems will not be attributed erroneously to
|
|
||||||
authors of previous versions.
|
|
||||||
|
|
||||||
Some devices are designed to deny users access to install or run
|
|
||||||
modified versions of the software inside them, although the manufacturer
|
|
||||||
can do so. This is fundamentally incompatible with the aim of
|
|
||||||
protecting users' freedom to change the software. The systematic
|
|
||||||
pattern of such abuse occurs in the area of products for individuals to
|
|
||||||
use, which is precisely where it is most unacceptable. Therefore, we
|
|
||||||
have designed this version of the GPL to prohibit the practice for those
|
|
||||||
products. If such problems arise substantially in other domains, we
|
|
||||||
stand ready to extend this provision to those domains in future versions
|
|
||||||
of the GPL, as needed to protect the freedom of users.
|
|
||||||
|
|
||||||
Finally, every program is threatened constantly by software patents.
|
|
||||||
States should not allow patents to restrict development and use of
|
|
||||||
software on general-purpose computers, but in those that do, we wish to
|
|
||||||
avoid the special danger that patents applied to a free program could
|
|
||||||
make it effectively proprietary. To prevent this, the GPL assures that
|
|
||||||
patents cannot be used to render the program non-free.
|
|
||||||
|
|
||||||
The precise terms and conditions for copying, distribution and
|
|
||||||
modification follow.
|
|
||||||
|
|
||||||
TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
0. Definitions.
|
|
||||||
|
|
||||||
"This License" refers to version 3 of the GNU General Public License.
|
|
||||||
|
|
||||||
"Copyright" also means copyright-like laws that apply to other kinds of
|
|
||||||
works, such as semiconductor masks.
|
|
||||||
|
|
||||||
"The Program" refers to any copyrightable work licensed under this
|
|
||||||
License. Each licensee is addressed as "you". "Licensees" and
|
|
||||||
"recipients" may be individuals or organizations.
|
|
||||||
|
|
||||||
To "modify" a work means to copy from or adapt all or part of the work
|
|
||||||
in a fashion requiring copyright permission, other than the making of an
|
|
||||||
exact copy. The resulting work is called a "modified version" of the
|
|
||||||
earlier work or a work "based on" the earlier work.
|
|
||||||
|
|
||||||
A "covered work" means either the unmodified Program or a work based
|
|
||||||
on the Program.
|
|
||||||
|
|
||||||
To "propagate" a work means to do anything with it that, without
|
|
||||||
permission, would make you directly or secondarily liable for
|
|
||||||
infringement under applicable copyright law, except executing it on a
|
|
||||||
computer or modifying a private copy. Propagation includes copying,
|
|
||||||
distribution (with or without modification), making available to the
|
|
||||||
public, and in some countries other activities as well.
|
|
||||||
|
|
||||||
To "convey" a work means any kind of propagation that enables other
|
|
||||||
parties to make or receive copies. Mere interaction with a user through
|
|
||||||
a computer network, with no transfer of a copy, is not conveying.
|
|
||||||
|
|
||||||
An interactive user interface displays "Appropriate Legal Notices"
|
|
||||||
to the extent that it includes a convenient and prominently visible
|
|
||||||
feature that (1) displays an appropriate copyright notice, and (2)
|
|
||||||
tells the user that there is no warranty for the work (except to the
|
|
||||||
extent that warranties are provided), that licensees may convey the
|
|
||||||
work under this License, and how to view a copy of this License. If
|
|
||||||
the interface presents a list of user commands or options, such as a
|
|
||||||
menu, a prominent item in the list meets this criterion.
|
|
||||||
|
|
||||||
1. Source Code.
|
|
||||||
|
|
||||||
The "source code" for a work means the preferred form of the work
|
|
||||||
for making modifications to it. "Object code" means any non-source
|
|
||||||
form of a work.
|
|
||||||
|
|
||||||
A "Standard Interface" means an interface that either is an official
|
|
||||||
standard defined by a recognized standards body, or, in the case of
|
|
||||||
interfaces specified for a particular programming language, one that
|
|
||||||
is widely used among developers working in that language.
|
|
||||||
|
|
||||||
The "System Libraries" of an executable work include anything, other
|
|
||||||
than the work as a whole, that (a) is included in the normal form of
|
|
||||||
packaging a Major Component, but which is not part of that Major
|
|
||||||
Component, and (b) serves only to enable use of the work with that
|
|
||||||
Major Component, or to implement a Standard Interface for which an
|
|
||||||
implementation is available to the public in source code form. A
|
|
||||||
"Major Component", in this context, means a major essential component
|
|
||||||
(kernel, window system, and so on) of the specific operating system
|
|
||||||
(if any) on which the executable work runs, or a compiler used to
|
|
||||||
produce the work, or an object code interpreter used to run it.
|
|
||||||
|
|
||||||
The "Corresponding Source" for a work in object code form means all
|
|
||||||
the source code needed to generate, install, and (for an executable
|
|
||||||
work) run the object code and to modify the work, including scripts to
|
|
||||||
control those activities. However, it does not include the work's
|
|
||||||
System Libraries, or general-purpose tools or generally available free
|
|
||||||
programs which are used unmodified in performing those activities but
|
|
||||||
which are not part of the work. For example, Corresponding Source
|
|
||||||
includes interface definition files associated with source files for
|
|
||||||
the work, and the source code for shared libraries and dynamically
|
|
||||||
linked subprograms that the work is specifically designed to require,
|
|
||||||
such as by intimate data communication or control flow between those
|
|
||||||
subprograms and other parts of the work.
|
|
||||||
|
|
||||||
The Corresponding Source need not include anything that users
|
|
||||||
can regenerate automatically from other parts of the Corresponding
|
|
||||||
Source.
|
|
||||||
|
|
||||||
The Corresponding Source for a work in source code form is that
|
|
||||||
same work.
|
|
||||||
|
|
||||||
2. Basic Permissions.
|
|
||||||
|
|
||||||
All rights granted under this License are granted for the term of
|
|
||||||
copyright on the Program, and are irrevocable provided the stated
|
|
||||||
conditions are met. This License explicitly affirms your unlimited
|
|
||||||
permission to run the unmodified Program. The output from running a
|
|
||||||
covered work is covered by this License only if the output, given its
|
|
||||||
content, constitutes a covered work. This License acknowledges your
|
|
||||||
rights of fair use or other equivalent, as provided by copyright law.
|
|
||||||
|
|
||||||
You may make, run and propagate covered works that you do not
|
|
||||||
convey, without conditions so long as your license otherwise remains
|
|
||||||
in force. You may convey covered works to others for the sole purpose
|
|
||||||
of having them make modifications exclusively for you, or provide you
|
|
||||||
with facilities for running those works, provided that you comply with
|
|
||||||
the terms of this License in conveying all material for which you do
|
|
||||||
not control copyright. Those thus making or running the covered works
|
|
||||||
for you must do so exclusively on your behalf, under your direction
|
|
||||||
and control, on terms that prohibit them from making any copies of
|
|
||||||
your copyrighted material outside their relationship with you.
|
|
||||||
|
|
||||||
Conveying under any other circumstances is permitted solely under
|
|
||||||
the conditions stated below. Sublicensing is not allowed; section 10
|
|
||||||
makes it unnecessary.
|
|
||||||
|
|
||||||
3. Protecting Users' Legal Rights From Anti-Circumvention Law.
|
|
||||||
|
|
||||||
No covered work shall be deemed part of an effective technological
|
|
||||||
measure under any applicable law fulfilling obligations under article
|
|
||||||
11 of the WIPO copyright treaty adopted on 20 December 1996, or
|
|
||||||
similar laws prohibiting or restricting circumvention of such
|
|
||||||
measures.
|
|
||||||
|
|
||||||
When you convey a covered work, you waive any legal power to forbid
|
|
||||||
circumvention of technological measures to the extent such circumvention
|
|
||||||
is effected by exercising rights under this License with respect to
|
|
||||||
the covered work, and you disclaim any intention to limit operation or
|
|
||||||
modification of the work as a means of enforcing, against the work's
|
|
||||||
users, your or third parties' legal rights to forbid circumvention of
|
|
||||||
technological measures.
|
|
||||||
|
|
||||||
4. Conveying Verbatim Copies.
|
|
||||||
|
|
||||||
You may convey verbatim copies of the Program's source code as you
|
|
||||||
receive it, in any medium, provided that you conspicuously and
|
|
||||||
appropriately publish on each copy an appropriate copyright notice;
|
|
||||||
keep intact all notices stating that this License and any
|
|
||||||
non-permissive terms added in accord with section 7 apply to the code;
|
|
||||||
keep intact all notices of the absence of any warranty; and give all
|
|
||||||
recipients a copy of this License along with the Program.
|
|
||||||
|
|
||||||
You may charge any price or no price for each copy that you convey,
|
|
||||||
and you may offer support or warranty protection for a fee.
|
|
||||||
|
|
||||||
5. Conveying Modified Source Versions.
|
|
||||||
|
|
||||||
You may convey a work based on the Program, or the modifications to
|
|
||||||
produce it from the Program, in the form of source code under the
|
|
||||||
terms of section 4, provided that you also meet all of these conditions:
|
|
||||||
|
|
||||||
a) The work must carry prominent notices stating that you modified
|
|
||||||
it, and giving a relevant date.
|
|
||||||
|
|
||||||
b) The work must carry prominent notices stating that it is
|
|
||||||
released under this License and any conditions added under section
|
|
||||||
7. This requirement modifies the requirement in section 4 to
|
|
||||||
"keep intact all notices".
|
|
||||||
|
|
||||||
c) You must license the entire work, as a whole, under this
|
|
||||||
License to anyone who comes into possession of a copy. This
|
|
||||||
License will therefore apply, along with any applicable section 7
|
|
||||||
additional terms, to the whole of the work, and all its parts,
|
|
||||||
regardless of how they are packaged. This License gives no
|
|
||||||
permission to license the work in any other way, but it does not
|
|
||||||
invalidate such permission if you have separately received it.
|
|
||||||
|
|
||||||
d) If the work has interactive user interfaces, each must display
|
|
||||||
Appropriate Legal Notices; however, if the Program has interactive
|
|
||||||
interfaces that do not display Appropriate Legal Notices, your
|
|
||||||
work need not make them do so.
|
|
||||||
|
|
||||||
A compilation of a covered work with other separate and independent
|
|
||||||
works, which are not by their nature extensions of the covered work,
|
|
||||||
and which are not combined with it such as to form a larger program,
|
|
||||||
in or on a volume of a storage or distribution medium, is called an
|
|
||||||
"aggregate" if the compilation and its resulting copyright are not
|
|
||||||
used to limit the access or legal rights of the compilation's users
|
|
||||||
beyond what the individual works permit. Inclusion of a covered work
|
|
||||||
in an aggregate does not cause this License to apply to the other
|
|
||||||
parts of the aggregate.
|
|
||||||
|
|
||||||
6. Conveying Non-Source Forms.
|
|
||||||
|
|
||||||
You may convey a covered work in object code form under the terms
|
|
||||||
of sections 4 and 5, provided that you also convey the
|
|
||||||
machine-readable Corresponding Source under the terms of this License,
|
|
||||||
in one of these ways:
|
|
||||||
|
|
||||||
a) Convey the object code in, or embodied in, a physical product
|
|
||||||
(including a physical distribution medium), accompanied by the
|
|
||||||
Corresponding Source fixed on a durable physical medium
|
|
||||||
customarily used for software interchange.
|
|
||||||
|
|
||||||
b) Convey the object code in, or embodied in, a physical product
|
|
||||||
(including a physical distribution medium), accompanied by a
|
|
||||||
written offer, valid for at least three years and valid for as
|
|
||||||
long as you offer spare parts or customer support for that product
|
|
||||||
model, to give anyone who possesses the object code either (1) a
|
|
||||||
copy of the Corresponding Source for all the software in the
|
|
||||||
product that is covered by this License, on a durable physical
|
|
||||||
medium customarily used for software interchange, for a price no
|
|
||||||
more than your reasonable cost of physically performing this
|
|
||||||
conveying of source, or (2) access to copy the
|
|
||||||
Corresponding Source from a network server at no charge.
|
|
||||||
|
|
||||||
c) Convey individual copies of the object code with a copy of the
|
|
||||||
written offer to provide the Corresponding Source. This
|
|
||||||
alternative is allowed only occasionally and noncommercially, and
|
|
||||||
only if you received the object code with such an offer, in accord
|
|
||||||
with subsection 6b.
|
|
||||||
|
|
||||||
d) Convey the object code by offering access from a designated
|
|
||||||
place (gratis or for a charge), and offer equivalent access to the
|
|
||||||
Corresponding Source in the same way through the same place at no
|
|
||||||
further charge. You need not require recipients to copy the
|
|
||||||
Corresponding Source along with the object code. If the place to
|
|
||||||
copy the object code is a network server, the Corresponding Source
|
|
||||||
may be on a different server (operated by you or a third party)
|
|
||||||
that supports equivalent copying facilities, provided you maintain
|
|
||||||
clear directions next to the object code saying where to find the
|
|
||||||
Corresponding Source. Regardless of what server hosts the
|
|
||||||
Corresponding Source, you remain obligated to ensure that it is
|
|
||||||
available for as long as needed to satisfy these requirements.
|
|
||||||
|
|
||||||
e) Convey the object code using peer-to-peer transmission, provided
|
|
||||||
you inform other peers where the object code and Corresponding
|
|
||||||
Source of the work are being offered to the general public at no
|
|
||||||
charge under subsection 6d.
|
|
||||||
|
|
||||||
A separable portion of the object code, whose source code is excluded
|
|
||||||
from the Corresponding Source as a System Library, need not be
|
|
||||||
included in conveying the object code work.
|
|
||||||
|
|
||||||
A "User Product" is either (1) a "consumer product", which means any
|
|
||||||
tangible personal property which is normally used for personal, family,
|
|
||||||
or household purposes, or (2) anything designed or sold for incorporation
|
|
||||||
into a dwelling. In determining whether a product is a consumer product,
|
|
||||||
doubtful cases shall be resolved in favor of coverage. For a particular
|
|
||||||
product received by a particular user, "normally used" refers to a
|
|
||||||
typical or common use of that class of product, regardless of the status
|
|
||||||
of the particular user or of the way in which the particular user
|
|
||||||
actually uses, or expects or is expected to use, the product. A product
|
|
||||||
is a consumer product regardless of whether the product has substantial
|
|
||||||
commercial, industrial or non-consumer uses, unless such uses represent
|
|
||||||
the only significant mode of use of the product.
|
|
||||||
|
|
||||||
"Installation Information" for a User Product means any methods,
|
|
||||||
procedures, authorization keys, or other information required to install
|
|
||||||
and execute modified versions of a covered work in that User Product from
|
|
||||||
a modified version of its Corresponding Source. The information must
|
|
||||||
suffice to ensure that the continued functioning of the modified object
|
|
||||||
code is in no case prevented or interfered with solely because
|
|
||||||
modification has been made.
|
|
||||||
|
|
||||||
If you convey an object code work under this section in, or with, or
|
|
||||||
specifically for use in, a User Product, and the conveying occurs as
|
|
||||||
part of a transaction in which the right of possession and use of the
|
|
||||||
User Product is transferred to the recipient in perpetuity or for a
|
|
||||||
fixed term (regardless of how the transaction is characterized), the
|
|
||||||
Corresponding Source conveyed under this section must be accompanied
|
|
||||||
by the Installation Information. But this requirement does not apply
|
|
||||||
if neither you nor any third party retains the ability to install
|
|
||||||
modified object code on the User Product (for example, the work has
|
|
||||||
been installed in ROM).
|
|
||||||
|
|
||||||
The requirement to provide Installation Information does not include a
|
|
||||||
requirement to continue to provide support service, warranty, or updates
|
|
||||||
for a work that has been modified or installed by the recipient, or for
|
|
||||||
the User Product in which it has been modified or installed. Access to a
|
|
||||||
network may be denied when the modification itself materially and
|
|
||||||
adversely affects the operation of the network or violates the rules and
|
|
||||||
protocols for communication across the network.
|
|
||||||
|
|
||||||
Corresponding Source conveyed, and Installation Information provided,
|
|
||||||
in accord with this section must be in a format that is publicly
|
|
||||||
documented (and with an implementation available to the public in
|
|
||||||
source code form), and must require no special password or key for
|
|
||||||
unpacking, reading or copying.
|
|
||||||
|
|
||||||
7. Additional Terms.
|
|
||||||
|
|
||||||
"Additional permissions" are terms that supplement the terms of this
|
|
||||||
License by making exceptions from one or more of its conditions.
|
|
||||||
Additional permissions that are applicable to the entire Program shall
|
|
||||||
be treated as though they were included in this License, to the extent
|
|
||||||
that they are valid under applicable law. If additional permissions
|
|
||||||
apply only to part of the Program, that part may be used separately
|
|
||||||
under those permissions, but the entire Program remains governed by
|
|
||||||
this License without regard to the additional permissions.
|
|
||||||
|
|
||||||
When you convey a copy of a covered work, you may at your option
|
|
||||||
remove any additional permissions from that copy, or from any part of
|
|
||||||
it. (Additional permissions may be written to require their own
|
|
||||||
removal in certain cases when you modify the work.) You may place
|
|
||||||
additional permissions on material, added by you to a covered work,
|
|
||||||
for which you have or can give appropriate copyright permission.
|
|
||||||
|
|
||||||
Notwithstanding any other provision of this License, for material you
|
|
||||||
add to a covered work, you may (if authorized by the copyright holders of
|
|
||||||
that material) supplement the terms of this License with terms:
|
|
||||||
|
|
||||||
a) Disclaiming warranty or limiting liability differently from the
|
|
||||||
terms of sections 15 and 16 of this License; or
|
|
||||||
|
|
||||||
b) Requiring preservation of specified reasonable legal notices or
|
|
||||||
author attributions in that material or in the Appropriate Legal
|
|
||||||
Notices displayed by works containing it; or
|
|
||||||
|
|
||||||
c) Prohibiting misrepresentation of the origin of that material, or
|
|
||||||
requiring that modified versions of such material be marked in
|
|
||||||
reasonable ways as different from the original version; or
|
|
||||||
|
|
||||||
d) Limiting the use for publicity purposes of names of licensors or
|
|
||||||
authors of the material; or
|
|
||||||
|
|
||||||
e) Declining to grant rights under trademark law for use of some
|
|
||||||
trade names, trademarks, or service marks; or
|
|
||||||
|
|
||||||
f) Requiring indemnification of licensors and authors of that
|
|
||||||
material by anyone who conveys the material (or modified versions of
|
|
||||||
it) with contractual assumptions of liability to the recipient, for
|
|
||||||
any liability that these contractual assumptions directly impose on
|
|
||||||
those licensors and authors.
|
|
||||||
|
|
||||||
All other non-permissive additional terms are considered "further
|
|
||||||
restrictions" within the meaning of section 10. If the Program as you
|
|
||||||
received it, or any part of it, contains a notice stating that it is
|
|
||||||
governed by this License along with a term that is a further
|
|
||||||
restriction, you may remove that term. If a license document contains
|
|
||||||
a further restriction but permits relicensing or conveying under this
|
|
||||||
License, you may add to a covered work material governed by the terms
|
|
||||||
of that license document, provided that the further restriction does
|
|
||||||
not survive such relicensing or conveying.
|
|
||||||
|
|
||||||
If you add terms to a covered work in accord with this section, you
|
|
||||||
must place, in the relevant source files, a statement of the
|
|
||||||
additional terms that apply to those files, or a notice indicating
|
|
||||||
where to find the applicable terms.
|
|
||||||
|
|
||||||
Additional terms, permissive or non-permissive, may be stated in the
|
|
||||||
form of a separately written license, or stated as exceptions;
|
|
||||||
the above requirements apply either way.
|
|
||||||
|
|
||||||
8. Termination.
|
|
||||||
|
|
||||||
You may not propagate or modify a covered work except as expressly
|
|
||||||
provided under this License. Any attempt otherwise to propagate or
|
|
||||||
modify it is void, and will automatically terminate your rights under
|
|
||||||
this License (including any patent licenses granted under the third
|
|
||||||
paragraph of section 11).
|
|
||||||
|
|
||||||
However, if you cease all violation of this License, then your
|
|
||||||
license from a particular copyright holder is reinstated (a)
|
|
||||||
provisionally, unless and until the copyright holder explicitly and
|
|
||||||
finally terminates your license, and (b) permanently, if the copyright
|
|
||||||
holder fails to notify you of the violation by some reasonable means
|
|
||||||
prior to 60 days after the cessation.
|
|
||||||
|
|
||||||
Moreover, your license from a particular copyright holder is
|
|
||||||
reinstated permanently if the copyright holder notifies you of the
|
|
||||||
violation by some reasonable means, this is the first time you have
|
|
||||||
received notice of violation of this License (for any work) from that
|
|
||||||
copyright holder, and you cure the violation prior to 30 days after
|
|
||||||
your receipt of the notice.
|
|
||||||
|
|
||||||
Termination of your rights under this section does not terminate the
|
|
||||||
licenses of parties who have received copies or rights from you under
|
|
||||||
this License. If your rights have been terminated and not permanently
|
|
||||||
reinstated, you do not qualify to receive new licenses for the same
|
|
||||||
material under section 10.
|
|
||||||
|
|
||||||
9. Acceptance Not Required for Having Copies.
|
|
||||||
|
|
||||||
You are not required to accept this License in order to receive or
|
|
||||||
run a copy of the Program. Ancillary propagation of a covered work
|
|
||||||
occurring solely as a consequence of using peer-to-peer transmission
|
|
||||||
to receive a copy likewise does not require acceptance. However,
|
|
||||||
nothing other than this License grants you permission to propagate or
|
|
||||||
modify any covered work. These actions infringe copyright if you do
|
|
||||||
not accept this License. Therefore, by modifying or propagating a
|
|
||||||
covered work, you indicate your acceptance of this License to do so.
|
|
||||||
|
|
||||||
10. Automatic Licensing of Downstream Recipients.
|
|
||||||
|
|
||||||
Each time you convey a covered work, the recipient automatically
|
|
||||||
receives a license from the original licensors, to run, modify and
|
|
||||||
propagate that work, subject to this License. You are not responsible
|
|
||||||
for enforcing compliance by third parties with this License.
|
|
||||||
|
|
||||||
An "entity transaction" is a transaction transferring control of an
|
|
||||||
organization, or substantially all assets of one, or subdividing an
|
|
||||||
organization, or merging organizations. If propagation of a covered
|
|
||||||
work results from an entity transaction, each party to that
|
|
||||||
transaction who receives a copy of the work also receives whatever
|
|
||||||
licenses to the work the party's predecessor in interest had or could
|
|
||||||
give under the previous paragraph, plus a right to possession of the
|
|
||||||
Corresponding Source of the work from the predecessor in interest, if
|
|
||||||
the predecessor has it or can get it with reasonable efforts.
|
|
||||||
|
|
||||||
You may not impose any further restrictions on the exercise of the
|
|
||||||
rights granted or affirmed under this License. For example, you may
|
|
||||||
not impose a license fee, royalty, or other charge for exercise of
|
|
||||||
rights granted under this License, and you may not initiate litigation
|
|
||||||
(including a cross-claim or counterclaim in a lawsuit) alleging that
|
|
||||||
any patent claim is infringed by making, using, selling, offering for
|
|
||||||
sale, or importing the Program or any portion of it.
|
|
||||||
|
|
||||||
11. Patents.
|
|
||||||
|
|
||||||
A "contributor" is a copyright holder who authorizes use under this
|
|
||||||
License of the Program or a work on which the Program is based. The
|
|
||||||
work thus licensed is called the contributor's "contributor version".
|
|
||||||
|
|
||||||
A contributor's "essential patent claims" are all patent claims
|
|
||||||
owned or controlled by the contributor, whether already acquired or
|
|
||||||
hereafter acquired, that would be infringed by some manner, permitted
|
|
||||||
by this License, of making, using, or selling its contributor version,
|
|
||||||
but do not include claims that would be infringed only as a
|
|
||||||
consequence of further modification of the contributor version. For
|
|
||||||
purposes of this definition, "control" includes the right to grant
|
|
||||||
patent sublicenses in a manner consistent with the requirements of
|
|
||||||
this License.
|
|
||||||
|
|
||||||
Each contributor grants you a non-exclusive, worldwide, royalty-free
|
|
||||||
patent license under the contributor's essential patent claims, to
|
|
||||||
make, use, sell, offer for sale, import and otherwise run, modify and
|
|
||||||
propagate the contents of its contributor version.
|
|
||||||
|
|
||||||
In the following three paragraphs, a "patent license" is any express
|
|
||||||
agreement or commitment, however denominated, not to enforce a patent
|
|
||||||
(such as an express permission to practice a patent or covenant not to
|
|
||||||
sue for patent infringement). To "grant" such a patent license to a
|
|
||||||
party means to make such an agreement or commitment not to enforce a
|
|
||||||
patent against the party.
|
|
||||||
|
|
||||||
If you convey a covered work, knowingly relying on a patent license,
|
|
||||||
and the Corresponding Source of the work is not available for anyone
|
|
||||||
to copy, free of charge and under the terms of this License, through a
|
|
||||||
publicly available network server or other readily accessible means,
|
|
||||||
then you must either (1) cause the Corresponding Source to be so
|
|
||||||
available, or (2) arrange to deprive yourself of the benefit of the
|
|
||||||
patent license for this particular work, or (3) arrange, in a manner
|
|
||||||
consistent with the requirements of this License, to extend the patent
|
|
||||||
license to downstream recipients. "Knowingly relying" means you have
|
|
||||||
actual knowledge that, but for the patent license, your conveying the
|
|
||||||
covered work in a country, or your recipient's use of the covered work
|
|
||||||
in a country, would infringe one or more identifiable patents in that
|
|
||||||
country that you have reason to believe are valid.
|
|
||||||
|
|
||||||
If, pursuant to or in connection with a single transaction or
|
|
||||||
arrangement, you convey, or propagate by procuring conveyance of, a
|
|
||||||
covered work, and grant a patent license to some of the parties
|
|
||||||
receiving the covered work authorizing them to use, propagate, modify
|
|
||||||
or convey a specific copy of the covered work, then the patent license
|
|
||||||
you grant is automatically extended to all recipients of the covered
|
|
||||||
work and works based on it.
|
|
||||||
|
|
||||||
A patent license is "discriminatory" if it does not include within
|
|
||||||
the scope of its coverage, prohibits the exercise of, or is
|
|
||||||
conditioned on the non-exercise of one or more of the rights that are
|
|
||||||
specifically granted under this License. You may not convey a covered
|
|
||||||
work if you are a party to an arrangement with a third party that is
|
|
||||||
in the business of distributing software, under which you make payment
|
|
||||||
to the third party based on the extent of your activity of conveying
|
|
||||||
the work, and under which the third party grants, to any of the
|
|
||||||
parties who would receive the covered work from you, a discriminatory
|
|
||||||
patent license (a) in connection with copies of the covered work
|
|
||||||
conveyed by you (or copies made from those copies), or (b) primarily
|
|
||||||
for and in connection with specific products or compilations that
|
|
||||||
contain the covered work, unless you entered into that arrangement,
|
|
||||||
or that patent license was granted, prior to 28 March 2007.
|
|
||||||
|
|
||||||
Nothing in this License shall be construed as excluding or limiting
|
|
||||||
any implied license or other defenses to infringement that may
|
|
||||||
otherwise be available to you under applicable patent law.
|
|
||||||
|
|
||||||
12. No Surrender of Others' Freedom.
|
|
||||||
|
|
||||||
If conditions are imposed on you (whether by court order, agreement or
|
|
||||||
otherwise) that contradict the conditions of this License, they do not
|
|
||||||
excuse you from the conditions of this License. If you cannot convey a
|
|
||||||
covered work so as to satisfy simultaneously your obligations under this
|
|
||||||
License and any other pertinent obligations, then as a consequence you may
|
|
||||||
not convey it at all. For example, if you agree to terms that obligate you
|
|
||||||
to collect a royalty for further conveying from those to whom you convey
|
|
||||||
the Program, the only way you could satisfy both those terms and this
|
|
||||||
License would be to refrain entirely from conveying the Program.
|
|
||||||
|
|
||||||
13. Use with the GNU Affero General Public License.
|
|
||||||
|
|
||||||
Notwithstanding any other provision of this License, you have
|
|
||||||
permission to link or combine any covered work with a work licensed
|
|
||||||
under version 3 of the GNU Affero General Public License into a single
|
|
||||||
combined work, and to convey the resulting work. The terms of this
|
|
||||||
License will continue to apply to the part which is the covered work,
|
|
||||||
but the special requirements of the GNU Affero General Public License,
|
|
||||||
section 13, concerning interaction through a network will apply to the
|
|
||||||
combination as such.
|
|
||||||
|
|
||||||
14. Revised Versions of this License.
|
|
||||||
|
|
||||||
The Free Software Foundation may publish revised and/or new versions of
|
|
||||||
the GNU General Public License from time to time. Such new versions will
|
|
||||||
be similar in spirit to the present version, but may differ in detail to
|
|
||||||
address new problems or concerns.
|
|
||||||
|
|
||||||
Each version is given a distinguishing version number. If the
|
|
||||||
Program specifies that a certain numbered version of the GNU General
|
|
||||||
Public License "or any later version" applies to it, you have the
|
|
||||||
option of following the terms and conditions either of that numbered
|
|
||||||
version or of any later version published by the Free Software
|
|
||||||
Foundation. If the Program does not specify a version number of the
|
|
||||||
GNU General Public License, you may choose any version ever published
|
|
||||||
by the Free Software Foundation.
|
|
||||||
|
|
||||||
If the Program specifies that a proxy can decide which future
|
|
||||||
versions of the GNU General Public License can be used, that proxy's
|
|
||||||
public statement of acceptance of a version permanently authorizes you
|
|
||||||
to choose that version for the Program.
|
|
||||||
|
|
||||||
Later license versions may give you additional or different
|
|
||||||
permissions. However, no additional obligations are imposed on any
|
|
||||||
author or copyright holder as a result of your choosing to follow a
|
|
||||||
later version.
|
|
||||||
|
|
||||||
15. Disclaimer of Warranty.
|
|
||||||
|
|
||||||
THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
|
|
||||||
APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
|
|
||||||
HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
|
|
||||||
OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
|
|
||||||
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
||||||
PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
|
|
||||||
IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
|
|
||||||
ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
|
|
||||||
|
|
||||||
16. Limitation of Liability.
|
|
||||||
|
|
||||||
IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
|
|
||||||
WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
|
|
||||||
THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
|
|
||||||
GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
|
|
||||||
USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
|
|
||||||
DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
|
|
||||||
PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
|
|
||||||
EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
|
|
||||||
SUCH DAMAGES.
|
|
||||||
|
|
||||||
17. Interpretation of Sections 15 and 16.
|
|
||||||
|
|
||||||
If the disclaimer of warranty and limitation of liability provided
|
|
||||||
above cannot be given local legal effect according to their terms,
|
|
||||||
reviewing courts shall apply local law that most closely approximates
|
|
||||||
an absolute waiver of all civil liability in connection with the
|
|
||||||
Program, unless a warranty or assumption of liability accompanies a
|
|
||||||
copy of the Program in return for a fee.
|
|
||||||
|
|
||||||
END OF TERMS AND CONDITIONS
|
|
||||||
|
|
||||||
How to Apply These Terms to Your New Programs
|
|
||||||
|
|
||||||
If you develop a new program, and you want it to be of the greatest
|
|
||||||
possible use to the public, the best way to achieve this is to make it
|
|
||||||
free software which everyone can redistribute and change under these terms.
|
|
||||||
|
|
||||||
To do so, attach the following notices to the program. It is safest
|
|
||||||
to attach them to the start of each source file to most effectively
|
|
||||||
state the exclusion of warranty; and each file should have at least
|
|
||||||
the "copyright" line and a pointer to where the full notice is found.
|
|
||||||
|
|
||||||
<one line to give the program's name and a brief idea of what it does.>
|
|
||||||
Copyright (C) <year> <name of author>
|
|
||||||
|
|
||||||
This program is free software: you can redistribute it and/or modify
|
|
||||||
it under the terms of the GNU General Public License as published by
|
|
||||||
the Free Software Foundation, either version 3 of the License, or
|
|
||||||
(at your option) any later version.
|
|
||||||
|
|
||||||
This program is distributed in the hope that it will be useful,
|
|
||||||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
||||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
||||||
GNU General Public License for more details.
|
|
||||||
|
|
||||||
You should have received a copy of the GNU General Public License
|
|
||||||
along with this program. If not, see <http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
Also add information on how to contact you by electronic and paper mail.
|
|
||||||
|
|
||||||
If the program does terminal interaction, make it output a short
|
|
||||||
notice like this when it starts in an interactive mode:
|
|
||||||
|
|
||||||
<program> Copyright (C) <year> <name of author>
|
|
||||||
This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
|
|
||||||
This is free software, and you are welcome to redistribute it
|
|
||||||
under certain conditions; type `show c' for details.
|
|
||||||
|
|
||||||
The hypothetical commands `show w' and `show c' should show the appropriate
|
|
||||||
parts of the General Public License. Of course, your program's commands
|
|
||||||
might be different; for a GUI interface, you would use an "about box".
|
|
||||||
|
|
||||||
You should also get your employer (if you work as a programmer) or school,
|
|
||||||
if any, to sign a "copyright disclaimer" for the program, if necessary.
|
|
||||||
For more information on this, and how to apply and follow the GNU GPL, see
|
|
||||||
<http://www.gnu.org/licenses/>.
|
|
||||||
|
|
||||||
The GNU General Public License does not permit incorporating your program
|
|
||||||
into proprietary programs. If your program is a subroutine library, you
|
|
||||||
may consider it more useful to permit linking proprietary applications with
|
|
||||||
the library. If this is what you want to do, use the GNU Lesser General
|
|
||||||
Public License instead of this License. But first, please read
|
|
||||||
<http://www.gnu.org/philosophy/why-not-lgpl.html>.
|
|
||||||
|
|
||||||
91
Makefile
91
Makefile
|
|
@ -1,91 +0,0 @@
|
||||||
.PHONY: run clean install all gl_test
|
|
||||||
.DELETE_ON_ERROR: $(BINDIR)/Getting_Started_with_GTK
|
|
||||||
.DEFAULT_GOAL: all
|
|
||||||
|
|
||||||
CPUS ?= $(shell (nproc --all || sysctl -n hw.ncpu) 2>/dev/null || echo 1)
|
|
||||||
MAKEFLAGS += --jobs=$(CPUS)
|
|
||||||
|
|
||||||
CC=gcc
|
|
||||||
CFLAGS=`pkg-config --cflags gtk4 epoxy glib-2.0 libxml-2.0`
|
|
||||||
LDFLAGS=`pkg-config --libs gtk4 epoxy glib-2.0 libxml-2.0` -lGL -lGLU -lm -lepoxy -lX11 -lGLEW
|
|
||||||
WARNINGS = -Wall
|
|
||||||
DEBUG = -ggdb -fno-omit-frame-pointer #-fdiagnostics-color=always -fsanitize=bounds -fstack-check
|
|
||||||
OPTIMIZE = -O3
|
|
||||||
|
|
||||||
BINDIR=bin
|
|
||||||
BUILDDIR=build
|
|
||||||
SRCDIR=src
|
|
||||||
|
|
||||||
SOURCES = $(shell find $(SRCDIR) -type f -name "*.c")
|
|
||||||
OBJECTS = $(patsubst %.c,$(BUILDDIR)/%.o,$(SOURCES))
|
|
||||||
DEPENDENCIES = $(patsubst %.c,$(BUILDDIR)/%.d,$(SOURCES))
|
|
||||||
|
|
||||||
sandbox: opengl_sandbox/main.c
|
|
||||||
$(CC) $(CFLAGS) $(LDFLAGS) $(WARNINGS) $(DEBUG)-o $@ $<
|
|
||||||
|
|
||||||
gl_run: sandbox
|
|
||||||
./$<
|
|
||||||
|
|
||||||
gl_clean:
|
|
||||||
rm sandbox
|
|
||||||
|
|
||||||
all: $(BINDIR)/gem-graph-client
|
|
||||||
|
|
||||||
-include /etc/os-release
|
|
||||||
|
|
||||||
#
|
|
||||||
# Directories
|
|
||||||
#
|
|
||||||
$(BUILDDIR):
|
|
||||||
@mkdir -p $@
|
|
||||||
@echo " MKDIR $@"
|
|
||||||
|
|
||||||
$(BINDIR):
|
|
||||||
@mkdir -p $@
|
|
||||||
@echo " MKDIR $@"
|
|
||||||
|
|
||||||
#
|
|
||||||
# Dependencies
|
|
||||||
#
|
|
||||||
-include $(DEPENDENCIES)
|
|
||||||
|
|
||||||
$(BUILDDIR)/%.d: %.c Makefile | $(BUILDDIR)
|
|
||||||
@mkdir -p $(shell dirname $@)
|
|
||||||
@$(CC) $(CFLAGS) -MM -MT $(@:%.d=%.o) -MF $@ $<
|
|
||||||
@echo " DEP $@"
|
|
||||||
|
|
||||||
#
|
|
||||||
# Main program
|
|
||||||
#
|
|
||||||
$(BINDIR)/gem-graph-client: $(OBJECTS) | $(BINDIR)
|
|
||||||
@$(CC) $(LDFLAGS) $(WARNINGS) $(DEBUG) $(OPTIMIZE) $^ -o $@
|
|
||||||
@echo " LD $@"
|
|
||||||
|
|
||||||
#
|
|
||||||
# Objects
|
|
||||||
#
|
|
||||||
$(BUILDDIR)/%.o: %.c Makefile | $(BUILDDIR)
|
|
||||||
@mkdir -p $(shell dirname $@)
|
|
||||||
@$(CC) $(CFLAGS) $(WARNINGS) $(DEBUG) $(OPTIMIZE) -c $< -o $@
|
|
||||||
@echo " CC $@"
|
|
||||||
|
|
||||||
#
|
|
||||||
# Virtual recipes
|
|
||||||
#
|
|
||||||
install:
|
|
||||||
@echo "Installing is not supported"
|
|
||||||
|
|
||||||
run: $(BINDIR)/gem-graph-client
|
|
||||||
$(BINDIR)/gem-graph-client
|
|
||||||
|
|
||||||
clean:
|
|
||||||
@rm -rf $(BINDIR)
|
|
||||||
@echo " RM $(BINDIR)"
|
|
||||||
@rm -rf $(BUILDDIR)
|
|
||||||
@echo " RM $(BUILDDIR)"
|
|
||||||
|
|
||||||
|
|
||||||
# More docs :
|
|
||||||
# https://www.gnu.org/software/make/manual/
|
|
||||||
# accessoirement : https://blog.stephane-robert.info/docs/makefile/ & /docs/task/
|
|
||||||
|
|
||||||
804
audit/2024-07-14
804
audit/2024-07-14
|
|
@ -1,804 +0,0 @@
|
||||||
<!DOCTYPE html>
|
|
||||||
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="" lang=""><head>
|
|
||||||
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
|
|
||||||
<meta charset="utf-8">
|
|
||||||
<meta name="generator" content="pandoc">
|
|
||||||
<meta name="viewport" content="width=device-width, initial-scale=1.0, user-scalable=yes">
|
|
||||||
<title>-</title>
|
|
||||||
<style>
|
|
||||||
html {
|
|
||||||
line-height: 1.5;
|
|
||||||
font-family: Georgia, serif;
|
|
||||||
font-size: 20px;
|
|
||||||
color: #1a1a1a;
|
|
||||||
background-color: #fdfdfd;
|
|
||||||
}
|
|
||||||
body {
|
|
||||||
margin: 0 auto;
|
|
||||||
max-width: 36em;
|
|
||||||
padding-left: 50px;
|
|
||||||
padding-right: 50px;
|
|
||||||
padding-top: 50px;
|
|
||||||
padding-bottom: 50px;
|
|
||||||
hyphens: auto;
|
|
||||||
overflow-wrap: break-word;
|
|
||||||
text-rendering: optimizeLegibility;
|
|
||||||
font-kerning: normal;
|
|
||||||
}
|
|
||||||
@media (max-width: 600px) {
|
|
||||||
body {
|
|
||||||
font-size: 0.9em;
|
|
||||||
padding: 1em;
|
|
||||||
}
|
|
||||||
h1 {
|
|
||||||
font-size: 1.8em;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
@media print {
|
|
||||||
body {
|
|
||||||
background-color: transparent;
|
|
||||||
color: black;
|
|
||||||
font-size: 12pt;
|
|
||||||
}
|
|
||||||
p, h2, h3 {
|
|
||||||
orphans: 3;
|
|
||||||
widows: 3;
|
|
||||||
}
|
|
||||||
h2, h3, h4 {
|
|
||||||
page-break-after: avoid;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
p {
|
|
||||||
margin: 1em 0;
|
|
||||||
}
|
|
||||||
a {
|
|
||||||
color: #1a1a1a;
|
|
||||||
}
|
|
||||||
a:visited {
|
|
||||||
color: #1a1a1a;
|
|
||||||
}
|
|
||||||
img {
|
|
||||||
max-width: 100%;
|
|
||||||
}
|
|
||||||
h1, h2, h3, h4, h5, h6 {
|
|
||||||
margin-top: 1.4em;
|
|
||||||
}
|
|
||||||
h5, h6 {
|
|
||||||
font-size: 1em;
|
|
||||||
font-style: italic;
|
|
||||||
}
|
|
||||||
h6 {
|
|
||||||
font-weight: normal;
|
|
||||||
}
|
|
||||||
ol, ul {
|
|
||||||
padding-left: 1.7em;
|
|
||||||
margin-top: 1em;
|
|
||||||
}
|
|
||||||
li > ol, li > ul {
|
|
||||||
margin-top: 0;
|
|
||||||
}
|
|
||||||
blockquote {
|
|
||||||
margin: 1em 0 1em 1.7em;
|
|
||||||
padding-left: 1em;
|
|
||||||
border-left: 2px solid #e6e6e6;
|
|
||||||
color: #606060;
|
|
||||||
}
|
|
||||||
code {
|
|
||||||
font-family: Menlo, Monaco, 'Lucida Console', Consolas, monospace;
|
|
||||||
font-size: 85%;
|
|
||||||
margin: 0;
|
|
||||||
}
|
|
||||||
pre {
|
|
||||||
margin: 1em 0;
|
|
||||||
overflow: auto;
|
|
||||||
}
|
|
||||||
pre code {
|
|
||||||
padding: 0;
|
|
||||||
overflow: visible;
|
|
||||||
overflow-wrap: normal;
|
|
||||||
}
|
|
||||||
.sourceCode {
|
|
||||||
background-color: transparent;
|
|
||||||
overflow: visible;
|
|
||||||
}
|
|
||||||
hr {
|
|
||||||
background-color: #1a1a1a;
|
|
||||||
border: none;
|
|
||||||
height: 1px;
|
|
||||||
margin: 1em 0;
|
|
||||||
}
|
|
||||||
table {
|
|
||||||
margin: 1em 0;
|
|
||||||
border-collapse: collapse;
|
|
||||||
width: 100%;
|
|
||||||
overflow-x: auto;
|
|
||||||
display: block;
|
|
||||||
font-variant-numeric: lining-nums tabular-nums;
|
|
||||||
}
|
|
||||||
table caption {
|
|
||||||
margin-bottom: 0.75em;
|
|
||||||
}
|
|
||||||
tbody {
|
|
||||||
margin-top: 0.5em;
|
|
||||||
border-top: 1px solid #1a1a1a;
|
|
||||||
border-bottom: 1px solid #1a1a1a;
|
|
||||||
}
|
|
||||||
th {
|
|
||||||
border-top: 1px solid #1a1a1a;
|
|
||||||
padding: 0.25em 0.5em 0.25em 0.5em;
|
|
||||||
}
|
|
||||||
td {
|
|
||||||
padding: 0.125em 0.5em 0.25em 0.5em;
|
|
||||||
}
|
|
||||||
header {
|
|
||||||
margin-bottom: 4em;
|
|
||||||
text-align: center;
|
|
||||||
}
|
|
||||||
#TOC li {
|
|
||||||
list-style: none;
|
|
||||||
}
|
|
||||||
#TOC ul {
|
|
||||||
padding-left: 1.3em;
|
|
||||||
}
|
|
||||||
#TOC > ul {
|
|
||||||
padding-left: 0;
|
|
||||||
}
|
|
||||||
#TOC a:not(:hover) {
|
|
||||||
text-decoration: none;
|
|
||||||
}
|
|
||||||
code{white-space: pre-wrap;}
|
|
||||||
span.smallcaps{font-variant: small-caps;}
|
|
||||||
div.columns{display: flex; gap: min(4vw, 1.5em);}
|
|
||||||
div.column{flex: auto; overflow-x: auto;}
|
|
||||||
div.hanging-indent{margin-left: 1.5em; text-indent: -1.5em;}
|
|
||||||
ul.task-list{list-style: none;}
|
|
||||||
ul.task-list li input[type="checkbox"] {
|
|
||||||
width: 0.8em;
|
|
||||||
margin: 0 0.8em 0.2em -1.6em;
|
|
||||||
vertical-align: middle;
|
|
||||||
}
|
|
||||||
</style>
|
|
||||||
<!--[if lt IE 9]>
|
|
||||||
<script src="//cdnjs.cloudflare.com/ajax/libs/html5shiv/3.7.3/html5shiv-printshiv.min.js"></script>
|
|
||||||
<![endif]-->
|
|
||||||
</head>
|
|
||||||
<body>
|
|
||||||
<h1 id="gem-graph-client">Gem-graph client</h1>
|
|
||||||
<p>version <code>0.0</code> commit
|
|
||||||
<code>8ce7191df3652ddd6284c4ac6d8d42c3cf32d2d5</code></p>
|
|
||||||
<h2 id="audit-de-code-source-et-structure-de-projet">Audit de code
|
|
||||||
source et structure de projet</h2>
|
|
||||||
<h3 id="arborescence-des-sources">Arborescence des sources</h3>
|
|
||||||
<p>Voici l’arborescence de la version actuelle du projet.</p>
|
|
||||||
<pre><code>├── data
|
|
||||||
│ ├── dimers random walk.xml
|
|
||||||
│ ├── image
|
|
||||||
│ │ ├── [...]
|
|
||||||
│ └── text
|
|
||||||
│ ├── [...]
|
|
||||||
├── include
|
|
||||||
│ ├── automat.h
|
|
||||||
│ ├── base.h
|
|
||||||
│ ├── calls.h
|
|
||||||
│ ├── graph.h
|
|
||||||
│ ├── parse.h
|
|
||||||
│ └── widgets.h
|
|
||||||
├── Makefile
|
|
||||||
├── manifest.scm
|
|
||||||
├── [...]
|
|
||||||
└── src
|
|
||||||
├── automat.c
|
|
||||||
├── calls.c
|
|
||||||
├── graph.c
|
|
||||||
│ ├── area.c
|
|
||||||
│ ├── draw.c
|
|
||||||
│ ├── grid.c
|
|
||||||
│ ├── init.c
|
|
||||||
│ ├── shader.frag
|
|
||||||
│ ├── shader.vert
|
|
||||||
│ └── stack.c
|
|
||||||
├── main.c
|
|
||||||
├── parse.c
|
|
||||||
└── widget.c
|
|
||||||
├── heads.c
|
|
||||||
├── labo.c
|
|
||||||
├── rules.c
|
|
||||||
├── state.c
|
|
||||||
├── stock.c
|
|
||||||
└── tree.c
|
|
||||||
|
|
||||||
8 dossiers, 46 fichiers</code></pre>
|
|
||||||
<p>Un certain nombre d’élements doivent être respectés :</p>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">séparation
|
|
||||||
code/headers</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">séparation
|
|
||||||
data/code</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">prise en compte de
|
|
||||||
la structure dans le Makefile</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">1 header = 1
|
|
||||||
sous-dossier ou fichier de <code>src</code>, excepté
|
|
||||||
<code>base.h</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">chaque sous-dossier
|
|
||||||
de <code>src</code> constitue un module clairement défini</li>
|
|
||||||
</ul>
|
|
||||||
<p>Erreurs critiques :</p>
|
|
||||||
<ul>
|
|
||||||
<li>les sous-dossiers de <code>src</code> sont nommés comme des fichiers
|
|
||||||
(<code>*.c</code>)</li>
|
|
||||||
<li>le module <code>widget</code> est mal nommé car il est pointé par le
|
|
||||||
header <code>widgets.h</code></li>
|
|
||||||
</ul>
|
|
||||||
<h3 id="analyse-formelle-des-sources">Analyse formelle des sources</h3>
|
|
||||||
<p>Généralités :</p>
|
|
||||||
<ul>
|
|
||||||
<li>le style du code manque de systématisme
|
|
||||||
<ul>
|
|
||||||
<li>la longueur des tabulations varie entre les fichiers</li>
|
|
||||||
</ul></li>
|
|
||||||
<li>beaucoup de problèmes critiques (voir ci-après)</li>
|
|
||||||
</ul>
|
|
||||||
<h4 id="analyse-des-headers">Analyse des headers</h4>
|
|
||||||
<p>Problèmes critiques relevés :</p>
|
|
||||||
<ul>
|
|
||||||
<li>3 headers sont mal nommés</li>
|
|
||||||
<li>6 headers contiennent un en-tête de licence valide selon la norme
|
|
||||||
SPDX</li>
|
|
||||||
<li>4 headers ne contiennent une directive <code>pragma once</code></li>
|
|
||||||
<li>0 headers incluent <code>base.h</code> indûment</li>
|
|
||||||
<li>1 headers n’ont pas un style de commentaire minimal et
|
|
||||||
systématique</li>
|
|
||||||
<li>5 headers n’ont pas un style de code/déclaration du projet
|
|
||||||
respecté</li>
|
|
||||||
<li>1 headers ne présentent pas des commentaires clairs et utiles</li>
|
|
||||||
<li>5 headers ont au moins une fonction non documentée</li>
|
|
||||||
<li>3 headers nomment mal les fonctions du module</li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="baseh-critique-à-retravailler">base.h <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">contient une
|
|
||||||
directive <code>pragma once</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">n’inclut pas
|
|
||||||
<code>base.h</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de commentaire minimal et
|
|
||||||
systématique<ul>
|
|
||||||
<li>commentaires au style non systématiques</li>
|
|
||||||
<li>symboles inutiles (<)</li>
|
|
||||||
<li>espacement incorrect</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>enum et struct invalides</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">chaque fonction est
|
|
||||||
documentée</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">chaque fonction est
|
|
||||||
nommée selon le module (non applicable)</li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="automath-critique-à-retravailler">automat.h
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>automate est un terme français non traduisible pour ce contexte</li>
|
|
||||||
<li>le terme habituel en informatique est Finite State Machine</li>
|
|
||||||
<li>fsm.h ? (serait compris par le plus grand nombre)</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient une directive
|
|
||||||
<code>pragma once</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">n’inclut pas
|
|
||||||
<code>base.h</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>enum invalides</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li><code>xor</code> est totalement incompréhensible et inutile</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est
|
|
||||||
documentée</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est nommée
|
|
||||||
selon le module<ul>
|
|
||||||
<li>les fonctions ne portent pas le préfixe <code>automat_</code></li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="callsh-critique-à-retravailler">calls.h <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>calls != callbacks, titre trompeur</li>
|
|
||||||
<li>calls => syscalls… or ça n’a rien à voir !!!</li>
|
|
||||||
<li>GTK appelle callbacks ce que la théorie nomme évènements (voir
|
|
||||||
“programmation évenementielle”)</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient une directive
|
|
||||||
<code>pragma once</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">n’inclut pas
|
|
||||||
<code>base.h</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères par ligne</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est
|
|
||||||
documentée</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">chaque fonction est
|
|
||||||
nommée selon le module<ul>
|
|
||||||
<li>les fonctions portent le préfixe <code>on_</code>, courant pour un
|
|
||||||
module d’évènements</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="graphh-critique-à-retravailler">graph.h <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>graph != graphics, titre trompeur</li>
|
|
||||||
<li>en anglais, graph est un mot complet et pas l’abbréviation de
|
|
||||||
graphics</li>
|
|
||||||
<li>confusion avec le graph de gem-graph…</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">contient une
|
|
||||||
directive <code>pragma once</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">inclut
|
|
||||||
<code>base.h</code> (ok car types utilisés)</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères par ligne</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est
|
|
||||||
documentée</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">chaque fonction est
|
|
||||||
nommée selon le module<ul>
|
|
||||||
<li>les fonctions portent le préfixe <code>graph_</code></li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="parseh-critique-à-retravailler">parse.h <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient une directive
|
|
||||||
<code>pragma once</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">n’inclut pas
|
|
||||||
<code>base.h</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de
|
|
||||||
code/déclaration du projet respecté</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est
|
|
||||||
documentée</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est nommée
|
|
||||||
selon le module<ul>
|
|
||||||
<li>les fonctions ne portent pas le préfixe <code>parse_</code></li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="widgetsh-critique-à-retravailler">widgets.h
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient une directive
|
|
||||||
<code>pragma once</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">n’inclut pas
|
|
||||||
<code>base.h</code></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite des 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est
|
|
||||||
documentée</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">chaque fonction est nommée
|
|
||||||
selon le module<ul>
|
|
||||||
<li>les fonctions ne portent pas toutes le préfixe
|
|
||||||
<code>widget_</code></li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h4 id="analyse-du-code">Analyse du code</h4>
|
|
||||||
<p>Problèmes critiques relevés :</p>
|
|
||||||
<ul>
|
|
||||||
<li>9 fichiers de code ou module sont mal nommés</li>
|
|
||||||
<li>15 fichiers de code contiennent un en-tête de licence valide selon
|
|
||||||
la norme SPDX</li>
|
|
||||||
<li>3 fichiers de code n’ont pas un style de commentaire minimal et
|
|
||||||
systématique</li>
|
|
||||||
<li>12 fichiers de code n’ont pas un style de code/déclaration du projet
|
|
||||||
respecté</li>
|
|
||||||
<li>13 fichiers de code ne présentent pas des commentaires clairs et
|
|
||||||
utiles</li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="mainc-critique-à-retravailler">main.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul>
|
|
||||||
<li><p><input type="checkbox" disabled="disabled" checked="checked">le nom est clair
|
|
||||||
et correspond à une fonctionnalité</p></li>
|
|
||||||
<li><p><input type="checkbox" disabled="disabled">contient un en-tête de
|
|
||||||
licence valide selon la norme SPDX</p></li>
|
|
||||||
<li><p><input type="checkbox" disabled="disabled" checked="checked">style de
|
|
||||||
commentaire minimal et systématique</p></li>
|
|
||||||
<li><p><input type="checkbox" disabled="disabled" checked="checked">style de
|
|
||||||
code/déclaration du projet respecté</p></li>
|
|
||||||
<li><p><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires</p></li>
|
|
||||||
<li><p><code>@:340</code> l’id de l’application est incohérent</p></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="automatc-critique-à-retravailler">automat.c
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h5>
|
|
||||||
<ul>
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>commentaires inline complètement incompréhensibles/cryptiques</li>
|
|
||||||
<li>documentation des fonctions statiques absente</li>
|
|
||||||
</ul></li>
|
|
||||||
<li>le formattage de variables en mi-minuscule mi-majuscule est
|
|
||||||
illisible</li>
|
|
||||||
<li>l’utilisation du terme “prescribed” est inhabituel et
|
|
||||||
incompréhensible</li>
|
|
||||||
<li><code>@:101:get_str_STATE_RULES_DATA()</code> très sous-optimal
|
|
||||||
<ul>
|
|
||||||
<li>on ne devrait jamais retourner des chaînes de caractères.</li>
|
|
||||||
<li>un tableau de hashage ferait mieux l’affaire qu’une fonction avec un
|
|
||||||
switch</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="callsc-critique-à-retravailler">calls.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul>
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>documentation des fonctions statiques absente</li>
|
|
||||||
<li>certains commentaires perfectibles</li>
|
|
||||||
</ul></li>
|
|
||||||
<li>le formattage de fonction en mi-minuscule mi-majuscule est
|
|
||||||
illisible</li>
|
|
||||||
<li>de manière générale, le nommage des évènements est peu clair
|
|
||||||
<ul>
|
|
||||||
<li>il faut séparer l’outil de ce qu’il représente (bouton vs
|
|
||||||
états)</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><code>@:249:switch_STATE_RULES_DATA()</code>
|
|
||||||
<ul>
|
|
||||||
<li>le switch pourrait être remplacé par une table de hashage de
|
|
||||||
pointeurs sur fonction (beaucoup plus optimal)</li>
|
|
||||||
<li>le nommage de cette fonction est trompeur (ça ne switch pas
|
|
||||||
l’état)</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="parsec-critique-à-retravailler">parse.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>documentation des fonctions statiques absente</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="module-graphc-critique-à-retravailler">module graph.c
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité</li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="areac-critique-à-retravailler">area.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>ne gère pas une “area” mais gère une pile d’area et leurs
|
|
||||||
environnements</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>manque pas mal de commentaires, des fonctions sont documentés au
|
|
||||||
mauvais endroit</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="drawc-critique-à-retravailler">draw.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>ne gère pas une “area” mais gère une pile d’area et leurs
|
|
||||||
environnements</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>manque pas mal de commentaires, des fonctions sont documentés au
|
|
||||||
mauvais endroit</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="gridc-critique-à-retravailler">grid.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de commentaire minimal et
|
|
||||||
systématique<ul>
|
|
||||||
<li>les commentaires inline sont mal formatés</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>QUASI RIEN !</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="initc-critique-à-retravailler">init.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement de la limite de 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">clarté et utilité
|
|
||||||
des commentaires<ul>
|
|
||||||
<li>peut toujours mieux faire mais ok</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="shaderfrag-critique-à-retravailler">shader.frag
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de
|
|
||||||
code/déclaration du projet respecté</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>à commenter</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="shadervert-critique-à-retravailler">shader.vert
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de
|
|
||||||
code/déclaration du projet respecté</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>à commenter</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="stackc-critique-à-retravailler">stack.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de
|
|
||||||
code/déclaration du projet respecté</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>il faut commenter davantage, c’est trop peu</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h5 id="module-widgetc-critique-à-retravailler">module widget.c
|
|
||||||
<code>[critique]</code> <code>[à retravailler]</code></h5>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="headsc-critique-à-retravailler">heads.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>heads != headers…</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement limite 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>il faut commenter, quasi rien de fait</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="laboc-critique-à-retravailler">labo.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<p><em>You who enter here, leave all hope of an understandable
|
|
||||||
code</em></p>
|
|
||||||
<p>Ok, je saute.</p>
|
|
||||||
<h6 id="rulesc-critique-à-retravailler">rules.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul>
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>confusion entre l’outil (les arbres, les treeview, etc) et la
|
|
||||||
structure de données affichée (règles).</li>
|
|
||||||
<li>à nommer différemment, selon la fonction réelle</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement limite 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>il faut commenter, quasi rien de fait</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><code>@:32</code> En GTK4, il ne faut jamais utiliser la taille de
|
|
||||||
fenêtre comme comme référence ou aide au layout. Ce n’est pas dans
|
|
||||||
l’esprit de l’API. On utilisera plutôt les méthodes de layout (GtkGrid
|
|
||||||
par exemple).</li>
|
|
||||||
<li>de manière générale : les fonctions commençant par <code>get</code>
|
|
||||||
devraient être des des getters. C’est à dire renvoyer des valeurs et non
|
|
||||||
pas des widgets ! C’est un nommage trompeur et problématique.</li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="statec-critique-à-retravailler">state.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul>
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>nom trop commun et pas assez clair</li>
|
|
||||||
<li>state machine (c’est ce que c’est) mais en terme de widget ?</li>
|
|
||||||
<li>séparer la logique des widgets est nécessaire</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de commentaire minimal et
|
|
||||||
systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement limite 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>il faut commenter, quasi rien de fait</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><code>@:34</code> En GTK4, il ne faut jamais utiliser la taille de
|
|
||||||
fenêtre comme comme référence ou aide au layout. Ce n’est pas dans
|
|
||||||
l’esprit de l’API. On utilisera plutôt les méthodes de layout (GtkGrid
|
|
||||||
par exemple).</li>
|
|
||||||
<li>de manière générale : les fonctions commençant par <code>get</code>
|
|
||||||
devraient être des des getters. C’est à dire renvoyer des valeurs et non
|
|
||||||
pas des widgets ! C’est un nommage trompeur et problématique.</li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="stockc-critique-à-retravailler">stock.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled">le nom est clair et correspond
|
|
||||||
à une fonctionnalité<ul>
|
|
||||||
<li>???</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">style de commentaire
|
|
||||||
minimal et systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement limite 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>pas du tout commenté</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
<h6 id="treec-critique-à-retravailler">tree.c <code>[critique]</code>
|
|
||||||
<code>[à retravailler]</code></h6>
|
|
||||||
<ul class="task-list">
|
|
||||||
<li><input type="checkbox" disabled="disabled" checked="checked">le nom est clair et
|
|
||||||
correspond à une fonctionnalité</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">contient un en-tête de licence
|
|
||||||
valide selon la norme SPDX</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de commentaire minimal et
|
|
||||||
systématique</li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">style de code/déclaration du
|
|
||||||
projet respecté<ul>
|
|
||||||
<li>dépassement limite 80 caractères</li>
|
|
||||||
</ul></li>
|
|
||||||
<li><input type="checkbox" disabled="disabled">clarté et utilité des
|
|
||||||
commentaires<ul>
|
|
||||||
<li>pas assez commenté</li>
|
|
||||||
</ul></li>
|
|
||||||
</ul>
|
|
||||||
|
|
||||||
|
|
||||||
</body></html>
|
|
||||||
|
|
@ -1,118 +0,0 @@
|
||||||
<?xml version="1.0" encoding="UTF-8"?>
|
|
||||||
<gem-graph-model version="0.2.1">
|
|
||||||
|
|
||||||
<identity>
|
|
||||||
<name>Modèle de test</name>
|
|
||||||
|
|
||||||
<owner>Léontine Patinette</owner>
|
|
||||||
|
|
||||||
<owner_id>2</owner_id>
|
|
||||||
|
|
||||||
<date>1630000000</date>
|
|
||||||
|
|
||||||
<version>1.0</version>
|
|
||||||
|
|
||||||
<g_ref id="Cause" date="1630000000" author="toujours" lang="en">Ref</g_ref>
|
|
||||||
</identity>
|
|
||||||
|
|
||||||
<parameters id="texte" date="0" author="Léontine Trottine.">
|
|
||||||
<simulation>
|
|
||||||
<max_thread>0</max_thread>
|
|
||||||
<max_cycles>9</max_cycles>
|
|
||||||
|
|
||||||
</simulation>
|
|
||||||
|
|
||||||
<space-param>
|
|
||||||
<!-- loop_on_zero="true" anything moved before zero reenters at the end of space-->
|
|
||||||
<!-- loop_on_zero="false" anything moved before zero is lost-->
|
|
||||||
<!-- loop_on_max="true" anything moved beyond max reenters at the zero of space-->
|
|
||||||
<!-- loop_on_max="false" anything moved beyond max is lost-->
|
|
||||||
|
|
||||||
<dimension x="29"/>
|
|
||||||
|
|
||||||
<!-- Site_multiplicity = number of sites in a space unit. -->
|
|
||||||
<!-- Each site points towards a neighbouring space unit. -->
|
|
||||||
<!-- Several arrows can be stacked in the same site. -->
|
|
||||||
|
|
||||||
<site_multiplicity>3</site_multiplicity>
|
|
||||||
|
|
||||||
</space-param>
|
|
||||||
|
|
||||||
</parameters>
|
|
||||||
|
|
||||||
<!-- Model objects definition -->
|
|
||||||
|
|
||||||
<objects id="only dimers in this model" date="1630000000" author="inanimés,... âme ?">
|
|
||||||
<object id="a dimer" date="1630000000" author="Alphonse">
|
|
||||||
<arrow site="1" weight="1" x="0"/>
|
|
||||||
<arrow site="2" weight="1" x="1"/>
|
|
||||||
</object>
|
|
||||||
|
|
||||||
</objects>
|
|
||||||
|
|
||||||
|
|
||||||
<!-- Saved space description (initial space is sequence 0) -->
|
|
||||||
|
|
||||||
<savedstates id="texte" date="1630000000" author="Qui courrait dans l'herbe'">
|
|
||||||
<state id="initial" date="1630000000" author="Une souris verte">
|
|
||||||
<arrow site="0" weight="1" x="0"/>
|
|
||||||
<arrow site="1" weight="1" x="1"/>
|
|
||||||
<arrow site="0" weight="1" x="10"/>
|
|
||||||
<arrow site="1" weight="1" x="11"/>
|
|
||||||
<arrow site="0" weight="1" x="20"/>
|
|
||||||
<arrow site="1" weight="1" x="21"/>
|
|
||||||
|
|
||||||
<!-- Three dimers 1-1 are drawn in the global space
|
|
||||||
at locations (0,1) (10,11) and (20,21) -->
|
|
||||||
|
|
||||||
</state>
|
|
||||||
|
|
||||||
</savedstates>
|
|
||||||
|
|
||||||
<!-- Model transitions definition (rules) -->
|
|
||||||
<!-- In this version : <xs:sequence minOccurs="0" maxOccurs="unbounded">-->
|
|
||||||
<!-- Transitions should be edited by hand and written in a 'human-readable' format -->
|
|
||||||
|
|
||||||
<conditions id="random walk of dimers" date="1630000000" author="Zazard le lézard !">
|
|
||||||
|
|
||||||
<condition site="1" weight="1" node_id="1" parent="0" x="0"/>
|
|
||||||
<condition site="2" weight="1" node_id="2" parent="1" x="1"/>
|
|
||||||
<!-- as soon as conditions 1 and 2 are satisfied, a dimer is identified at atation (0,1). -->
|
|
||||||
|
|
||||||
<condition site="1" weight="0" node_id="3" parent="2" x="2"/>
|
|
||||||
<!-- as soon as condition 3 is satisfied,
|
|
||||||
the neighbouring space unit to East of the dimer is empty
|
|
||||||
and the dimer identified by conditions (1,2) can be moved to East. -->
|
|
||||||
|
|
||||||
<condition site="2" weight="0" node_id="4" parent="2" x="-1"/>
|
|
||||||
<!-- as soon as condition 4 is satisfied,
|
|
||||||
the neighbouring space unit to West of the dimer is empty
|
|
||||||
and the dimer identified by conditions (1,2) can be moved to West. -->
|
|
||||||
|
|
||||||
</conditions>
|
|
||||||
|
|
||||||
<transitions>
|
|
||||||
|
|
||||||
<transition id="move_a_dimer_to_east" date="1630000000" author="Pas moi..."
|
|
||||||
parent="3" probability="1">
|
|
||||||
|
|
||||||
<arrow site="1" weight="0" x="0"/>
|
|
||||||
<arrow site="2" weight="0" x="1"/>
|
|
||||||
<arrow site="1" weight="1" x="1"/>
|
|
||||||
<arrow site="2" weight="1" x="2"/>
|
|
||||||
|
|
||||||
</transition>
|
|
||||||
|
|
||||||
<transition id="move_a_dimer_to_west" date="1630000000" author="Ni moi !"
|
|
||||||
parent="4" probability="1">
|
|
||||||
|
|
||||||
<arrow site="1" weight="0" x="0"/>
|
|
||||||
<arrow site="2" weight="0" x="1"/>
|
|
||||||
<arrow site="2" weight="1" x="0"/>
|
|
||||||
<arrow site="1" weight="1" x="1"/>
|
|
||||||
|
|
||||||
</transition>
|
|
||||||
|
|
||||||
</transitions>
|
|
||||||
|
|
||||||
</gem-graph-model>
|
|
||||||
|
|
@ -1,8 +0,0 @@
|
||||||
# Fichier de commande pour gnuplot
|
|
||||||
# En ligne de commande : load "data/gnuplot/a_cmd.plt"
|
|
||||||
#
|
|
||||||
set zeroaxis
|
|
||||||
plot cos(x),\
|
|
||||||
sin(x)
|
|
||||||
|
|
||||||
reset
|
|
||||||
|
|
@ -1,15 +0,0 @@
|
||||||
-7.000 -0.657
|
|
||||||
-6.000 0.279
|
|
||||||
-5.000 0.959
|
|
||||||
-4.000 0.757
|
|
||||||
-3.000 -0.141
|
|
||||||
-2.000 -0.909
|
|
||||||
-1.000 -0.841
|
|
||||||
0.000 0.000
|
|
||||||
1.000 0.841
|
|
||||||
2.000 0.909
|
|
||||||
3.000 0.141
|
|
||||||
4.000 -0.757
|
|
||||||
5.000 -0.959
|
|
||||||
6.000 -0.279
|
|
||||||
7.000 0.657
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
Jean Sirmai,jean,n-guix-port,03.08.2024 17:28,file:///home/jean/.config/libreoffice/4;
|
|
||||||
|
|
@ -1 +0,0 @@
|
||||||
Jean Sirmai,jean,n-guix-port,03.08.2024 17:28,file:///home/jean/.config/libreoffice/4;
|
|
||||||
Binary file not shown.
|
Before Width: | Height: | Size: 126 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 105 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 285 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.5 MiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.7 MiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.6 MiB |
Binary file not shown.
|
Before Width: | Height: | Size: 22 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 112 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 148 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 140 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 148 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 6.8 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 24 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 75 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 32 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 37 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 61 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 119 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 131 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 121 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 137 KiB |
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 21 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 17 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 17 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 46 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 141 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 132 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 185 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 153 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 180 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 190 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 128 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 167 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 140 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 152 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 707 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 702 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 256 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 113 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 568 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 308 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 151 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 161 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 178 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 491 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.2 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 22 KiB |
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 37 KiB |
Binary file not shown.
Binary file not shown.
|
Before Width: | Height: | Size: 1.7 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 3.0 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.1 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.0 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.4 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.8 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 955 B |
Binary file not shown.
|
Before Width: | Height: | Size: 1.9 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.4 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 983 B |
Binary file not shown.
|
Before Width: | Height: | Size: 1.9 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.9 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.4 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.5 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.5 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 4.3 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.9 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.2 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.4 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.2 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.9 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.6 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 4.4 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 3.8 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 3.5 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.1 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1016 B |
Binary file not shown.
|
Before Width: | Height: | Size: 2.7 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.8 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 2.0 KiB |
Binary file not shown.
|
Before Width: | Height: | Size: 1.8 KiB |
Some files were not shown because too many files have changed in this diff Show More
Loading…
Reference in New Issue