Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Concepts
PairSetFirst.h
Go to the documentation of this file.
1
6#pragma once
7
8#include <alib/set>
9#include <alib/pair>
10
11namespace dataAccess {
12
14public:
15 template < class First, class Second >
18 for ( const ext::pair < First, Second > & pair : pairSet )
19 res.insert ( pair.first );
20
21 return res;
22 }
23
24};
25
26} /* namespace dataAccess */
27
Definition: PairSetFirst.h:13
static ext::set< First > access(const ext::set< ext::pair< First, Second > > &pairSet)
Definition: PairSetFirst.h:16
Class extending the pair class from the standard library. Original reason is to allow printing of the...
Definition: pair.hpp:43
Definition: set.hpp:44
return res
Definition: MinimizeByPartitioning.h:145
Definition: PairSetFirst.h:11