/// section 4b in the paper. As the paper says, "The idea for doing
/// so is to simultaneously run the basic algorithm in both the
/// forward and reverse directions until furthest reaching forward and
-/// reverse paths starting at opposing corners ‘‘overlap’’."
+/// reverse paths starting at opposing corners 'overlap'."
///
/// @tparm RandomAccessOutputIterator the type of iterators passed to
/// this function. It must be a random access output iterator kind.
|| is_linux_kernel_module(elf_handle));
}
-/// Get the address at which a given binary is loaded in memory⋅
+/// Get the address at which a given binary is loaded in memory.
///
/// @param elf_handle the elf handle for the binary to consider.
///
/// Default constructor for the @ref property_value type.
///
-/// @param kind the of @êef property_value that is being constructed.
+/// @param kind the of @ref property_value that is being constructed.
property_value::property_value()
: priv_(new priv(ABSTRACT_PROPERTY_VALUE))
{}
/// Constructor for the @ref property_value type.
///
-/// @param kind the of @êef property_value that is being constructed.
+/// @param kind the of @ref property_value that is being constructed.
property_value::property_value(value_kind kind)
: priv_(new priv(kind))
{}
integral_type::get_base_type() const
{return base_;}
-/// Getter of the modifiers bitmap of the @êef integral_type.
+/// Getter of the modifiers bitmap of the @ref integral_type.
///
-/// @return the modifiers bitmap of the @êef integral_type.
+/// @return the modifiers bitmap of the @ref integral_type.
integral_type::modifiers_type
integral_type::get_modifiers() const
{return modifiers_;}
///
/// "if the hexadecimal value for a universal-character-name [...] or
/// string literal corresponds to a control character (in either of
-/// the ranges 0x00–0x1F or 0x7F–0x9F, both inclusive) [...] the
+/// the ranges 0x00-0x1F or 0x7F-0x9F, both inclusive) [...] the
/// program is ill-formed."
///
/// @param str the string to consider.