File indexing completed on 2024-04-28 05:42:10

 /***************************************************************************
  *   Copyright (C) 2006-2009 by Rajko Albrecht                             *
  *   ral@alwins-world.de                                                   *
  *                                                                         *
  * This program is free software; you can redistribute it and/or           *
  * modify it under the terms of the GNU Lesser General Public              *
  * License as published by the Free Software Foundation; either            *
  * version 2.1 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       *
  * Lesser General Public License for more details.                         *
  *                                                                         *
  * You should have received a copy of the GNU Lesser General Public        *
  * License along with this program (in the file LGPL.txt); if not,         *
  * write to the Free Software Foundation, Inc., 51 Franklin St,            *
  * Fifth Floor, Boston, MA  02110-1301  USA                                *
  *                                                                         *
  * This software consists of voluntary contributions made by many          *
  * individuals.  For exact contribution history, see the revision          *
  * history and logs, available at https://commits.kde.org/kdesvn.          *
  ***************************************************************************/
 #include "repository.h"
 #include "repositorydata.h"
 
 namespace svn
 {
 
 namespace repository
 {
 
 Repository::Repository(svn::repository::RepositoryListener *aListener)
 {
     m_Data = new RepositoryData(aListener);
 }
 
 Repository::~Repository()
 {
     delete m_Data;
 }
 
 /*!
     \fn svn::Repository::Open(const QString&)
  */
 void Repository::Open(const QString &name)
 {
     svn_error_t *error = m_Data->Open(name);
     if (error != nullptr) {
         throw ClientException(error);
     }
 }
 
 void Repository::CreateOpen(const CreateRepoParameter &params)
 {
     svn_error_t *error = m_Data->CreateOpen(params);
     if (error != nullptr) {
         throw ClientException(error);
     }
 }
 
 /*!
     \fn svn::Repository::dump(const QString&output,const svn::Revision&start,const svn::Revision&end, bool incremental, bool use_deltas)
  */
 void Repository::dump(const QString &output, const svn::Revision &start, const svn::Revision &end, bool incremental, bool use_deltas)
 {
     svn_error_t *error = m_Data->dump(output, start, end, incremental, use_deltas);
     if (error != nullptr) {
         throw ClientException(error);
     }
 }
 
 void Repository::loaddump(const QString &dump, LOAD_UUID uuida, const QString &parentFolder, bool usePre, bool usePost, bool validateProps)
 {
     svn_repos_load_uuid uuid_action;
     switch (uuida) {
     case UUID_IGNORE_ACTION:
         uuid_action = svn_repos_load_uuid_ignore;
         break;
     case UUID_FORCE_ACTION:
         uuid_action = svn_repos_load_uuid_force;
         break;
     case UUID_DEFAULT_ACTION:
     default:
         uuid_action = svn_repos_load_uuid_default;
         break;
     }
     svn_error_t *error = m_Data->loaddump(dump, uuid_action, parentFolder, usePre, usePost, validateProps);
     if (error != nullptr) {
         throw ClientException(error);
     }
 }
 
 /*!
     \fn svn::Repository::hotcopy(const QString&src,const QString&dest,bool cleanlogs)
  */
 void Repository::hotcopy(const QString &src, const QString &dest, bool cleanlogs)
 {
     svn_error_t *error = RepositoryData::hotcopy(src, dest, cleanlogs);
     if (error != nullptr) {
         throw ClientException(error);
     }
 }
 
 } // namespace repository
 
 } // namespace svn