RhodeCode

    FORCE )

SET( CMAKE_SHARED_LINKER_FLAGS_MAINTAINER

    "-Wl,--warn-unresolved-symbols,--warn-once" CACHE STRING

    "Flags used by the shared libraries linker during maintainer builds."

    FORCE )

MARK_AS_ADVANCED(

    CMAKE_CXX_FLAGS_MAINTAINER

    CMAKE_C_FLAGS_MAINTAINER

    CMAKE_EXE_LINKER_FLAGS_MAINTAINER

    CMAKE_SHARED_LINKER_FLAGS_MAINTAINER )

IF(CMAKE_CONFIGURATION_TYPES)

  LIST(APPEND CMAKE_CONFIGURATION_TYPES Maintainer)

  LIST(REMOVE_DUPLICATES CMAKE_CONFIGURATION_TYPES)

  SET(CMAKE_CONFIGURATION_TYPES "${CMAKE_CONFIGURATION_TYPES}" CACHE STRING

      "Add the configurations that we need"

      FORCE)

 endif()

IF(NOT CMAKE_BUILD_TYPE)

  SET(CMAKE_BUILD_TYPE "Release")

ENDIF()

SET( CMAKE_BUILD_TYPE "${CMAKE_BUILD_TYPE}" CACHE STRING

    "Choose the type of build, options are: None(CMAKE_CXX_FLAGS or CMAKE_C_FLAGS used) Debug Release RelWithDebInfo MinSizeRel Maintainer."

    FORCE )

INCLUDE(CheckTypeSize)

CHECK_TYPE_SIZE("long long" LONG_LONG)

SET(LEMON_HAVE_LONG_LONG ${HAVE_LONG_LONG})

ENABLE_TESTING()

IF(${CMAKE_BUILD_TYPE} STREQUAL "Maintainer")

  ADD_CUSTOM_TARGET(check ALL COMMAND ${CMAKE_CTEST_COMMAND})

ELSE()

  ADD_CUSTOM_TARGET(check COMMAND ${CMAKE_CTEST_COMMAND})

ENDIF()

ADD_SUBDIRECTORY(lemon)

IF(${CMAKE_SOURCE_DIR} STREQUAL ${PROJECT_SOURCE_DIR})

  ADD_SUBDIRECTORY(contrib)

  ADD_SUBDIRECTORY(demo)

  ADD_SUBDIRECTORY(tools)

  ADD_SUBDIRECTORY(doc)

  ADD_SUBDIRECTORY(test)

ENDIF()

CONFIGURE_FILE(

  ${PROJECT_SOURCE_DIR}/cmake/LEMONConfig.cmake.in

  ${PROJECT_BINARY_DIR}/cmake/LEMONConfig.cmake

  @ONLY

)

IF(UNIX)

  INSTALL(

    FILES ${PROJECT_BINARY_DIR}/cmake/LEMONConfig.cmake

    DESTINATION share/lemon/cmake

  )

ELSEIF(WIN32)

  INSTALL(

    FILES ${PROJECT_BINARY_DIR}/cmake/LEMONConfig.cmake

    DESTINATION cmake

  )

	lemon/math.h \

	lemon/min_cost_arborescence.h \

	lemon/max_cardinality_search.h \

	lemon/nagamochi_ibaraki.h \

	lemon/nauty_reader.h \

	lemon/network_simplex.h \

	lemon/pairing_heap.h \

	lemon/path.h \

	lemon/planarity.h \

	lemon/preflow.h \

	lemon/quad_heap.h \

	lemon/radix_heap.h \

	lemon/radix_sort.h \

	lemon/random.h \

	lemon/smart_graph.h \

	lemon/soplex.h \

	lemon/static_graph.h \

	lemon/suurballe.h \

	lemon/time_measure.h \

	lemon/tolerance.h \

	lemon/unionfind.h \

	lemon/bits/windows.h

bits_HEADERS += \

	lemon/bits/alteration_notifier.h \

	lemon/bits/array_map.h \

	lemon/bits/bezier.h \

	lemon/bits/default_map.h \

	lemon/bits/edge_set_extender.h \

	lemon/bits/enable_if.h \

	lemon/bits/graph_adaptor_extender.h \

	lemon/bits/graph_extender.h \

	lemon/bits/map_extender.h \

	lemon/bits/path_dump.h \

	lemon/bits/solver_bits.h \

	lemon/bits/traits.h \

	lemon/bits/variant.h \

	lemon/bits/vector_map.h

