1 | /*
|
---|
2 | * IndexSetContainer.hpp
|
---|
3 | *
|
---|
4 | * Created on: Jul 3, 2012
|
---|
5 | * Author: heber
|
---|
6 | */
|
---|
7 |
|
---|
8 | #ifndef INDEXSETCONTAINER_HPP_
|
---|
9 | #define INDEXSETCONTAINER_HPP_
|
---|
10 |
|
---|
11 |
|
---|
12 | // include config.h
|
---|
13 | #ifdef HAVE_CONFIG_H
|
---|
14 | #include <config.h>
|
---|
15 | #endif
|
---|
16 |
|
---|
17 | #include <boost/shared_ptr.hpp>
|
---|
18 | #include <vector>
|
---|
19 |
|
---|
20 | #include "IndexSet.hpp"
|
---|
21 | #include "SortedVector.hpp"
|
---|
22 |
|
---|
23 | class IndexSetContainerTest;
|
---|
24 | class KeySetsContainer;
|
---|
25 |
|
---|
26 | /**
|
---|
27 | * As the IndexSet is supposed to appear in many maps and Containers as it may
|
---|
28 | * be contained in other IndexSet's, we store it always as a shared_ptr. This
|
---|
29 | * Container is then responsible that the ordering within the container still
|
---|
30 | * allows for fast access due to sorted appearance not by order in memory but
|
---|
31 | * order defined by IndexSet comparison operators.
|
---|
32 | *
|
---|
33 | */
|
---|
34 |
|
---|
35 | //!> typedef for IndexSet instances stored in SortedVector
|
---|
36 | class IndexSetContainer : public SortedVector<IndexSet> {
|
---|
37 | //!> grant unit test access to protected members of SortedVector
|
---|
38 | friend class IndexSetContainerTest;
|
---|
39 | public:
|
---|
40 | //!> typedef for IndexSetContainer wrapped in shared_ptr
|
---|
41 | typedef boost::shared_ptr<IndexSetContainer> ptr;
|
---|
42 |
|
---|
43 | /** Constructor from an unsorted vector of instances.
|
---|
44 | *
|
---|
45 | * @param _container unsorted vector of instances
|
---|
46 | */
|
---|
47 | IndexSetContainer(const SortedVector<IndexSet>::Container_t &_container) :
|
---|
48 | SortedVector<IndexSet>(_container)
|
---|
49 | {}
|
---|
50 |
|
---|
51 | /** Constructor from an unsorted vector of instances.
|
---|
52 | *
|
---|
53 | * @param _container unsorted vector of instances
|
---|
54 | */
|
---|
55 | IndexSetContainer(const std::vector<IndexSet> &_container) :
|
---|
56 | SortedVector<IndexSet>(_container)
|
---|
57 | {}
|
---|
58 |
|
---|
59 | /** Constructor from a single instance.
|
---|
60 | *
|
---|
61 | * @param _instance single instance
|
---|
62 | */
|
---|
63 | IndexSetContainer(IndexSet::ptr &_instance) :
|
---|
64 | SortedVector<IndexSet>(_instance)
|
---|
65 | {}
|
---|
66 |
|
---|
67 | /** Conversion constructor from a KeySetConntainer.
|
---|
68 | *
|
---|
69 | * We create the super set of all found key sets and then each single set,
|
---|
70 | * while always dropping indices equal to -1.
|
---|
71 | *
|
---|
72 | * @param _keysets keysets to turn into IndexSets
|
---|
73 | */
|
---|
74 | explicit IndexSetContainer(const KeySetsContainer &_keysets);
|
---|
75 |
|
---|
76 | private:
|
---|
77 | /** Helper function to get the super set out of a KeySetsContainer.
|
---|
78 | *
|
---|
79 | * @param _keysets keysets to construct super set for
|
---|
80 | * @return IndexSet that contains each index once that appears in the sets of \a _keysets
|
---|
81 | */
|
---|
82 | IndexSet::ptr& createSuperSet(const KeySetsContainer &_keysets) const;
|
---|
83 |
|
---|
84 | //!> static instance for AllIndices such that createSuperSet may return a reference.
|
---|
85 | static IndexSet::ptr AllIndices;
|
---|
86 | };
|
---|
87 |
|
---|
88 | //!> typedef for IndexSet instance stored as shared_ptr in SortedVector
|
---|
89 | typedef IndexSetContainer::T_ptr IndexSet_ptr;
|
---|
90 |
|
---|
91 |
|
---|
92 | #endif /* INDEXSETCONTAINER_HPP_ */
|
---|