Octopus 16.0
real-space, real-time, TDDFT code
sort_low.cc File Reference
#include <algorithm>
#include <fortran_types.h>
#include <new>
Include dependency graph for sort_low.cc:

Classes

class  compare< TT >
 

Functions

template<typename TT >
void sort2 (const fint size, TT *array, fint *indices)
 
void FC_FUNC (isort1, ISORT1)(const fint *size
 
void FC_FUNC (isort2, ISORT2)(const fint *size
 
void FC_FUNC (lsort1, LSORT1)(const fint *size
 
void FC_FUNC (lsort2, LSORT2)(const fint *size
 
void FC_FUNC (dsort1, DSORT1)(const fint *size
 
void FC_FUNC (dsort2, DSORT2)(const fint *size
 

Variables

void fintarray
 
void fint fintindices
 

Function Documentation

◆ sort2()

template<typename TT >
void sort2 ( const fint  size,
TT *  array,
fint indices 
)

◆ FC_FUNC() [1/6]

void FC_FUNC ( isort1  ,
ISORT1   
) const

◆ FC_FUNC() [2/6]

void FC_FUNC ( isort2  ,
ISORT2   
) const

◆ FC_FUNC() [3/6]

void FC_FUNC ( lsort1  ,
LSORT1   
) const

◆ FC_FUNC() [4/6]

void FC_FUNC ( lsort2  ,
LSORT2   
) const

◆ FC_FUNC() [5/6]

void FC_FUNC ( dsort1  ,
DSORT1   
) const

◆ FC_FUNC() [6/6]

void FC_FUNC ( dsort2  ,
DSORT2   
) const

Variable Documentation

◆ array

void double * array
Initial value:
{
std::sort(array, array + *size)
void const fint8 * size
Definition: alloc_cache_low.cc:67
void fint * array
Definition: sort_low.cc:65

◆ indices

void double fint * indices
Initial value:
{
sort2<fint>(*size, array, indices)
void fint fint * indices
Definition: sort_low.cc:70