|
DFT-FE 1.3.0-pre
Density Functional Theory With Finite-Elements
|
#include <OptimizedIndexSet.h>
Public Member Functions | |
| OptimizedIndexSet (const std::set< T > &inputSet=std::set< T >()) | |
| Constructor. | |
| ~OptimizedIndexSet ()=default | |
| void | getPosition (const T &index, dftfe::uInt &pos, bool &found) const |
| bool | getPosition (const OptimizedIndexSet< T > &rhs) const |
| bool | operator== (const OptimizedIndexSet< T > &rhs) const |
Private Attributes | |
| dftfe::uInt | d_numContiguousRanges |
| Store the number of contiguous ranges in the input set of indices. | |
| std::vector< T > | d_contiguousRanges |
| std::vector< dftfe::uInt > | d_numEntriesBefore |
| dftfe::utils::OptimizedIndexSet< T >::OptimizedIndexSet | ( | const std::set< T > & | inputSet = std::set<T>() | ) |
Constructor.
| [in] | inputSet | A set of dftfe::uInt or unsigned long int for which an OptimizedIndexSet is to be created |
|
default |
| bool dftfe::utils::OptimizedIndexSet< T >::getPosition | ( | const OptimizedIndexSet< T > & | rhs | ) | const |
| void dftfe::utils::OptimizedIndexSet< T >::getPosition | ( | const T & | index, |
| dftfe::uInt & | pos, | ||
| bool & | found ) const |
| bool dftfe::utils::OptimizedIndexSet< T >::operator== | ( | const OptimizedIndexSet< T > & | rhs | ) | const |
|
private |
|
private |
Store the number of contiguous ranges in the input set of indices.
|
private |
Vector of size d_numContiguousRanges which stores the accumulated number of elements in d_set prior to the i-th contiguous range