- Timestamp:
- 07/23/09 11:18:49 (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/SRC/Documentation/idldoc_html_output/Matrix/inter.html
r338 r402 88 88 89 89 <div id="file_comments"> 90 calculate the intersection between 2 matrices of whole numbers 90 find the intersection between 2 matrices of whole numbers 91 92 see also <a href="..//Matrix/different.html">different</a> and <a href="..//Matrix/union.html">union</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 both a and b. 120 121 The empty set is denoted by an array with the first element equal to 122 -1. 118 123 </div> 119 124 … … 160 165 161 166 <h3>Examples</h3><div class="preformat"> 162 IDL> a = [2,4,6,8] 163 IDL> b = [6,1,3,2] 164 IDL> inter(a,b) = [ 2, 6] ; Common elements 167 168 IDL> a = [2,4,6,8] 169 IDL> b = [6,1,3,2] 170 IDL> res=inter(a,b) 171 2 6 172 Right because 2 and 6 are in a and B. 165 173 </div> 166 174 <h3>Version history</h3> 167 175 168 176 <h4>Version</h4><div class="preformat"> 169 $Id: inter.pro 3 25 2007-12-06 10:04:53Z pinsard $177 $Id: inter.pro 378 2008-08-12 12:35:46Z pinsard $ 170 178 </div> 171 179 <h4>History</h4><div class="preformat"> … … 179 187 180 188 <h4>Restrictions</h4><div class="preformat"> 181 The empty set is denoted by an array with the first element equal to182 -1.183 184 185 189 These functions will not be efficient on sparse sets with wide 186 190 ranges, as they trade memory for efficiency.
Note: See TracChangeset
for help on using the changeset viewer.