i7dstk.F File Reference

#include "implicit_f.inc"

Go to the source code of this file.

Functions/Subroutines
subroutine	i7dstk (i_add, nb_nc, nb_ec, add, bpn, pn, bpe, pe)

Function/Subroutine Documentation

i7dstk()

subroutine i7dstk	(	integer	i_add,
		integer	nb_nc,
		integer	nb_ec,
		integer, dimension(2,0:*)	add,
		integer, dimension(*)	bpn,
		integer, dimension(*)	pn,
		integer, dimension(*)	bpe,
		integer, dimension(*)	pe )

Definition at line 32 of file i7dstk.F.

C============================================================================
C  this routine is called by: I7TRI(/inter3d1/i7tri.F)
C                                  I11TRI(/inter3d1/i11tri.F)
C                                  I2TRI(/inter3d1/i2tri.F)
C----------------------------------------------------------------------------
C  this routine calls: -
C============================================================================
C-----------------------------------------------
C   I m p l i c i t   T y p e s
C-----------------------------------------------
#include      "implicit_f.inc"
C-----------------------------------------------
C   ROLE OF THE ROUTINE:
C   ===================
C   RELOAD THE BOTTOM STACK VECTORS BPN AND BPE WITH THE BOTTOMS OF
C   STACKS PN AND PE
C-----------------------------------------------
C   D u m m y   A r g u m e n t s
C
C     NOM          DESCRIPTION                       E/S
C
C     BPE          ARRAY OF FACETTES TO SORT      S
C                  AND THE RESULT ON THE MAX SIDE
C     PE           ARRAY OF FACETTES              E
C                  RESULTAT COTE MIN
C     BPN          SORTED NODES ARRAY        S
C                  AND THE RESULT ON THE MAX SIDE
C     PN           NODES ARRAY E
C                  RESULTAT COTE MIN
C     ADD(2,*)     ARRAY OF ADRESSES              E  
C          1.......ADRESSES NODES C          2.......ADRESSES ELEMENTS
C     NB_NC        NUMBER OF CANDIDATE NODES        s 
C     NB_EC        NUMBER OF CANDIDATE ELEMENTS           s 
C     I_ADD        POSITION IN THE TABLE OF I/O ADDRESSES
C 
C-----------------------------------------------
      INTEGER NB_NC,NB_EC,I_ADD
      INTEGER ADD(2,0:*),BPE(*),PE(*),BPN(*),PN(*)
C-----------------------------------------------
C   L o c a l   V a r i a b l e s
C-----------------------------------------------
      INTEGER I,IPROV
C
      i_add = i_add - 1
      IF(i_add==0) RETURN
C
C     1- STACK OF NODES
      iprov = 2*(i_add-1)
      nb_nc = add(1,1) - add(1,0)
      DO 10 i=1,nb_nc
        bpn(i) = pn(add(1,0)+i)
   10 CONTINUE
C     2- STACK OF ELEMENTS
      nb_ec = add(2,1) - add(2,0)
      DO 20 i=1,nb_ec
        bpe(i) = pe(add(2,0)+i)
   20 CONTINUE
      RETURN