grive2/libgrive/src/base/ResourceTree.hh

100 lines
2.8 KiB
C++
Raw Normal View History

2012-05-18 04:52:11 +04:00
/*
grive: an GPL program to sync a local directory with Google Drive
Copyright (C) 2012 Wan Wai Ho
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 version 2
of the License.
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, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#pragma once
#include "Resource.hh"
2012-05-18 04:52:11 +04:00
#include "util/FileSystem.hh"
#include <boost/multi_index_container.hpp>
#include <boost/multi_index/hashed_index.hpp>
#include <boost/multi_index/identity.hpp>
#include <boost/multi_index/mem_fun.hpp>
namespace gr {
namespace details
{
using namespace boost::multi_index ;
2016-01-03 01:57:54 +03:00
struct ByMD5 {} ;
2012-05-18 04:52:11 +04:00
struct ByHref {} ;
struct ByIdentity {} ;
struct BySize {} ;
2012-05-18 04:52:11 +04:00
typedef multi_index_container<
2012-05-19 11:41:21 +04:00
Resource*,
2012-05-18 04:52:11 +04:00
indexed_by<
2012-05-19 11:41:21 +04:00
hashed_non_unique<tag<ByHref>, const_mem_fun<Resource, std::string, &Resource::SelfHref> >,
2016-01-03 01:57:54 +03:00
hashed_non_unique<tag<ByMD5>, const_mem_fun<Resource, std::string, &Resource::MD5> >,
hashed_non_unique<tag<BySize>, const_mem_fun<Resource, u64_t, &Resource::Size> >,
2012-05-19 11:41:21 +04:00
hashed_unique<tag<ByIdentity>, identity<Resource*> >
2012-05-18 04:52:11 +04:00
>
> Folders ;
2016-01-03 01:57:54 +03:00
typedef Folders::index<ByMD5>::type MD5Map ;
2012-05-18 04:52:11 +04:00
typedef Folders::index<ByHref>::type HrefMap ;
typedef Folders::index<BySize>::type SizeMap ;
2012-05-18 04:52:11 +04:00
typedef Folders::index<ByIdentity>::type Set ;
typedef std::pair<SizeMap::iterator, SizeMap::iterator> SizeRange ;
2016-01-03 01:57:54 +03:00
typedef std::pair<MD5Map::iterator, MD5Map::iterator> MD5Range ;
2012-05-18 04:52:11 +04:00
}
/*! \brief A simple container for storing folders
This class stores a set of folders and provide fast search access from ID, HREF etc.
It is a wrapper around multi_index_container from Boost library.
*/
class ResourceTree
2012-05-18 04:52:11 +04:00
{
2012-05-19 13:14:04 +04:00
public :
typedef details::Set::iterator iterator ;
2012-05-18 04:52:11 +04:00
public :
ResourceTree( const fs::path& rootFolder ) ;
ResourceTree( const ResourceTree& fs ) ;
~ResourceTree( ) ;
2012-05-18 04:52:11 +04:00
2012-05-19 11:41:21 +04:00
Resource* FindByHref( const std::string& href ) ;
const Resource* FindByHref( const std::string& href ) const ;
2016-01-03 01:57:54 +03:00
details::MD5Range FindByMD5( const std::string& md5 ) ;
details::SizeRange FindBySize( u64_t size ) ;
2012-05-18 04:52:11 +04:00
2012-05-19 11:41:21 +04:00
bool ReInsert( Resource *coll ) ;
2012-05-18 04:52:11 +04:00
2012-05-19 11:41:21 +04:00
void Insert( Resource *coll ) ;
void Erase( Resource *coll ) ;
void Update( Resource *coll, const Entry& e ) ;
2012-05-19 11:26:55 +04:00
2012-05-19 11:41:21 +04:00
Resource* Root() ;
const Resource* Root() const ;
2012-05-19 13:14:04 +04:00
iterator begin() ;
iterator end() ;
private :
void Clear() ;
2012-05-18 04:52:11 +04:00
private :
details::Folders m_set ;
2012-05-19 11:41:21 +04:00
Resource* m_root ;
2012-05-18 04:52:11 +04:00
} ;
} // end of namespace gr