[PythonReports-checkins] PythonReports/PythonReports segment_layout.py, 1.1, 1.2

[alexander s. <a1...@us...>]

Update of /cvsroot/pythonreports/PythonReports/PythonReports
In directory vz-cvs-3.sog:/tmp/cvs-serv12146

Modified Files:
	segment_layout.py 
Log Message:
cosmetic changes

Index: segment_layout.py
===================================================================
RCS file: /cvsroot/pythonreports/PythonReports/PythonReports/segment_layout.py,v
retrieving revision 1.1
retrieving revision 1.2
diff -C2 -d -r1.1 -r1.2
*** segment_layout.py	26 Jan 2011 13:47:27 -0000	1.1
--- segment_layout.py	26 Sep 2011 16:01:59 -0000	1.2
***************
*** 16,21 ****
      actual width of segments after stretching.
  
!     Layout is based on segment dependency DAG -- directed acyclic graph.
!     All segments, that a segment depends on, should be wholly at its left.
  
      Each segment has a non-negative gap to the nearest segment of those
--- 16,21 ----
      actual width of segments after stretching.
  
!     Layout is based on segment dependency DAG (Directed Acyclic Graph).
!     All segments that a segment depends on should be wholly at its left.
  
      Each segment has a non-negative gap to the nearest segment of those
***************
*** 23,27 ****
      width is positive.  Zero width segments are considered meaningless.
  
!     Example: 1 depend on A and B, 2 depends on 1, Z depends 1,
          3 depends on 2 and Z.
  
--- 23,27 ----
      width is positive.  Zero width segments are considered meaningless.
  
!     Example: 1 depend on A and B, 2 depends on 1, Z depends on 1,
          3 depends on 2 and Z.
  
***************
*** 44,52 ****
        :bbbbbb   zzz
  
!     - A and B collapses::
        :   1111 222222 333
        :          zzz
  
!     At present there is no other way avoid leading gap when A and B collapes,
      other than make zero gap.
  
--- 44,52 ----
        :bbbbbb   zzz
  
!     - A and B collapse::
        :   1111 222222 333
        :          zzz
  
!     At present there is no way to avoid leading gap when A and B collapse
      other than make zero gap.
  
***************
*** 221,225 ****
  
  
! def toposort(direcred_graph):
      """@return: vertexes of directed acyclic graph in C{toposort} order
  
--- 221,225 ----
  
  
! def toposort(directed_graph):
      """@return: vertexes of directed acyclic graph in C{toposort} order
  
***************
*** 242,250 ****
          if vertex not in _visited:
              _visited.add(vertex)
!             for child in direcred_graph[vertex]:
                  _walk(child)
              _vertex_order.append(vertex)
  
!     for _vertex in direcred_graph:
          _walk(_vertex)
      return _vertex_order
--- 242,250 ----
          if vertex not in _visited:
              _visited.add(vertex)
!             for child in directed_graph[vertex]:
                  _walk(child)
              _vertex_order.append(vertex)
  
!     for _vertex in directed_graph:
          _walk(_vertex)
      return _vertex_order