/usr/include/svncpp/targets.hpp is in libsvncpp-dev 0.12.1dfsg-2ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 | /*
* ====================================================================
* Copyright (c) 2002-2009 The RapidSvn Group. All rights reserved.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* 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 (in the file GPL.txt.
* If not, see <http://www.gnu.org/licenses/>.
*
* This software consists of voluntary contributions made by many
* individuals. For exact contribution history, see the revision
* history and logs, available at http://rapidsvn.tigris.org/.
* ====================================================================
*/
#ifndef _SVNCPP_TARGETS_HPP_
#define _SVNCPP_TARGETS_HPP_
// apr api
#include "apr_tables.h"
// svncpp
#include "svncpp/path.hpp"
namespace svn
{
// forward declarations
class Pool;
/**
* Encapsulation for Subversion target arrays handling
*/
class Targets
{
public:
/**
* Constructor
*
* @param targets vector of paths
*/
Targets(const PathVector & targets);
/**
* Constructor from an APR array containing
* char *.
*
* @param targets APR array header
*/
Targets(const apr_array_header_t * targets);
/**
* Constructor. Initializes list with just
* one entry
*
* @param target
*/
Targets(const char * target = 0);
/**
* Copy Constructor
*
* @param targets Source
*/
Targets(const Targets & targets);
/**
* Destructor
*/
virtual ~Targets();
/**
* Returns an apr array containing
* char *.
*
* @param pool Pool used for conversion
*/
const apr_array_header_t *
array(const Pool & pool) const;
/**
* Returns a vector of paths
*
* @return vector of paths
*/
const PathVector &
targets() const;
/**
* @return the number of targets
*/
size_t size() const;
/**
* operator to return the vector
*
* @return vector with targets
*/
operator const PathVector & () const
{
return m_targets;
}
/**
* returns one single target. in fact,
* the first in the vector, it there are more
* than one. if there is no target returns
* an empty path
*
* @return single path
*/
const Path
target() const;
/**
* adds a @ref Path to the existing entries
*
* @remark you have to make sure the path is
* unique
*/
void
push_back(const Path & path);
/**
* clears all entries
*/
void
clear();
/**
* reserve the size for following calls
* to @ref push_back
*/
void
reserve(size_t size);
private:
PathVector m_targets;
};
}
#endif
/* -----------------------------------------------------------------
* local variables:
* eval: (load-file "../../rapidsvn-dev.el")
* end:
*/
|