pub struct DFA4REST {
pub spin_channel: usize,
pub dfa_compnt_scf: Vec<usize>,
pub dfa_paramr_scf: Vec<f64>,
pub dfa_hybrid_scf: f64,
pub dfa_family_pos: Option<DFAFamily>,
pub dfa_compnt_pos: Option<Vec<usize>>,
pub dfa_paramr_pos: Option<Vec<f64>>,
pub dfa_hybrid_pos: Option<f64>,
pub dfa_paramr_adv: Option<Vec<f64>>,
}
Fields
spin_channel: usize
dfa_compnt_scf: Vec<usize>
dfa_paramr_scf: Vec<f64>
dfa_hybrid_scf: f64
dfa_family_pos: Option<DFAFamily>
dfa_compnt_pos: Option<Vec<usize>>
dfa_paramr_pos: Option<Vec<f64>>
dfa_hybrid_pos: Option<f64>
dfa_paramr_adv: Option<Vec<f64>>
Implementations
sourceimpl DFA4REST
impl DFA4REST
pub fn xc_version(&self)
pub fn new(name: &str, spin_channel: usize) -> DFA4REST
pub fn libxc_code_fdqc(name: &str) -> [usize; 3]
pub fn xc_func_init_fdqc(name: &str, spin_channel: usize) -> Vec<usize>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A>where
A: Allocator,
A: Allocator,
pub fn init_libxc(&self, xc_code: &usize) -> XcFuncType
pub fn get_hybrid_libxc(dfa_compnt_scf: &Vec<usize>, spin_channel: usize) -> f64
pub fn parse_scf(name: &str, spin_channel: usize) -> DFA4REST
pub fn parse_scf_nonstd(
codelist: Vec<usize>,
paramlist: Vec<f64>,
spin_channel: usize
) -> DFA4REST
pub fn parse_postscf(name: &str, spin_channel: usize) -> Option<DFA4REST>
pub fn is_dfa_scf(&self) -> bool
pub fn use_density_gradient(&self) -> bool
pub fn use_kinetic_density(&self) -> bool
pub fn xc_exc_vxc(
&self,
grids: &Grids,
spin_channel: usize,
dm: &Vec<MatrixFull<f64>>,
mo: &[MatrixFull<f64>; 2],
occ: &[Vec<f64>; 2]
) -> (Vec<f64>, Vec<MatrixFull<f64>>)
pub fn xc_exc_vxc_slots(
&self,
range_grids: Range<usize>,
grids: &Grids,
spin_channel: usize,
dm: &Vec<MatrixFull<f64>>,
mo: &[MatrixFull<f64>; 2],
occ: &[Vec<f64>; 2]
) -> (Vec<f64>, Vec<MatrixFull<f64>>, [f64; 2])
pub fn xc_exc(
&self,
grids: &mut Grids,
spin_channel: usize,
dm: &mut Vec<MatrixFull<f64>>,
mo: &mut [MatrixFull<f64>; 2],
occ: &mut [Vec<f64>; 2],
iop: usize
) -> Vec<f64>ⓘNotable traits for Vec<u8, A>impl<A> Write for Vec<u8, A>where
A: Allocator,
A: Allocator,
Trait Implementations
Auto Trait Implementations
impl RefUnwindSafe for DFA4REST
impl Send for DFA4REST
impl Sync for DFA4REST
impl Unpin for DFA4REST
impl UnwindSafe for DFA4REST
Blanket Implementations
sourceimpl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
sourceimpl<T> Instrument for T
impl<T> Instrument for T
sourcefn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
sourcefn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read morefn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self
from the equivalent element of its
superset. Read morefn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self
is actually part of its subset T
(and can be converted to it).unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset
but without any property checks. Always succeeds.fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self
to the equivalent element of its superset.