Changeset 226 for trunk/SRC/ToBeReviewed/TRIANGULATION/ciseauxtri.pro

Timestamp:

03/16/07 10:22:26 (17 years ago)

Author:

pinsard

Message:

corrections of some misspellings in some *.pro

File:

• trunk/SRC/ToBeReviewed/TRIANGULATION/ciseauxtri.pro (modified) (12 diffs)

trunk/SRC/ToBeReviewed/TRIANGULATION/ciseauxtri.pro

@@ -3 +3 @@
 ;------------------------------------------------------------
 ;+
-; @file_comments 
+; @file_comments
 ; Delete arrays which do not have to be drawn thanks to 2 tests:
 ;     1) Corners of the array must be in the window
-;     2) Lengthes of side of triangles expressed in normalized 
-;        coordinates must not surpass a sill length. 
+;     2) Lengthes of side of triangles expressed in normalized
+;        coordinates must not surpass a sill length.
 ;
 ; @categories
 ;
 ; @param TRIANG
-; 
-; @param GLAM 
-;
-; @param GPHI 
-; 
+;
+; @param GLAM
+;
+; @param GPHI
+;
 ; @keyword _EXTRA
 ; Used to pass your keywords.
@@ -29 +29 @@
 ; @version
 ; $Id$
-; 
+;
 ;-
 ;------------------------------------------------------------
@@ -56 +56 @@
 
    tempdeux = systime(1)        ; For key_performance =2
-   z = convert_coord(glam[*],gphi[*],/data,/to_normal) 
+   z = convert_coord(glam[*],gphi[*],/data,/to_normal)
    x = z[0, *]
    y = z[1, *]
@@ -63 +63 @@
     print, 'temps ciseauxtri: convert_coord data to_normal', systime(1)-tempdeux
 ;
-; Beware, following the projection, some points x or y can become NaN 
-; (see points behind the Earth in an orthographic projection). 
+; Beware, following the projection, some points x or y can become NaN
+; (see points behind the Earth in an orthographic projection).
 ; In this case, we have to remove all triangle which contain one of these points.
 ;
@@ -99 +99 @@
       testy = abs(temporary(ytri)) GT ((!p.position[3]-!p.position[1])/seuil)
       testy = total(temporary(testy), 1)
-; 
+;
       test = temporary(testx)+temporary(testy)
-      ind=where(temporary(test) EQ 0) 
+      ind=where(temporary(test) EQ 0)
 ;
       IF testvar(var = key_performance) EQ 2 THEN $
@@ -146 +146 @@
    if keyword_set(trichanged) then BEGIN
 ;
-; We have to check that triangles we keep do not form a triangulation 
-; in which 2 triangles have a common summit without have a common side. 
-;
-; We constitute the list of rectangles we want to keep (we keep every 
+; We have to check that triangles we keep do not form a triangulation
+; in which 2 triangles have a common summit without have a common side.
+;
+; We constitute the list of rectangles we want to keep (we keep every
 ; rectangle containing a triangle)
 ;
@@ -155 +155 @@
 ; last summit are those of the diagonale of the rectangle defined by
 ; the mesh size. To find from which rectangle a triangle comes, we look
-; for the min of the index folowing x and following y of each triangle.
+; for the min of the index following x and following y of each triangle.
 ; Then we go by again this indexion following x and y in an indexion
 ; following nx*ny/
@@ -166 +166 @@
       indxtriang2 = triang[2, *]-nx*(triang[2, *]/nx)
       indxmin = indxtriang0 < indxtriang2
-; Beware in the case where the grid is periodic and where we have all points 
-; following x, triangles which assure the periodicity in x have indexes 
-; following x which are 0 and nx-1. They belong to rectangles of the column 
+; Beware in the case where the grid is periodic and where we have all points
+; following x, triangles which assure the periodicity in x have indexes
+; following x which are 0 and nx-1. They belong to rectangles of the column
 ; nx-1 and not to column 0.
       if keyword_set(key_periodic) AND nx EQ jpi then BEGIN
       indxmax = indxtriang0 > indxtriang2
       indxtriang = indxmin + (nx-1)*(indxmin EQ 0 AND indxmax EQ (nx-1))
-      ENDIF ELSE indxtriang = indxmin 
+      ENDIF ELSE indxtriang = indxmin
       listrect = nx*indytriang+indxtriang
       IF testvar(var = key_performance) EQ 2 THEN $
        print, 'temps ciseauxtri: liste des rectangles', systime(1)-tempdeux
 ;
-; Now we have this list, we will make sure that we do not have triangles 
+; Now we have this list, we will make sure that we do not have triangles
 ; with only a common summit.
 ;
@@ -195 +195 @@
                          *shift(test, 0, -1)*shift(test, -1, 0)) EQ 1)
 ; We delete the top rectangle (same x index but equal to 1)
-         if vire2[0] NE -1 THEN test[vire2+nx] = 0 
+         if vire2[0] NE -1 THEN test[vire2+nx] = 0
       ENDWHILE
 ;stop
@@ -202 +202 @@
       avirer = where(temporary(test) EQ 0)
       IF testvar(var = key_performance) EQ 2 THEN $
-       print, 'temps ciseauxtri: determinationdes rectangles a virer', systime(1)-tempdeux
+       print, 'temps ciseauxtri: determination des rectangles a virer', systime(1)-tempdeux
 ;
       if avirer[0] NE -1 then begin
@@ -208 +208 @@
       indnx = n_elements(listrect)
       indny = n_elements(avirer)
-      ind = listrect[*]#replicate(1l, indny) 
+      ind = listrect[*]#replicate(1l, indny)
       ind = ind EQ replicate(1, indnx)#avirer[*]
       if indny GT 1 then ind = total(ind, 2)
@@ -217 +217 @@
        print, 'temps ciseauxtri: derniere retouche de la triangulation', systime(1)-tempdeux
    endif
-;    
-;
-   if keyword_set(key_performance) THEN print, 'temps ciseauxtri', systime(1)-tempsun 
+;
+;
+   if keyword_set(key_performance) THEN print, 'temps ciseauxtri', systime(1)-tempsun
 ;
    return,  triang