Changeset 495 for trunk/SRC/Matrix


Ignore:
Timestamp:
04/17/14 10:49:43 (10 years ago)
Author:
pinsard
Message:

fix thanks to coding rules; typo; dupe empty lines; trailing blanks

Location:
trunk/SRC/Matrix
Files:
6 edited

Legend:

Unmodified
Added
Removed

  • trunk/SRC/Matrix/cmapply.pro

    r493 r495  
    9696; 
    9797;     USER  - Applies user-defined function      no. of output elements 
    98 ; 
    9998; 
    10099;   It is possible to perform user-defined operations arrays using 
    … …  
    173172; @examples 
    174173; 
    175 ;   First example:   
    176 ;   Shows how <pro>cmapply</pro> can be used to total the second dimension of  
     174;   First example: 
     175;   Shows how <pro>cmapply</pro> can be used to total the second dimension of 
    177176;   the array called IN. This is equivalent to OUT = TOTAL(IN, 2) 
    178177; 
    … …  
    377376      end 
    378377 
    379  
    380378  endcase 
    381379 

  • trunk/SRC/Matrix/different.pro

    r493 r495  
    3434;   IDL> b = [6,1,3,2] 
    3535; 
    36 ;   IDL> res=different(a,b)  
     36;   IDL> res=different(a,b) 
    3737;              4           8 
    3838; Right because 4 and 8 are in a but not in b ! 

  • trunk/SRC/Matrix/extrac2.pro

    r373 r495  
    138138   endcase 
    139139 
    140  
    141140;------------------------------------------------------------ 
    142141;------------------------------------------------------------ 

  • trunk/SRC/Matrix/inter.pro

    r378 r495  
    99; Calculation 
    1010; 
    11 ; @param a {in}{required}  
     11; @param a {in}{required} 
    1212; arrays of positive integers, which need not to be 
    1313; sorted. Duplicate elements are ignored, as they have no effect on the 
    1414; result 
    1515; 
    16 ; @param b {in}{required}  
     16; @param b {in}{required} 
    1717; see a 
    1818; 
    … …  
    2323; -1. 
    2424; 
    25 ; @restrictions  
     25; @restrictions 
    2626; These functions will not be efficient on sparse sets with wide 
    27 ; ranges, as they trade memory for efficiency.  
     27; ranges, as they trade memory for efficiency. 
    2828; The <proidl>HISTOGRAM</proidl> function 
    2929; is used, which creates arrays of size equal to the range of the 

  • trunk/SRC/Matrix/union.pro

    r414 r495  
    1414; effect on the result 
    1515; 
    16 ; @param b {in}{required}  
     16; @param b {in}{required} 
    1717; see a 
    1818; 
    … …  
    2020; an array containing the set of values in a and b. 
    2121; 
    22 ; @restrictions  
     22; @restrictions 
    2323; These functions will not be efficient on sparse sets with wide 
    24 ; ranges, as they trade memory for efficiency.  
     24; ranges, as they trade memory for efficiency. 
    2525; The <proidl>HISTOGRAM</proidl> function 
    2626; is used, which creates arrays of size equal to the range of the 
    … …  
    3131;   IDL> a = [2,4,6,8] 
    3232;   IDL> b = [6,1,3,2] 
    33 ;   IDL> res=union(a,b)  
     33;   IDL> res=union(a,b) 
    3434;   IDL> print, res 
    3535;           1           2           3           4           5           6 

  • trunk/SRC/Matrix/zero_one.pro

    r373 r495  
    1414; @examples 
    1515; 
    16 ;   IDL> a=zero_one(3)    
     16;   IDL> a=zero_one(3) 
    1717;   IDL> help,a 
    1818;   A               FLOAT     = Array[3] 
    … …  
    2020;         0.00000      1.00000      0.00000 
    2121; 
    22 ;   IDL> a=zero_one(2,3)    
     22;   IDL> a=zero_one(2,3) 
    2323;   IDL> help,a 
    2424;   A               FLOAT     = Array[2, 3] 
Note: See TracChangeset for help on using the changeset viewer.