File: bidgroup.h

package info (click to toggle)
bidwatcher 1.3.17-1
  • links: PTS
  • area: main
  • in suites: sarge
  • size: 936 kB
  • ctags: 717
  • sloc: cpp: 6,505; sh: 2,970; makefile: 62
file content (95 lines) | stat: -rw-r--r-- 2,569 bytes parent folder | download
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
/*
 * part of bidwatcher
 * Author: Jan Starzynski
 * use of this code is restricted to the terms
 * of the GNU GPL, which should have been included in this
 * distribution. If not, see www.gnu.org/copyleft/gpl.html.
 * Here is the short version:
 *
 * 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.
 *
 * $Id: bidgroup.h,v 1.1.2.4 2004/08/25 07:44:58 sturnus Exp $
 *
 * Handling of Bidgroups
 */

#ifndef BIDWATCHER_BIDGROUP_H
#define BIDWATCHER_BIDGROUP_H

#include "config.h"

#ifdef HAVE_STL

#define HAVE_BIDGROUP 1

#include <vector>
#include <set>
#include <cstdio>

class BidGroup {
public:
  typedef unsigned long long    IdType;
  typedef std::set<IdType>      ItemList;
  typedef std::vector<ItemList> GroupList;

  void clear();
  int numGroup() const;

  ItemList *addItem(const IdType &id1, const IdType &id2);
  bool delItem(const IdType &id);

  int groupId(const IdType &id) const;
  const ItemList *getGroup(int idx) const { return getGroupP(idx); }
  ItemList *getGroup(int idx) { return getGroupP(idx); }

  const ItemList *findItem(const IdType &id) const { return findItemP(id); }
  ItemList *findItem(const IdType &id) { return findItemP(id); }
  std::vector<IdType> &findItem(std::vector<IdType> &vec, const IdType &id);

  void sweepList(bool at_end_only = true);

  bool read(const char *file);
  bool read(std::FILE *fp);

  bool write(const char *file) const;
  bool write(std::FILE *fp) const;

private:
  GroupList m_list;
  ItemList *findItemP(const IdType &id) const;
  ItemList *getGroupP(int idx) const;
};

#else

#include <stdio.h>

class BidGroup {
public:
  typedef unsigned long long    IdType;
  int groupId(const IdType &id) const { return 0; }
  bool delItem(const IdType &id) { return false; }
  void *addItem(const IdType &id1, const IdType &id2) { return 0; }
  void sweepList(bool at_end_only = true) {}
  bool read(const char *file) { return false; }
  bool read(FILE *fp) { return false; }

  bool write(const char *file) const { return false; }
  bool write(FILE *fp) const { return false; }

  void clear() {}
  int numGroup() const { return 0; }
};

#endif

#endif