hm_admlistcnt.F File Reference

#include "implicit_f.inc"
#include "scr17_c.inc"

Go to the source code of this file.

Functions/Subroutines
subroutine	hm_admlcnt (nix, ix, numel, ipartel, ipart, keltree, eltree, ksontree, nsontree, klevtree, nlist, mess, ix1, ix2, index, ll, nel, elkey, id, titr, lsubmodel)

Function/Subroutine Documentation

hm_admlcnt()

subroutine hm_admlcnt	(	integer	nix,
		integer, dimension(nix,*)	ix,
		integer	numel,
		integer, dimension(*)	ipartel,
		integer, dimension(lipart1,*)	ipart,
		integer	keltree,
		integer, dimension(keltree,*)	eltree,
		integer	ksontree,
		integer	nsontree,
		integer	klevtree,
		integer	nlist,
		character	mess,
		integer, dimension(*)	ix1,
		integer, dimension(*)	ix2,
		integer, dimension(*)	index,
		integer	ll,
		integer	nel,
		character	elkey,
		integer	id,
		character(len=nchartitle)	titr,
		type(submodel_data), dimension(nsubmod)	lsubmodel )

Definition at line 35 of file hm_admlistcnt.F.

      USE message_mod
      USE hm_option_read_mod
      USE submodel_mod
      USE names_and_titles_mod , ONLY : nchartitle
C-----------------------------------------------
C   I m p l i c i t   T y p e s
C-----------------------------------------------
#include      "implicit_f.inc"
C-----------------------------------------------
C   G l o b a l   P a r a m e t e r s
C-----------------------------------------------
#include      "scr17_c.inc"
C-----------------------------------------------
C   D u m m y   A r g u m e n t s
C-----------------------------------------------
      INTEGER NIX, IX(NIX,*), NUMEL, IPARTEL(*), IPART(LIPART1,*),
     .        KELTREE, ELTREE(KELTREE,*), KSONTREE, NSONTREE, KLEVTREE,
     .        NLIST,IX1(*), IX2(*), INDEX(*), LL, NEL, LEVEL
      CHARACTER MESS*40
      INTEGER ID
      CHARACTER(LEN=NCHARTITLE)::TITR
      CHARACTER :: ELKEY*4
      TYPE(SUBMODEL_DATA) LSUBMODEL(NSUBMOD)
C-----------------------------------------------
C   L o c a l   V a r i a b l e s
C-----------------------------------------------
      INTEGER LIST(NLIST), IL, JJ
      INTEGER I, J, NOLD, K, IWORK(70000),II
      INTEGER LELT, NE, IP, NLEV
      LOGICAL IS_AVAILABLE, IS_ENCRYPTED
      INTEGER,DIMENSION(:),ALLOCATABLE :: LIST_ENTITY
      INTEGER :: NENTITY
C-----------------------------------------------
      INTERFACE
       SUBROUTINE groups_get_elem_list(arg1,arg2,arg3)
        USE submodel_mod
        INTEGER,DIMENSION(:),ALLOCATABLE       :: arg1
        INTEGER,INTENT(INOUT)                  :: arg2
        TYPE(SUBMODEL_DATA)                    :: arg3(NSUBMOD)
       END SUBROUTINE  
      END INTERFACE     
C-----------------------------------------------
C CONSTITUTION DE LIST
C-----------------------------------------------
      il   = 0
      CALL groups_get_elem_list(list_entity, nentity, lsubmodel)
      DO ii=1,nentity
          jj=list_entity(ii)
          IF(jj /= 0)THEN
            il = il + 1
            list(il)=jj
          ENDIF
      enddo! NEXT II
      IF(ALLOCATED(list_entity))DEALLOCATE (list_entity)
                      
C-----------------------
C TRI DE LIST EN ORDRE CROISSANT
C AVEC SUPPRESSION DES No DOUBLES
C-----------------------
      CALL my_orders(0,iwork,list,index,nlist,1)
      DO i=1,nlist
        index(nlist+i) = list(index(i))
      ENDDO
      k=1
      nold = index(nlist+1)
      DO i=1,nlist
        IF(nold/=index(nlist+i))k=k+1
        list(k) = index(nlist+i)
        nold    = index(nlist+i)
      ENDDO
      nel=k
C-----------------------
C TRI DE IX EN ORDRE CROISSANT si LL = 0
C-----------------------
      IF(ll==0)THEN
        DO i=1,numel
          ix2(i) = ix(nix,i)
        ENDDO
        CALL my_orders(0,iwork,ix2,index,numel,1)
        DO i=1,numel
          ix1(i) = ix2(index(i))
        ENDDO
        DO i=1,numel
          ix2(i) = index(i)
        ENDDO
      ENDIF
C-----------------------
C RECHERCHE DES ELEMENTS DE LIST() DANS IX()
C  ALGO < NLIST+NUMEL
C-----------------------
      i=1
      j=1
      DO i=1,nel
        DO WHILE(list(i)>ix1(j).AND.j<numel)
          j=j+1
        ENDDO
        IF(list(i)==ix1(j))THEN
          list(i)=ix2(j)
        ELSE
           CALL ancmsg(msgid=70,
     .                 msgtype=msgerror,
     .                 anmode=aninfo,
     .                 c1=elkey,
     .                 i1=id,
     .                 c2=trim(titr),
     .                 i2=list(i))
           RETURN
        ENDIF
      ENDDO
C-----------------------
C
C-----------------------
      lelt = 0
C
      DO i=1,nel
 
        ne=list(i)
 
        ip=ipartel(ne)
        nlev =ipart(10,ip)
 
        level    =eltree(klevtree,ne)
        IF(level < 0) level=-(level+1)
 
        lelt=lelt+nsontree**(nlev-level)
 
      END DO
C
      nel=lelt
C-----------------------
      RETURN