Src update, move of ref/* to reference/*

[SVN r69329]

include/boost/geometry/algorithms/append.hpp

@@ -128,45 +128,45 @@ namespace splitted_dispatch
 
 template <typename Tag, typename Geometry, typename Point>
 struct append_point
-    : detail::append::append_no_action<Geometry, Point> 
+    : detail::append::append_no_action<Geometry, Point>
 {};
 
 template <typename Geometry, typename Point>
 struct append_point<linestring_tag, Geometry, Point>
-    : detail::append::append_point<Geometry, Point> 
+    : detail::append::append_point<Geometry, Point>
 {};
 
 template <typename Geometry, typename Point>
 struct append_point<ring_tag, Geometry, Point>
-    : detail::append::append_point<Geometry, Point> 
+    : detail::append::append_point<Geometry, Point>
 {};
 
 
 template <typename Polygon, typename Point>
 struct append_point<polygon_tag, Polygon, Point>
-        : detail::append::point_to_polygon<Polygon, Point> 
+        : detail::append::point_to_polygon<Polygon, Point>
 {};
 
 
 template <typename Tag, typename Geometry, typename Range>
 struct append_range
-    : detail::append::append_no_action<Geometry, Range> 
+    : detail::append::append_no_action<Geometry, Range>
 {};
 
 template <typename Geometry, typename Range>
 struct append_range<linestring_tag, Geometry, Range>
-    : detail::append::append_range<Geometry, Range> 
+    : detail::append::append_range<Geometry, Range>
 {};
 
 template <typename Geometry, typename Range>
 struct append_range<ring_tag, Geometry, Range>
-    : detail::append::append_range<Geometry, Range> 
+    : detail::append::append_range<Geometry, Range>
 {};
 
 
 template <typename Polygon, typename Range>
 struct append_range<polygon_tag, Polygon, Range>
-        : detail::append::range_to_polygon<Polygon, Range> 
+        : detail::append::range_to_polygon<Polygon, Range>
 {};
 
 }
@@ -174,14 +174,14 @@ struct append_range<polygon_tag, Polygon, Range>
 
 // Default: append a range (or linestring or ring or whatever) to any geometry
 template <typename TagRangeOrPoint, typename Geometry, typename RangeOrPoint>
-struct append 
-    : splitted_dispatch::append_range<typename tag<Geometry>::type, Geometry, RangeOrPoint> 
+struct append
+    : splitted_dispatch::append_range<typename tag<Geometry>::type, Geometry, RangeOrPoint>
 {};
 
 // Specialization for point to append a point to any geometry
 template <typename Geometry, typename RangeOrPoint>
-struct append<point_tag, Geometry, RangeOrPoint> 
-    : splitted_dispatch::append_point<typename tag<Geometry>::type, Geometry, RangeOrPoint> 
+struct append<point_tag, Geometry, RangeOrPoint>
+    : splitted_dispatch::append_point<typename tag<Geometry>::type, Geometry, RangeOrPoint>
 {};
 
 
@@ -201,7 +201,7 @@ struct append<point_tag, Geometry, RangeOrPoint>
     exterior ring (-1, the default) or  interior ring index
 \param multi_index Reserved for multi polygons or multi linestrings
 
-\qbk{[include ref/algorithms/append.qbk]}
+\qbk{[include reference/algorithms/append.qbk]}
 }
  */
 template <typename Geometry, typename RangeOrPoint>

include/boost/geometry/algorithms/area.hpp

@@ -213,7 +213,7 @@ and Geographic as well.
 \param geometry \param_geometry
 \return \return_calc{area}
 
-\qbk{[include ref/algorithms/area.qbk]}
+\qbk{[include reference/algorithms/area.qbk]}
 \qbk{[heading Examples]}
 \qbk{[area] [area_output]}
 */
@@ -250,7 +250,7 @@ inline typename area_result<Geometry>::type area(Geometry const& geometry)
 \qbk{distinguish,with strategy}
 
 \qbk{
-[include ref/algorithms/area.qbk]
+[include reference/algorithms/area.qbk]
 
 [heading Example]
 [area_with_strategy]

include/boost/geometry/algorithms/assign.hpp

@@ -518,7 +518,7 @@ collect the minimum bounding box of a geometry.
 [assign_inverse] [assign_inverse_output]
 
 [heading See also]
-\* [link geometry.reference.algorithms.make.make_inverse make]
+\* [link geometry.reference.algorithms.make.make_inverse make_inverse]
 }
  */
 template <typename Geometry>

include/boost/geometry/algorithms/buffer.hpp

