T_Uneven_Partition Class Reference (original) (raw)

This website is no longer maintained. Its content may be obsolete.
Please visit https://home.cern/ for current CERN information.

List of all members.

Detailed Description

Elementary uneven partition for transient histograms: bins may have different widths.

Member Typedef Documentation

**typedef T_Uneven_Partition T_Uneven_Partition::Like_Current

**typedef T_Point T_Uneven_Partition::Mapped_Point

**typedef HTL_STD::vector<T_Point> T_Uneven_Partition::Points_Set

**typedef T_Uneven_Partition T_Uneven_Partition::T__Partition

Constructor & Destructor Documentation

**T_Uneven_Partition::~T_Uneven_Partition () [inline, virtual]

**T_Uneven_Partition::T_Uneven_Partition () [inline]

| T_Uneven_Partition::T_Uneven_Partition ( | HTL_STD::vector& some_points, | | ------------------------------------------------ | -------------------------------------------- | | | |

End_Point_Convention a_convention = RIGHT_OPEN)

Construct an elementary partition which is delimited by a vector of floats.

All of the delimited intervals have the same endpoint convention which is a_convention.

| T_Uneven_Partition::T_Uneven_Partition ( | HTL_STD::vector& some_points, | | ------------------------------------------------ | --------------------------------------------- | | | |

End_Point_Convention a_convention = RIGHT_OPEN)

Construct an elementary partition which is delimited by a vector of doubles.

All of the delimited intervals have the same endpoint convention which is a_convention.

| T_Uneven_Partition::T_Uneven_Partition ( | | | ------------------------------------------------ | |

I_Partition & another)

Construct a new T_Uneven_Partition out of another I_Partition.

Member Function Documentation

| T_Uneven_Partition::H_IID_IMPLEMENT ( | T_Uneven_Partition) | | --------------------------------------------- | ------------------------- |

Very simple RTTI feature.

Size T_Uneven_Partition::bin_count () const [inline, virtual]

Number of in-range bin indexes.

Reimplemented from I_Partition.

| T_Point T_Uneven_Partition::bin_width ( | | | ----------------------------------------------- | |

Index i) const [inline]

Width of the bin indexed by i .

End point convention: the same for all of the bins.

Reimplemented from I_Partition.

| double T_Uneven_Partition::i_bin_width ( | | | ------------------------------------------------ | |

Index i) const [inline, virtual]

Number of bin indexes that are not in range.

Reimplemented from I_Partition.

| double T_Uneven_Partition::i_lower_point ( | | | -------------------------------------------------- | |

Index i) const [inline, virtual]

Leftmost point of bin indexed by i .

Reimplemented from I_Partition.

**double T_Uneven_Partition::i_lower_point () const [inline, virtual]

Leftmost point of the partition.

Reimplemented from I_Partition.

| double T_Uneven_Partition::i_upper_point ( | | | -------------------------------------------------- | |

Index i) const [inline, virtual]

Rightmost point of bin indexed by i .

Reimplemented from I_Partition.

**double T_Uneven_Partition::i_upper_point () const [inline, virtual]

Rightmost point of the partition.

Reimplemented from I_Partition.

**void T_Uneven_Partition::initializePartition () [protected]

| T_Point T_Uneven_Partition::lower_point ( | | | ------------------------------------------------- | |

Index i) const [inline]

Left-most point of the in-range bin whose index is i .

**T_Point T_Uneven_Partition::lower_point () const [inline]

Same as left-most point of the partition.

The returned type is more specialized.

| void T_Uneven_Partition::map_index ( | T_Point a_point, | | ------------------------------------------- | ------------------------ | | | |

Index & an_index,

Extra_Index & an_extra_index) [inline]

Map a_point to a bin index.

The mapped index is passed to an_index when the mapped bin is in range, i.e when the value passed toan_extra_index equals H_IN_RANGE. If an_extra_index equals H_UNDERFLOW or H_OVERFLOW, one cannot not rely on the value passed to an_index: it is undefined. This is a fast inline function which handle the most common case. More complex cases are managed by the non-inlined method map_index1

| void T_Uneven_Partition::map_index1 ( | T_Point a_point, | | -------------------------------------------- | ------------------------ | | | |

Index & _index,

Extra_Index & _extra_index)

Map a_point to a bin index.

The mapped index is passed to an_index when the mapped bin is in range, i.e when the value passed toan_extra_index equals H_IN_RANGE. If an_extra_index equals H_UNDERFLOW or H_OVERFLOW, one cannot not rely on the value passed to an_index: it is undefined.

| void T_Uneven_Partition::map_point ( | double a_point, | | ------------------------------------------- | ---------------------- | | | |

Index & _index,

Extra_Index & _exindex) [inline, virtual]

Bin mapped to point a_point.

Reimplemented from I_Partition.

| T_Point T_Uneven_Partition::upper_point ( | | | ------------------------------------------------- | |

Index i) const [inline]

Right-most point of the in-range bin whose index is i .

**T_Point T_Uneven_Partition::upper_point () const [inline]

Same as right-most point of the partition.

The returned type is more specialized.

Member Data Documentation

Size T_Uneven_Partition::count_ [protected]

**T_Point T_Uneven_Partition::lower_point_ [protected]

Points_Set T_Uneven_Partition::points_ [protected]

**T_Point T_Uneven_Partition::upper_point_ [protected]

The documentation for this class was generated from the following file:

• T_Uneven_Partition.h

Generated at Fri Nov 24 09:28:39 2000 for TransientHTL by 1.1.2 written by Dimitri van Heesch, © 1997-2000