Files
duplicati/Duplicati/Library/Interface/IFileEntry.cs
T
kenneth@hexad.dk a0521da54d Initial version of the new block-based storage format.
Still needs a work over in terms of error handling, progress reporting, warning output, refactoring etc.
Also misses the volume reuse/reclaim algorithms.
But it passes the unit tests now, with and without a local database.

git-svn-id: https://duplicati.googlecode.com/svn/sandboxes/Kenneth/ForestHash@1526 59da171f-624f-0410-aa54-27559c288bec
2013-02-12 21:43:14 +00:00

51 lines
1.8 KiB
C#

#region Disclaimer / License
// Copyright (C) 2011, Kenneth Skovhede
// http://www.hexad.dk, opensource@hexad.dk
//
// This library 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 library 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 library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
//
#endregion
using System;
namespace Duplicati.Library.Interface
{
/// <summary>
/// The interface for an instance of a file, as seen by a backend
/// </summary>
public interface IFileEntry
{
/// <summary>
/// True if the entry represents a folder, false otherwise
/// </summary>
bool IsFolder { get; }
/// <summary>
/// The time the file or folder was last accessed
/// </summary>
DateTime LastAccess { get; }
/// <summary>
/// The time the file or folder was last modified
/// </summary>
DateTime LastModification { get; }
/// <summary>
/// The name of the file or folder
/// </summary>
string Name { get; }
/// <summary>
/// The size of the file or folder
/// </summary>
long Size { get; }
}
}