Struct moc::qty::Time

pub struct Time<T: Idx>(/* private fields */);

Time index (microsec since JD=0)

Trait Implementations

impl<T: Clone + Idx> Clone for Time<T>

fn clone(&self) -> Time<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T: Debug + Idx> Debug for Time<T>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> MocQty<T> for Time<T>

where T: Idx,

const MAX_DEPTH: u8 = _

const MAX_SHIFT: u32 = _

fn n_cells_max() -> T

fn n_cells(depth: u8) -> T

fn delta_depth_max_from_n_bits(n_bits: u8) -> u8

Upper bound on the maximum number of depths that can be coded using n_bitsof a MOC index. I.e., maximum possible hierarchy depth on a len = [0, 2^(delta_depth)^dim] => (log(len) / log(2)) / dim = delta_depth

fn delta_depth_max_from_n_bits_unchecked(n_bits: u8) -> u8

Same as delta_depth_max_from_n_bits without checking that the result is smaller than depth_max.

fn delta_with_depth_max(depth: u8) -> u8

fn shift_from_depth_max(depth: u8) -> u8

fn get_msb(x: T) -> u32

fn get_lsb(x: T) -> u32

fn compute_min_depth(x: T) -> u8

fn from_uniq_gen(uniq: T) -> (u8, T)

From generic uniq notation (using a sentinel bit)

fn to_uniq_gen(depth: u8, idx: T) -> T

To generic uniq notation (using a sentinel bit)

fn sentinel_bit(depth: u8) -> T

fn uniq_gen_to_range(uniq: T) -> Range<T>

Range from the genric uniq notation (using a sentinel bit)

fn to_zuniq(depth: u8, idx: T) -> T

zuniq is similar to the uniq notation (i.e. it encodes both the depth and the cell index at this depth), but the natural ordering of the type T preserves the global ordering of the cells, independently of the cells depth. It is similar to the cdshealpix BMOC notation (without the extra bit coding a boolean) and to multi-order-map, but also coding the depth.

fn from_zuniq(zuniq: T) -> (u8, T)

impl<T: Idx> MocableQty for Time<T>

const NAME: &'static str = "TIME"

A simple str to identify the quantity (e.g. in ASCII serialisation)

const PREFIX: char = 't'

A simple char prefix to identify the quantity (e.g. in ASCII serialisation)

const DIM: u8 = 1u8

Dimension of the qty, i.e. number of bits needed to code a sub-cell relative index

const N_D0_CELLS: u8 = 2u8

Number of base cells, i.e. number of cell at depth 0 (usually 2^dim, but 12 in the HEALPix case)

const MOC_DIM: MocDim = MocDim::Time

FITS keyword

const HAS_COOSYS: bool = false

For FITS serialization (TODO: find a better approach)

const HAS_TIMESYS: bool = true

For FITS serialization (TODO: find a better approach)

const HAS_FREQSYS: bool = false

For FITS serialization (TODO: find a better approach)

fn mult_by_dim<U: Idx>(v: U) -> U

v * Self::DIM, generic so that for:

fn div_by_dim<U: Idx>(v: U) -> U

v / Self::DIM, generic so that for:

const N_RESERVED_BITS: u8 = 2u8

Number of bits reserved to code the quantity type

const N_D0_BITS: u8 = _

Number of bits needed to code the base cell index

const LEVEL_MASK: u8 = _

Mask to select the bit(s) of a level > 0:

fn shift(delta_depth: u8) -> u8

impl<T: PartialEq + Idx> PartialEq for Time<T>

fn eq(&self, other: &Time<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T: Idx, R: BufRead> RangeMOC2Iterator<T, Time<T>, RangeMocIter<T, Time<T>>, T, Hpx<T>, RangeMocIter<T, Hpx<T>>, RangeMOC2Elem<T, Time<T>, T, Hpx<T>>> for RangeMoc2DIterFromFits<T, R>

fn into_range_moc2(self) -> RangeMOC2<T, Q, U, R>

fn stats(self) -> (u64, u64, u64)

Returns a tuple containing:

fn or<I2, J2, K2, L2>( self, rhs: L2 ) -> OrRange2Iter<T, Q, U, R, I, J, K, Self, I2, J2, K2, L2>

where I2: RangeMOCIterator<T, Qty = Q>, J2: RangeMOCIterator<U, Qty = R>, K2: RangeMOC2ElemIt<T, Q, U, R, It1 = I2, It2 = J2>, L2: RangeMOC2Iterator<T, Q, I2, U, R, J2, K2>,

impl<T: Idx, R: BufRead> RangeMOC2Iterator<T, Time<T>, RangeMocIter<T, Time<T>>, T, Hpx<T>, RangeMocIter<T, Hpx<T>>, RangeMOC2Elem<T, Time<T>, T, Hpx<T>>> for RangeMoc2DPreV2IterFromFits<T, R>

fn into_range_moc2(self) -> RangeMOC2<T, Q, U, R>

fn stats(self) -> (u64, u64, u64)

Returns a tuple containing:

fn or<I2, J2, K2, L2>( self, rhs: L2 ) -> OrRange2Iter<T, Q, U, R, I, J, K, Self, I2, J2, K2, L2>

where I2: RangeMOCIterator<T, Qty = Q>, J2: RangeMOCIterator<U, Qty = R>, K2: RangeMOC2ElemIt<T, Q, U, R, It1 = I2, It2 = J2>, L2: RangeMOC2Iterator<T, Q, I2, U, R, J2, K2>,

impl<'a, T: Idx> RangeMOC2Iterator<T, Time<T>, RangeMocIter<T, Time<T>>, T, Hpx<T>, RangeMocIter<T, Hpx<T>>, RangeMOC2Elem<T, Time<T>, T, Hpx<T>>> for TimeSpaceRangesIter<'a, T>

fn into_range_moc2(self) -> RangeMOC2<T, Q, U, R>

fn stats(self) -> (u64, u64, u64)

Returns a tuple containing:

fn or<I2, J2, K2, L2>( self, rhs: L2 ) -> OrRange2Iter<T, Q, U, R, I, J, K, Self, I2, J2, K2, L2>

where I2: RangeMOCIterator<T, Qty = Q>, J2: RangeMOCIterator<U, Qty = R>, K2: RangeMOC2ElemIt<T, Q, U, R, It1 = I2, It2 = J2>, L2: RangeMOC2Iterator<T, Q, I2, U, R, J2, K2>,

impl<T: Eq + Idx> Eq for Time<T>

impl<T: Idx> StructuralPartialEq for Time<T>