X-Git-Url: https://git.lyx.org/gitweb/?a=blobdiff_plain;f=boost%2Fboost%2Fproperty_map.hpp;h=9077ea37cd10d3f690e08462244cacbad706b2dd;hb=94da7f7c835a9b2b45f9c8c2b1a5dd16683cc25b;hp=74acca59fda08d11e8c227bb6fe58b2ab8e11b5e;hpb=e1644a68eb123c267a7ef2e651c66b788c38f03a;p=lyx.git diff --git a/boost/boost/property_map.hpp b/boost/boost/property_map.hpp index 74acca59fd..9077ea37cd 100644 --- a/boost/boost/property_map.hpp +++ b/boost/boost/property_map.hpp @@ -1,8 +1,7 @@ -// (C) Copyright Jeremy Siek 1999-2001. Permission to copy, use, modify, -// sell and distribute this software is granted provided this -// copyright notice appears in all copies. This software is provided -// "as is" without express or implied warranty, and with no claim as -// to its suitability for any purpose. +// (C) Copyright Jeremy Siek 1999-2001. +// Distributed under the Boost Software License, Version 1.0. (See +// accompanying file LICENSE_1_0.txt or copy at +// http://www.boost.org/LICENSE_1_0.txt) // See http://www.boost.org/libs/property_map for documentation. @@ -171,7 +170,9 @@ namespace boost { }; template const typename readable_property_map_archetype::reference& - get(const readable_property_map_archetype&, const K&) { + get(const readable_property_map_archetype&, + const typename readable_property_map_archetype::key_type&) + { typedef typename readable_property_map_archetype::reference R; return static_object::get(); } @@ -199,7 +200,9 @@ namespace boost { typedef writable_property_map_tag category; }; template - void put(const writable_property_map_archetype&, const K&, const V&) { } + void put(const writable_property_map_archetype&, + const typename writable_property_map_archetype::key_type&, + const typename writable_property_map_archetype::value_type&) { } template @@ -393,10 +396,11 @@ namespace boost { typedef boost::lvalue_property_map_tag category; inline safe_iterator_property_map( - RandomAccessIterator first = RandomAccessIterator(), - std::size_t n = 0, + RandomAccessIterator first, + std::size_t n_ = 0, const IndexMap& _id = IndexMap() ) - : iter(first), n(n), index(_id) { } + : iter(first), n(n_), index(_id) { } + inline safe_iterator_property_map() { } inline R operator[](key_type v) const { assert(get(index, v) < n); return *(iter + get(index, v)) ;