API Documentation
Loading...
Searching...
No Matches
Median.hpp File Reference
#include <NDEVR/Buffer.h>
#include <NDEVR/BinaryHeap.h>
Include dependency graph for Median.hpp:

Go to the source code of this file.

Classes

class  Median
 A dummy class for including optimized median functions. More...
 

Namespaces

namespace  NDEVR
 

Functions

template<class t_buffer_type >
uint04 ApxMedian (const t_buffer_type &elements, const Buffer< uint04 > &indices, uint04 start, uint04 end, uint01 dimension)
 Returns the aproximate median, or value that is close to the median, significantly faster than it would take to calculate the true median.
 
template<class t_type , class t_node_type >
uint04 ApxNthElement (const Buffer< t_node_type > &points, Buffer< uint04 > &indices, uint04 start, uint04 end, uint01 dimension)
 Returns the aproximate Nth element, or value that is close to the Nth Element, significantly faster than it would take to calculate the true Nth element of the sorted series.
 
template<class t_node_type , class t_container_type >
uint04 dynamicHeapMedian (uint04 size, const Buffer< t_node_type > &points, const t_container_type &indices, const uint04 start, const uint04 step, uint01 dimension)
 
template<class t_container_type >
uint04 median (const t_container_type &elements, Buffer< uint04 > &indices, const uint04 start, const uint04 end, uint01 dimension)
 
template<class t_type , class t_node_type >
uint04 SortAboutValue (uint04 value_index, const Buffer< t_node_type > &points, Buffer< uint04 > &indices, uint04 start, uint04 end, uint01 dimension)
 Sorts all incoming indices within the given range such that the resulting index matrix will have values less than the index first, and greater than the index second.
 
template<class t_type , class t_buffer_type , class t_bounds_type >
uint04 SortAboutValue (uint04 value_index, const t_buffer_type &points, Buffer< uint04 > &indices, uint04 start, uint04 end, uint01 dimension, t_bounds_type &bounds_left, t_bounds_type &bounds_right)
 Sorts all incoming indices within the given range such that the resulting index matrix will have values less than the index first, and greater than the index second.
 
template<uint01 t_bucket_size, class t_buffer_type , class t_container_type >
uint04 StaticHeapMedian (const t_buffer_type &points, const t_container_type &indices, uint04 start, uint04 step, uint01 dimension)
 Return the median value in a Buffer of points based on a given dimension.