blob: be75c8ee5b7f68c25817ae3845cd52548030c51a (
plain)
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
|
/*
* Copyright (c) 2018 Samsung Electronics Co., Ltd. All Rights Reserved
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef __NEURUN_GRAPH_OPERAND_LAYOUT_SET_H__
#define __NEURUN_GRAPH_OPERAND_LAYOUT_SET_H__
#include <initializer_list>
#include <unordered_set>
#include "model/Layout.h"
namespace neurun
{
namespace model
{
class LayoutSet
{
public:
LayoutSet() = default;
LayoutSet(std::initializer_list<Layout> layouts);
public:
void add(const Layout &layout) { _set.insert(layout); }
void remove(const Layout &layout) { _set.erase(layout); }
uint32_t size() const { return static_cast<uint32_t>(_set.size()); }
bool contains(const Layout &layout) const { return _set.find(layout) != _set.end(); }
public:
LayoutSet operator|(const LayoutSet &other) const; // Union
LayoutSet operator&(const LayoutSet &other) const; // Intersect
LayoutSet operator-(const LayoutSet &other) const; // Minus
public:
std::unordered_set<Layout>::const_iterator begin() const { return _set.begin(); }
std::unordered_set<Layout>::const_iterator end() const { return _set.end(); }
private:
std::unordered_set<Layout> _set;
};
} // namespace model
} // namespace neurun
#endif // __NEURUN_GRAPH_OPERAND_LAYOUT_SET_H__
|
