Home
last modified time | relevance | path

Searched refs:no_R (Results 1 – 3 of 3) sorted by relevance

/dports/editors/ted/Ted-2.23/appUtil/
H A DutilTree.c413 nw->no_M= no->no_R; in utilTreeStoreValue()
418 no->no_R= no->no_M; in utilTreeStoreValue()
442 nw->no_M= no->no_R; in utilTreeStoreValue()
533 Hslot= dn->no_R; in utilTreeStoreValue()
541 Hslot= dn->no_R; in utilTreeStoreValue()
543 dn->no_R.sl_nod= nw; in utilTreeStoreValue()
917 no->no_R= *hs; in trfillslots()
1015 no->no_M= no->no_R; in utilTreeDeleteCurrent()
1043 (void) (*callback)( no->no_R.nsKey, no->no_R.sl_val, through ); in utilTreeDeleteCurrent()
1535 if ( (*callback)( no->no_R.nsKey, no->no_R.sl_val, through ) ) in utilTreeForAll()
[all …]
/dports/science/siesta/siesta-4.1.5/Src/
H A Dm_hs_matrix.f901134 subroutine matrix_rem_left_right_2d(no_tot,Hk,Sk,no_L,no_R) argument
1139 integer, intent(in) :: no_tot, no_L, no_R local
1152 if ( no_L == 0 .or. no_R == 0 ) return
1154 do j = no_tot - no_R + 1 , no_tot
1165 subroutine matrix_rem_left_right_1d(no_tot,Hk,Sk,no_L,no_R) argument
1166 integer, intent(in) :: no_tot, no_L, no_R local
1168 call matrix_rem_left_right_2d(no_tot,Hk,Sk,no_L,no_R)
/dports/science/siesta/siesta-4.1.5/Docs/branch-changes/
H A DTS-scf.CHANGES15927 For the right electrode we only need the last no_R states in the
15929 This leverages a lot of computation as no_u_TS-no_L-no_R states