pub struct Tags {
pub val: Marker,
}Expand description
Compress up to 64 tags to one u64 (8 bytes) (or up to 128 tags to a
u128(16 bytes) with the feature sample128 enabled)
Fields§
§val: MarkerImplementations§
Source§impl Tags
impl Tags
Sourcepub fn new(val: Marker) -> Self
pub fn new(val: Marker) -> Self
Make a new Tags from a u64 (or u128 with the feature sample128 enabled)
Sourcepub fn from_tag_vec(vec: &Vec<Tag>) -> Self
pub fn from_tag_vec(vec: &Vec<Tag>) -> Self
encodes a sorted (!) Vec
pub fn to_tag_vec(&self) -> Vec<Tag> ⓘ
pub fn to_string_vec<'a>( &'a self, str_map: &'a BiMap<String, Tag>, ) -> Vec<&'a str>
Sourcepub fn bit_and(&self, marker: Marker) -> bool
pub fn bit_and(&self, marker: Marker) -> bool
compares the value of the tags with another value (marker) with a bit-wise and,
returns true if the result is greater than 0:
00101 & 01000 -> false
00101 & 00100 -> true
Sourcepub fn bit_and_dist(&self, marker: Marker) -> usize
pub fn bit_and_dist(&self, marker: Marker) -> usize
compares the value of the tags with another value (marker) with a bit-wise and
counts the overlaps:
00101 & 01000 -> 0
00101 & 00100 -> 1
00101 & 00101 -> 2
Sourcepub fn iter(&self) -> TagsIterator ⓘ
pub fn iter(&self) -> TagsIterator ⓘ
get an iterator over the tags in the Tags
Trait Implementations§
Source§impl<'de> Deserialize<'de> for Tags
impl<'de> Deserialize<'de> for Tags
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
Deserialize this value from the given Serde deserializer. Read more
impl Copy for Tags
impl StructuralPartialEq for Tags
Auto Trait Implementations§
impl Freeze for Tags
impl RefUnwindSafe for Tags
impl Send for Tags
impl Sync for Tags
impl Unpin for Tags
impl UnsafeUnpin for Tags
impl UnwindSafe for Tags
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<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
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§impl<T> Pointable for T
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§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 more§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).§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.