thepeg is hosted by Hepforge, IPPP Durham
ThePEG 2.3.0
AITree.h
1// -*- C++ -*-
2//
3// AITree.h is a part of ThePEG - Toolkit for HEP Event Generation
4// Copyright (C) 1999-2019 Leif Lonnblad
5//
6// ThePEG is licenced under version 3 of the GPL, see COPYING for details.
7// Please respect the MCnet academic guidelines, see GUIDELINES for details.
8//
9#ifndef LWH_AITree_H
10#define LWH_AITree_H
11
12
13
16namespace AIDA {
17
18class IManagedObject;
19
20class ITree {
21
22public:
23
24 virtual ~ITree() {}
25
26 virtual std::string storeName() const = 0;
27 virtual IManagedObject * find(const std::string & name) = 0;
28 virtual std::string pwd() const = 0;
29 virtual bool commit() = 0;
30 virtual bool close() = 0;
31 virtual bool mkdir(const std::string &) = 0;
32 virtual bool mkdirs(const std::string &) = 0;
33 virtual bool cd(const std::string &) = 0;
34 virtual bool rmdir(const std::string & str) = 0;
35 virtual bool rm(const std::string & str) = 0;
36 virtual std::string findPath(const IManagedObject & o) const = 0;
37 virtual bool mv(const std::string & oldo, const std::string & newo) = 0;
38 virtual void setOverwrite(bool o = true) = 0;
39 virtual bool cp(const std::string &, const std::string &, bool = false) = 0;
40
41};
42
43}
44
51#endif /* LWH_AITree_H */
Iterator find(IteratorRange< Iterator > r, const T &t)
The std::find function taking an IteratorRange as argument.
Definition: algorithm.h:85