r1134:0b9a94956916
Mon, 30 Jan 2012 17:49:50
[Not Reviewed]
0 comments (0 inline)
1
1
0
27
9
| 1 | 1 |
CMAKE_MINIMUM_REQUIRED(VERSION 2.6) |
| 2 | 2 |
|
| 3 | 3 |
SET(PROJECT_NAME "LEMON") |
| 4 | 4 |
PROJECT(${PROJECT_NAME})
|
| 5 | 5 |
|
| 6 | 6 |
INCLUDE(FindPythonInterp) |
| 7 | 7 |
INCLUDE(FindWget) |
| 8 | 8 |
|
| 9 | 9 |
IF(EXISTS ${PROJECT_SOURCE_DIR}/cmake/version.cmake)
|
| 10 | 10 |
INCLUDE(${PROJECT_SOURCE_DIR}/cmake/version.cmake)
|
| 11 | 11 |
ELSEIF(DEFINED ENV{LEMON_VERSION})
|
| 12 | 12 |
SET(LEMON_VERSION $ENV{LEMON_VERSION} CACHE STRING "LEMON version string.")
|
| 13 | 13 |
ELSE() |
| 14 | 14 |
EXECUTE_PROCESS( |
| 15 |
COMMAND |
|
| 15 |
COMMAND |
|
| 16 |
hg log -r. --template "{latesttag}"
|
|
| 16 | 17 |
WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}
|
| 17 |
OUTPUT_VARIABLE |
|
| 18 |
OUTPUT_VARIABLE HG_REVISION_TAG |
|
| 18 | 19 |
ERROR_QUIET |
| 19 | 20 |
OUTPUT_STRIP_TRAILING_WHITESPACE |
| 20 | 21 |
) |
| 21 | 22 |
EXECUTE_PROCESS( |
| 22 |
COMMAND |
|
| 23 |
COMMAND |
|
| 24 |
hg log -r. --template "{latesttagdistance}"
|
|
| 23 | 25 |
WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}
|
| 24 |
OUTPUT_VARIABLE |
|
| 26 |
OUTPUT_VARIABLE HG_REVISION_DIST |
|
| 25 | 27 |
ERROR_QUIET |
| 26 | 28 |
OUTPUT_STRIP_TRAILING_WHITESPACE |
| 27 | 29 |
) |
| 28 |
|
|
| 30 |
EXECUTE_PROCESS( |
|
| 31 |
COMMAND |
|
| 32 |
hg log -r. --template "{node|short}"
|
|
| 33 |
WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}
|
|
| 34 |
OUTPUT_VARIABLE HG_REVISION_ID |
|
| 35 |
ERROR_QUIET |
|
| 36 |
OUTPUT_STRIP_TRAILING_WHITESPACE |
|
| 37 |
) |
|
| 38 |
|
|
| 39 |
IF(HG_REVISION_TAG STREQUAL "") |
|
| 29 | 40 |
SET(HG_REVISION_ID "hg-tip") |
| 30 | 41 |
ELSE() |
| 31 |
IF(HG_REVISION_PATH STREQUAL "") |
|
| 32 |
SET(HG_REVISION_ID ${HG_REVISION})
|
|
| 42 |
IF(HG_REVISION_TAG STREQUAL "null") |
|
| 43 |
SET(HG_REVISION_TAG "trunk") |
|
| 44 |
ELSEIF(HG_REVISION_TAG MATCHES "^r") |
|
| 45 |
STRING(SUBSTRING ${HG_REVISION_TAG} 1 -1 HG_REVISION_TAG)
|
|
| 46 |
ENDIF() |
|
| 47 |
IF(HG_REVISION_DIST STREQUAL "0") |
|
| 48 |
SET(HG_REVISION ${HG_REVISION_TAG})
|
|
| 33 | 49 |
ELSE() |
| 34 |
SET( |
|
| 50 |
SET(HG_REVISION |
|
| 51 |
"${HG_REVISION_TAG}+${HG_REVISION_DIST}-${HG_REVISION_ID}")
|
|
| 35 | 52 |
ENDIF() |
| 36 | 53 |
ENDIF() |
| 37 |
|
|
| 54 |
|
|
| 55 |
SET(LEMON_VERSION ${HG_REVISION} CACHE STRING "LEMON version string.")
|
|
| 38 | 56 |
ENDIF() |
| 39 | 57 |
|
| 40 | 58 |
SET(PROJECT_VERSION ${LEMON_VERSION})
|
| 41 | 59 |
|
| 42 | 60 |
SET(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake)
|
| 43 | 61 |
|
| 44 | 62 |
FIND_PACKAGE(Doxygen) |
| 45 | 63 |
FIND_PACKAGE(Ghostscript) |
| 46 | 64 |
FIND_PACKAGE(GLPK 4.33) |
| 47 | 65 |
FIND_PACKAGE(CPLEX) |
| 48 | 66 |
FIND_PACKAGE(COIN) |
| 49 | 67 |
|
| 50 | 68 |
IF(DEFINED ENV{LEMON_CXX_WARNING})
|
| 51 | 69 |
SET(CXX_WARNING $ENV{LEMON_CXX_WARNING})
|
| 52 | 70 |
ELSE() |
| 53 | 71 |
IF(CMAKE_COMPILER_IS_GNUCXX) |
| 1 |
#! /usr/bin/env python |
|
| 2 |
# |
|
| 3 |
# This file is a part of LEMON, a generic C++ optimization library. |
|
| 4 |
# |
|
| 5 |
# Copyright (C) 2003-2009 |
|
| 6 |
# Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
|
| 7 |
# (Egervary Research Group on Combinatorial Optimization, EGRES). |
|
| 8 |
# |
|
| 9 |
# Permission to use, modify and distribute this software is granted |
|
| 10 |
# provided that this copyright notice appears in all copies. For |
|
| 11 |
# precise terms see the accompanying LICENSE file. |
|
| 12 |
# |
|
| 13 |
# This software is provided "AS IS" with no warranty of any kind, |
|
| 14 |
# express or implied, and with no claim as to its suitability for any |
|
| 15 |
# purpose. |
|
| 16 |
|
|
| 17 |
import sys |
|
| 18 |
|
|
| 19 |
from mercurial import ui, hg |
|
| 20 |
from mercurial import util |
|
| 21 |
|
|
| 22 |
util.rcpath = lambda : [] |
|
| 23 |
|
|
| 24 |
if len(sys.argv)>1 and sys.argv[1] in ["-h","--help"]: |
|
| 25 |
print """ |
|
| 26 |
This utility just prints the length of the longest path |
|
| 27 |
in the revision graph from revison 0 to the current one. |
|
| 28 |
""" |
|
| 29 |
exit(0) |
|
| 30 |
|
|
| 31 |
u = ui.ui() |
|
| 32 |
r = hg.repository(u, ".") |
|
| 33 |
N = r.changectx(".").rev()
|
|
| 34 |
lengths=[0]*(N+1) |
|
| 35 |
for i in range(N+1): |
|
| 36 |
p=r.changectx(i).parents() |
|
| 37 |
if p[0]: |
|
| 38 |
p0=lengths[p[0].rev()] |
|
| 39 |
else: |
|
| 40 |
p0=-1 |
|
| 41 |
if len(p)>1 and p[1]: |
|
| 42 |
p1=lengths[p[1].rev()] |
|
| 43 |
else: |
|
| 44 |
p1=-1 |
|
| 45 |
lengths[i]=max(p0,p1)+1 |
|
| 46 |
print lengths[N] |
0 comments (0 inline)