1
//////////////////////////////////////////////////////////////////////////////////
2
// This file is part of Toolkit for Conceptual Modeling (TCM).
3
// (c) copyright 2001, Universiteit Twente.
4
// Author: Rik Eshuis (eshuis@cs.utwente.nl).
6
// TCM is free software; you can redistribute it and/or modify
7
// it under the terms of the GNU General Public License as published by
8
// the Free Software Foundation; either version 2 of the License, or
9
// (at your option) any later version.
11
// TCM is distributed in the hope that it will be useful,
12
// but WITHOUT ANY WARRANTY; without even the implied warranty of
13
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14
// GNU General Public License for more details.
16
// You should have received a copy of the GNU General Public License
17
// along with TCM; if not, write to the Free Software
18
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
20
////////////////////////////////////////////////////////////////////////////////
22
//------------------------------------------------------------------------------
32
#include "adshyperedge.h"
34
/// lists of objects of arbitrary type T.
35
template <class T> class Bag {
36
/*@Doc: {\large {\bf scope:} global} */
38
/// create an empty list.
41
Bag (const List<T> &l, int n);
43
Bag (const Bag <T> &b);
47
/// add e to n times to bag
48
void add(const T &e, int n);
50
/// insert e to i+1'th position of the list.
51
// void insert(const T &e, const unsigned i);
53
/// return index of first element equal to e, if not found, return -1.
54
// int find(const T &e) const;
56
/// return list is set
59
/// count the number of times e occurs in the list
60
int count(const T &e) const;
64
/// return if bag contains bag l
65
bool contains(Bag<T> &l) const;
67
void join(const Bag <T> &l);
70
bool diff( Bag <T> &l);
72
// get all elements (including those that might not be in the bag)
73
void GetList(List<T> &l) const {l=list;};
75
/// get all elements that occur more than once and put them in set
76
void GetSet(List<T> *l);
78
bool remove(const T &e);
84
/// list[i] is countl[i] times in the bag
85
int countl[MAXLENGTH];
added
removed
src/sd/bv/bag.h
