mirror of
https://github.com/boostorg/python.git
synced 2026-01-24 18:12:43 +00:00
Apply typo fixes from Julio M. Merino Vidal
[SVN r27513]
This commit is contained in:
@@ -273,7 +273,7 @@ correctly:
|
||||
==================
|
||||
|
||||
This section outlines some of the library's major features. Except as
|
||||
neccessary to avoid confusion, details of library implementation are
|
||||
necessary to avoid confusion, details of library implementation are
|
||||
omitted.
|
||||
|
||||
-------------------------------------------
|
||||
@@ -537,7 +537,7 @@ This has two effects:
|
||||
called with an object wrapping a ``Derived`` instance. Wrapped
|
||||
member functions of class ``T`` are treated as though they have an
|
||||
implicit first argument of ``T&``, so these conversions are
|
||||
neccessary to allow the base class methods to be called for derived
|
||||
necessary to allow the base class methods to be called for derived
|
||||
objects.
|
||||
|
||||
Of course it's possible to derive new Python classes from wrapped C++
|
||||
@@ -650,7 +650,7 @@ Things to notice about the dispatcher class:
|
||||
called on an object of type ``BaseWrap``, since it overrides ``f``.
|
||||
|
||||
Admittedly, this formula is tedious to repeat, especially on a project
|
||||
with many polymorphic classes; that it is neccessary reflects
|
||||
with many polymorphic classes; that it is necessary reflects
|
||||
limitations in C++'s compile-time reflection capabilities. Several
|
||||
efforts are underway to write front-ends for Boost.Python which can
|
||||
generate these dispatchers (and other wrapping code) automatically.
|
||||
|
||||
@@ -260,7 +260,7 @@ a request which helps to eliminate redundancy. The rules used to
|
||||
<ol>
|
||||
<li> Treat built-in types specially: when unwrapping a value or
|
||||
constant reference to one of these, use a value for the target
|
||||
type. It will bind to a const reference if neccessary, and more
|
||||
type. It will bind to a const reference if necessary, and more
|
||||
importantly, avoids having to dynamically allocate room for
|
||||
an lvalue of types which can be cheaply copied.
|
||||
<li>
|
||||
|
||||
@@ -126,7 +126,7 @@ void handle_exception() throw();
|
||||
|
||||
<dt><b>Rationale:</b> At inter-language boundaries it is important to
|
||||
ensure that no C++ exceptions escape, since the calling language
|
||||
usually doesn't have the equipment neccessary to properly unwind the
|
||||
usually doesn't have the equipment necessary to properly unwind the
|
||||
stack. Use <code>handle_exception</code> to manage exception
|
||||
translation whenever your C++ code is called directly from the Python
|
||||
API. This is done for you automatically by the usual function wrapping
|
||||
|
||||
@@ -121,7 +121,7 @@ type_info(std::type_info const& = typeid(void));
|
||||
<dt><b>Effects:</b> constructs a <code>type_info</code> object which
|
||||
identifies the same type as its argument.</dt>
|
||||
|
||||
<dt><b>Rationale:</b> Since it is occasionally neccessary to make an
|
||||
<dt><b>Rationale:</b> Since it is occasionally necessary to make an
|
||||
array of <code>type_info</code> objects a benign default argument is
|
||||
supplied. <span class="c3"><b>Note:</b></span> this constructor does
|
||||
<i>not</i> correct for non-conformance of compiler
|
||||
|
||||
@@ -17,7 +17,7 @@ struct registration;
|
||||
// This namespace acts as a sort of singleton
|
||||
namespace registry
|
||||
{
|
||||
// Get the registration corresponding to the type, creating it if neccessary
|
||||
// Get the registration corresponding to the type, creating it if necessary
|
||||
BOOST_PYTHON_DECL registration const& lookup(type_info);
|
||||
|
||||
// Return a pointer to the corresponding registration, if one exists
|
||||
|
||||
@@ -109,7 +109,7 @@ struct iterator_range
|
||||
namespace detail
|
||||
{
|
||||
// Get a Python class which contains the given iterator and
|
||||
// policies, creating it if neccessary. Requires: NextPolicies is
|
||||
// policies, creating it if necessary. Requires: NextPolicies is
|
||||
// default-constructible.
|
||||
template <class Iterator, class NextPolicies>
|
||||
object demand_iterator_class(char const* name, Iterator* = 0, NextPolicies const& policies = NextPolicies())
|
||||
|
||||
@@ -203,7 +203,7 @@ namespace
|
||||
return &*p;
|
||||
}
|
||||
|
||||
// Get the entry for a type, inserting if neccessary
|
||||
// Get the entry for a type, inserting if necessary
|
||||
inline type_index_t::iterator demand_type(class_id type)
|
||||
{
|
||||
type_index_t::iterator p = type_position(type);
|
||||
@@ -218,7 +218,7 @@ namespace
|
||||
return type_index().insert(p, boost::make_tuple(type, v, dynamic_id_function(0)));
|
||||
}
|
||||
|
||||
// Map a two types to a vertex in the graph, inserting if neccessary
|
||||
// Map a two types to a vertex in the graph, inserting if necessary
|
||||
typedef std::pair<type_index_t::iterator, type_index_t::iterator>
|
||||
type_index_iterator_pair;
|
||||
|
||||
|
||||
Reference in New Issue
Block a user