pub struct SecretFinding {
pub kind: String,
pub start: usize,
pub end: usize,
pub preview: String,
}Expand description
A finding: the rule id and the byte offsets of the value in the scanned text.
Fields§
§kind: String§start: usize§end: usize§preview: StringTrait Implementations§
Source§impl Clone for SecretFinding
impl Clone for SecretFinding
Source§impl Debug for SecretFinding
impl Debug for SecretFinding
impl Eq for SecretFinding
Source§impl PartialEq for SecretFinding
impl PartialEq for SecretFinding
impl StructuralPartialEq for SecretFinding
Auto Trait Implementations§
impl Forget for SecretFinding
impl Freeze for SecretFinding
impl Move for SecretFinding
impl RefUnwindSafe for SecretFinding
impl Send for SecretFinding
impl Sync for SecretFinding
impl Unpin for SecretFinding
impl UnsafeUnpin for SecretFinding
impl UnwindSafe for SecretFinding
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<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to
key and return true if they are equal.