File: file_cache.h

package info (click to toggle)
apparmor 4.1.0-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 34,800 kB
  • sloc: ansic: 24,940; python: 24,595; sh: 12,524; cpp: 9,024; yacc: 2,061; makefile: 1,921; lex: 1,215; pascal: 1,145; perl: 1,033; ruby: 365; lisp: 282; exp: 250; java: 212; xml: 159
file content (52 lines) | stat: -rw-r--r-- 1,300 bytes parent folder | download | duplicates (2)
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
/*
 *   Copyright (c) 2021
 *   Canonical, Ltd. (All rights reserved)
 *
 *   This program is free software; you can redistribute it and/or
 *   modify it under the terms of version 2 of the GNU General Public
 *   License published by the Free Software Foundation.
 *
 *   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.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program; if not, contact Canonical Ltd.
 */

#ifndef __AA_FILE_CACHE_H
#define __AA_FILE_CACHE_H

#include <set>
#include <string>

using namespace std;

/* TODO: have includecache be a frontend for file cache, don't just
 * store name.
 */
class IncludeCache_t {
public:
	set<string> cache;

	IncludeCache_t() = default;
	virtual ~IncludeCache_t() = default;

	/* return true if in set */
	bool find(const char *name) {
		return cache.find(name) != cache.end();
	}

	bool insert(const char *name) {
		pair<set<string>::iterator,bool> res = cache.insert(name);
		if (res.second == false) {
			return false;
		}
		/* inserted */

		return true;
	}
};

#endif /* __AA_FILE_CACHE_H */