Changeset 402 for trunk/SRC/Documentation/idldoc_assistant_output/Matrix
- Timestamp:
- 07/23/09 11:18:49 (15 years ago)
- Location:
- trunk/SRC/Documentation/idldoc_assistant_output/Matrix
- Files:
-
- 7 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/cmset_op.html
r338 r402 360 360 361 361 <h4>Version</h4> 362 $Id: cmset_op.pro 3 25 2007-12-06 10:04:53Z pinsard $362 $Id: cmset_op.pro 372 2008-08-08 12:31:53Z pinsard $ 363 363 364 364 <h4>History</h4> -
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/different.html
r338 r402 62 62 63 63 64 calculate the different elements of 2 matrix of positive whole numbers. 64 find the different elements of 2 matrixes of positive whole numbers. 65 66 see also <a href="..//Matrix/union.html">union</a> and <a href="..//Matrix/inter.html">inter</a>. 65 67 66 68 … … 80 82 81 83 <h3>Return value</h3> 82 tableau 84 an array containing the set of values in only a. 85 86 The empty set is denoted by an array with the first element equal to 87 -1. 83 88 84 89 … … 101 106 102 107 arrays of positive integers, which need 103 104 108 not be sorted. Duplicate elements are ignored, as they have no 109 effect on the result 105 110 106 111 … … 128 133 <h3>Examples</h3><pre> 129 134 130 IDL> a = [2,4,6,8] 131 IDL> b = [6,1,3,2] 132 IDL> different(a,b) = [ 4, 8] ; Elements in A but not in B 135 IDL> a = [2,4,6,8] 136 IDL> b = [6,1,3,2] 137 138 IDL> res=different(a,b) 139 4 8 140 Right because 4 and 8 are in a but not in b ! 141 142 IDL> res=different(b,a) 143 IDL> print,res 144 1 3 145 146 Right because 1 and 3 are in b but not in a ! 133 147 134 148 </pre><h3>Version history</h3> 135 149 136 150 <h4>Version</h4> 137 $Id: different.pro 3 25 2007-12-06 10:04:53Z pinsard $151 $Id: different.pro 373 2008-08-08 14:11:31Z pinsard $ 138 152 139 153 <h4>History</h4> … … 147 161 148 162 <h4>Restrictions</h4> 149 The empty set is denoted by an array with the first element equal to150 -1.151 152 153 163 These functions will not be efficient on sparse sets with wide 154 164 ranges, as they trade memory for efficiency. The HISTOGRAM function -
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/extrac2.html
r338 r402 66 66 By default, IDL can make extractions of subdomain: 67 67 68 69 68 IDL> a=indgen(5,5) 69 IDL> print, a 70 70 0 1 2 3 4 71 71 5 6 7 8 9 … … 73 73 15 16 17 18 19 74 74 20 21 22 23 24 75 75 IDL> print, a[[0,2],3] 76 76 15 17 77 77 IDL> print, a[[0,2],*] 78 78 0 2 79 79 5 7 … … 82 82 20 22 83 83 but 84 84 IDL> print, a[[0,2],[3,4]] 85 85 15 22 86 86 while 87 87 IDL> print, extrac2(a,[0,2],[3,4]) 88 88 15 17 89 89 20 22 … … 105 105 106 106 <h3>Return value</h3> 107 a matrix 1 ,2,3or 4d extract from input array107 a matrix 1d, 2d, 3d or 4d extract from input array 108 108 -1 in case of mistake 109 109 … … 126 126 127 127 128 a 1 ,2,3 or 4 diminput array128 a 1d, 2d, 3d or 4d input array 129 129 130 130 … … 144 144 145 145 can have 2 forms: 146 1)a vector containing indexes of lines we want to keep 147 2)the string '*' if we want to keep all lines. 146 147 1) a vector containing indexes of lines we want to keep 148 2) the string '*' if we want to keep all lines. 148 149 149 150 … … 204 205 205 206 <h3>Examples</h3><pre> 206 I have a dim 2matrix named A. I want extract a small intersection207 matrix 2d of the line 2, 3 and 7 and of the column 0 and 1:208 209 IDL> res=extrac2(A,[2,3,7],[0,1])207 I have a 2d matrix named A. I want extract a small intersection 208 matrix 2d of the line 2, 3 and 7 and of the column 0 and 1: 209 210 IDL> res=extrac2(A,[2,3,7],[0,1]) 210 211 211 212 other ex: 212 IDL> print, a 213 IDL> a=[['a','b','c'],['d','e','f'],['g','h','i']] 214 IDL> print, a 213 215 a b c 214 216 d e f 215 217 g h i 216 IDL> print, extrac2(a,[0,2],[0,2])218 IDL> print, extrac2(a,[0,2],[0,2]) 217 219 a c 218 220 g i … … 221 223 222 224 <h4>Version</h4> 223 $Id: extrac2.pro 3 25 2007-12-06 10:04:53Z pinsard $225 $Id: extrac2.pro 373 2008-08-08 14:11:31Z pinsard $ 224 226 225 227 <h4>History</h4> 226 228 Sebastien Masson (smasson@lodyc.jussieu.fr) 227 228 229 - 12/1/1999 230 - 29/4/1999: correction of a bug and complement of the heading 229 231 230 232 -
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. -
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/make_selection.html
r338 r402 190 190 191 191 <h3>Examples</h3><pre> 192 names = [ 'Alfred','Anton','Peter','John','Mary'] 193 index = MAKE_SELECTION(names,['Peter','Mary']) 194 print,index 195 ; prints 2 4 196 197 vals = indgen(20) 198 index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9]) 199 print,index 200 ; prints 9 -1 8 7 7 8 9 201 202 index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9],/ONLY_VALID) 203 print,index 204 ; prints 9 8 7 7 8 9 205 206 index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9],/REQUIRED) 207 print,index 208 ; prints -1 192 193 IDL> names = [ 'Alfred','Anton','Peter','John','Mary'] 194 IDL> index = MAKE_SELECTION(names,['Peter','Mary']) 195 IDL> print,index 196 2 4 197 198 IDL> vals = indgen(20) 199 IDL> index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9]) 200 IDL> print,index 201 9 -1 8 7 7 8 9 202 203 IDL> index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9],/ONLY_VALID) 204 IDL> print,index 205 9 8 7 7 8 9 206 207 IDL> index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9],/REQUIRED) 208 IDL> print,index 209 -1 210 211 IDL> index = MAKE_SELECTION(vals,[9,-5,8,7,7,8,9],/REQUIRED,/QUIET) 212 % MAKE_SELECTION: Selected name not found in names array (-5)! 213 IDL> print,index 214 -1 209 215 210 216 </pre><h3>Version history</h3> 211 217 212 218 <h4>Version</h4> 213 $Id: make_selection.pro 3 25 2007-12-06 10:04:53Z pinsard $219 $Id: make_selection.pro 372 2008-08-08 12:31:53Z pinsard $ 214 220 215 221 <h4>History</h4> -
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/union.html
r338 r402 62 62 63 63 64 calculate the union between 2 matrices of whole numbers 64 find the union between 2 matrices of whole numbers 65 66 see also <a href="..//Matrix/different.html">different</a> and <a href="..//Matrix/inter.html">inter</a>. 65 67 66 68 … … 80 82 81 83 <h3>Return value</h3> 82 tableau84 an array containing the set of values in a and b. 83 85 84 86 … … 101 103 102 104 arrays of positive integers, which need 103 104 105 not be sorted. Duplicate elements are ignored, as they have no 106 effect on the result 105 107 106 108 … … 127 129 128 130 <h3>Examples</h3><pre> 129 IDL> a = [2,4,6,8] 130 IDL> b = [6,1,3,2] 131 IDL> union(a,b) = [ 1, 2, 3, 4, 6, 8] ; Elements in either set 131 132 IDL> a = [2,4,6,8] 133 IDL> b = [6,1,3,2] 134 IDL> res=union(a,b) 135 IDL> print, res 136 1 2 3 4 5 6 137 8 138 this is the list ao all elements in either sets. 132 139 133 140 </pre><h3>Version history</h3> 134 141 135 142 <h4>Version</h4> 136 $Id: union.pro 3 25 2007-12-06 10:04:53Z pinsard $143 $Id: union.pro 378 2008-08-12 12:35:46Z pinsard $ 137 144 138 145 <h4>History</h4> … … 145 152 146 153 147 <h4>Restrictions</h4> 148 The empty set is denoted by an array with the first element equal to -1. 149 150 154 <h4>Restrictions</h4> 151 155 These functions will not be efficient on sparse sets with wide 152 156 ranges, as they trade memory for efficiency. -
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/zero_one.html
r338 r402 79 79 80 80 <h3>Return value</h3> 81 result81 an array of n1 dimension or n1xn2 dimensions 82 82 83 83 … … 93 93 <font size="-1" color="#006633">required</font> 94 94 95 95 <font size="-1" color="#006633">type:</font> <font size="-1" color="#006633"><i>integer</i></font> 96 96 97 97 … … 108 108 109 109 110 <font size="-1" color="#006633">required</font>111 110 112 111 112 <font size="-1" color="#006633">type:</font> <font size="-1" color="#006633"><i>integer</i></font> 113 113 114 114 … … 123 123 124 124 125 125 <h3>Examples</h3><pre> 126 127 IDL> a=zero_one(3) 128 IDL> help,a 129 A FLOAT = Array[3] 130 IDL> print,a 131 0.00000 1.00000 0.00000 132 133 IDL> a=zero_one(2,3) 134 IDL> help,a 135 A FLOAT = Array[2, 3] 136 IDL> print,a 137 0.00000 1.00000 138 1.00000 0.00000 139 0.00000 1.00000 140 126 141 </pre><h3>Version history</h3> 127 142 128 143 <h4>Version</h4> 129 $Id: zero_one.pro 3 25 2007-12-06 10:04:53Z pinsard $144 $Id: zero_one.pro 373 2008-08-08 14:11:31Z pinsard $ 130 145 131 146 <h4>History</h4>
Note: See TracChangeset
for help on using the changeset viewer.