concept_HEADERS += \

	lemon/concepts/digraph.h \

	lemon/concepts/graph.h \

	lemon/concepts/graph_components.h \

	lemon/concepts/heap.h \

	lemon/concepts/maps.h \

	lemon/concepts/path.h

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#ifndef LEMON_BITS_ALTERATION_NOTIFIER_H

#define LEMON_BITS_ALTERATION_NOTIFIER_H

#include <vector>

#include <list>

#include <lemon/core.h>

//\ingroup graphbits

//\file

//\brief Observer notifier for graph alteration observers.

namespace lemon {

  // \ingroup graphbits

  //

  // \brief Notifier class to notify observes about alterations in

  // a container.

  //

  // The simple graphs can be refered as two containers: a node container

  // and an edge container. But they do not store values directly, they

  // are just key continars for more value containers, which are the

  // node and edge maps.

  //

  // The node and edge sets of the graphs can be changed as we add or erase

  // nodes and edges in the graph. LEMON would like to handle easily

  // that the node and edge maps should contain values for all nodes or

  // edges. If we want to check on every indicing if the map contains

  // the current indicing key that cause a drawback in the performance

  // in the library. We use another solution: we notify all maps about

  // an alteration in the graph, which cause only drawback on the

  // alteration of the graph.

  //

  // This class provides an interface to a node or edge container.

  // The first() and next() member functions make possible

  // to iterate on the keys of the container.

  // The id() function returns an integer id for each key.

  // The maxId() function gives back an upper bound of the ids.

  //

      // \brief The member function to notificate the observer about

      // more item is erased from the container.

      //

      // The erase() member function notificates the observer about more item

      // is erased from the container. It have to be overrided in the

      // subclasses.

      virtual void erase(const std::vector<Item>& items) = 0;

      // \brief The member function to notificate the observer about the

      // container is built.

      //

      // The build() member function notificates the observer about the

      // container is built from an empty container. It have to be

      // overrided in the subclasses.

      virtual void build() = 0;

      // \brief The member function to notificate the observer about all

      // items are erased from the container.

      //

      // The clear() member function notificates the observer about all

      // items are erased from the container. It have to be overrided in

      // the subclasses.

