$include_dir="/home/hyper-archives/boost-commit/include"; include("$include_dir/msg-header.inc") ?>
Subject: [Boost-commit] svn:boost r65824 - in sandbox/itl/boost: itl itl/concept itl_xt/detail
From: afojgo_at_[hidden]
Date: 2010-10-08 06:25:30
Author: jofaber
Date: 2010-10-08 06:25:07 EDT (Fri, 08 Oct 2010)
New Revision: 65824
URL: http://svn.boost.org/trac/boost/changeset/65824
Log:
Refactoring: Renaming unon, neutron etc. 1. Renaming in comments. Fast test. Stable{msvc-9.0,10.0, gcc-3.4.4}
Text files modified: 
   sandbox/itl/boost/itl/concept/element_map.hpp            |     2 +-                                      
   sandbox/itl/boost/itl/functors.hpp                       |     2 +-                                      
   sandbox/itl/boost/itl/interval_base_map.hpp              |     2 +-                                      
   sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp |     4 ++--                                    
   4 files changed, 5 insertions(+), 5 deletions(-)
Modified: sandbox/itl/boost/itl/concept/element_map.hpp
==============================================================================
--- sandbox/itl/boost/itl/concept/element_map.hpp	(original)
+++ sandbox/itl/boost/itl/concept/element_map.hpp	2010-10-08 06:25:07 EDT (Fri, 08 Oct 2010)
@@ -59,7 +59,7 @@
 //= Equivalences and Orderings<ElementMap>
 //==============================================================================
 
-/** Protonic equality is equality on all elements that do not carry a neutron as content. */
+/** Protonic equality is equality on all elements that do not carry an identity element as content. */
 template<class Type>
 inline typename enable_if<is_element_map<Type>, bool>::type
 is_protonic_equal(const Type& lhs, const Type& rhs)
Modified: sandbox/itl/boost/itl/functors.hpp
==============================================================================
--- sandbox/itl/boost/itl/functors.hpp	(original)
+++ sandbox/itl/boost/itl/functors.hpp	2010-10-08 06:25:07 EDT (Fri, 08 Oct 2010)
@@ -368,7 +368,7 @@
 
     // A binary operation - is negative (or inverting) with respect to the
     // neutral element iff it yields the inverse element if it is applied to the 
-    // neutron element:
+    // identity element:
     // 0 - x = -x
     // For a functor that wraps the inplace of op-assign version this is 
     // equivalent to
Modified: sandbox/itl/boost/itl/interval_base_map.hpp
==============================================================================
--- sandbox/itl/boost/itl/interval_base_map.hpp	(original)
+++ sandbox/itl/boost/itl/interval_base_map.hpp	2010-10-08 06:25:07 EDT (Fri, 08 Oct 2010)
@@ -535,7 +535,7 @@
     add_at(const iterator& prior_, const interval_type& inter_val, 
                                    const codomain_type& co_val   )
     {
-        // Never try to insert a neutron into a neutron absorber here:
+        // Never try to insert an identity element into an identity element absorber here:
         BOOST_ASSERT((!(on_absorbtion<type,Combiner,Traits::absorbs_neutrons>::is_absorbable(co_val))));
 
         iterator inserted_ 
Modified: sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp
==============================================================================
--- sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp	(original)
+++ sandbox/itl/boost/itl_xt/detail/bit_element_iterator.hpp	2010-10-08 06:25:07 EDT (Fri, 08 Oct 2010)
@@ -176,13 +176,13 @@
 
     void first_bit()const
     {
-        // Because interval_bitsets are neutron absorbers, _saltator->second.word() is not a neutron
+        // Because interval_bitsets are neutron absorbers, _saltator->second.word() is not an identity element
         _on_bit   = Proceed::first_bit(_saltator->second.word());
     }
 
     void last_bit()const
     {
-        // Because interval_bitsets are neutron absorbers, _saltator->second.word() is not a neutron
+        // Because interval_bitsets are neutron absorbers, _saltator->second.word() is not an identity element
         _on_bit   = Proceed::last_bit(_saltator->second.word());
     }