Struct valence_server::ChunkView
source · pub struct ChunkView {
pub pos: ChunkPos,
/* private fields */
}
Expand description
Represents the set of all chunk positions that a client can see, defined by
a center chunk position pos
and view distance dist
.
Fields§
§pos: ChunkPos
The center position of this chunk view.
Implementations§
source§impl ChunkView
impl ChunkView
sourcepub const fn new(pos: ChunkPos, dist: u8) -> Self
pub const fn new(pos: ChunkPos, dist: u8) -> Self
Creates a new chunk view. dist
is clamped to the range
0..[MAX_VIEW_DIST
].
pub const fn with_dist(self, dist: u8) -> Self
pub const fn dist(self) -> u8
pub const fn contains(self, pos: ChunkPos) -> bool
sourcepub fn iter(
self,
) -> impl DoubleEndedIterator<Item = ChunkPos> + ExactSizeIterator + Clone
pub fn iter( self, ) -> impl DoubleEndedIterator<Item = ChunkPos> + ExactSizeIterator + Clone
Returns an iterator over all the chunk positions in this view. Positions
are sorted by the distance to pos
in ascending order.
sourcepub fn diff(
self,
other: Self,
) -> impl DoubleEndedIterator<Item = ChunkPos> + Clone
pub fn diff( self, other: Self, ) -> impl DoubleEndedIterator<Item = ChunkPos> + Clone
Returns an iterator over all the chunk positions in self
, excluding
the positions that overlap with other
. Positions are sorted by the
distance to pos
in ascending order.
sourcepub fn bounding_box(self) -> (ChunkPos, ChunkPos)
pub fn bounding_box(self) -> (ChunkPos, ChunkPos)
Returns a (min, max)
tuple describing the tight axis-aligned bounding
box for this view. All chunk positions in the view are contained in the
bounding box.
§Examples
use valence_server::{ChunkPos, ChunkView};
let view = ChunkView::new(ChunkPos::new(5, -4), 16);
let (min, max) = view.bounding_box();
for pos in view.iter() {
assert!(pos.x >= min.x && pos.x <= max.x && pos.z >= min.z && pos.z <= max.z);
}
Trait Implementations§
impl Copy for ChunkView
impl Eq for ChunkView
impl StructuralPartialEq for ChunkView
Auto Trait Implementations§
impl Freeze for ChunkView
impl RefUnwindSafe for ChunkView
impl Send for ChunkView
impl Sync for ChunkView
impl Unpin for ChunkView
impl UnwindSafe for ChunkView
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§unsafe fn clone_to_uninit(&self, dst: *mut T)
unsafe fn clone_to_uninit(&self, dst: *mut T)
🔬This is a nightly-only experimental API. (
clone_to_uninit
)§impl<T> Downcast for Twhere
T: Any,
impl<T> Downcast for Twhere
T: Any,
§fn into_any(self: Box<T>) -> Box<dyn Any>
fn into_any(self: Box<T>) -> Box<dyn Any>
Convert
Box<dyn Trait>
(where Trait: Downcast
) to Box<dyn Any>
. Box<dyn Any>
can
then be further downcast
into Box<ConcreteType>
where ConcreteType
implements Trait
.§fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
fn into_any_rc(self: Rc<T>) -> Rc<dyn Any>
Convert
Rc<Trait>
(where Trait: Downcast
) to Rc<Any>
. Rc<Any>
can then be
further downcast
into Rc<ConcreteType>
where ConcreteType
implements Trait
.§fn as_any(&self) -> &(dyn Any + 'static)
fn as_any(&self) -> &(dyn Any + 'static)
Convert
&Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &Any
’s vtable from &Trait
’s.§fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
fn as_any_mut(&mut self) -> &mut (dyn Any + 'static)
Convert
&mut Trait
(where Trait: Downcast
) to &Any
. This is needed since Rust cannot
generate &mut Any
’s vtable from &mut Trait
’s.§impl<T> DowncastSync for T
impl<T> DowncastSync for T
§impl<T> DynEq for T
impl<T> DynEq for T
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Checks if this value is equivalent to the given key. Read more
§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key
and return true
if they are equal.§impl<T> FromWorld for Twhere
T: Default,
impl<T> FromWorld for Twhere
T: Default,
§fn from_world(_world: &mut World) -> T
fn from_world(_world: &mut World) -> T
Creates
Self
using data from the given [World
].