equal
deleted
inserted
replaced
1 /* -*- mode: C++; indent-tabs-mode: nil; -*- |
1 /* -*- mode: C++; indent-tabs-mode: nil; -*- |
2 * |
2 * |
3 * This file is a part of LEMON, a generic C++ optimization library. |
3 * This file is a part of LEMON, a generic C++ optimization library. |
4 * |
4 * |
5 * Copyright (C) 2003-2009 |
5 * Copyright (C) 2003-2010 |
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
6 * Egervary Jeno Kombinatorikus Optimalizalasi Kutatocsoport |
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
7 * (Egervary Research Group on Combinatorial Optimization, EGRES). |
8 * |
8 * |
9 * Permission to use, modify and distribute this software is granted |
9 * Permission to use, modify and distribute this software is granted |
10 * provided that this copyright notice appears in all copies. For |
10 * provided that this copyright notice appears in all copies. For |
432 /// Constructor with given initial value |
432 /// Constructor with given initial value |
433 NodeMap(const Digraph&, T) { } |
433 NodeMap(const Digraph&, T) { } |
434 |
434 |
435 private: |
435 private: |
436 ///Copy constructor |
436 ///Copy constructor |
437 NodeMap(const NodeMap& nm) : |
437 NodeMap(const NodeMap& nm) : |
438 ReferenceMap<Node, T, T&, const T&>(nm) { } |
438 ReferenceMap<Node, T, T&, const T&>(nm) { } |
439 ///Assignment operator |
439 ///Assignment operator |
440 template <typename CMap> |
440 template <typename CMap> |
441 NodeMap& operator=(const CMap&) { |
441 NodeMap& operator=(const CMap&) { |
442 checkConcept<ReadMap<Node, T>, CMap>(); |
442 checkConcept<ReadMap<Node, T>, CMap>(); |