summaryrefslogtreecommitdiff
path: root/src/a2algo.h
diff options
context:
space:
mode:
authorTatsuhiro Tsujikawa <tatsuhiro.t@gmail.com>2010-01-05 16:01:46 +0000
committerTatsuhiro Tsujikawa <tatsuhiro.t@gmail.com>2010-01-05 16:01:46 +0000
commit4db349c1f32b4a313d12d114137432441633d00a (patch)
tree417451971e264834312cfd8339c79930d680a5d1 /src/a2algo.h
parent338e8aca09331d3e7fa4e1e8e1f9d10260986772 (diff)
2010-01-06 Tatsuhiro Tsujikawa <t-tujikawa@users.sourceforge.net>
Untabify. Fixed one line in copyright which is longer than 80 columns. * src * test
Diffstat (limited to 'src/a2algo.h')
-rw-r--r--src/a2algo.h10
1 files changed, 5 insertions, 5 deletions
diff --git a/src/a2algo.h b/src/a2algo.h
index 5a5b1b2f..377ca793 100644
--- a/src/a2algo.h
+++ b/src/a2algo.h
@@ -16,7 +16,7 @@
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
- * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* In addition, as a special exception, the copyright holders give
* permission to link the code of portions of this program with the
@@ -41,7 +41,7 @@ namespace aria2 {
template<typename InputIterator, typename OutputIterator>
OutputIterator ncopy(InputIterator first, InputIterator last,
- size_t count, OutputIterator destination)
+ size_t count, OutputIterator destination)
{
OutputIterator x = destination;
while(count--) {
@@ -62,7 +62,7 @@ OutputIterator ncopy(InputIterator first, InputIterator last,
// and the length 6.
template<typename InputIterator>
std::pair<InputIterator, size_t> max_sequence(InputIterator first,
- InputIterator last)
+ InputIterator last)
{
InputIterator maxfirst = last;
size_t maxlen = 0;
@@ -85,9 +85,9 @@ std::pair<InputIterator, size_t> max_sequence(InputIterator first,
}
template<typename InputIterator, typename R, typename C, typename A,
- typename ACompat>
+ typename ACompat>
static void forEachMemFunSH(InputIterator first, InputIterator last,
- R (C::*f)(A), ACompat arg)
+ R (C::*f)(A), ACompat arg)
{
for(; first != last; ++first) {
((*first).get()->*f)(arg);