2008-08-31 13:58:17 +00:00
|
|
|
/* ScummVM - Graphic Adventure Engine
|
|
|
|
*
|
|
|
|
* ScummVM is the legal property of its developers, whose names
|
|
|
|
* are too numerous to list here. Please refer to the COPYRIGHT
|
|
|
|
* file distributed with this source distribution.
|
|
|
|
*
|
|
|
|
* 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 2
|
|
|
|
* 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; if not, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
|
|
|
|
*
|
|
|
|
* $URL$
|
|
|
|
* $Id$
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
2008-12-27 18:03:27 +00:00
|
|
|
#ifndef COMMON_ARCHIVE_H
|
|
|
|
#define COMMON_ARCHIVE_H
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
#include "common/str.h"
|
|
|
|
#include "common/hash-str.h"
|
|
|
|
#include "common/list.h"
|
|
|
|
#include "common/ptr.h"
|
2008-09-11 13:24:01 +00:00
|
|
|
#include "common/singleton.h"
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
namespace Common {
|
|
|
|
|
2008-12-27 18:03:27 +00:00
|
|
|
class FSNode;
|
|
|
|
class SeekableReadStream;
|
|
|
|
|
|
|
|
|
2008-10-12 06:06:04 +00:00
|
|
|
/**
|
|
|
|
* ArchiveMember is an abstract interface to represent elements inside
|
|
|
|
* implementations of Archive.
|
|
|
|
*
|
|
|
|
* Archive subclasses must provide their own implementation of ArchiveMember,
|
|
|
|
* and use it when serving calls to listMembers() and listMatchingMembers().
|
|
|
|
* Alternatively, the GenericArchiveMember below can be used.
|
|
|
|
*/
|
2008-10-03 16:57:40 +00:00
|
|
|
class ArchiveMember {
|
|
|
|
public:
|
|
|
|
virtual ~ArchiveMember() { }
|
2009-01-23 04:36:18 +00:00
|
|
|
virtual SeekableReadStream *createReadStream() const = 0;
|
2008-11-21 12:17:35 +00:00
|
|
|
virtual String getName() const = 0;
|
|
|
|
virtual String getDisplayName() const { return getName(); }
|
2008-10-03 16:57:40 +00:00
|
|
|
};
|
|
|
|
|
2008-11-01 12:49:29 +00:00
|
|
|
typedef SharedPtr<ArchiveMember> ArchiveMemberPtr;
|
|
|
|
typedef List<ArchiveMemberPtr> ArchiveMemberList;
|
2008-10-03 16:57:40 +00:00
|
|
|
|
|
|
|
class Archive;
|
|
|
|
|
|
|
|
/**
|
2008-10-12 06:06:04 +00:00
|
|
|
* Simple ArchiveMember implementation which allows
|
2008-10-03 16:57:40 +00:00
|
|
|
* creation of ArchiveMember compatible objects via
|
|
|
|
* a simple Archive and name pair.
|
|
|
|
*
|
|
|
|
* Note that GenericArchiveMember objects will not
|
|
|
|
* be working anymore after the 'parent' object
|
|
|
|
* is destroyed.
|
|
|
|
*/
|
|
|
|
class GenericArchiveMember : public ArchiveMember {
|
|
|
|
Archive *_parent;
|
|
|
|
String _name;
|
|
|
|
public:
|
|
|
|
GenericArchiveMember(String name, Archive *parent);
|
|
|
|
String getName() const;
|
2009-01-23 04:36:18 +00:00
|
|
|
SeekableReadStream *createReadStream() const;
|
2008-10-03 16:57:40 +00:00
|
|
|
};
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Archive allows searches of (file)names into an arbitrary container.
|
|
|
|
* It also supports opening a file and returning an usable input stream.
|
|
|
|
*/
|
|
|
|
class Archive {
|
|
|
|
public:
|
|
|
|
virtual ~Archive() { }
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Check if a name is present in the Archive. Patterns are not allowed,
|
|
|
|
* as this is meant to be a quick File::exists() replacement.
|
|
|
|
*/
|
|
|
|
virtual bool hasFile(const String &name) = 0;
|
|
|
|
|
|
|
|
/**
|
2008-09-06 21:09:34 +00:00
|
|
|
* Add all the names present in the Archive which match pattern to
|
2009-01-23 04:45:44 +00:00
|
|
|
* list. Returned names can be used as parameters to createReadStreamForMember.
|
2008-08-31 13:58:17 +00:00
|
|
|
* Must not remove elements from the list.
|
|
|
|
*
|
2008-09-06 21:09:34 +00:00
|
|
|
* @return the number of names added to list
|
2008-08-31 13:58:17 +00:00
|
|
|
*/
|
2008-10-03 16:57:40 +00:00
|
|
|
virtual int listMatchingMembers(ArchiveMemberList &list, const String &pattern);
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
/**
|
2008-09-06 21:09:34 +00:00
|
|
|
* Add all the names present in the Archive to list. Returned
|
2009-01-23 04:45:44 +00:00
|
|
|
* names can be used as parameters to createReadStreamForMember.
|
2008-08-31 13:58:17 +00:00
|
|
|
* Must not remove elements from the list.
|
|
|
|
*
|
2008-09-06 21:09:34 +00:00
|
|
|
* @return the number of names added to list
|
2008-08-31 13:58:17 +00:00
|
|
|
*/
|
2008-10-03 16:57:40 +00:00
|
|
|
virtual int listMembers(ArchiveMemberList &list) = 0;
|
2008-08-31 13:58:17 +00:00
|
|
|
|
2008-11-01 12:49:29 +00:00
|
|
|
/**
|
|
|
|
* Returns a ArchiveMember representation of the given file.
|
|
|
|
*/
|
|
|
|
virtual ArchiveMemberPtr getMember(const String &name) = 0;
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
/**
|
2009-02-22 16:48:02 +00:00
|
|
|
* Create a stream bound to a member in the archive. If no member with the
|
|
|
|
* specified name exists, then 0 is returned.
|
2008-09-06 21:09:34 +00:00
|
|
|
* @return the newly created input stream
|
2008-08-31 13:58:17 +00:00
|
|
|
*/
|
2009-01-23 04:45:44 +00:00
|
|
|
virtual SeekableReadStream *createReadStreamForMember(const String &name) const = 0;
|
2008-08-31 13:58:17 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
/**
|
|
|
|
* SearchSet enables access to a group of Archives through the Archive interface.
|
|
|
|
* Its intended usage is a situation in which there are no name clashes among names in the
|
|
|
|
* contained Archives, hence the simplistic policy of always looking for the first
|
|
|
|
* match. SearchSet *DOES* guarantee that searches are performed in *DESCENDING*
|
|
|
|
* priority order. In case of conflicting priorities, insertion order prevails.
|
|
|
|
*/
|
2008-09-03 19:07:38 +00:00
|
|
|
class SearchSet : public Archive {
|
2008-08-31 13:58:17 +00:00
|
|
|
struct Node {
|
2008-10-22 17:44:12 +00:00
|
|
|
int _priority;
|
|
|
|
String _name;
|
|
|
|
Archive *_arc;
|
|
|
|
bool _autoFree;
|
|
|
|
Node(int priority, const String &name, Archive *arc, bool autoFree)
|
|
|
|
: _priority(priority), _name(name), _arc(arc), _autoFree(autoFree) {
|
2008-09-29 19:09:56 +00:00
|
|
|
}
|
2008-08-31 13:58:17 +00:00
|
|
|
};
|
2008-12-15 12:55:13 +00:00
|
|
|
typedef List<Node> ArchiveNodeList;
|
|
|
|
ArchiveNodeList _list;
|
2008-08-31 13:58:17 +00:00
|
|
|
|
2008-12-15 12:55:13 +00:00
|
|
|
ArchiveNodeList::iterator find(const String &name) const;
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
// Add an archive keeping the list sorted by ascending priorities.
|
|
|
|
void insert(const Node& node);
|
|
|
|
|
|
|
|
public:
|
2008-10-22 17:44:12 +00:00
|
|
|
virtual ~SearchSet() { clear(); }
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
/**
|
2008-09-06 22:09:34 +00:00
|
|
|
* Add a new archive to the searchable set.
|
2008-08-31 13:58:17 +00:00
|
|
|
*/
|
2008-10-22 17:44:12 +00:00
|
|
|
void add(const String& name, Archive *arch, int priority = 0, bool autoFree = true);
|
2008-08-31 13:58:17 +00:00
|
|
|
|
2008-12-27 17:16:48 +00:00
|
|
|
/**
|
|
|
|
* Create and add a FSDirectory by name
|
|
|
|
*/
|
|
|
|
void addDirectory(const String &name, const String &directory, int priority = 0, int depth = 1);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Create and add a FSDirectory by FSNode
|
|
|
|
*/
|
|
|
|
void addDirectory(const String &name, const FSNode &directory, int priority = 0, int depth = 1);
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
/**
|
2008-09-06 22:09:34 +00:00
|
|
|
* Remove an archive from the searchable set.
|
2008-08-31 13:58:17 +00:00
|
|
|
*/
|
|
|
|
void remove(const String& name);
|
|
|
|
|
2008-09-06 22:09:34 +00:00
|
|
|
/**
|
|
|
|
* Check if a given archive name is already present.
|
|
|
|
*/
|
|
|
|
bool hasArchive(const String &name) const;
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
/**
|
2008-12-22 11:22:15 +00:00
|
|
|
* Empties the searchable set.
|
|
|
|
*/
|
2008-09-27 18:32:01 +00:00
|
|
|
virtual void clear();
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
/**
|
2008-12-22 11:22:15 +00:00
|
|
|
* Change the order of searches.
|
|
|
|
*/
|
2008-09-27 18:32:01 +00:00
|
|
|
void setPriority(const String& name, int priority);
|
2008-08-31 13:58:17 +00:00
|
|
|
|
|
|
|
virtual bool hasFile(const String &name);
|
2008-10-03 16:57:40 +00:00
|
|
|
virtual int listMatchingMembers(ArchiveMemberList &list, const String &pattern);
|
|
|
|
virtual int listMembers(ArchiveMemberList &list);
|
2008-08-31 13:58:17 +00:00
|
|
|
|
2008-11-01 12:49:29 +00:00
|
|
|
virtual ArchiveMemberPtr getMember(const String &name);
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
/**
|
2009-01-23 04:45:44 +00:00
|
|
|
* Implements createReadStreamForMember from Archive base class. The current policy is
|
2008-08-31 13:58:17 +00:00
|
|
|
* opening the first file encountered that matches the name.
|
|
|
|
*/
|
2009-01-23 04:45:44 +00:00
|
|
|
virtual SeekableReadStream *createReadStreamForMember(const String &name) const;
|
2008-08-31 13:58:17 +00:00
|
|
|
};
|
|
|
|
|
2008-09-11 13:24:01 +00:00
|
|
|
|
2008-09-17 18:59:09 +00:00
|
|
|
class SearchManager : public Singleton<SearchManager>, public SearchSet {
|
2008-09-11 13:24:01 +00:00
|
|
|
public:
|
2008-09-27 18:32:01 +00:00
|
|
|
|
|
|
|
/**
|
2008-10-22 17:08:17 +00:00
|
|
|
* Resets the search manager to the default list of search paths (system
|
|
|
|
* specific dirs + current dir).
|
2008-09-27 18:32:01 +00:00
|
|
|
*/
|
|
|
|
virtual void clear();
|
2008-10-22 22:31:09 +00:00
|
|
|
|
|
|
|
private:
|
|
|
|
friend class Common::Singleton<SingletonBaseType>;
|
|
|
|
SearchManager();
|
2008-09-11 13:24:01 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/** Shortcut for accessing the search manager. */
|
|
|
|
#define SearchMan Common::SearchManager::instance()
|
|
|
|
|
2008-08-31 13:58:17 +00:00
|
|
|
} // namespace Common
|
|
|
|
|
|
|
|
#endif
|