/*
 * Copyright (C) 2017 Matthieu Gautier <mgautier@kymeria.fr>
 *
 * 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
 * is provided AS IS, WITHOUT ANY WARRANTY; without even the implied
 * warranty of MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, and
 * NON-INFRINGEMENT.  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 St, Fifth Floor, Boston, MA  02110-1301 USA
 *
 */

#ifndef ZIM_FILE_COMPOUND_H_
#define ZIM_FILE_COMPOUND_H_

#include "file_part.h"
#include "zim_types.h"
#include "debug.h"
#include <map>
#include <memory>
#include <cstdio>

namespace zim {

class FileReader;

struct Range {
  Range(const offset_t  min, const offset_t max)
    : min(min), max(max)
  {
      // ASSERT(min, <, max);
  }

  const offset_t min;
  const offset_t max;
};

struct less_range : public std::binary_function< Range, Range, bool>
{
  bool operator()(const Range& lhs, const Range& rhs) const {
    return lhs.min < rhs.min && lhs.max <= rhs.min;
  }
};

class FileCompound : private std::map<Range, FilePart<>*, less_range> {
    typedef std::map<Range, FilePart<>*, less_range> ImplType;

  public: // types
    typedef const_iterator PartIterator;
    typedef std::pair<PartIterator, PartIterator> PartRange;

  public: // functions
    FileCompound(const std::string& filename);
    FileCompound(FilePart<>* fpart);
    ~FileCompound();

    using ImplType::begin;
    using ImplType::end;

    zsize_t fsize() const { return _fsize; };
    time_t getMTime() const;
    bool fail() const { return empty(); };
    bool is_multiPart() const { return size() > 1; };

    PartIterator locate(offset_t offset) const {
      const PartIterator partIt = lower_bound(Range(offset, offset));
      ASSERT(partIt != end(), ==, true);
      return partIt;
    }

    PartRange locate(offset_t offset, zsize_t size) const {
#if ! defined(__APPLE__)
        return equal_range(Range(offset, offset+size));
#else
        // Workaround for https://github.com/openzim/libzim/issues/398
        // Under MacOS the implementation of std::map::equal_range() makes
        // assumptions about the properties of the key comparison function and
        // abuses the std::map requirement that it must contain unique keys. As
        // a result, when a map m is queried with an element k that is
        // equivalent to more than one keys present in m,
        // m.equal_range(k).first may be different from m.lower_bound(k) (the
        // latter one returning the correct result).
        const Range queryRange(offset, offset+size);
        return {lower_bound(queryRange), upper_bound(queryRange)};
#endif // ! defined(__APPLE__)
    }

  private: // functions
    void addPart(FilePart<>* fpart);

  private: // data
    zsize_t _fsize;
    mutable time_t mtime;
};


};


#endif //ZIM_FILE_COMPOUND_H_
