- Timestamp:
- 07/23/09 11:18:49 (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/SRC/Documentation/idldoc_html_output/Matrix/different.html
r338 r402 88 88 89 89 <div id="file_comments"> 90 calculate the different elements of 2 matrix of positive whole numbers. 90 find the different elements of 2 matrixes of positive whole numbers. 91 92 see also <a href="..//Matrix/union.html">union</a> and <a href="..//Matrix/inter.html">inter</a>. 91 93 </div> 92 94 … … 115 117 116 118 <h3>Return value</h3><div class="preformat"> 117 tableau 119 an array containing the set of values in only a. 120 121 The empty set is denoted by an array with the first element equal to 122 -1. 118 123 </div> 119 124 … … 135 140 <div class="comments"> 136 141 arrays of positive integers, which need 137 138 142 not be sorted. Duplicate elements are ignored, as they have no 143 effect on the result 139 144 </div> 140 145 … … 161 166 <h3>Examples</h3><div class="preformat"> 162 167 163 IDL> a = [2,4,6,8] 164 IDL> b = [6,1,3,2] 165 IDL> different(a,b) = [ 4, 8] ; Elements in A but not in B 168 IDL> a = [2,4,6,8] 169 IDL> b = [6,1,3,2] 170 171 IDL> res=different(a,b) 172 4 8 173 Right because 4 and 8 are in a but not in b ! 174 175 IDL> res=different(b,a) 176 IDL> print,res 177 1 3 178 179 Right because 1 and 3 are in b but not in a ! 166 180 </div> 167 181 <h3>Version history</h3> 168 182 169 183 <h4>Version</h4><div class="preformat"> 170 $Id: different.pro 3 25 2007-12-06 10:04:53Z pinsard $184 $Id: different.pro 373 2008-08-08 14:11:31Z pinsard $ 171 185 </div> 172 186 <h4>History</h4><div class="preformat"> … … 180 194 181 195 <h4>Restrictions</h4><div class="preformat"> 182 The empty set is denoted by an array with the first element equal to183 -1.184 185 186 196 These functions will not be efficient on sparse sets with wide 187 197 ranges, as they trade memory for efficiency. The HISTOGRAM function
Note: See TracChangeset
for help on using the changeset viewer.