Change instances of text "assignment attempt" to indicate object test.

Author:halw
Date:2012-04-07T13:46:56.000000Z


git-svn-id: https://svn.eiffel.com/eiffel-org/trunk@1067 abb3cda0-5349-4a8f-a601-0c33ac3a8c38

documentation/current/solutions/basic-computing/eiffelbase/eiffelbase-tutorial/eiffelbase-kernel.wiki

@@ -277,7 +277,7 @@ For a set of important applications of tuples see the book chapter on [[EiffelBa
 
 The implementation of tuples has the following limitations:
 * Conformance of [[ref:/libraries/base/reference/array_chart|ARRAY]]  types to [[ref:/libraries/base/reference/tuple_chart|TUPLE]]  types is not yet fully supported. 
-* Class [[ref:/libraries/base/reference/tuple_chart|TUPLE]]  does not have features such as first and second. You must use item and, in most cases, an assignment attempt. 
+* Class [[ref:/libraries/base/reference/tuple_chart|TUPLE]]  does not have features such as first and second. You must use item and, in most cases, an object test. 
 
 ==Strings==
 
@@ -416,7 +416,7 @@ correct_mismatch
     end
 </code>
 
-Note the use of <eiffel>mismatch_information</eiffel>, this is a once feature of [[ref:/libraries/base/reference/any_chart|ANY]] of type <eiffel>MISMATCH_INFORMATION</eiffel> which behaves like a [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]]. The keys of the table are the names of the attributes on which a mismatch occurred and the values are the corresponding object fields as they were originally stored. In this particular case of [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]] we know that the previous version was an [[ref:/libraries/base/reference/array_chart|ARRAY]], so we do an assignment attempt and if it succeeds we assign its <eiffel>area</eiffel> to the corresponding attribute of [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]]. 
+Note the use of <eiffel>mismatch_information</eiffel>, this is a once feature of [[ref:/libraries/base/reference/any_chart|ANY]] of type <eiffel>MISMATCH_INFORMATION</eiffel> which behaves like a [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]]. The keys of the table are the names of the attributes on which a mismatch occurred and the values are the corresponding object fields as they were originally stored. In this particular case of [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]] we know that the previous version was an [[ref:/libraries/base/reference/array_chart|ARRAY]], so we do an object test and if it succeeds we assign its <eiffel>area</eiffel> to the corresponding attribute of [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]]. 
 
 If a class name changed, then you need to create an instance of <eiffel>CLASS_NAME_TRANSLATIONS</eiffel>, it behaves like a [[ref:/libraries/base/reference/hash_table_chart|HASH_TABLE]] where the keys represent the old name, and the value the new name. This instance needs to be created before the call to retrieved.