blob: 8c124b5d50ecf683ea5138628899ef9c3106c365 (
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
|
/*
* entry.c: Data structure to handle still pictures
*
* See the README file for copyright information and how to reach the author.
*
* $Id: entry.c 2.1 2012/02/17 14:00:28 kls Exp $
*/
#include "entry.h"
cPictureEntry::cPictureEntry(const char *Name, const cPictureEntry *Parent, bool IsDirectory)
{
name = strdup(Name);
parent = Parent;
isDirectory = IsDirectory;
entries = NULL;
}
cPictureEntry::~cPictureEntry()
{
free(name);
delete entries;
}
int cPictureEntry::Compare(const cListObject &ListObject) const
{
cPictureEntry *p = (cPictureEntry *)&ListObject;
if (IsDirectory() && !p->IsDirectory())
return -1;
if (!IsDirectory() && p->IsDirectory())
return +1;
if (IsDirectory())
return strcoll(name, p->name);
else
return strcmp(name, p->name); // correctly sorts dsc01234.jpg and dsc01234a.jpg in case pictures have been "squeezed in"
}
cString cPictureEntry::Path(void) const
{
return parent ? *AddDirectory(parent->Path(), name) : name;
}
void cPictureEntry::Load(void) const
{
if (isDirectory && !entries) {
cString Directory = Path();
cReadDir d(Directory);
if (d.Ok()) {
struct dirent *e;
while ((e = d.Next()) != NULL) {
struct stat ds;
if (stat(AddDirectory(Directory, e->d_name), &ds) == 0) {
if (!entries)
entries = new cList<cPictureEntry>;
entries->Add(new cPictureEntry(e->d_name, this, S_ISDIR(ds.st_mode)));
}
}
if (entries)
entries->Sort();
}
else
LOG_ERROR_STR(*Directory);
}
}
const cList<cPictureEntry> *cPictureEntry::Entries(void) const
{
Load();
return entries;
}
const cPictureEntry *cPictureEntry::FirstPicture(void) const
{
Load();
if (entries) {
for (cPictureEntry *pe = entries->First(); pe; pe = entries->Next(pe)) {
if (pe->IsDirectory()) {
const cPictureEntry *p = pe->FirstPicture();
if (p)
return p;
}
else
return pe;
}
}
return NULL;
}
const cPictureEntry *cPictureEntry::LastPicture(void) const
{
Load();
if (entries) {
for (cPictureEntry *pe = entries->Last(); pe; pe = entries->Prev(pe)) {
if (pe->IsDirectory()) {
const cPictureEntry *p = pe->LastPicture();
if (p)
return p;
}
else
return pe;
}
}
return NULL;
}
const cPictureEntry *cPictureEntry::PrevPicture(const cPictureEntry *This) const
{
if (This) {
const cPictureEntry *pe = (cPictureEntry *)entries->Prev(This);
if (pe) {
if (pe->IsDirectory()) {
const cPictureEntry *p = pe->LastPicture();
if (p)
return p;
return PrevPicture(pe);
}
return pe;
}
}
if (parent)
return parent->PrevPicture(this);
return NULL;
}
const cPictureEntry *cPictureEntry::NextPicture(const cPictureEntry *This) const
{
if (This) {
cPictureEntry *pe = (cPictureEntry *)entries->Next(This);
if (pe) {
if (pe->IsDirectory()) {
const cPictureEntry *p = pe->FirstPicture();
if (p)
return p;
return NextPicture(pe);
}
return pe;
}
}
else if (IsDirectory()) {
const cPictureEntry *p = FirstPicture();
if (p)
return p;
}
if (parent)
return parent->NextPicture(this);
return NULL;
}
|
