X-Git-Url: https://git.carlh.net/gitweb/?a=blobdiff_plain;f=src%2Flib%2Fcase_insensitive_sorter.cc;h=540b3cfe5e37bdaa23af20ea8b24767a49e9aaca;hb=dba7e1137282b52a1bd6ad1d56fe6371a8c97e30;hp=02543f03aeef697082886fc092b5736758e6cae5;hpb=1668af230bde86ebc7ca5e2ff113bd8ad122a9bc;p=dcpomatic.git

diff --git a/src/lib/case_insensitive_sorter.cc b/src/lib/case_insensitive_sorter.cc
index 02543f03a..540b3cfe5 100644
--- a/src/lib/case_insensitive_sorter.cc
+++ b/src/lib/case_insensitive_sorter.cc
@@ -1,34 +1,37 @@
 /*
-    Copyright (C) 2016 Carl Hetherington <cth@carlh.net>
+    Copyright (C) 2016-2021 Carl Hetherington <cth@carlh.net>
 
-    This program is free software; you can redistribute it and/or modify
+    This file is part of DCP-o-matic.
+
+    DCP-o-matic is free software; you can redistribute it and/or modify
     it under the terms of the GNU General Public License as published by
     the Free Software Foundation; either version 2 of the License, or
     (at your option) any later version.
 
-    This program is distributed in the hope that it will be useful,
+    DCP-o-matic is distributed in the hope that it will be useful,
     but WITHOUT ANY WARRANTY; without even the implied warranty of
     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
     GNU General Public License for more details.
 
     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., 675 Mass Ave, Cambridge, MA 02139, USA.
+    along with DCP-o-matic.  If not, see <http://www.gnu.org/licenses/>.
 
 */
 
+
 #include "case_insensitive_sorter.h"
 #include <boost/filesystem.hpp>
-#include <boost/foreach.hpp>
-#include <iostream>
+#include <algorithm>
+
 
 using std::string;
 
+
 bool
 CaseInsensitiveSorter::operator() (boost::filesystem::path a, boost::filesystem::path b)
 {
-	string x = a.string ();
-	string y = b.string ();
+	auto x = a.string();
+	auto y = b.string();
 	transform (x.begin(), x.end(), x.begin(), ::tolower);
 	transform (y.begin(), y.end(), y.begin(), ::tolower);
 	return x < y;