Remove unused patches from the repo
The spec file stopped using these patches years ago.
This commit is contained in:
parent
eefba79672
commit
c808f65625
@ -1,80 +0,0 @@
|
|||||||
diff -up boost_1_53_0/boost/math/special_functions/sign.hpp\~ boost_1_53_0/boost/math/special_functions/sign.hpp
|
|
||||||
--- boost_1_53_0/boost/math/special_functions/sign.hpp~ 2011-05-17 14:19:17.000000000 +0200
|
|
||||||
+++ boost_1_53_0/boost/math/special_functions/sign.hpp 2013-07-22 23:24:39.751342557 +0200
|
|
||||||
@@ -110,7 +110,6 @@ template<class T> int (signbit)(T x)
|
|
||||||
{
|
|
||||||
typedef typename detail::fp_traits<T>::type traits;
|
|
||||||
typedef typename traits::method method;
|
|
||||||
- typedef typename boost::is_floating_point<T>::type fp_tag;
|
|
||||||
return detail::signbit_impl(x, method());
|
|
||||||
}
|
|
||||||
|
|
||||||
@@ -124,7 +123,6 @@ template<class T> T (changesign)(const T
|
|
||||||
{ //!< \brief return unchanged binary pattern of x, except for change of sign bit.
|
|
||||||
typedef typename detail::fp_traits<T>::sign_change_type traits;
|
|
||||||
typedef typename traits::method method;
|
|
||||||
- typedef typename boost::is_floating_point<T>::type fp_tag;
|
|
||||||
|
|
||||||
return detail::changesign_impl(x, method());
|
|
||||||
}
|
|
||||||
diff -up boost_1_53_0/boost/math/special_functions/fpclassify.hpp~ boost_1_53_0/boost/math/special_functions/fpclassify.hpp
|
|
||||||
--- boost_1_53_0/boost/math/special_functions/fpclassify.hpp~ 2012-12-12 19:17:22.000000000 +0100
|
|
||||||
+++ boost_1_53_0/boost/math/special_functions/fpclassify.hpp 2013-07-22 12:07:59.478713488 +0200
|
|
||||||
@@ -327,7 +327,6 @@ inline bool (isfinite)(T x)
|
|
||||||
{ //!< \brief return true if floating-point type t is finite.
|
|
||||||
typedef typename detail::fp_traits<T>::type traits;
|
|
||||||
typedef typename traits::method method;
|
|
||||||
- typedef typename boost::is_floating_point<T>::type fp_tag;
|
|
||||||
typedef typename tools::promote_args<T>::type value_type;
|
|
||||||
return detail::isfinite_impl(static_cast<value_type>(x), method());
|
|
||||||
}
|
|
||||||
@@ -338,7 +338,6 @@ inline bool (isfinite)(long double x)
|
|
||||||
{ //!< \brief return true if floating-point type t is finite.
|
|
||||||
typedef detail::fp_traits<long double>::type traits;
|
|
||||||
typedef traits::method method;
|
|
||||||
- typedef boost::is_floating_point<long double>::type fp_tag;
|
|
||||||
typedef long double value_type;
|
|
||||||
return detail::isfinite_impl(static_cast<value_type>(x), method());
|
|
||||||
}
|
|
||||||
@@ -398,7 +397,6 @@ inline bool (isnormal)(T x)
|
|
||||||
{
|
|
||||||
typedef typename detail::fp_traits<T>::type traits;
|
|
||||||
typedef typename traits::method method;
|
|
||||||
- typedef typename boost::is_floating_point<T>::type fp_tag;
|
|
||||||
typedef typename tools::promote_args<T>::type value_type;
|
|
||||||
return detail::isnormal_impl(static_cast<value_type>(x), method());
|
|
||||||
}
|
|
||||||
@@ -409,7 +408,6 @@ inline bool (isnormal)(long double x)
|
|
||||||
{
|
|
||||||
typedef detail::fp_traits<long double>::type traits;
|
|
||||||
typedef traits::method method;
|
|
||||||
- typedef boost::is_floating_point<long double>::type fp_tag;
|
|
||||||
typedef long double value_type;
|
|
||||||
return detail::isnormal_impl(static_cast<value_type>(x), method());
|
|
||||||
}
|
|
||||||
@@ -487,7 +485,6 @@ inline bool (isinf)(T x)
|
|
||||||
{
|
|
||||||
typedef typename detail::fp_traits<T>::type traits;
|
|
||||||
typedef typename traits::method method;
|
|
||||||
- typedef typename boost::is_floating_point<T>::type fp_tag;
|
|
||||||
typedef typename tools::promote_args<T>::type value_type;
|
|
||||||
return detail::isinf_impl(static_cast<value_type>(x), method());
|
|
||||||
}
|
|
||||||
@@ -498,7 +496,6 @@ inline bool (isinf)(long double x)
|
|
||||||
{
|
|
||||||
typedef detail::fp_traits<long double>::type traits;
|
|
||||||
typedef traits::method method;
|
|
||||||
- typedef boost::is_floating_point<long double>::type fp_tag;
|
|
||||||
typedef long double value_type;
|
|
||||||
return detail::isinf_impl(static_cast<value_type>(x), method());
|
|
||||||
}
|
|
||||||
@@ -570,7 +567,6 @@ inline bool (isnan)(T x)
|
|
||||||
{ //!< \brief return true if floating-point type t is NaN (Not A Number).
|
|
||||||
typedef typename detail::fp_traits<T>::type traits;
|
|
||||||
typedef typename traits::method method;
|
|
||||||
- typedef typename boost::is_floating_point<T>::type fp_tag;
|
|
||||||
return detail::isnan_impl(x, method());
|
|
||||||
}
|
|
||||||
|
|
||||||
|
|
||||||
Diff finished. Mon Jul 22 12:09:24 2013
|
|
@ -1,130 +0,0 @@
|
|||||||
diff -urp boost_1_54_0-orig/boost/graph/breadth_first_search.hpp boost_1_54_0/boost/graph/breadth_first_search.hpp
|
|
||||||
--- boost_1_54_0-orig/boost/graph/breadth_first_search.hpp 2013-07-23 00:47:43.418886551 +0200
|
|
||||||
+++ boost_1_54_0/boost/graph/breadth_first_search.hpp 2013-07-23 00:50:40.339958756 +0200
|
|
||||||
@@ -64,7 +64,6 @@ namespace boost {
|
|
||||||
BOOST_CONCEPT_ASSERT(( IncidenceGraphConcept<IncidenceGraph> ));
|
|
||||||
typedef graph_traits<IncidenceGraph> GTraits;
|
|
||||||
typedef typename GTraits::vertex_descriptor Vertex;
|
|
||||||
- typedef typename GTraits::edge_descriptor Edge;
|
|
||||||
BOOST_CONCEPT_ASSERT(( BFSVisitorConcept<BFSVisitor, IncidenceGraph> ));
|
|
||||||
BOOST_CONCEPT_ASSERT(( ReadWritePropertyMapConcept<ColorMap, Vertex> ));
|
|
||||||
typedef typename property_traits<ColorMap>::value_type ColorValue;
|
|
||||||
diff -urp boost_1_53_0-orig/boost/graph/compressed_sparse_row_graph.hpp boost_1_53_0/boost/graph/compressed_sparse_row_graph.hpp
|
|
||||||
--- boost_1_53_0-orig/boost/graph/compressed_sparse_row_graph.hpp 2013-07-23 01:32:19.273266030 +0200
|
|
||||||
+++ boost_1_53_0/boost/graph/compressed_sparse_row_graph.hpp 2013-07-23 01:34:15.202970721 +0200
|
|
||||||
@@ -642,8 +642,6 @@ class compressed_sparse_row_graph<direct
|
|
||||||
const GlobalToLocal& global_to_local) {
|
|
||||||
typedef compressed_sparse_row_graph Graph;
|
|
||||||
typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex_t;
|
|
||||||
- typedef typename boost::graph_traits<Graph>::vertices_size_type vertex_num;
|
|
||||||
- typedef typename boost::graph_traits<Graph>::edges_size_type edge_num;
|
|
||||||
typedef std::vector<std::pair<vertex_t, vertex_t> > edge_vector_t;
|
|
||||||
edge_vector_t new_edges(first, last);
|
|
||||||
if (new_edges.empty()) return;
|
|
||||||
@@ -666,8 +664,6 @@ class compressed_sparse_row_graph<direct
|
|
||||||
const GlobalToLocal& global_to_local) {
|
|
||||||
typedef compressed_sparse_row_graph Graph;
|
|
||||||
typedef typename boost::graph_traits<Graph>::vertex_descriptor vertex_t;
|
|
||||||
- typedef typename boost::graph_traits<Graph>::vertices_size_type vertex_num;
|
|
||||||
- typedef typename boost::graph_traits<Graph>::edges_size_type edge_num;
|
|
||||||
typedef std::pair<vertex_t, vertex_t> vertex_pair;
|
|
||||||
typedef std::vector<
|
|
||||||
boost::tuple<vertex_pair,
|
|
||||||
@@ -1164,7 +1160,6 @@ inline std::pair<typename BOOST_BIDIR_CS
|
|
||||||
typename BOOST_BIDIR_CSR_GRAPH_TYPE::in_edge_iterator>
|
|
||||||
in_edges(Vertex v, const BOOST_BIDIR_CSR_GRAPH_TYPE& g)
|
|
||||||
{
|
|
||||||
- typedef typename BOOST_BIDIR_CSR_GRAPH_TYPE::edge_descriptor ed;
|
|
||||||
typedef typename BOOST_BIDIR_CSR_GRAPH_TYPE::in_edge_iterator it;
|
|
||||||
EdgeIndex v_row_start = g.m_backward.m_rowstart[v];
|
|
||||||
EdgeIndex next_row_start = g.m_backward.m_rowstart[v + 1];
|
|
||||||
@@ -1368,7 +1363,6 @@ put(Tag tag,
|
|
||||||
typename property_map<BOOST_CSR_GRAPH_TYPE, Tag>::key_type k,
|
|
||||||
typename lookup_one_property<typename property_map<BOOST_CSR_GRAPH_TYPE, Tag>::plist_type, Tag>::type val) {
|
|
||||||
typedef typename property_map<BOOST_CSR_GRAPH_TYPE, Tag>::all_tag all_tag;
|
|
||||||
- typedef typename property_map<BOOST_CSR_GRAPH_TYPE, all_tag>::type outer_pm;
|
|
||||||
lookup_one_property<typename property_map<BOOST_CSR_GRAPH_TYPE, Tag>::plist_type, Tag>::lookup(get(all_tag(), g, k), tag) = val;
|
|
||||||
}
|
|
||||||
|
|
||||||
diff -urp boost_1_53_0-orig/boost/graph/detail/adjacency_list.hpp boost_1_53_0/boost/graph/detail/adjacency_list.hpp
|
|
||||||
--- boost_1_53_0-orig/boost/graph/detail/adjacency_list.hpp 2013-07-23 01:32:19.390266741 +0200
|
|
||||||
+++ boost_1_53_0/boost/graph/detail/adjacency_list.hpp 2013-07-23 01:34:15.275971164 +0200
|
|
||||||
@@ -634,7 +634,6 @@ namespace boost {
|
|
||||||
directed_graph_helper<Config>& g_)
|
|
||||||
{
|
|
||||||
typedef typename Config::graph_type graph_type;
|
|
||||||
- typedef typename Config::edge_parallel_category Cat;
|
|
||||||
graph_type& g = static_cast<graph_type&>(g_);
|
|
||||||
g.out_edge_list(u).clear();
|
|
||||||
// clear() should be a req of Sequence and AssociativeContainer,
|
|
||||||
@@ -781,7 +780,6 @@ namespace boost {
|
|
||||||
typedef typename Graph::global_edgelist_selector EdgeListS;
|
|
||||||
BOOST_STATIC_ASSERT((!is_same<EdgeListS, vecS>::value));
|
|
||||||
|
|
||||||
- typedef typename EdgeList::value_type StoredEdge;
|
|
||||||
typename EdgeList::iterator i = el.begin(), end = el.end();
|
|
||||||
for (; i != end; ++i) {
|
|
||||||
if ((*i).get_target() == v) {
|
|
||||||
@@ -986,7 +984,6 @@ namespace boost {
|
|
||||||
BOOST_STATIC_ASSERT((!is_same<EdgeListS, vecS>::value));
|
|
||||||
|
|
||||||
typedef typename Config::graph_type graph_type;
|
|
||||||
- typedef typename Config::edge_parallel_category Cat;
|
|
||||||
graph_type& g = static_cast<graph_type&>(g_);
|
|
||||||
while (true) {
|
|
||||||
typename Config::out_edge_iterator ei, ei_end;
|
|
||||||
@@ -1588,7 +1585,6 @@ namespace boost {
|
|
||||||
typedef typename Config::graph_type Graph;
|
|
||||||
typedef typename Config::StoredEdge StoredEdge;
|
|
||||||
const Graph& cg = static_cast<const Graph&>(g_);
|
|
||||||
- typedef typename Config::out_edge_iterator out_edge_iterator;
|
|
||||||
const typename Config::OutEdgeList& el = cg.out_edge_list(u);
|
|
||||||
typename Config::OutEdgeList::const_iterator it = graph_detail::
|
|
||||||
find(el, StoredEdge(v));
|
|
||||||
diff -urp boost_1_53_0-orig/boost/graph/detail/compressed_sparse_row_struct.hpp boost_1_53_0/boost/graph/detail/compressed_sparse_row_struct.hpp
|
|
||||||
--- boost_1_53_0-orig/boost/graph/detail/compressed_sparse_row_struct.hpp 2013-07-23 01:32:19.395266772 +0200
|
|
||||||
+++ boost_1_53_0/boost/graph/detail/compressed_sparse_row_struct.hpp 2013-07-23 01:34:15.278971182 +0200
|
|
||||||
@@ -218,8 +218,6 @@ namespace detail {
|
|
||||||
// the user has supplied the number of edges.
|
|
||||||
edges_size_type numedges = numedges_or_zero;
|
|
||||||
if (numedges == 0) {
|
|
||||||
- typedef typename std::iterator_traits<InputIterator>::iterator_category
|
|
||||||
- category;
|
|
||||||
numedges = boost::graph::detail::reserve_count_for_single_pass(edge_begin, edge_end);
|
|
||||||
}
|
|
||||||
m_column.clear();
|
|
||||||
@@ -313,7 +311,6 @@ namespace detail {
|
|
||||||
inherited_edge_properties::resize(numedges);
|
|
||||||
EdgeIndex current_edge = 0;
|
|
||||||
typedef typename boost::graph_traits<Graph>::vertex_descriptor g_vertex;
|
|
||||||
- typedef typename boost::graph_traits<Graph>::edge_descriptor g_edge;
|
|
||||||
typedef typename boost::graph_traits<Graph>::out_edge_iterator
|
|
||||||
g_out_edge_iter;
|
|
||||||
|
|
||||||
@@ -347,7 +344,6 @@ namespace detail {
|
|
||||||
// Flip sequence
|
|
||||||
BidirectionalIterator first(last_sorted);
|
|
||||||
BidirectionalIterator last(first_sorted);
|
|
||||||
- typedef Vertex vertex_t;
|
|
||||||
typedef Vertex vertex_num;
|
|
||||||
typedef EdgeIndex edge_num;
|
|
||||||
edge_num new_edge_count = std::distance(first, last);
|
|
||||||
diff -urp boost_1_53_0-orig/boost/graph/detail/histogram_sort.hpp boost_1_53_0/boost/graph/detail/histogram_sort.hpp
|
|
||||||
--- boost_1_53_0-orig/boost/graph/detail/histogram_sort.hpp 2013-07-23 01:32:19.364266583 +0200
|
|
||||||
+++ boost_1_53_0/boost/graph/detail/histogram_sort.hpp 2013-07-23 01:34:15.279971188 +0200
|
|
||||||
@@ -159,7 +159,6 @@ histogram_sort_inplace(KeyIterator key_b
|
|
||||||
Value1Iter values1,
|
|
||||||
KeyTransform key_transform) {
|
|
||||||
|
|
||||||
- typedef NumKeys vertices_size_type;
|
|
||||||
typedef typename std::iterator_traits<RowstartIterator>::value_type EdgeIndex;
|
|
||||||
|
|
||||||
// 1. Copy m_rowstart (except last element) to get insert positions
|
|
||||||
@@ -194,7 +193,6 @@ histogram_sort_inplace(KeyIterator key_b
|
|
||||||
Value2Iter values2,
|
|
||||||
KeyTransform key_transform) {
|
|
||||||
|
|
||||||
- typedef NumKeys vertices_size_type;
|
|
||||||
typedef typename std::iterator_traits<RowstartIterator>::value_type EdgeIndex;
|
|
||||||
|
|
||||||
// 1. Copy m_rowstart (except last element) to get insert positions
|
|
@ -1,13 +0,0 @@
|
|||||||
diff -up boost_1_53_0/boost/lexical_cast.hpp\~ boost_1_53_0/boost/lexical_cast.hpp
|
|
||||||
--- boost_1_53_0/boost/lexical_cast.hpp~ 2012-12-29 15:41:23.000000000 +0100
|
|
||||||
+++ boost_1_53_0/boost/lexical_cast.hpp 2013-07-22 23:27:48.841566845 +0200
|
|
||||||
@@ -865,7 +865,6 @@ namespace boost {
|
|
||||||
#ifndef BOOST_NO_LIMITS_COMPILE_TIME_CONSTANTS
|
|
||||||
BOOST_STATIC_ASSERT(!std::numeric_limits<T>::is_signed);
|
|
||||||
#endif
|
|
||||||
- typedef typename Traits::int_type int_type;
|
|
||||||
CharT const czero = lcast_char_constants<CharT>::zero;
|
|
||||||
--end;
|
|
||||||
value = 0;
|
|
||||||
|
|
||||||
Diff finished. Mon Jul 22 23:28:02 2013
|
|
@ -1,46 +0,0 @@
|
|||||||
diff -urp boost_1_53_0-orig/boost/math/special_functions/detail/igamma_inverse.hpp boost_1_53_0/boost/math/special_functions/detail/igamma_inverse.hpp
|
|
||||||
--- boost_1_53_0-orig/boost/math/special_functions/detail/igamma_inverse.hpp 2013-07-23 01:32:21.874281840 +0200
|
|
||||||
+++ boost_1_53_0/boost/math/special_functions/detail/igamma_inverse.hpp 2013-07-23 01:34:15.291971260 +0200
|
|
||||||
@@ -341,7 +341,6 @@ struct gamma_p_inverse_func
|
|
||||||
// flag is set, then Q(x) - q and it's derivatives.
|
|
||||||
//
|
|
||||||
typedef typename policies::evaluation<T, Policy>::type value_type;
|
|
||||||
- typedef typename lanczos::lanczos<T, Policy>::type evaluation_type;
|
|
||||||
typedef typename policies::normalise<
|
|
||||||
Policy,
|
|
||||||
policies::promote_float<false>,
|
|
||||||
diff -urp boost_1_53_0-orig/boost/math/special_functions/gamma.hpp boost_1_53_0/boost/math/special_functions/gamma.hpp
|
|
||||||
--- boost_1_53_0-orig/boost/math/special_functions/gamma.hpp 2013-07-23 01:32:21.824281537 +0200
|
|
||||||
+++ boost_1_53_0/boost/math/special_functions/gamma.hpp 2013-07-23 01:34:15.322971451 +0200
|
|
||||||
@@ -1360,7 +1360,6 @@ inline typename tools::promote_args<T1,
|
|
||||||
BOOST_FPU_EXCEPTION_GUARD
|
|
||||||
typedef typename tools::promote_args<T1, T2>::type result_type;
|
|
||||||
typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
|
||||||
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
|
|
||||||
typedef typename policies::normalise<
|
|
||||||
Policy,
|
|
||||||
policies::promote_float<false>,
|
|
||||||
@@ -1489,7 +1488,6 @@ inline typename tools::promote_args<T1,
|
|
||||||
BOOST_FPU_EXCEPTION_GUARD
|
|
||||||
typedef typename tools::promote_args<T1, T2>::type result_type;
|
|
||||||
typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
|
||||||
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
|
|
||||||
typedef typename policies::normalise<
|
|
||||||
Policy,
|
|
||||||
policies::promote_float<false>,
|
|
||||||
@@ -1520,7 +1518,6 @@ inline typename tools::promote_args<T1,
|
|
||||||
BOOST_FPU_EXCEPTION_GUARD
|
|
||||||
typedef typename tools::promote_args<T1, T2>::type result_type;
|
|
||||||
typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
|
||||||
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
|
|
||||||
typedef typename policies::normalise<
|
|
||||||
Policy,
|
|
||||||
policies::promote_float<false>,
|
|
||||||
@@ -1551,7 +1548,6 @@ inline typename tools::promote_args<T1,
|
|
||||||
BOOST_FPU_EXCEPTION_GUARD
|
|
||||||
typedef typename tools::promote_args<T1, T2>::type result_type;
|
|
||||||
typedef typename policies::evaluation<result_type, Policy>::type value_type;
|
|
||||||
- typedef typename lanczos::lanczos<value_type, Policy>::type evaluation_type;
|
|
||||||
typedef typename policies::normalise<
|
|
||||||
Policy,
|
|
||||||
policies::promote_float<false>,
|
|
@ -1,65 +0,0 @@
|
|||||||
diff -up ./boost/regex/icu.hpp~ ./boost/regex/icu.hpp
|
|
||||||
--- ./boost/regex/icu.hpp~ 2011-10-16 14:19:37.000000000 +0200
|
|
||||||
+++ ./boost/regex/icu.hpp 2013-07-22 23:32:44.346321967 +0200
|
|
||||||
@@ -423,7 +423,6 @@ bool do_regex_match(BidiIterator first,
|
|
||||||
{
|
|
||||||
typedef u16_to_u32_iterator<BidiIterator, UChar32> conv_type;
|
|
||||||
typedef match_results<conv_type> match_type;
|
|
||||||
- typedef typename match_type::allocator_type alloc_type;
|
|
||||||
match_type what;
|
|
||||||
bool result = ::boost::regex_match(conv_type(first, first, last), conv_type(last, first, last), what, e, flags);
|
|
||||||
// copy results across to m:
|
|
||||||
@@ -439,7 +438,6 @@ bool do_regex_match(BidiIterator first,
|
|
||||||
{
|
|
||||||
typedef u8_to_u32_iterator<BidiIterator, UChar32> conv_type;
|
|
||||||
typedef match_results<conv_type> match_type;
|
|
||||||
- typedef typename match_type::allocator_type alloc_type;
|
|
||||||
match_type what;
|
|
||||||
bool result = ::boost::regex_match(conv_type(first, first, last), conv_type(last, first, last), what, e, flags);
|
|
||||||
// copy results across to m:
|
|
||||||
@@ -598,7 +596,6 @@ bool do_regex_search(BidiIterator first,
|
|
||||||
{
|
|
||||||
typedef u16_to_u32_iterator<BidiIterator, UChar32> conv_type;
|
|
||||||
typedef match_results<conv_type> match_type;
|
|
||||||
- typedef typename match_type::allocator_type alloc_type;
|
|
||||||
match_type what;
|
|
||||||
bool result = ::boost::regex_search(conv_type(first, first, last), conv_type(last, first, last), what, e, flags, conv_type(base));
|
|
||||||
// copy results across to m:
|
|
||||||
@@ -615,7 +612,6 @@ bool do_regex_search(BidiIterator first,
|
|
||||||
{
|
|
||||||
typedef u8_to_u32_iterator<BidiIterator, UChar32> conv_type;
|
|
||||||
typedef match_results<conv_type> match_type;
|
|
||||||
- typedef typename match_type::allocator_type alloc_type;
|
|
||||||
match_type what;
|
|
||||||
bool result = ::boost::regex_search(conv_type(first, first, last), conv_type(last, first, last), what, e, flags, conv_type(base));
|
|
||||||
// copy results across to m:
|
|
||||||
diff -up ./boost/regex/v4/regex_format.hpp~ ./boost/regex/v4/regex_format.hpp
|
|
||||||
--- ./boost/regex/v4/regex_format.hpp~ 2012-05-24 12:03:48.000000000 +0200
|
|
||||||
+++ ./boost/regex/v4/regex_format.hpp 2013-07-22 23:31:06.466740621 +0200
|
|
||||||
@@ -1064,7 +1064,6 @@ struct format_functor_c_string
|
|
||||||
template <class OutputIter>
|
|
||||||
OutputIter operator()(const Match& m, OutputIter i, boost::regex_constants::match_flag_type f, const Traits& t = Traits())
|
|
||||||
{
|
|
||||||
- typedef typename Match::char_type char_type;
|
|
||||||
const charT* end = func;
|
|
||||||
while(*end) ++end;
|
|
||||||
return regex_format_imp(i, m, func, end, f, t);
|
|
||||||
@@ -1083,7 +1082,6 @@ struct format_functor_container
|
|
||||||
template <class OutputIter>
|
|
||||||
OutputIter operator()(const Match& m, OutputIter i, boost::regex_constants::match_flag_type f, const Traits& t = Traits())
|
|
||||||
{
|
|
||||||
- typedef typename Match::char_type char_type;
|
|
||||||
return re_detail::regex_format_imp(i, m, func.begin(), func.end(), f, t);
|
|
||||||
}
|
|
||||||
private:
|
|
||||||
diff -up ./boost/regex/v4/regex_split.hpp~ ./boost/regex/v4/regex_split.hpp
|
|
||||||
--- ./boost/regex/v4/regex_split.hpp~ 2007-11-25 19:07:19.000000000 +0100
|
|
||||||
+++ ./boost/regex/v4/regex_split.hpp 2013-07-22 23:31:29.098875039 +0200
|
|
||||||
@@ -107,7 +107,6 @@ std::size_t regex_split(OutputIterator o
|
|
||||||
std::size_t max_split)
|
|
||||||
{
|
|
||||||
typedef typename std::basic_string<charT, Traits1, Alloc1>::const_iterator ci_t;
|
|
||||||
- typedef typename match_results<ci_t>::allocator_type match_allocator;
|
|
||||||
ci_t last = s.begin();
|
|
||||||
std::size_t init_size = max_split;
|
|
||||||
re_detail::split_pred<OutputIterator, charT, Traits1, Alloc1> pred(&last, &out, &max_split);
|
|
@ -1,30 +0,0 @@
|
|||||||
diff -up boost_1_53_0/boost/static_assert.hpp\~ boost_1_53_0/boost/static_assert.hpp
|
|
||||||
--- boost_1_53_0/boost/static_assert.hpp~ 2012-12-11 15:42:26.000000000 +0100
|
|
||||||
+++ boost_1_53_0/boost/static_assert.hpp 2013-07-19 14:15:59.504039071 +0200
|
|
||||||
@@ -43,6 +43,14 @@
|
|
||||||
#else
|
|
||||||
# define BOOST_STATIC_ASSERT_BOOL_CAST(x) (bool)(x)
|
|
||||||
#endif
|
|
||||||
+//
|
|
||||||
+// If the compiler warns about unused typedefs then enable this:
|
|
||||||
+//
|
|
||||||
+#if defined(__GNUC__) && ((__GNUC__ > 4) || ((__GNUC__ == 4) && (__GNUC_MINOR__ >= 7)))
|
|
||||||
+# define BOOST_STATIC_ASSERT_UNUSED_ATTRIBUTE __attribute__((unused))
|
|
||||||
+#else
|
|
||||||
+# define BOOST_STATIC_ASSERT_UNUSED_ATTRIBUTE
|
|
||||||
+#endif
|
|
||||||
|
|
||||||
#ifndef BOOST_NO_CXX11_STATIC_ASSERT
|
|
||||||
# define BOOST_STATIC_ASSERT( B ) static_assert(B, #B)
|
|
||||||
@@ -122,7 +130,8 @@ template<int x> struct static_assert_tes
|
|
||||||
#define BOOST_STATIC_ASSERT( B ) \
|
|
||||||
typedef ::boost::static_assert_test<\
|
|
||||||
sizeof(::boost::STATIC_ASSERTION_FAILURE< BOOST_STATIC_ASSERT_BOOL_CAST( B ) >)>\
|
|
||||||
- BOOST_JOIN(boost_static_assert_typedef_, __LINE__)
|
|
||||||
+ BOOST_JOIN(boost_static_assert_typedef_, __LINE__) \
|
|
||||||
+ BOOST_STATIC_ASSERT_UNUSED_ATTRIBUTE
|
|
||||||
#endif
|
|
||||||
|
|
||||||
#else
|
|
||||||
|
|
||||||
Diff finished. Fri Jul 19 14:16:04 2013
|
|
@ -1,26 +0,0 @@
|
|||||||
diff -up boost_1_53_0/boost/thread/future.hpp\~ boost_1_53_0/boost/thread/future.hpp
|
|
||||||
--- boost_1_53_0/boost/thread/future.hpp~ 2012-12-16 20:01:45.000000000 +0100
|
|
||||||
+++ boost_1_53_0/boost/thread/future.hpp 2013-07-23 16:50:27.044995968 +0200
|
|
||||||
@@ -2911,10 +2913,6 @@ namespace boost
|
|
||||||
{
|
|
||||||
typedef typename boost::result_of<typename decay<F>::type()>::type R;
|
|
||||||
typedef packaged_task<R()> packaged_task_type;
|
|
||||||
-
|
|
||||||
- typedef detail::async_func<typename decay<F>::type> BF;
|
|
||||||
- typedef typename BF::result_type Rp;
|
|
||||||
-
|
|
||||||
#endif
|
|
||||||
#else
|
|
||||||
template <class F>
|
|
||||||
@@ -2925,9 +2924,6 @@ namespace boost
|
|
||||||
{
|
|
||||||
typedef typename boost::result_of<typename decay<F>::type()>::type R;
|
|
||||||
typedef packaged_task<R> packaged_task_type;
|
|
||||||
-
|
|
||||||
- typedef detail::async_func<typename decay<F>::type> BF;
|
|
||||||
- typedef typename BF::result_type Rp;
|
|
||||||
#endif
|
|
||||||
|
|
||||||
if (int(policy) & int(launch::async))
|
|
||||||
|
|
||||||
Diff finished. Tue Jul 23 16:50:30 2013
|
|
@ -1,11 +0,0 @@
|
|||||||
diff -urp boost_1_54_0-orig/boost/locale/boundary/segment.hpp boost_1_54_0/boost/locale/boundary/segment.hpp
|
|
||||||
--- boost_1_54_0-orig/boost/locale/boundary/segment.hpp 2013-07-23 00:47:27.020787174 +0200
|
|
||||||
+++ boost_1_54_0/boost/locale/boundary/segment.hpp 2013-07-23 00:50:40.382959016 +0200
|
|
||||||
@@ -27,7 +27,6 @@ namespace boundary {
|
|
||||||
int compare_text(LeftIterator l_begin,LeftIterator l_end,RightIterator r_begin,RightIterator r_end)
|
|
||||||
{
|
|
||||||
typedef LeftIterator left_iterator;
|
|
||||||
- typedef RightIterator right_iterator;
|
|
||||||
typedef typename std::iterator_traits<left_iterator>::value_type char_type;
|
|
||||||
typedef std::char_traits<char_type> traits;
|
|
||||||
while(l_begin!=l_end && r_begin!=r_end) {
|
|
@ -1,24 +0,0 @@
|
|||||||
Index: boost/random/generate_canonical.hpp
|
|
||||||
===================================================================
|
|
||||||
--- boost/random/generate_canonical.hpp (revision 85073)
|
|
||||||
+++ boost/random/generate_canonical.hpp (working copy)
|
|
||||||
@@ -54,7 +54,6 @@
|
|
||||||
using std::floor;
|
|
||||||
BOOST_ASSERT((g.min)() == 0);
|
|
||||||
BOOST_ASSERT((g.max)() == 1);
|
|
||||||
- typedef typename URNG::result_type base_result;
|
|
||||||
std::size_t digits = std::numeric_limits<RealType>::digits;
|
|
||||||
std::size_t engine_bits = detail::generator_bits<URNG>::value();
|
|
||||||
std::size_t b = (std::min)(bits, digits);
|
|
||||||
Index: boost/random/uniform_real_distribution.hpp
|
|
||||||
===================================================================
|
|
||||||
--- boost/random/uniform_real_distribution.hpp (revision 85073)
|
|
||||||
+++ boost/random/uniform_real_distribution.hpp (working copy)
|
|
||||||
@@ -36,7 +36,6 @@
|
|
||||||
{
|
|
||||||
for(;;) {
|
|
||||||
typedef T result_type;
|
|
||||||
- typedef typename Engine::result_type base_result;
|
|
||||||
result_type numerator = static_cast<T>(eng() - (eng.min)());
|
|
||||||
result_type divisor = static_cast<T>((eng.max)() - (eng.min)());
|
|
||||||
BOOST_ASSERT(divisor > 0);
|
|
Loading…
Reference in New Issue
Block a user