mat/simdnbt
1
0
Fork 0
mirror of https://github.com/azalea-rs/simdnbt.git synced 2025-08-02 07:26:04 +00:00
Code Activity Actions

change .len() to always take a reference

Browse source
This commit is contained in:
mat 2025-02-02 20:55:33 +00:00
parent 760bd071fc
commit 92aebaef70
1 changed files with 6 additions and 6 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
simdnbt/src/borrow/list.rs
View file

@ -541,7 +541,7 @@ impl<'a, 'tape> NbtListList<'a, 'tape> {
/// Note that due to an internal optimization, this function runs at `O(n)`
/// if the list has at least 2^24 items. Use [`Self::approx_len`] if you
/// want to avoid that.
pub fn len(self) -> usize {
pub fn len(&self) -> usize {
self.iter.len()
}
/// A version of [`Self::len`] that saturates at 2^24.
@ -603,12 +603,12 @@ impl<'a: 'tape, 'tape> NbtListListIter<'a, 'tape> {
/// Note that due to an internal optimization, this function runs at `O(n)`
/// if the list has at least 2^24 items. Use [`Self::approx_len`] if you
/// want to avoid that.
pub fn len(self) -> usize {
pub fn len(&self) -> usize {
let len = self.approx_len();
if len < 2u32.pow(24) {
len as usize
} else {
self.count()
self.clone().count()
}
}
@ -673,7 +673,7 @@ impl<'a, 'tape> NbtCompoundList<'a, 'tape> {
/// Note that due to an internal optimization, this function runs at `O(n)`
/// if the list has at least 2^24 items. Use [`Self::approx_len`] if you
/// want to avoid that.
pub fn len(self) -> usize {
pub fn len(&self) -> usize {
self.iter.len()
}
/// A version of [`Self::len`] that saturates at 2^24.
@ -734,12 +734,12 @@ impl<'a: 'tape, 'tape> NbtCompoundListIter<'a, 'tape> {
/// Note that due to an internal optimization, this function runs at `O(n)`
/// if the list has at least 2^24 items. Use [`Self::approx_len`] if you
/// want to avoid that.
pub fn len(self) -> usize {
pub fn len(&self) -> usize {
let len = self.approx_len();
if len < 2u32.pow(24) {
len as usize
} else {
self.count()
self.clone().count()
}
}