- Timestamp:
- 07/23/09 11:18:49 (15 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/inter.html
r338 r402 62 62 63 63 64 calculate the intersection between 2 matrices of whole numbers 64 find the intersection between 2 matrices of whole numbers 65 66 see also <a href="..//Matrix/different.html">different</a> and <a href="..//Matrix/union.html">union</a> 65 67 66 68 … … 80 82 81 83 <h3>Return value</h3> 82 tableau 84 an array containing the set of values in both a and b. 85 86 The empty set is denoted by an array with the first element equal to 87 -1. 83 88 84 89 … … 127 132 128 133 <h3>Examples</h3><pre> 129 IDL> a = [2,4,6,8] 130 IDL> b = [6,1,3,2] 131 IDL> inter(a,b) = [ 2, 6] ; Common elements 134 135 IDL> a = [2,4,6,8] 136 IDL> b = [6,1,3,2] 137 IDL> res=inter(a,b) 138 2 6 139 Right because 2 and 6 are in a and B. 132 140 133 141 </pre><h3>Version history</h3> 134 142 135 143 <h4>Version</h4> 136 $Id: inter.pro 3 25 2007-12-06 10:04:53Z pinsard $144 $Id: inter.pro 378 2008-08-12 12:35:46Z pinsard $ 137 145 138 146 <h4>History</h4> … … 146 154 147 155 <h4>Restrictions</h4> 148 The empty set is denoted by an array with the first element equal to149 -1.150 151 152 156 These functions will not be efficient on sparse sets with wide 153 157 ranges, as they trade memory for efficiency.
Note: See TracChangeset
for help on using the changeset viewer.