pub struct GameInfo<'a> {
pub _tab: Table<'a>,
}Fields§
§_tab: Table<'a>Implementations§
Source§impl<'a> GameInfo<'a>
impl<'a> GameInfo<'a>
pub const VT_SECONDSELAPSED: VOffsetT = 4i16
pub const VT_GAMETIMEREMAINING: VOffsetT = 6i16
pub const VT_ISOVERTIME: VOffsetT = 8i16
pub const VT_ISUNLIMITEDTIME: VOffsetT = 10i16
pub const VT_ISROUNDACTIVE: VOffsetT = 12i16
pub const VT_ISKICKOFFPAUSE: VOffsetT = 14i16
pub const VT_ISMATCHENDED: VOffsetT = 16i16
pub const VT_WORLDGRAVITYZ: VOffsetT = 18i16
pub const VT_GAMESPEED: VOffsetT = 20i16
pub fn init_from_table(table: Table<'a>) -> Self
pub fn create<'bldr: 'args, 'args: 'mut_bldr, 'mut_bldr>( _fbb: &'mut_bldr mut FlatBufferBuilder<'bldr>, args: &'args GameInfoArgs, ) -> WIPOffset<GameInfo<'bldr>>
pub fn secondsElapsed(&self) -> f32
pub fn gameTimeRemaining(&self) -> f32
pub fn isOvertime(&self) -> bool
pub fn isUnlimitedTime(&self) -> bool
Sourcepub fn isRoundActive(&self) -> bool
pub fn isRoundActive(&self) -> bool
True when cars are allowed to move, and during the pause menu. False during replays.
Sourcepub fn isKickoffPause(&self) -> bool
pub fn isKickoffPause(&self) -> bool
True when the clock is paused due to kickoff, but false during kickoff countdown. In other words, it is true while cars can move during kickoff. Note that if both players sit still, game clock start and this will become false.
Sourcepub fn isMatchEnded(&self) -> bool
pub fn isMatchEnded(&self) -> bool
Turns true after final replay, the moment the ‘winner’ screen appears. Remains true during next match countdown. Turns false again the moment the ‘choose team’ screen appears.
pub fn worldGravityZ(&self) -> f32
Trait Implementations§
impl<'a> Copy for GameInfo<'a>
impl<'a> StructuralPartialEq for GameInfo<'a>
Auto Trait Implementations§
impl<'a> Freeze for GameInfo<'a>
impl<'a> RefUnwindSafe for GameInfo<'a>
impl<'a> Send for GameInfo<'a>
impl<'a> Sync for GameInfo<'a>
impl<'a> Unpin for GameInfo<'a>
impl<'a> UnwindSafe for GameInfo<'a>
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§unsafe fn to_subset_unchecked(&self) -> SS
unsafe fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.