mrffl_bitset Module Reference

Simple sets (using the bits of an integer to indicate element existence). More...

Functions/Subroutines
integer(kind=ik) pure function, public	bitset_size (bitset)
	Return the number of elements in bitset.
integer(kind=ik) pure function, public	bitset_minus (bitset1, bitset2)
	Return the set diffrence between bitset1 and bitset2.
logical pure function, public	bitset_subsetp (bitset1, bitset2)
logical pure function, public	bitset_not_subsetp (bitset1, bitset2)
logical pure function, public	bitset_intersectp (bitset1, bitset2)
logical pure function, public	bitset_not_intersectp (bitset1, bitset2)

Detailed Description

Simple sets (using the bits of an integer to indicate element existence).

This is NOT a compete implementation of bitsets. Just what we need for MRFFL. Today bitsets are used to identity unknown variables for TVM solvers, and elements to print in output routines.

Function/Subroutine Documentation

bitset_size()

integer(kind=ik) pure function, public mrffl_bitset::bitset_size

(

integer(kind=ik), intent(in)

bitset

)

Return the number of elements in bitset.

Definition at line 55 of file mrffl_bitset.f90.

References bitset_size().

Referenced by bitset_size().

Here is the call graph for this function:

Here is the caller graph for this function:

bitset_minus()

integer(kind=ik) pure function, public mrffl_bitset::bitset_minus	(	integer(kind=ik), intent(in)	bitset1,
		integer(kind=ik), intent(in)	bitset2 )

Return the set diffrence between bitset1 and bitset2.

Definition at line 63 of file mrffl_bitset.f90.

References bitset_minus().

Referenced by bitset_minus().

Here is the call graph for this function:

Here is the caller graph for this function:

bitset_subsetp()

logical pure function, public mrffl_bitset::bitset_subsetp	(	integer(kind=ik), intent(in)	bitset1,
		integer(kind=ik), intent(in)	bitset2 )

Definition at line 71 of file mrffl_bitset.f90.

References bitset_subsetp().

Referenced by bitset_subsetp(), mrffl_cashflows::cashflow_matrix_pv_fv_print(), mrffl_life_table::life_table_print(), and mrffl_tvm12::tvm12_print().

Here is the call graph for this function:

Here is the caller graph for this function:

bitset_not_subsetp()

logical pure function, public mrffl_bitset::bitset_not_subsetp	(	integer(kind=ik), intent(in)	bitset1,
		integer(kind=ik), intent(in)	bitset2 )

Definition at line 79 of file mrffl_bitset.f90.

References bitset_not_subsetp().

Referenced by bitset_not_subsetp(), and mrffl_cashflows::cashflow_matrix_pv_fv_print().

Here is the call graph for this function:

Here is the caller graph for this function:

bitset_intersectp()

logical pure function, public mrffl_bitset::bitset_intersectp	(	integer(kind=ik), intent(in)	bitset1,
		integer(kind=ik), intent(in)	bitset2 )

Definition at line 87 of file mrffl_bitset.f90.

References bitset_intersectp().

Referenced by bitset_intersectp(), mrffl_cashflows::cashflow_matrix_pv_fv_print(), and mrffl_tvm12::tvm12_print().

Here is the call graph for this function:

Here is the caller graph for this function:

bitset_not_intersectp()

logical pure function, public mrffl_bitset::bitset_not_intersectp	(	integer(kind=ik), intent(in)	bitset1,
		integer(kind=ik), intent(in)	bitset2 )

Definition at line 95 of file mrffl_bitset.f90.

References bitset_not_intersectp().

Referenced by bitset_not_intersectp().

Here is the call graph for this function:

Here is the caller graph for this function: