summaryrefslogtreecommitdiff
path: root/src/lib/image_filename_sorter.cc
blob: 69114b2bd46a569a2844b975baa4feed489fc99d (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/*
    Copyright (C) 2015 Carl Hetherington <cth@carlh.net>

    This program 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,
    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.

*/

#include <iostream>
#include <boost/filesystem.hpp>
#include <boost/optional.hpp>
#include "raw_convert.h"

class ImageFilenameSorter
{
public:
	bool operator() (boost::filesystem::path a, boost::filesystem::path b)
	{
		boost::optional<int> na = extract_number (a);
		boost::optional<int> nb = extract_number (b);
		if (!na || !nb) {
			return a.string() < b.string();
		}

		return na.get() < nb.get();
	}

private:
	boost::optional<int> extract_number (boost::filesystem::path p)
	{
		p = p.leaf ();
		
		std::list<std::string> numbers;

		std::string current;
		for (size_t i = 0; i < p.string().size(); ++i) {
			if (isdigit (p.string()[i])) {
				current += p.string()[i];
			} else {
				if (!current.empty ()) {
					numbers.push_back (current);
					current.clear ();
				}
			}
		}

		if (!current.empty ()) {
			numbers.push_back (current);
		}

		std::string longest;
		for (std::list<std::string>::const_iterator i = numbers.begin(); i != numbers.end(); ++i) {
			if (i->length() > longest.length()) {
				longest = *i;
			}
		}

		if (longest.empty ()) {
			return boost::optional<int> ();
		}

		return raw_convert<int> (longest);
	}
};