summaryrefslogtreecommitdiff
path: root/Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp
diff options
context:
space:
mode:
authorKarl Berry <karl@freefriends.org>2018-01-17 22:50:15 +0000
committerKarl Berry <karl@freefriends.org>2018-01-17 22:50:15 +0000
commite7dfe5ab98e759081fc73990ed6c1ac6910a105d (patch)
tree1635f79c86856a6aa57a45b8b952b651ef9fcba9 /Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp
parentae542350b1e3add10d4ee3d7b68f610132f31a50 (diff)
dvisvgm 2.3.1 (patched)
git-svn-id: svn://tug.org/texlive/trunk@46352 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp')
-rw-r--r--Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp10
1 files changed, 5 insertions, 5 deletions
diff --git a/Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp b/Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp
index c87eddf054f..4ba3f8719cb 100644
--- a/Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp
+++ b/Build/source/texk/dvisvgm/dvisvgm-src/src/NumericRanges.hpp
@@ -2,7 +2,7 @@
** NumericRanges.hpp **
** **
** This file is part of dvisvgm -- a fast DVI to SVG converter **
-** Copyright (C) 2005-2017 Martin Gieseking <martin.gieseking@uos.de> **
+** Copyright (C) 2005-2018 Martin Gieseking <martin.gieseking@uos.de> **
** **
** This program is free software; you can redistribute it and/or **
** modify it under the terms of the GNU General Public License as **
@@ -29,9 +29,9 @@ template <class T>
class NumericRanges
{
public:
- typedef std::pair<T,T> Range;
- typedef std::list<Range> Container;
- typedef typename Container::const_iterator ConstIterator;
+ using Range = std::pair<T,T>;
+ using Container = std::list<Range>;
+ using ConstIterator = typename Container::const_iterator;
public:
void addRange (T value) {addRange(value, value);}
@@ -98,7 +98,7 @@ void NumericRanges<T>::addRange (T first, T last) {
template <class T>
bool NumericRanges<T>::valueExists (T value) const {
- ConstIterator it = std::lower_bound(_ranges.begin(), _ranges.end(), Range(value, 0),
+ auto it = std::lower_bound(_ranges.begin(), _ranges.end(), Range(value, 0),
[](const Range &r1, const Range &r2) {
return r1.first < r2.first;
});