Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/histogram__binning_8cpp_source.html below:

NCBI C++ ToolKit: src/util/histogram_binning.cpp Source File

<

TValue>

total_appearances_arg )

: first_number(first_number_arg),

last_number(last_number_arg),

total_appearances(total_appearances_arg )

(eHistAlgo) );

SIndexOfBin;

pair<TValue, SIndexOfBin> TDiffAndBinPair;

vector<TDiffAndBinPair> TVecOfDiffAndBinPair;

TVecOfDiffAndBinPair vecOfDiffAndBinPair;

vecOfDiffAndBinPair.reserve(pAnswer->size());

& this_bin = (*pAnswer)[ii];

& next_bin = (*pAnswer)[ii+1];

difference = (

vecOfDiffAndBinPair.push_back(

( vecOfDiffAndBinPair.begin(),

vecOfDiffAndBinPair.end(),

CReverseSort<TVecOfDiffAndBinPair::value_type>() );

vector<SIndexOfBin> vecNodesThatEndRanges;

(TVecOfDiffAndBinPair, map_iter,

( vecNodesThatEndRanges.size() >= (num_bins - 1) ) {

vecNodesThatEndRanges.push_back( map_iter->second );

( vecNodesThatEndRanges.begin(),

vecNodesThatEndRanges.end() );

SIndexOfBin bin_in_range_idx = 0;

(vector<SIndexOfBin>, range_near_end_it,

vecNodesThatEndRanges)

total_appearances_in_range = 0;

lowest_number_in_range =

(*pAnswer)[bin_in_range_idx].first_number;

( ; bin_in_range_idx != *range_near_end_it ;

& bin = (*pAnswer)[bin_in_range_idx];

total_appearances_in_range += (*pAnswer)[bin_in_range_idx].total_appearances;

highest_number_in_range = (*pAnswer)[bin_in_range_idx].last_number;

pNewAnswer->push_back(

(lowest_number_in_range,

highest_number_in_range,

total_appearances_in_range ) );

total_appearances_in_range = 0;

lowest_number_in_range =

(*pAnswer)[bin_in_range_idx].first_number;

( ; bin_in_range_idx != pAnswer->size(); ++bin_in_range_idx) {

total_appearances_in_range += (*pAnswer)[bin_in_range_idx].total_appearances;

highest_number_in_range = pAnswer->back().last_number;

pNewAnswer->push_back(

(lowest_number_in_range,

highest_number_in_range,

total_appearances_in_range ) );

total_num_data_points = 0;

total_num_data_points += bin_iter->total_appearances;

total_data_points_remaining = total_num_data_points;

& current_input_bin = *this_bin_iter;

num_bins_remaining = (num_bins - pNewAnswer->size() );

bin_size_goal =

( num_bins_remaining > 0 ?

( total_data_points_remaining / num_bins_remaining ) :

( pNewAnswer->empty() ) {

pNewAnswer->push_back(current_input_bin);

}

( pNewAnswer->back().total_appearances >= bin_size_goal )

pNewAnswer->push_back(current_input_bin);

& current_answer_bin = pNewAnswer->back();

(total_data_points_remaining == 0);

& out_num_bins)

( out_listOfBins.empty() );

total_appearances_of_all = 0;

total_appearances_of_all += value_iter->second;

( out_num_bins <= 0 ) {

out_num_bins = 1 +

(total_appearances_of_all);

total_appearances = value_iter->second;

out_listOfBins.push_back(

(

,

, total_appearances) );

( out_num_bins >= out_listOfBins.size() ) {

Bit manipulation primitives (internal)

Uint8 m_iNumBins

The number of bins to aim for the next time CalcHistogram is called.

EInitStatus x_InitializeHistogramAlgo(TListOfBins &out_listOfBins, Uint8 &out_num_bins) const

This holds the shared logic used by the various histogram algorithms.

vector< SBin > TListOfBins

A histogram is given as a vector of bins.

TListOfBins * CalcHistogram(EHistAlgo eHistAlgo=eHistAlgo_Default) const

Call this after data is loaded via AddNumber, etc.

TListOfBins * x_TryForEvenBins(void) const

Implementation of eHistAlgo_TryForSameNumDataInEachBin NOTE: Caller must deallocate the returned obje...

TListOfBins * x_IdentifyClusters(void) const

Implementation of eHistAlgo_IdentifyClusters NOTE: Caller must deallocate the returned object!

Int8 TValue

The numeric type this bins.

TMapValueToTotalAppearances m_mapValueToTotalAppearances

Maps a value to the number of times it appears, for the data given so far.

EInitStatus

shared by the various histogram algos

@ eInitStatus_AllAlgoWorkDone

This indicates that x_InitializeHistogramAlgo has done all the work required of it and the caller can...

@ eInitStatus_KeepGoing

This means the initialization completed, but the caller will need to do more work to shrink the numbe...

EHistAlgo

Pick which binning algorithm to use when generating the histogram.

@ eHistAlgo_TryForSameNumDataInEachBin

This algorithm tries to make each bin roughly even in size, except the last bin which may be much sma...

@ eHistAlgo_IdentifyClusters

This algorithm tries to make each bin represent values that are clustered together.

#define ITERATE_0_IDX(idx, up_to)

idx loops from 0 (inclusive) to up_to (exclusive)

#define ITERATE(Type, Var, Cont)

ITERATE macro to sequence through container elements.

element_type * release(void)

Release will release ownership of pointer to caller.

#define NCBI_USER_THROW_FMT(message)

Throw a "user exception" with message processed as output to ostream.

uint64_t Uint8

8-byte (64-bit) unsigned integer

#define END_NCBI_SCOPE

End previously defined NCBI scope.

#define BEGIN_NCBI_SCOPE

Define ncbi namespace.

Given a set of data points, automatically put them into bins for histogram display.

T ilog2(T x) noexcept

Fast loop-less function to find LOG2.

constexpr auto sort(_Init &&init)

double value_type

The numeric datatype used by the parser.

const GenericPointer< typename T::ValueType > T2 value

Defines NCBI C++ exception handling.

Holds the information about a bin.

Uint8 total_appearances

The total number of data points in this bin for all values from first_number to last_number.

SBin(TValue first_number_arg, TValue last_number_arg, Uint8 total_appearances_arg)

TValue first_number

The start range of the bin (inclusive)

TValue last_number

The end range of the bin (inclusive)

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4