Changeset 231 for trunk/SRC/Matrix/union.pro

Timestamp:

03/19/07 18:15:51 (17 years ago)

Author:

pinsard

Message:

improvements/corrections of some *.pro headers

File:

• trunk/SRC/Matrix/union.pro (modified) (3 diffs)

trunk/SRC/Matrix/union.pro

@@ -1 @@
-;------------------------------------------------------------
-;------------------------------------------------------------
-;------------------------------------------------------------
 ;+
 ;
-; @file_comments 
+; @file_comments
 ; calculate the union between 2 matrices of whole numbers
 ;
-; @categories 
+; @categories
 ; Calculation
 ;
-; @param a {in}{required} arrays of positive integers, which need
+; @param a {in}{required}
+; arrays of positive integers, which need
 ;               not be sorted. Duplicate elements are ignored, as they have no
 ;               effect on the result
@@ -16 +14 @@
 ; @param b {in}{required} see a
 ;
-; @returns tableau
+; @returns
+; tableau
 ;
-; @restrictions The empty set is denoted by an array with the first element equal to
-; -1.
+; @restrictions
+; The empty set is denoted by an array with the first element equal to -1.
 ;
 ; @restrictions These functions will not be efficient on sparse sets with wide
@@ -26 +25 @@
 ; resulting set.
 ;
-; @examples a = [2,4,6,8]
-;           b = [6,1,3,2]
-;           union(a,b) = [ 1, 2, 3, 4, 6, 8]  ; Elements in either set
+; @examples
+; 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
 ;
-; @history  http://www.dfanning.com/tips/set_operations.html
+; @history
+; http://www.dfanning.com/tips/set_operations.html
 ;
-; @version $Id$
+; @version
+; $Id$
 ;
 ;-
-;------------------------------------------------------------
-;------------------------------------------------------------
-;------------------------------------------------------------
+;
 FUNCTION union, a, b
 ;