gegl r3018 - in trunk: . gegl/graph



Author: martinn
Date: Fri Apr 10 18:33:25 2009
New Revision: 3018
URL: http://svn.gnome.org/viewvc/gegl?rev=3018&view=rev

Log:
Document GeglNode members

Modified:
   trunk/ChangeLog
   trunk/gegl/graph/gegl-node.h

Modified: trunk/gegl/graph/gegl-node.h
==============================================================================
--- trunk/gegl/graph/gegl-node.h	(original)
+++ trunk/gegl/graph/gegl-node.h	Fri Apr 10 18:33:25 2009
@@ -39,7 +39,10 @@
 {
   GObject         parent_instance;
 
+  /* The current operation associated with this node */
   GeglOperation  *operation;
+
+  /* The region for which this node provides pixel data */
   GeglRectangle   have_rect;
 
   /* If TRUE the above have_rect is correct and can be returned
@@ -47,12 +50,26 @@
    */
   gboolean        valid_have_rect;
 
+  /* All the pads on this node, depends on operation */
   GSList         *pads;
+
+  /* The input pads */
   GSList         *input_pads;
+
+  /* The output pads */
   GSList         *output_pads;
+
+  /* The nodes this node depends on */
   GSList         *sources;
+
+  /* The nodes that depends on this node */
   GSList         *sinks;
 
+  /* If a node is a graph it means it has children. Typically the
+   * children connect to the input/output proxies of their graph
+   * node. This results in that the graph node can more or less be
+   * transparently treated as a normal node in most contexts
+   */
   gboolean        is_graph;
 
   /* For a node, the cache should be created at first demand if



[Date Prev][Date Next]   [Thread Prev][Thread Next]   [Thread Index] [Date Index] [Author Index]