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
|
/* $Id: Threading.h,v 1.5 2004/08/24 21:52:39 terpstra Exp $
*
* Threading.h - Helper which can load a thread tree
*
* Copyright (C) 2002 - Wesley W. Terpstra
*
* License: GPL
*
* Authors: 'Wesley W. Terpstra' <wesley@terpstra.ca>
*
* 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; version 2.1.
*
* 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., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef THREADING_H
#define THREADING_H
#include <MessageId.h>
#include <esort.h>
#include <set>
#include <map>
#include <vector>
#include <memory>
#include "Summary.h"
using std::set;
using std::map;
using std::ostream;
class Threading
{
public:
struct Node
{
Summary summary;
int replies;
int replyee;
int replyor_first;
int replyor_next;
int depth;
int consumed;
int column;
int draw_next;
string in_reply_tos;
Node(const MessageId& id_) : summary(id_) { }
Node() : summary(MessageId()) { }
};
protected:
typedef std::vector<Node> Nodes;
Nodes nodes;
map<string, int> hashes;
public:
typedef Nodes::size_type Key;
string load(ESort::Reader* r, const Summary& sum, Key& out); // "" = ok
Key size() const { return nodes.size(); }
string findprev(Key m, ESort::Reader* r, const Config& cfg, Summary& s);
string findnext(Key m, ESort::Reader* r, const Config& cfg, Summary& s);
bool hasMessage(string hash) { return hashes.find(hash) != hashes.end(); }
set<Summary> replies(Key k);
Summary& getSummary(Key m);
string draw_tree (ESort::Reader* db); // prepare for row drawing
string draw_snippet(ESort::Reader* db, Key root, const Config& cfg);
void draw_tree_row (ostream& o, int* h, Key row); // "" = ok
void draw_snippet_row(ostream& o, int* h, Key row, Key root); // "" = ok
};
#endif
|
