Struct mwalib::Rfinput

source ·
pub struct Rfinput {
Show 20 fields pub input: u32, pub ant: u32, pub tile_id: u32, pub tile_name: String, pub pol: Pol, pub electrical_length_m: f64, pub north_m: f64, pub east_m: f64, pub height_m: f64, pub vcs_order: u32, pub subfile_order: u32, pub flagged: bool, pub digital_gains: Vec<f64>, pub dipole_gains: Vec<f64>, pub dipole_delays: Vec<u32>, pub rec_number: u32, pub rec_slot_number: u32, pub rec_type: ReceiverType, pub flavour: String, pub has_whitening_filter: bool,
}
Expand description

Structure for storing MWA rf_chains (tile with polarisation) information from the metafits file

Fields§

§input: u32

This is the metafits order (0-n inputs)

§ant: u32

This is the antenna number. Nominally this is the field we sort by to get the desired output order of antenna. X and Y have the same antenna number. This is the sorted ordinal order of the antenna.None e.g. 0…N-1

§tile_id: u32

Numeric part of tile_name for the antenna. Each pol has the same value e.g. tile_name “tile011” hsa tile_id of 11

§tile_name: String

Human readable name of the antenna X and Y have the same name

§pol: Pol

Polarisation - X or Y

§electrical_length_m: f64

Electrical length in metres for this antenna and polarisation to the receiver

§north_m: f64

Antenna position North from the array centre (metres)

§east_m: f64

Antenna position East from the array centre (metres)

§height_m: f64

Antenna height from the array centre (metres)

§vcs_order: u32

AKA PFB to correlator input order (only relevant for pre V2 correlator)

§subfile_order: u32

Subfile order is the order in which this rf_input is desired in our final output of data

§flagged: bool

Is this rf_input flagged out (due to tile error, etc from metafits)

§digital_gains: Vec<f64>

Digital gains metafits digital gains will be divided by 64 Digital gains are in mwalib metafits coarse channel order (ascending sky frequency order)

§dipole_gains: Vec<f64>

Dipole gains.

These are either 1 or 0 (on or off), depending on the dipole delay; a dipole delay of 32 corresponds to “dead dipole”, so the dipole gain of 0 reflects that. All other dipoles are assumed to be “live”. The values are made floats for easy use in beam code.

§dipole_delays: Vec<u32>

Dipole delays

§rec_number: u32

Receiver number

§rec_slot_number: u32

Receiver slot number

§rec_type: ReceiverType

Receiver type

§flavour: String

Flavour

§has_whitening_filter: bool

Has whitening filter (depends on flavour)

Trait Implementations§

source§

impl Clone for Rfinput

source§

fn clone(&self) -> Rfinput

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

impl Debug for Rfinput

Implements fmt::Debug for RFInput struct

§Arguments

  • f - A fmt::Formatter

§Returns

  • fmt::Result - Result of this method
source§

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

Formats the value using the given formatter. Read more
source§

impl PartialEq for Rfinput

source§

fn eq(&self, other: &Rfinput) -> bool

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

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.
source§

impl StructuralPartialEq for Rfinput

Auto Trait Implementations§

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

source§

impl<T> IntoEither for T

source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
source§

impl<T> Pointable for T

source§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.