@@ -106,7 +106,7 @@ struct buffer<box_tag, box_tag, BoxIn, T, BoxOut>
 \param chord_length (optional) The length of the chord's in the generated arcs around points or bends
 \note Currently only implemented for box, the trivial case, but still useful
 
-\qbk{[include ref/algorithms/buffer.qbk]}
+\qbk{[include reference/algorithms/buffer.qbk]}
  */
 template <typename Input, typename Output, typename Distance>
 inline void buffer(Input const& geometry_in, Output& geometry_out,

include/boost/geometry/algorithms/centroid.hpp

@@ -378,7 +378,7 @@ struct centroid<polygon_tag, Polygon, Point, Strategy>
 \param strategy \param_strategy{centroid}
 
 \qbk{distinguish,with strategy}
-\qbk{[include ref/algorithms/centroid.qbk]}
+\qbk{[include reference/algorithms/centroid.qbk]}
 
 \qbk{
 [heading Available Strategies]
@@ -417,7 +417,7 @@ inline void centroid(Geometry const& geometry, Point& c,
 \param geometry \param_geometry
 \param c the calculated centroid will be assigned to this point reference
 
-\qbk{[include ref/algorithms/centroid.qbk]}
+\qbk{[include reference/algorithms/centroid.qbk]}
  */
 template<typename Geometry, typename Point>
 inline void centroid(Geometry const& geometry, Point& c)
@@ -445,7 +445,7 @@ inline void centroid(Geometry const& geometry, Point& c)
 \tparam Geometry \tparam_geometry
 \param geometry \param_geometry
 \return \return_calc{centroid}
-\qbk{[include ref/algorithms/centroid.qbk]}
+\qbk{[include reference/algorithms/centroid.qbk]}
  */
 template<typename Point, typename Geometry>
 inline Point make_centroid(Geometry const& geometry)
@@ -469,7 +469,7 @@ inline Point make_centroid(Geometry const& geometry)
 \return \return_calc{centroid}
 
 \qbk{distinguish,with strategy}
-\qbk{[include ref/algorithms/centroid.qbk]}
+\qbk{[include reference/algorithms/centroid.qbk]}
 
 \qbk{
 [heading Available Strategies]

include/boost/geometry/algorithms/difference.hpp

@@ -70,6 +70,11 @@ inline OutputIterator difference_inserter(Geometry1 const& geometry1,
 \param out \param_out{difference}
 \return \return_out
 
+\qbk{[include reference/algorithms/difference.qbk]}
+\qbk{
+[heading Example]
+[difference] [difference_output]
+}
 */
 template
 <
@@ -110,7 +115,11 @@ inline OutputIterator difference_inserter(Geometry1 const& geometry1,
 \param geometry2 \param_geometry
 \param output_collection the output collection
 
-\qbk{[include ref/algorithms/difference.qbk]}
+\qbk{[include reference/algorithms/difference.qbk]}
+\qbk{
+[heading Example]
+[difference_inserter] [difference_inserter_output]
+}
 */
 template
 <

include/boost/geometry/algorithms/intersection.hpp

@@ -186,7 +186,7 @@ struct intersection_reversed
 \param geometry_out The output geometry, either a multi_point, multi_polygon,
     multi_linestring, or a box (for intersection of two boxes)
 
-\qbk{[include ref/algorithms/intersection.qbk]}
+\qbk{[include reference/algorithms/intersection.qbk]}
 */
 template
 <

include/boost/geometry/algorithms/intersection_inserter.hpp

@@ -409,7 +409,7 @@ inline OutputIterator inserter(Geometry1 const& geometry1,
 \return \return_out
 
 \qbk{distinguish,with strategy}
-\qbk{[include ref/algorithms/intersection.qbk]}
+\qbk{[include reference/algorithms/intersection.qbk]}
 */
 template
 <
@@ -446,7 +446,7 @@ inline OutputIterator intersection_inserter(Geometry1 const& geometry1,
 \param out \param_out{intersection}
 \return \return_out
 
-\qbk{[include ref/algorithms/intersection.qbk]}
+\qbk{[include reference/algorithms/intersection.qbk]}
 */
 template
 <

include/boost/geometry/algorithms/intersects.hpp

@@ -30,7 +30,7 @@ namespace boost { namespace geometry
 \return \return_check{is self-intersecting}
 
 \qbk{distinguish,one geometry}
-\qbk{[include ref/algorithms/intersects.qbk]}
+\qbk{[include reference/algorithms/intersects.qbk]}
 */
 template <typename Geometry>
 inline bool intersects(Geometry const& geometry)
@@ -82,7 +82,7 @@ inline bool intersects(Geometry const& geometry)
 \return \return_check2{intersect each other}
 
 \qbk{distinguish,two geometries}
-\qbk{[include ref/algorithms/intersects.qbk]}
+\qbk{[include reference/algorithms/intersects.qbk]}
  */
 template <typename Geometry1, typename Geometry2>
 inline bool intersects(Geometry1 const& geometry1, Geometry2 const& geometry2)

include/boost/geometry/algorithms/length.hpp

@@ -137,7 +137,7 @@ struct length<segment_tag, Geometry, Strategy>
 \param geometry \param_geometry
 \return \return_calc{length}
 
-\qbk{[include ref/algorithms/length.qbk]}
+\qbk{[include reference/algorithms/length.qbk]}
 \qbk{[length] [length_output]}
  */
 template<typename Geometry>
@@ -171,7 +171,7 @@ inline typename length_result<Geometry>::type length(
 \return \return_calc{length}
 
 \qbk{distinguish,with strategy}
-\qbk{[include ref/algorithms/length.qbk]}
+\qbk{[include reference/algorithms/length.qbk]}
 \qbk{[length_with_strategy] [length_with_strategy_output]}
  */
 template<typename Geometry, typename Strategy>

include/boost/geometry/algorithms/make.hpp

@@ -19,7 +19,7 @@ namespace boost { namespace geometry
 /*!
 \brief Construct a geometry
 \ingroup make
-\details 
+\details
 \note It does not work with array-point types, like int[2]
 \tparam Geometry \tparam_geometry
 \tparam Type \tparam_numeric to specify the coordinates
@@ -144,7 +144,7 @@ inline Geometry make(Range const& range)
 [make_inverse] [make_inverse_output]
 
 [heading See also]
-\* [link geometry.reference.algorithms.assign.assign_inverse assign]
+\* [link geometry.reference.algorithms.assign.assign_inverse assign_inverse]
 }
  */
 template <typename Geometry>

include/boost/geometry/algorithms/num_geometries.hpp

@@ -63,7 +63,7 @@ struct num_geometries<single_tag, Geometry>
 \param geometry \param_geometry
 \return \return_calc{number of geometries}
 
-\qbk{[include ref/algorithms/num_geometries.qbk]}
+\qbk{[include reference/algorithms/num_geometries.qbk]}
 */
 template <typename Geometry>
 inline std::size_t num_geometries(Geometry const& geometry)

include/boost/geometry/algorithms/num_interior_rings.hpp

@@ -60,7 +60,7 @@ struct num_interior_rings<polygon_tag, Polygon>
 \param geometry \param_geometry
 \return \return_calc{number of interior rings}
 
-\qbk{[include ref/algorithms/num_interior_rings.qbk]}
+\qbk{[include reference/algorithms/num_interior_rings.qbk]}
 
 \note Defined by OGC as "numInteriorRing". To be consistent with "numPoints"
     letter "s" is appended

include/boost/geometry/algorithms/num_points.hpp

@@ -147,7 +147,7 @@ struct num_points<polygon_tag, Geometry>
 \param add_for_open add one for open geometries (i.e. polygon types which are not closed)
 \return \return_calc{number of points}
 
-\qbk{[include ref/algorithms/num_points.qbk]}
+\qbk{[include reference/algorithms/num_points.qbk]}
 */
 template <typename Geometry>
 inline std::size_t num_points(Geometry const& geometry, bool add_for_open = false)

include/boost/geometry/algorithms/perimeter.hpp

@@ -78,7 +78,7 @@ struct perimeter<polygon_tag, Polygon, Strategy>
 \param geometry \param_geometry
 \return \return_calc{perimeter}
 
-\qbk{[include ref/algorithms/perimeter.qbk]}
+\qbk{[include reference/algorithms/perimeter.qbk]}
  */
 template<typename Geometry>
 inline typename length_result<Geometry>::type perimeter(
@@ -112,7 +112,7 @@ inline typename length_result<Geometry>::type perimeter(
 \return \return_calc{perimeter}
 
 \qbk{distinguish,with strategy}
-\qbk{[include ref/algorithms/perimeter.qbk]}
+\qbk{[include reference/algorithms/perimeter.qbk]}
  */
 template<typename Geometry, typename Strategy>
 inline typename length_result<Geometry>::type perimeter(

include/boost/geometry/algorithms/simplify.hpp

@@ -293,7 +293,7 @@ inline void simplify(Geometry const& geometry, Geometry& out,
 \param max_distance distance (in units of input coordinates) of a vertex
     to other segments to be removed
 
-\qbk{[include ref/algorithms/simplify.qbk]}
+\qbk{[include reference/algorithms/simplify.qbk]}
  */
 template<typename Geometry, typename Distance>
 inline void simplify(Geometry const& geometry, Geometry& out,
@@ -329,7 +329,7 @@ inline void simplify(Geometry const& geometry, Geometry& out,
     might include point-distance strategy
 
 \qbk{distinguish,with strategy}
-\qbk{[include ref/algorithms/simplify.qbk]}
+\qbk{[include reference/algorithms/simplify.qbk]}
 */
 template<typename Geometry, typename OutputIterator, typename Distance, typename Strategy>
 inline void simplify_inserter(Geometry const& geometry, OutputIterator out,
@@ -355,7 +355,7 @@ inline void simplify_inserter(Geometry const& geometry, OutputIterator out,
 \param max_distance distance (in units of input coordinates) of a vertex
     to other segments to be removed
 
-\qbk{[include ref/algorithms/simplify_inserter.qbk]}
+\qbk{[include reference/algorithms/simplify_inserter.qbk]}
  */
 template<typename Geometry, typename OutputIterator, typename Distance>
 inline void simplify_inserter(Geometry const& geometry, OutputIterator out,

include/boost/geometry/algorithms/sym_difference.hpp

@@ -111,7 +111,7 @@ inline OutputIterator sym_difference_inserter(Geometry1 const& geometry1,
 \param geometry2 \param_geometry
 \param output_collection the output collection
 
-\qbk{[include ref/algorithms/sym_difference.qbk]}
+\qbk{[include reference/algorithms/sym_difference.qbk]}
 */
 template
 <

include/boost/geometry/algorithms/union.hpp

@@ -254,7 +254,7 @@ inline OutputIterator union_inserter(Geometry1 const& geometry1,
 \param output_collection the output collection
 \note Called union_ because union is a reserved word.
 
-\qbk{[include ref/algorithms/union.qbk]}
+\qbk{[include reference/algorithms/union.qbk]}
 */
 template
 <

include/boost/geometry/core/access.hpp

@@ -185,7 +185,7 @@ struct signature_getset_index_dimension {};
 \param geometry \param_geometry (usually a point)
 \param dummy \qbk_skip
 \return The coordinate value of specified dimension of specified geometry
-\qbk{[include ref/core/get_point.qbk]}
+\qbk{[include reference/core/get_point.qbk]}
 */
 template <std::size_t Dimension, typename Geometry>
 inline typename coordinate_type<Geometry>::type get(Geometry const& geometry
@@ -219,7 +219,7 @@ inline typename coordinate_type<Geometry>::type get(Geometry const& geometry
 \param dummy \qbk_skip
 \ingroup set
 
-\qbk{[include ref/core/set_point.qbk]}
+\qbk{[include reference/core/set_point.qbk]}
 */
 template <std::size_t Dimension, typename Geometry>
 inline void set(Geometry& geometry
@@ -255,7 +255,7 @@ inline void set(Geometry& geometry
 \ingroup get
 
 \qbk{distinguish,with index}
-\qbk{[include ref/core/get_box.qbk]}
+\qbk{[include reference/core/get_box.qbk]}
 */
 template <std::size_t Index, std::size_t Dimension, typename Geometry>
 inline typename coordinate_type<Geometry>::type get(Geometry const& geometry
@@ -291,7 +291,7 @@ inline typename coordinate_type<Geometry>::type get(Geometry const& geometry
 \ingroup set
 
 \qbk{distinguish,with index}
-\qbk{[include ref/core/set_box.qbk]}
+\qbk{[include reference/core/set_box.qbk]}
 */
 template <std::size_t Index, std::size_t Dimension, typename Geometry>
 inline void set(Geometry& geometry

include/boost/geometry/geometries/point.hpp

@@ -39,7 +39,7 @@ namespace model
 \tparam DimensionCount number of coordinates, usually 2 or 3
 \tparam CoordinateSystem coordinate system, for example cs::cartesian
 
-\qbk{[include ref/geometries/point.qbk]}
+\qbk{[include reference/geometries/point.qbk]}
 \qbk{before.synopsis, [heading Model of]}
 \qbk{before.synopsis, [link geometry.reference.concepts.concept_point Point Concept]}
 

include/boost/geometry/geometries/register/point.hpp

@@ -60,7 +60,7 @@
 \param Field0 \param_macro_member{\macro_x}
 \param Field1 \param_macro_member{\macro_y}
 
-\qbk{[include ref/geometries/register/point.qbk]}
+\qbk{[include reference/geometries/register/point.qbk]}
 */
 #define BOOST_GEOMETRY_REGISTER_POINT_2D(Point, CoordinateType, CoordinateSystem, Field0, Field1) \
 namespace boost { namespace geometry { namespace traits {  \