RhodeCode

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

 *

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

 *

 * Copyright (C) 2003-2008

 * 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.

 *

 */

namespace lemon {

/*!

\page migration Migration from the 0.x Series

This guide gives an in depth description on what has changed compared

to the 0.x release series.

Many of these changes adjusted automatically by the

update are typeset <b>boldface</b>.

\section migration-graph Graph Related Name Changes

- \ref concepts::Digraph "Directed graphs" are called \c Digraph and

  they have <tt>Arc</tt>s (instead of <tt>Edge</tt>s), while

  \ref concepts::Graph "undirected graphs" are called \c Graph

  (instead of \c UGraph) and they have <tt>Edge</tt>s (instead of

  <tt>UEdge</tt>s). These changes reflected thoroughly everywhere in

  the library. Namely,

  - \c Graph -> \c Digraph

    - \c %ListGraph -> \c ListDigraph, \c %SmartGraph -> \c SmartDigraph etc.

  - \c UGraph -> \c Graph

    - \c ListUGraph -> \c ListGraph, \c SmartUGraph -> \c SmartGraph etc.

  - \c Edge -> \c Arc, \c UEdge -> \c Edge

  - \c EdgeMap -> \c ArcMap, \c UEdgeMap -> \c EdgeMap

  - \c EdgeIt -> \c ArcIt, \c UEdgeIt -> \c EdgeIt

  - Class names and function names containing the words \c graph,

    \c ugraph, \e edge or \e arc should also be updated.

- <b>The two endpoints of an (\e undirected) \c Edge can be obtained by the

  <tt>u()</tt> and <tt>v()</tt> member function of the graph

  (instead of <tt>source()</tt> and <tt>target()</tt>). This change

  must be done by hand.</b>

  \n Of course, you can still use <tt>source()</tt> and <tt>target()</tt>

  for <tt>Arc</tt>s (directed edges).

\warning

\section migration-lgf LGF tools

 - The \ref lgf-format "LGF file format" has changed,

   <tt>\@nodeset</tt> has changed to <tt>\@nodes</tt>,

   <tt>\@edgeset</tt> and <tt>\@uedgeset</tt> to <tt>\@arcs</tt> or

   <tt>\@edges</tt>, which become completely equivalents. The

   <tt>\@nodes</tt>, <tt>\@edges</tt> and <tt>\@uedges</tt> sections are

   removed from the format, the content of them should be

   the part of <tt>\@attributes</tt> section. The data fields in

   the sections must follow a strict format, they must be either character

   sequences without whitespaces or quoted strings.

 - The <tt>LemonReader</tt> and <tt>LemonWriter</tt> core interfaces

   are no longer available.

 - The implementation of the general section readers and writers has changed

   they are simple functors now. Beside the old

   stream based section handling, currently line oriented section

   reading and writing are also supported. In the

   section readers the lines must be counted manually. The sections

   should be read and written with the SectionWriter and SectionReader

   classes.

 - Instead of the item readers and writers, item converters should be

   used. The converters are functors, which map the type to

   std::string or std::string to the type. The converters for standard

   containers hasn't yet been implemented in the new LEMON. The converters

   can return strings in any format, because if it is necessary, the LGF

   writer and reader will quote and unquote the given value.

 - The DigraphReader and DigraphWriter can used similarly to the

   0.x series, however the <tt>read</tt> or <tt>write</tt> prefix of

   the member functions are removed.

 - The new LEMON supports the function like interface, the \c

   digraphReader and \c digraphWriter functions are more convenient than

   using the classes directly.

\section migration-search BFS, DFS and Dijkstra

- <b>Using the function interface of BFS, DFS and %Dijkstra both source and

  target nodes can be given as parameters of the <tt>run()</tt> function

  (instead of \c bfs(), \c dfs() or \c dijkstra() itself).</b>

- \ref named-templ-param "Named class template parameters" of \c Bfs,

  \c Dfs, \c Dijkstra, \c BfsVisit, \c DfsVisit are renamed to start

  with "Set" instead of "Def". Namely,

  - \c DefPredMap -> \c SetPredMap

  - \c DefDistMap -> \c SetDistMap

  - \c DefReachedMap -> \c SetReachedMap

  - \c DefProcessedMap -> \c SetProcessedMap

  - \c DefHeap -> \c SetHeap

  - \c DefStandardHeap -> \c SetStandardHeap

  - \c DefOperationTraits -> \c SetOperationTraits

  - \c DefProcessedMapToBeDefaultMap -> \c SetStandardProcessedMap

#!/bin/bash

set -e

if [ $# -eq 0 -o x$1 = "x-h" -o x$1 = "x-help" -o x$1 = "x--help" ]; then

    echo "Usage:"

    echo "  $0 source-file(s)"

    exit

fi

for i in $@

do

    echo Update $i...

    TMP=`mktemp`

    sed -e "s/undirected graph/_gr_aph_label_/g"\

        -e "s/undirected edge/_ed_ge_label_/g"\

        -e "s/UGraph/_Gr_aph_label_/g"\

        -e "s/Graph/_Digr_aph_label_/g"\

        -e "s/graph/_digr_aph_label_/g"\

        -e "s/UEdge/_Ed_ge_label_/g"\

        -e "s/IncEdgeIt/_In_cEd_geIt_label_/g"\

        -e "s/Edge/_Ar_c_label_/g"\

        -e "s/edge/_ar_c_label_/g"\

        -e "s/_Digr_aph_label_/Digraph/g"\

        -e "s/_digr_aph_label_/digraph/g"\

        -e "s/_Gr_aph_label_/Graph/g"\

        -e "s/_gr_aph_label_/graph/g"\

        -e "s/_Ar_c_label_/Arc/g"\

        -e "s/_ar_c_label_/arc/g"\

        -e "s/_Ed_ge_label_/Edge/g"\

        -e "s/_ed_ge_label_/edge/g"\

        -e "s/_In_cEd_geIt_label_/IncEdgeIt/g"\

        -e "s/_Re_d_label_/Red/g"\

        -e "s/_Blu_e_label_/Blue/g"\

        -e "s/_re_d_label_/red/g"\

        -e "s/_blu_e_label_/blue/g"\

        -e "s/\<DefPredMap\>/SetPredMap/g"\

        -e "s/\<DefDistMap\>/SetDistMap/g"\

        -e "s/\<DefReachedMap\>/SetReachedMap/g"\

        -e "s/\<DefProcessedMap\>/SetProcessedMap/g"\

        -e "s/\<DefHeap\>/SetHeap/g"\

        -e "s/\<DefStandardHeap\>/SetStandradHeap/g"\

        -e "s/\<DefOperationTraits\>/SetOperationTraits/g"\

        -e "s/\<DefProcessedMapToBeDefaultMap\>/SetStandardProcessedMap/g"\

        -e "s/\<copyGraph\>/graphCopy/g"\

        -e "s/\<copyDigraph\>/digraphCopy/g"\

        -e "s/\<IntegerMap\>/RangeMap/g"\

        -e "s/\<integerMap\>/rangeMap/g"\

        -e "s/\<\([sS]\)tdMap\>/\1parseMap/g"\

        -e "s/\<\([Ff]\)unctorMap\>/\1unctorToMap/g"\

        -e "s/\<\([Mm]\)apFunctor\>/\1apToFunctor/g"\

        -e "s/\<\([Ff]\)orkWriteMap\>/\1orkMap/g"\

        -e "s/\<StoreBoolMap\>/LoggerBoolMap/g"\

        -e "s/\<storeBoolMap\>/loggerBoolMap/g"\

        -e "s/\<BoundingBox\>/Box/g"\

    <$i > $TMP

    mv $TMP $i

done