      virtual void clear() = 0;

    };

  protected:

    const Container* container;

    typedef std::list<ObserverBase*> Observers;

    Observers _observers;

  public:

    // \brief Default constructor.

    //

    // The default constructor of the AlterationNotifier.

    // It creates an empty notifier.

    AlterationNotifier()

      : container(0) {}

    // \brief Constructor.

    //

    // Constructor with the observed container parameter.

    AlterationNotifier(const Container& _container)

      : container(&_container) {}

    // \brief Copy Constructor of the AlterationNotifier.

    //

    // Copy constructor of the AlterationNotifier.

    // It creates only an empty notifier because the copiable

    // notifier's observers have to be registered still into that notifier.

    AlterationNotifier(const AlterationNotifier& _notifier)

      : container(_notifier.container) {}

    // \brief Destructor.

    //

    // Destructor of the AlterationNotifier.

    ~AlterationNotifier() {

      typename Observers::iterator it;

      for (it = _observers.begin(); it != _observers.end(); ++it) {

        (*it)->_notifier = 0;

      }

    //

    // Returns the first item in the container. It is

    // for start the iteration on the container.

    void first(Item& item) const {

      container->first(item);

    }

    // \brief Next item in the container.

    //

    // Returns the next item in the container. It is

    // for iterate on the container.

    void next(Item& item) const {

      container->next(item);

    }

    // \brief Returns the id of the item.

    //

    // Returns the id of the item provided by the container.

    int id(const Item& item) const {

      return container->id(item);

    }

    // \brief Returns the maximum id of the container.

    //

    // Returns the maximum id of the container.

    int maxId() const {

      return container->maxId(Item());

    }

  protected:

    void attach(ObserverBase& observer) {

      observer._index = _observers.insert(_observers.begin(), &observer);

      observer._notifier = this;

    }

    void detach(ObserverBase& observer) {

      _observers.erase(observer._index);

      observer._index = _observers.end();

      observer._notifier = 0;

    }

  public:

    // \brief Notifies all the registed observers about an item added to

    // the container.

    //

    // It notifies all the registed observers about an item added to

    // the container.

    void add(const Item& item) {

      typename Observers::reverse_iterator it;

      try {

        for (it = _observers.rbegin(); it != _observers.rend(); ++it) {

          (*it)->add(item);

        }

      } catch (...) {

        typename Observers::iterator jt;

        for (jt = it.base(); jt != _observers.end(); ++jt) {

          (*jt)->erase(item);

        }

        throw;

      }

    }

    // \brief Notifies all the registed observers about more item added to

    // the container.

    //

    // It notifies all the registed observers about more item added to

    // the container.

    void add(const std::vector<Item>& items) {

      typename Observers::reverse_iterator it;

      try {

          if (GetDateFormat(MY_LOCALE, 0, &time,

                        ("ddd MMM dd"), buf1, 11) &&

          GetTimeFormat(MY_LOCALE, 0, &time,

                        ("HH':'mm':'ss"), buf2, 9) &&

          GetDateFormat(MY_LOCALE, 0, &time,

                        ("yyyy"), buf3, 5)) {

        os << buf1 << ' ' << buf2 << ' ' << buf3;

      }

      else os << "unknown";

#else

      timeval tv;

      gettimeofday(&tv, 0);

      char cbuf[26];

      ctime_r(&tv.tv_sec,cbuf);

      os << cbuf;

#endif

      return os.str();

    }

    int getWinRndSeed()

    {

#ifdef WIN32

      FILETIME time;

      GetSystemTimeAsFileTime(&time);

      return GetCurrentProcessId() + time.dwHighDateTime + time.dwLowDateTime;

#else

      timeval tv;

      gettimeofday(&tv, 0);

      return getpid() + tv.tv_sec + tv.tv_usec;

#endif

    }

  }

}

/* -*- mode: C++; indent-tabs-mode: nil; -*-

 *

 * This file is a part of LEMON, a generic C++ optimization library.

 *

 * Copyright (C) 2003-2009

 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport

 * (Egervary Research Group on Combinatorial Optimization, EGRES).

 *

 * Permission to use, modify and distribute this software is granted

 * provided that this copyright notice appears in all copies. For

 * precise terms see the accompanying LICENSE file.

 *

 * This software is provided "AS IS" with no warranty of any kind,

 * express or implied, and with no claim as to its suitability for any

 * purpose.

 *

 */

#ifndef LEMON_BITS_WINDOWS_H

#define LEMON_BITS_WINDOWS_H

#include <string>

namespace lemon {

  namespace bits {

    void getWinProcTimes(double &rtime,

                         double &utime, double &stime,

                         double &cutime, double &cstime);

    std::string getWinFormattedDate();

    int getWinRndSeed();

  }

}

#endif

#define LEMON_VERSION "@PROJECT_VERSION@"

#cmakedefine LEMON_HAVE_LONG_LONG 1

#cmakedefine LEMON_HAVE_LP 1

#cmakedefine LEMON_HAVE_MIP 1

#cmakedefine LEMON_HAVE_GLPK 1

#cmakedefine LEMON_HAVE_CPLEX 1

#cmakedefine LEMON_HAVE_CLP 1

#cmakedefine LEMON_HAVE_CBC 1

/* The version string */

#undef LEMON_VERSION

/* Define to 1 if you have long long */

#undef LEMON_HAVE_LONG_LONG

/* Define to 1 if you have any LP solver. */

#undef LEMON_HAVE_LP

/* Define to 1 if you have any MIP solver. */

#undef LEMON_HAVE_MIP

/* Define to 1 if you have CPLEX. */

#undef LEMON_HAVE_CPLEX

/* Define to 1 if you have GLPK. */

#undef LEMON_HAVE_GLPK

/* Define to 1 if you have SOPLEX */

#undef LEMON_HAVE_SOPLEX

/* Define to 1 if you have CLP */

#undef LEMON_HAVE_CLP

/* Define to 1 if you have CBC */

#undef LEMON_HAVE_CBC