From eed804baaa02b4f81a27ba2844868b19992a90a1 Mon Sep 17 00:00:00 2001
From: Tatsuhiro Tsujikawa <tatsuhiro.t@gmail.com>
Date: Fri, 23 Mar 2012 01:34:37 +0900
Subject: Use std::set instead of std::deque if the elements are sorted and
 insertions and deletions are frequent.

---
 src/Peer.cc | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

(limited to 'src/Peer.cc')

diff --git a/src/Peer.cc b/src/Peer.cc
index 2621b929..020ff25f 100644
--- a/src/Peer.cc
+++ b/src/Peer.cc
@@ -287,7 +287,7 @@ size_t Peer::countPeerAllowedIndexSet() const
   return res_->peerAllowedIndexSet().size();
 }
 
-const std::vector<size_t>& Peer::getPeerAllowedIndexSet() const
+const std::set<size_t>& Peer::getPeerAllowedIndexSet() const
 {
   assert(res_);
   return res_->peerAllowedIndexSet();
-- 
cgit