- Timestamp:
- 04/06/07 10:35:17 (17 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/SRC/Documentation/idldoc_assistant_output/Matrix/inter.html
r234 r242 79 79 80 80 81 <h3>Return value</h3> tableau 81 <h3>Return value</h3> 82 tableau 82 83 83 84 … … 98 99 </h4> 99 100 100 arrays of positive integers, which need not to be 101 102 arrays of positive integers, which need not to be 101 103 sorted. Duplicate elements are ignored, as they have no effect on the 102 104 result … … 116 118 </h4> 117 119 118 see a 120 121 see a 119 122 120 123 … … 131 134 132 135 <h4>Version</h4> 133 $Id: inter.pro 23 2 2007-03-20 16:59:36Z pinsard $136 $Id: inter.pro 237 2007-03-26 15:37:03Z pinsard $ 134 137 135 138 <h4>History</h4> … … 142 145 143 146 144 <h4>Restrictions</h4> The empty set is denoted by an array with the first element equal to 147 <h4>Restrictions</h4> 148 The empty set is denoted by an array with the first element equal to 145 149 -1. 146 150 151 147 152 These functions will not be efficient on sparse sets with wide 148 ranges, as they trade memory for efficiency. The HISTOGRAM function 153 ranges, as they trade memory for efficiency. 154 The <proidl>HISTOGRAM</proidl> function 149 155 is used, which creates arrays of size equal to the range of the 150 156 resulting set.
Note: See TracChangeset
for help on using the changeset viewer.