src/TortoiseProc/RevisionGraph/StandardLayoutConnectionList.cpp

   1 // TortoiseSVN - a Windows shell extension for easy version control
   2
   3 // Copyright (C) 2003-2008 - TortoiseSVN
   4
   5 // This program is free software; you can redistribute it and/or
   6 // modify it under the terms of the GNU General Public License
   7 // as published by the Free Software Foundation; either version 2
   8 // of the License, or (at your option) any later version.
   9
  10 // This program is distributed in the hope that it will be useful,
  11 // but WITHOUT ANY WARRANTY; without even the implied warranty of
  12 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  13 // GNU General Public License for more details.
  14
  15 // You should have received a copy of the GNU General Public License
  16 // along with this program; if not, write to the Free Software Foundation,
  17 // 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  18 //
  19 #include "StdAfx.h"
  20 #include "StandardLayoutConnectionList.h"
  21
  22 // construction
  23
  24 CStandardLayoutConnectionList::CStandardLayoutConnectionList
  25     ( const std::vector<CStandardLayoutNodeInfo>& nodes
  26     , const std::vector<std::pair<index_t, index_t> >& connections)
  27     : nodes (nodes)
  28     , connections (connections)
  29 {
  30 }
  31
  32 // implement ILayoutItemList
  33
  34 index_t CStandardLayoutConnectionList::GetCount() const
  35 {
  36     return static_cast<index_t>(connections.size());
  37 }
  38
  39 CString CStandardLayoutConnectionList::GetToolTip (index_t /* index */) const
  40 {
  41     return CString();
  42 }
  43
  44 index_t CStandardLayoutConnectionList::GetFirstVisible
  45     (const CRect& viewRect) const
  46 {
  47     return GetNextVisible (static_cast<index_t>(-1), viewRect);
  48 }
  49
  50 index_t CStandardLayoutConnectionList::GetNextVisible
  51     ( index_t prev
  52     , const CRect& viewRect) const
  53 {
  54     for (size_t i = prev+1, count = connections.size(); i < count; ++i)
  55     {
  56         const std::pair<index_t, index_t>& connection = connections[i];
  57
  58         CRect commonRect;
  59         commonRect.UnionRect ( nodes[connection.first].rect
  60                              , nodes[connection.second].rect);
  61         if (FALSE != CRect().IntersectRect (commonRect, viewRect))
  62             return static_cast<index_t>(i);
  63     }
  64
  65     return static_cast<index_t>(NO_INDEX);
  66 }
  67
  68 index_t CStandardLayoutConnectionList::GetAt
  69     ( const CPoint& /* point */
  70     , CSize /* delta */) const
  71 {
  72     return static_cast<index_t>(NO_INDEX);
  73 }
  74
  75 // implement ILayoutConnectionList
  76
  77 CStandardLayoutConnectionList::SConnection
  78 CStandardLayoutConnectionList::GetConnection (index_t index) const
  79 {
  80     // determine the end points of the connection
  81
  82     const std::pair<index_t, index_t>& connection = connections[index];
  83     const CRect* source = &nodes[connection.first].rect;
  84     const CRect* dest = &nodes[connection.second].rect;
  85
  86     if (source->left > dest->right)
  87         std::swap (source, dest);
  88
  89         CPoint startPoint;
  90         CPoint endPoint;
  91
  92     if (source->right < dest->left)
  93     {
  94         // there is a vertical gap between source and dest
  95
  96         startPoint.x = source->right;
  97         startPoint.y = (source->top + source->bottom) / 2;
  98     }
  99     else
 100     {
 101         // there must be a horizontal gap
 102
 103         if (source->top > dest->top)
 104             std::swap (source, dest);
 105
 106         startPoint.x = (source->left + source->right) / 2;
 107         startPoint.y = source->bottom;
 108     }
 109
 110     endPoint.x = (dest->left + dest->right) / 2;
 111     endPoint.y = dest->top > startPoint.y ? dest->top : dest->bottom;
 112
 113     // Bezier points
 114
 115     static CPoint points[4];
 116
 117         points[0] = startPoint;
 118         points[1].x = (startPoint.x + endPoint.x) / 2;          // first control point
 119         points[1].y = startPoint.y;
 120         points[2].x = endPoint.x;                                                       // second control point
 121         points[2].y = startPoint.y;
 122         points[3] = endPoint;
 123
 124     // construct result
 125
 126     SConnection result;
 127
 128     result.style = 0;
 129     result.numberOfPoints = 4;
 130     result.points = points;
 131
 132     return result;
 133 }