blob: 5e6f681f23a10c5f5ec02492cdc6d115cbe5d105 (
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
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you 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 .
*/
#ifndef INCLUDED_SD_SOURCE_UI_SLIDESORTER_INC_MODEL_SLSENUMERATION_HXX
#define INCLUDED_SD_SOURCE_UI_SLIDESORTER_INC_MODEL_SLSENUMERATION_HXX
#include <memory>
namespace sd { namespace slidesorter { namespace model {
/** Interface to generic enumerations. Designed to operate on shared
pointers. Therefore GetNextElement() returns T and not T&.
*/
template <class T>
class Enumeration
{
public:
virtual ~Enumeration() {}
virtual bool HasMoreElements() const = 0;
/** Returns T instead of T& so that it can handle shared pointers.
*/
virtual T GetNextElement() = 0;
virtual void Rewind() = 0;
virtual ::std::unique_ptr<Enumeration<T> > Clone() = 0;
};
} } } // end of namespace ::sd::slidesorter::model
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|