Changeset 402 for trunk/SRC/Documentation/idldoc_html_output/Matrix/union.html

Timestamp:

07/23/09 11:18:49 (15 years ago)

Author:

smasson

Message:

update documentation

File:

• trunk/SRC/Documentation/idldoc_html_output/Matrix/union.html (modified) (5 diffs)

trunk/SRC/Documentation/idldoc_html_output/Matrix/union.html

@@ -88 +88 @@
 
       <div id="file_comments">
- calculate the union between 2 matrices of whole numbers
+ find the union between 2 matrices of whole numbers
+
+ see also <a href="..//Matrix/different.html">different</a> and <a href="..//Matrix/inter.html">inter</a>.
 </div>
 
@@ -115 +117 @@
 
           <h3>Return value</h3><div class="preformat">
- tableau
+ an array containing the set of values in a and b.
 </div>
 
@@ -135 +137 @@
           <div class="comments">
  arrays of positive integers, which need
-               not be sorted. Duplicate elements are ignored, as they have no
-               effect on the result
+ not be sorted. Duplicate elements are ignored, as they have no
+ effect on the result
 </div>
             
@@ -160 +162 @@
 
           <h3>Examples</h3><div class="preformat">
- IDL> a = [2,4,6,8]
- IDL> b = [6,1,3,2]
- IDL> union(a,b) = [ 1, 2, 3, 4, 6, 8]  ; Elements in either set
+
+   IDL> a = [2,4,6,8]
+   IDL> b = [6,1,3,2]
+   IDL> res=union(a,b) 
+   IDL> print, res
+           1           2           3           4           5           6
+           8
+ this is the list ao all elements in either sets.
 </div>
           <h3>Version history</h3>
           
           <h4>Version</h4><div class="preformat">
- $Id: union.pro 325 2007-12-06 10:04:53Z pinsard $
+ $Id: union.pro 378 2008-08-12 12:35:46Z pinsard $
 </div>
           <h4>History</h4><div class="preformat">
@@ -178 +185 @@
           
           
-          <h4>Restrictions</h4><div class="preformat">
- The empty set is denoted by an array with the first element equal to -1.
-
- 
+          <h4>Restrictions</h4><div class="preformat"> 
  These functions will not be efficient on sparse sets with wide
  ranges, as they trade memory for efficiency.