From 5fd00cab14d48beaf2279a2b8f3ad5b02b76c87b Mon Sep 17 00:00:00 2001
From: Marc Jeanmougin <mc>
Date: Thu, 19 Feb 2015 04:25:21 +0100
Subject: Put a few std::vector<SPitem*>

(bzr r13922.1.5)
---
 src/graphlayout.cpp | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

(limited to 'src/graphlayout.cpp')

diff --git a/src/graphlayout.cpp b/src/graphlayout.cpp
index 613440269..4d590173a 100644
--- a/src/graphlayout.cpp
+++ b/src/graphlayout.cpp
@@ -88,8 +88,8 @@ struct CheckProgress : TestConvergence {
  * Scans the items list and places those items that are
  * not connectors in filtered
  */
-void filterConnectors(SelContainer const &items, list<SPItem *> &filtered) {
-    for(SelContainer::const_iterator i=items.begin();i!=items.end();i++){
+void filterConnectors(std::vector<SPItem*> const &items, list<SPItem *> &filtered) {
+    for(std::vector<SPItem*>::const_iterator i=items.begin();i!=items.end();i++){
         SPItem *item = SP_ITEM(*i);
         if(!isConnector(item)) {
             filtered.push_back(item);
@@ -101,7 +101,7 @@ void filterConnectors(SelContainer const &items, list<SPItem *> &filtered) {
 * connectors between them, and uses graph layout techniques to find
 * a nice layout
 */
-void graphlayout(SelContainer const &items) {
+void graphlayout(std::vector<SPItem*> const &items) {
     if(items.empty()) {
         return;
     }
-- 
cgit v1.2.3